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 -i ../../../trunk/examples/programs/toy/UselessIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:30:50,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:30:51,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:30:51,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:30:51,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:30:51,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:30:51,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:30:51,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:30:51,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:30:51,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:30:51,020 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:30:51,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:30:51,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:30:51,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:30:51,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:30:51,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:30:51,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:30:51,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:30:51,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:30:51,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:30:51,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:30:51,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:30:51,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:30:51,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:30:51,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:30:51,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:30:51,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:30:51,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:30:51,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:30:51,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:30:51,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:30:51,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:30:51,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:30:51,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:30:51,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:30:51,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:30:51,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:30:51,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:30:51,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:30:51,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:30:51,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:30:51,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:30:51,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:30:51,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:30:51,099 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:30:51,100 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:30:51,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/UselessIncrement.bpl [2019-08-05 10:30:51,101 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/UselessIncrement.bpl' [2019-08-05 10:30:51,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:30:51,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:30:51,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:51,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:30:51,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:30:51,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,176 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:30:51,177 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:30:51,177 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:30:51,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:51,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:30:51,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:30:51,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:30:51,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/1) ... [2019-08-05 10:30:51,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:30:51,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:30:51,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:30:51,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:30:51,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:30:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure UselessIncrement [2019-08-05 10:30:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure UselessIncrement [2019-08-05 10:30:51,334 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:30:51,527 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:30:51,528 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:30:51,529 INFO L202 PluginConnector]: Adding new model UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:51 BoogieIcfgContainer [2019-08-05 10:30:51,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:30:51,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:30:51,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:30:51,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:30:51,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:51" (1/2) ... [2019-08-05 10:30:51,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61046a95 and model type UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:30:51, skipping insertion in model container [2019-08-05 10:30:51,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:51" (2/2) ... [2019-08-05 10:30:51,537 INFO L109 eAbstractionObserver]: Analyzing ICFG UselessIncrement.bpl [2019-08-05 10:30:51,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:30:51,554 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:30:51,571 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:30:51,597 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:30:51,598 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:30:51,598 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:30:51,598 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:30:51,599 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:30:51,599 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:30:51,599 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:30:51,599 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:30:51,599 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:30:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:30:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:30:51,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:51,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:30:51,622 INFO L418 AbstractCegarLoop]: === Iteration 1 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 49168253, now seen corresponding path program 1 times [2019-08-05 10:30:51,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:51,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:30:51,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:30:51,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:51,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:51,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:51,937 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 5 states. [2019-08-05 10:30:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:52,143 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:30:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:30:52,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:30:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:52,154 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:30:52,154 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:52,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-08-05 10:30:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:30:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-08-05 10:30:52,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-08-05 10:30:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:52,191 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-08-05 10:30:52,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-08-05 10:30:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:30:52,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:52,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:30:52,193 INFO L418 AbstractCegarLoop]: === Iteration 2 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:52,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1522184248, now seen corresponding path program 1 times [2019-08-05 10:30:52,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:52,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:30:52,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:52,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:52,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:30:52,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:30:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:30:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:52,533 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2019-08-05 10:30:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:52,954 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-08-05 10:30:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:30:52,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:30:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:52,956 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:30:52,956 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:30:52,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:30:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 9. [2019-08-05 10:30:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-08-05 10:30:52,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 6 [2019-08-05 10:30:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:52,961 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-08-05 10:30:52,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:30:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2019-08-05 10:30:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:30:52,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:52,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:30:52,963 INFO L418 AbstractCegarLoop]: === Iteration 3 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1524150454, now seen corresponding path program 1 times [2019-08-05 10:30:52,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:30:52,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:53,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:30:53,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:30:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:30:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:53,071 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2019-08-05 10:30:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:53,161 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 10:30:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:53,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:30:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:53,163 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:30:53,163 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:30:53,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:30:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2019-08-05 10:30:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:30:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:30:53,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-08-05 10:30:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:53,167 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:30:53,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:30:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:30:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:53,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:53,168 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:30:53,169 INFO L418 AbstractCegarLoop]: === Iteration 4 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash -58960163, now seen corresponding path program 2 times [2019-08-05 10:30:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:53,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:53,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:53,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:53,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:53,346 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2019-08-05 10:30:53,798 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-08-05 10:30:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:53,800 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:30:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:30:53,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:30:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:53,801 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:30:53,801 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:30:53,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:30:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 11. [2019-08-05 10:30:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:30:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-08-05 10:30:53,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2019-08-05 10:30:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:53,805 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-08-05 10:30:53,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2019-08-05 10:30:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:53,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:53,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:53,807 INFO L418 AbstractCegarLoop]: === Iteration 5 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -56993957, now seen corresponding path program 1 times [2019-08-05 10:30:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:53,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:53,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:53,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:53,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:53,938 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 7 states. [2019-08-05 10:30:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:54,099 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-08-05 10:30:54,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:30:54,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:30:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:54,108 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:30:54,108 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:30:54,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:30:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:30:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 11. [2019-08-05 10:30:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:30:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-08-05 10:30:54,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2019-08-05 10:30:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:54,112 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-08-05 10:30:54,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2019-08-05 10:30:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:54,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:54,113 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:30:54,113 INFO L418 AbstractCegarLoop]: === Iteration 6 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash 3958429, now seen corresponding path program 2 times [2019-08-05 10:30:54,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:54,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:54,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:54,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:54,201 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 7 states. [2019-08-05 10:30:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:54,263 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-08-05 10:30:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:54,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:30:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:54,269 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:30:54,269 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:30:54,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:30:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2019-08-05 10:30:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:30:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-08-05 10:30:54,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2019-08-05 10:30:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:54,274 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-08-05 10:30:54,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-08-05 10:30:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:54,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:54,276 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:30:54,277 INFO L418 AbstractCegarLoop]: === Iteration 7 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1829796648, now seen corresponding path program 3 times [2019-08-05 10:30:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:54,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:30:54,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:54,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:54,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:54,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:54,424 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 8 states. [2019-08-05 10:30:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:54,785 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 10:30:54,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:30:54,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:54,786 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:30:54,787 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:30:54,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:30:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:30:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 13. [2019-08-05 10:30:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-08-05 10:30:54,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 8 [2019-08-05 10:30:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:54,791 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-08-05 10:30:54,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2019-08-05 10:30:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:54,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:54,792 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:54,792 INFO L418 AbstractCegarLoop]: === Iteration 8 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1827830442, now seen corresponding path program 2 times [2019-08-05 10:30:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:54,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:30:54,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:54,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:54,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:54,899 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 8 states. [2019-08-05 10:30:55,145 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 10:30:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:55,391 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-08-05 10:30:55,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:30:55,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:55,392 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:30:55,392 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:30:55,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:30:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:30:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 13. [2019-08-05 10:30:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-08-05 10:30:55,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 8 [2019-08-05 10:30:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:55,395 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-08-05 10:30:55,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2019-08-05 10:30:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:55,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:55,396 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:55,396 INFO L418 AbstractCegarLoop]: === Iteration 9 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1766878056, now seen corresponding path program 3 times [2019-08-05 10:30:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:55,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:30:55,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:55,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:55,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:55,521 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 8 states. [2019-08-05 10:30:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:55,710 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-08-05 10:30:55,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:30:55,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:55,712 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:30:55,712 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:30:55,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:30:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:30:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2019-08-05 10:30:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-08-05 10:30:55,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 8 [2019-08-05 10:30:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:55,715 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-08-05 10:30:55,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2019-08-05 10:30:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:55,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:55,716 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:30:55,717 INFO L418 AbstractCegarLoop]: === Iteration 10 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash 122645910, now seen corresponding path program 3 times [2019-08-05 10:30:55,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:55,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:30:55,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:55,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:55,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:55,822 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 8 states. [2019-08-05 10:30:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:55,866 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2019-08-05 10:30:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:30:55,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:55,867 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:30:55,868 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:30:55,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:30:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2019-08-05 10:30:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:30:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-08-05 10:30:55,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2019-08-05 10:30:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:55,873 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-08-05 10:30:55,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-08-05 10:30:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:55,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:55,874 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:30:55,874 INFO L418 AbstractCegarLoop]: === Iteration 11 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -891152835, now seen corresponding path program 4 times [2019-08-05 10:30:55,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:55,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:55,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:56,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:56,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:56,004 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 9 states. [2019-08-05 10:30:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:56,221 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-08-05 10:30:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:30:56,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:30:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:56,223 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:30:56,223 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:30:56,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:30:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:30:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 15. [2019-08-05 10:30:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:30:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-08-05 10:30:56,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2019-08-05 10:30:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:56,228 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-08-05 10:30:56,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2019-08-05 10:30:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:56,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:56,229 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:56,229 INFO L418 AbstractCegarLoop]: === Iteration 12 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -889186629, now seen corresponding path program 4 times [2019-08-05 10:30:56,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:56,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:56,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:56,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:56,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:56,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:56,327 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 9 states. [2019-08-05 10:30:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:56,576 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-08-05 10:30:56,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:30:56,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:30:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:56,578 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:30:56,578 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:30:56,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:30:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:30:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 15. [2019-08-05 10:30:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:30:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-08-05 10:30:56,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2019-08-05 10:30:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:56,581 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-08-05 10:30:56,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2019-08-05 10:30:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:56,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:56,582 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:30:56,583 INFO L418 AbstractCegarLoop]: === Iteration 13 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -828234243, now seen corresponding path program 5 times [2019-08-05 10:30:56,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:56,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:56,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:56,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:56,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:56,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:56,781 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 9 states. [2019-08-05 10:30:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,035 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 10:30:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:30:57,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:30:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,036 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:30:57,036 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:30:57,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:30:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:30:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 15. [2019-08-05 10:30:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:30:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-08-05 10:30:57,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2019-08-05 10:30:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,039 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-08-05 10:30:57,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2019-08-05 10:30:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:57,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,040 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:57,040 INFO L418 AbstractCegarLoop]: === Iteration 14 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1061289723, now seen corresponding path program 6 times [2019-08-05 10:30:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:57,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:57,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:57,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:57,129 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 9 states. [2019-08-05 10:30:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,263 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:30:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:30:57,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:30:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,264 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:30:57,265 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:30:57,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:30:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:30:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 15. [2019-08-05 10:30:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:30:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-08-05 10:30:57,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2019-08-05 10:30:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,269 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-08-05 10:30:57,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2019-08-05 10:30:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:30:57,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,270 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:30:57,270 INFO L418 AbstractCegarLoop]: === Iteration 15 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash -493009475, now seen corresponding path program 4 times [2019-08-05 10:30:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:57,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:57,411 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 9 states. [2019-08-05 10:30:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,452 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2019-08-05 10:30:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:30:57,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:30:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,453 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:30:57,453 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:30:57,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:30:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2019-08-05 10:30:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:30:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:30:57,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 9 [2019-08-05 10:30:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,457 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:30:57,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:30:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:57,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,458 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:30:57,458 INFO L418 AbstractCegarLoop]: === Iteration 16 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1857965704, now seen corresponding path program 5 times [2019-08-05 10:30:57,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:57,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:57,534 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2019-08-05 10:30:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,057 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2019-08-05 10:30:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:30:58,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,058 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:30:58,058 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:30:58,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:30:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:30:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 17. [2019-08-05 10:30:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:58,061 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:58,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:58,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,062 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,063 INFO L418 AbstractCegarLoop]: === Iteration 17 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1855999498, now seen corresponding path program 7 times [2019-08-05 10:30:58,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:58,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:58,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:58,136 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 10 states. [2019-08-05 10:30:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,434 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 10:30:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:30:58,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,436 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:30:58,436 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:30:58,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:30:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:30:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 17. [2019-08-05 10:30:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:58,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,440 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:58,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:58,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,441 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,441 INFO L418 AbstractCegarLoop]: === Iteration 18 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1795047112, now seen corresponding path program 8 times [2019-08-05 10:30:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:58,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:58,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:58,523 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 10 states. [2019-08-05 10:30:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:58,790 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-08-05 10:30:58,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:30:58,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:58,792 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:30:58,792 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:30:58,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:30:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:30:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 17. [2019-08-05 10:30:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:58,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:58,796 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:58,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:58,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:58,797 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:30:58,797 INFO L418 AbstractCegarLoop]: === Iteration 19 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 94476854, now seen corresponding path program 9 times [2019-08-05 10:30:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:58,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:58,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:58,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:58,924 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 10 states. [2019-08-05 10:30:59,485 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-08-05 10:30:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:59,610 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-08-05 10:30:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:30:59,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:59,618 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:30:59,618 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:30:59,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:30:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:30:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 17. [2019-08-05 10:30:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:59,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:59,622 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:59,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:59,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:59,623 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:59,623 INFO L418 AbstractCegarLoop]: === Iteration 20 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1459822344, now seen corresponding path program 10 times [2019-08-05 10:30:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:59,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:59,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:59,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:59,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:59,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:59,776 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 10 states. [2019-08-05 10:30:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:59,906 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-08-05 10:30:59,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:30:59,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:30:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:59,910 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:30:59,910 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:30:59,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:30:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:30:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2019-08-05 10:30:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:59,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:59,912 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:59,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:59,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:59,913 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:30:59,913 INFO L418 AbstractCegarLoop]: === Iteration 21 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:30:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1896510070, now seen corresponding path program 5 times [2019-08-05 10:30:59,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:59,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:59,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:00,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:00,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:00,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:00,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:00,006 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 10 states. [2019-08-05 10:31:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:00,075 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-08-05 10:31:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:00,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:31:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:00,076 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:00,076 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:00,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2019-08-05 10:31:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-08-05 10:31:00,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 [2019-08-05 10:31:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:00,079 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-08-05 10:31:00,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-08-05 10:31:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:00,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:00,080 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:31:00,081 INFO L418 AbstractCegarLoop]: === Iteration 22 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1764393571, now seen corresponding path program 6 times [2019-08-05 10:31:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:00,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:00,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:00,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:00,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:00,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:00,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:00,208 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2019-08-05 10:31:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:00,513 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-08-05 10:31:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:00,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:00,514 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:31:00,514 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:31:00,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:31:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 19. [2019-08-05 10:31:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:00,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:00,517 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:00,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:00,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:00,518 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:00,518 INFO L418 AbstractCegarLoop]: === Iteration 23 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1762427365, now seen corresponding path program 11 times [2019-08-05 10:31:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:00,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:00,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:00,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:00,667 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:01,154 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-08-05 10:31:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:01,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:01,155 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:31:01,156 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:31:01,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:31:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 19. [2019-08-05 10:31:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:01,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:01,159 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:01,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:01,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:01,160 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:01,160 INFO L418 AbstractCegarLoop]: === Iteration 24 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1701474979, now seen corresponding path program 12 times [2019-08-05 10:31:01,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:01,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:01,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:01,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:01,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:01,242 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:01,682 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-08-05 10:31:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:31:01,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:01,683 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:31:01,683 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:31:01,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:31:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 19. [2019-08-05 10:31:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:01,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:01,687 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:01,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:01,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:01,688 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:01,688 INFO L418 AbstractCegarLoop]: === Iteration 25 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash 188048987, now seen corresponding path program 13 times [2019-08-05 10:31:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:01,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:01,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:01,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:01,764 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:02,288 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-08-05 10:31:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:02,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:02,289 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:31:02,289 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:31:02,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:31:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 19. [2019-08-05 10:31:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:02,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:02,292 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:02,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:02,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:02,292 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:02,293 INFO L418 AbstractCegarLoop]: === Iteration 26 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1366250211, now seen corresponding path program 14 times [2019-08-05 10:31:02,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:02,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:02,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:02,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:02,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:02,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:02,376 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:02,607 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-08-05 10:31:02,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:02,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:02,608 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:31:02,609 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:31:02,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:31:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 19. [2019-08-05 10:31:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:02,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:02,612 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:02,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:02,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:02,613 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:02,613 INFO L418 AbstractCegarLoop]: === Iteration 27 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1990082203, now seen corresponding path program 15 times [2019-08-05 10:31:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:02,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:02,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:02,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:02,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:02,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:02,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:02,721 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:02,867 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2019-08-05 10:31:02,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:02,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:02,869 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:31:02,869 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:31:02,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:31:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 19. [2019-08-05 10:31:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-08-05 10:31:02,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 11 [2019-08-05 10:31:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:02,872 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-08-05 10:31:02,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2019-08-05 10:31:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:02,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:02,873 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:31:02,873 INFO L418 AbstractCegarLoop]: === Iteration 28 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:02,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1337795363, now seen corresponding path program 6 times [2019-08-05 10:31:02,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:02,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:02,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:02,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:02,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:02,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:02,949 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 11 states. [2019-08-05 10:31:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:03,001 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2019-08-05 10:31:03,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:03,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:31:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:03,003 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:31:03,003 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:31:03,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:31:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2019-08-05 10:31:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:31:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-08-05 10:31:03,006 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 11 [2019-08-05 10:31:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:03,006 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-08-05 10:31:03,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-08-05 10:31:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:03,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:03,007 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:31:03,007 INFO L418 AbstractCegarLoop]: === Iteration 29 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1136342552, now seen corresponding path program 7 times [2019-08-05 10:31:03,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:03,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:03,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:03,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:03,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:03,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:03,127 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2019-08-05 10:31:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:03,463 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2019-08-05 10:31:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:03,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:03,465 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:31:03,465 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:03,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 21. [2019-08-05 10:31:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:03,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:03,469 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:03,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:03,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:03,469 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:03,470 INFO L418 AbstractCegarLoop]: === Iteration 30 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1138308758, now seen corresponding path program 16 times [2019-08-05 10:31:03,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:03,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:03,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:03,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:03,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:03,574 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:03,980 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2019-08-05 10:31:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:03,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:03,981 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:31:03,982 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:31:03,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:31:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 21. [2019-08-05 10:31:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:03,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:03,984 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:03,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:03,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:03,985 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:03,985 INFO L418 AbstractCegarLoop]: === Iteration 31 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1199261144, now seen corresponding path program 17 times [2019-08-05 10:31:03,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:03,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:03,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:04,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:04,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:04,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:04,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:04,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:04,065 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:04,617 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2019-08-05 10:31:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:04,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:04,618 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:31:04,619 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:31:04,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=744, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:31:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 21. [2019-08-05 10:31:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:04,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:04,625 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:04,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:04,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:04,626 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:04,627 INFO L418 AbstractCegarLoop]: === Iteration 32 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1206182186, now seen corresponding path program 18 times [2019-08-05 10:31:04,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:04,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:04,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:04,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:04,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:04,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:04,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:04,769 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:05,176 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2019-08-05 10:31:05,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:05,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:05,177 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:31:05,177 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:31:05,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:31:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 21. [2019-08-05 10:31:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:05,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:05,181 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:05,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:05,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:05,181 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:05,182 INFO L418 AbstractCegarLoop]: === Iteration 33 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1534485912, now seen corresponding path program 19 times [2019-08-05 10:31:05,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:05,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:05,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:05,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:05,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:05,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:05,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:05,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:05,261 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:05,625 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2019-08-05 10:31:05,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:05,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:05,626 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:31:05,626 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:31:05,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:31:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 21. [2019-08-05 10:31:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:05,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:05,629 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:05,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:05,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:05,630 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:05,630 INFO L418 AbstractCegarLoop]: === Iteration 34 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 595851030, now seen corresponding path program 20 times [2019-08-05 10:31:05,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:05,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:05,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:05,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:05,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:05,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:05,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:05,843 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:06,202 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-08-05 10:31:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:06,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:06,203 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:31:06,203 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:31:06,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:31:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 21. [2019-08-05 10:31:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:06,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:06,206 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:06,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:06,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:06,207 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:06,207 INFO L418 AbstractCegarLoop]: === Iteration 35 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1562940760, now seen corresponding path program 21 times [2019-08-05 10:31:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:06,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:06,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:06,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:06,289 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:06,551 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-08-05 10:31:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:06,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:06,552 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:31:06,552 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:31:06,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:31:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 21. [2019-08-05 10:31:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:31:06,554 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 12 [2019-08-05 10:31:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:06,554 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:31:06,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:31:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:06,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:06,555 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:31:06,555 INFO L418 AbstractCegarLoop]: === Iteration 36 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1477951318, now seen corresponding path program 7 times [2019-08-05 10:31:06,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:06,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:31:06,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:06,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:06,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:06,630 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 12 states. [2019-08-05 10:31:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:06,675 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-08-05 10:31:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:06,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:06,676 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:31:06,676 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:31:06,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:06,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:31:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2019-08-05 10:31:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-08-05 10:31:06,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 12 [2019-08-05 10:31:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:06,678 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-08-05 10:31:06,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-08-05 10:31:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:06,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:06,680 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:31:06,680 INFO L418 AbstractCegarLoop]: === Iteration 37 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 864849149, now seen corresponding path program 8 times [2019-08-05 10:31:06,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:06,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:06,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:06,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:06,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:06,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:06,780 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 13 states. [2019-08-05 10:31:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:07,171 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2019-08-05 10:31:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:07,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:07,172 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:31:07,172 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:31:07,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=561, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:31:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 23. [2019-08-05 10:31:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:07,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:07,175 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:07,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:07,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,175 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:07,176 INFO L418 AbstractCegarLoop]: === Iteration 38 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash 866815355, now seen corresponding path program 22 times [2019-08-05 10:31:07,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:07,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:07,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:07,275 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:07,797 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-08-05 10:31:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:07,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:07,798 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:31:07,798 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:31:07,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=823, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:31:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 23. [2019-08-05 10:31:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:07,801 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:07,801 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:07,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:07,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:07,802 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:07,802 INFO L418 AbstractCegarLoop]: === Iteration 39 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash 927767741, now seen corresponding path program 23 times [2019-08-05 10:31:07,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:07,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:07,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:07,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:07,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:07,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:07,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:07,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:07,895 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:08,409 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2019-08-05 10:31:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:08,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:08,410 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:31:08,410 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:31:08,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=409, Invalid=997, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:31:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 23. [2019-08-05 10:31:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:08,413 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:08,413 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:08,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:08,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:08,413 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:08,414 INFO L418 AbstractCegarLoop]: === Iteration 40 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1477675589, now seen corresponding path program 24 times [2019-08-05 10:31:08,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:08,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:08,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:08,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:08,554 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,026 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2019-08-05 10:31:09,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:09,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,027 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:31:09,028 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:31:09,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=423, Invalid=1059, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:31:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 23. [2019-08-05 10:31:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:09,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,031 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:09,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:09,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,032 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:09,032 INFO L418 AbstractCegarLoop]: === Iteration 41 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1262992509, now seen corresponding path program 25 times [2019-08-05 10:31:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:09,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:09,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:09,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:09,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:09,129 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:10,158 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-08-05 10:31:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,158 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2019-08-05 10:31:10,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:10,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,159 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:31:10,160 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:31:10,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=1003, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:31:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 23. [2019-08-05 10:31:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:10,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,162 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:10,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:10,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,163 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:10,163 INFO L418 AbstractCegarLoop]: === Iteration 42 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash 324357627, now seen corresponding path program 26 times [2019-08-05 10:31:10,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:10,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:10,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:10,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:10,327 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,801 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-08-05 10:31:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:10,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,801 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:31:10,802 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:31:10,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=841, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:31:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 23. [2019-08-05 10:31:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:10,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,804 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:10,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:10,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,804 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:10,805 INFO L418 AbstractCegarLoop]: === Iteration 43 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1291447357, now seen corresponding path program 27 times [2019-08-05 10:31:10,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:11,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:11,016 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,492 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-08-05 10:31:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:11,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,493 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:31:11,494 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:31:11,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:31:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 23. [2019-08-05 10:31:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:11,497 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,497 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:11,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:11,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,498 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:11,498 INFO L418 AbstractCegarLoop]: === Iteration 44 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1206457915, now seen corresponding path program 28 times [2019-08-05 10:31:11,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:11,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:11,815 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,033 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2019-08-05 10:31:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:12,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,034 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:31:12,035 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:31:12,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:31:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 23. [2019-08-05 10:31:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2019-08-05 10:31:12,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 13 [2019-08-05 10:31:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,037 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2019-08-05 10:31:12,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2019-08-05 10:31:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:12,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,038 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:31:12,038 INFO L418 AbstractCegarLoop]: === Iteration 45 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:12,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1428214787, now seen corresponding path program 8 times [2019-08-05 10:31:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:12,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:12,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:12,125 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 13 states. [2019-08-05 10:31:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,167 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2019-08-05 10:31:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:12,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:31:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,168 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:31:12,168 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:31:12,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:31:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2019-08-05 10:31:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-08-05 10:31:12,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2019-08-05 10:31:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,171 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-08-05 10:31:12,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-08-05 10:31:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:12,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,172 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:31:12,172 INFO L418 AbstractCegarLoop]: === Iteration 46 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1038488248, now seen corresponding path program 9 times [2019-08-05 10:31:12,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:12,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:12,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:12,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:12,396 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 14 states. [2019-08-05 10:31:12,710 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,175 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2019-08-05 10:31:13,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:13,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,176 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:31:13,176 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:31:13,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=683, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:31:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 25. [2019-08-05 10:31:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:13,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,179 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:13,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:13,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,180 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:13,180 INFO L418 AbstractCegarLoop]: === Iteration 47 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1040454454, now seen corresponding path program 29 times [2019-08-05 10:31:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:13,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:13,255 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,847 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2019-08-05 10:31:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:13,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,848 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:31:13,848 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:31:13,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:31:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 25. [2019-08-05 10:31:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:13,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,851 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:13,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:13,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,851 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:13,852 INFO L418 AbstractCegarLoop]: === Iteration 48 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1101406840, now seen corresponding path program 30 times [2019-08-05 10:31:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:13,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:13,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:13,954 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:14,448 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:14,839 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:15,208 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:16,229 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2019-08-05 10:31:16,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:16,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:16,230 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:31:16,230 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:31:16,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:31:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 25. [2019-08-05 10:31:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:16,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:16,233 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:16,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:16,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:16,234 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:16,234 INFO L418 AbstractCegarLoop]: === Iteration 49 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:16,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1304036490, now seen corresponding path program 31 times [2019-08-05 10:31:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:16,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:16,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:16,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:16,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:16,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:16,330 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:16,914 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2019-08-05 10:31:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:31:16,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:16,915 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:31:16,915 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:31:16,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=556, Invalid=1424, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:31:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 25. [2019-08-05 10:31:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:16,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:16,918 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:16,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:16,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:16,919 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:16,919 INFO L418 AbstractCegarLoop]: === Iteration 50 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1436631608, now seen corresponding path program 32 times [2019-08-05 10:31:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:16,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:16,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:17,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:17,037 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:17,534 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:31:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,046 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2019-08-05 10:31:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:31:18,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,047 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:31:18,047 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:31:18,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=555, Invalid=1425, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:31:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 25. [2019-08-05 10:31:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:18,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,051 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:18,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:18,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,052 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:18,052 INFO L418 AbstractCegarLoop]: === Iteration 51 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 497996726, now seen corresponding path program 33 times [2019-08-05 10:31:18,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:18,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:18,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:18,218 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,786 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2019-08-05 10:31:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:18,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,788 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:31:18,788 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:31:18,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=513, Invalid=1293, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:31:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 25. [2019-08-05 10:31:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:18,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,791 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:18,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:18,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,792 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:18,792 INFO L418 AbstractCegarLoop]: === Iteration 52 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1465086456, now seen corresponding path program 34 times [2019-08-05 10:31:18,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:19,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:19,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:19,668 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,164 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-08-05 10:31:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:20,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,165 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:31:20,165 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:31:20,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=433, Invalid=1049, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:31:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 25. [2019-08-05 10:31:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:20,168 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,168 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:20,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:20,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,169 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:20,169 INFO L418 AbstractCegarLoop]: === Iteration 53 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1380097014, now seen corresponding path program 35 times [2019-08-05 10:31:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:20,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:20,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:20,283 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,637 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2019-08-05 10:31:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:20,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,638 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:31:20,638 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:31:20,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=732, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:31:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-08-05 10:31:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:20,640 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,640 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:20,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:20,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,641 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:20,641 INFO L418 AbstractCegarLoop]: === Iteration 54 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1254575688, now seen corresponding path program 36 times [2019-08-05 10:31:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:20,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:20,736 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,942 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-08-05 10:31:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:20,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,943 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:31:20,943 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:31:20,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:31:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. [2019-08-05 10:31:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:31:20,945 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 14 [2019-08-05 10:31:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,946 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:31:20,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:31:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:20,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,946 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:31:20,947 INFO L418 AbstractCegarLoop]: === Iteration 55 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1325050826, now seen corresponding path program 9 times [2019-08-05 10:31:20,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:21,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:21,214 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 14 states. [2019-08-05 10:31:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,294 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-08-05 10:31:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:21,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:31:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,295 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:31:21,295 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:21,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2019-08-05 10:31:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-08-05 10:31:21,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2019-08-05 10:31:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,296 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-08-05 10:31:21,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-08-05 10:31:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:21,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,297 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:31:21,297 INFO L418 AbstractCegarLoop]: === Iteration 56 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2126333021, now seen corresponding path program 10 times [2019-08-05 10:31:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:21,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:21,414 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 15 states. [2019-08-05 10:31:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:21,993 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2019-08-05 10:31:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:31:21,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:21,995 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:31:21,995 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:31:21,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=443, Invalid=817, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:31:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 27. [2019-08-05 10:31:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:21,997 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:21,997 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:21,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:21,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:21,998 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:21,998 INFO L418 AbstractCegarLoop]: === Iteration 57 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2128299227, now seen corresponding path program 37 times [2019-08-05 10:31:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:22,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:22,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:22,091 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,284 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2019-08-05 10:31:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:23,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,286 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:31:23,286 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:31:23,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=548, Invalid=1258, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:31:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 27. [2019-08-05 10:31:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:23,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,288 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:23,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:23,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,289 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:23,289 INFO L418 AbstractCegarLoop]: === Iteration 58 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2105715683, now seen corresponding path program 38 times [2019-08-05 10:31:23,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:23,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:23,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:23,378 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,057 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2019-08-05 10:31:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:31:24,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,059 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:31:24,059 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:31:24,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=642, Invalid=1614, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:31:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 27. [2019-08-05 10:31:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:24,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,061 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:24,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:24,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,062 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:24,062 INFO L418 AbstractCegarLoop]: === Iteration 59 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -216191717, now seen corresponding path program 39 times [2019-08-05 10:31:24,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:24,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:24,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:24,164 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,861 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2019-08-05 10:31:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:24,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,863 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:31:24,863 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:31:24,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=707, Invalid=1843, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:31:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 27. [2019-08-05 10:31:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:24,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,865 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:24,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:24,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,866 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:24,866 INFO L418 AbstractCegarLoop]: === Iteration 60 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1770490915, now seen corresponding path program 40 times [2019-08-05 10:31:24,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:24,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:24,978 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,704 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2019-08-05 10:31:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:31:25,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,706 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:31:25,706 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:31:25,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=731, Invalid=1921, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:31:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:31:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 27. [2019-08-05 10:31:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:25,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,709 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:25,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:25,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,710 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:25,710 INFO L418 AbstractCegarLoop]: === Iteration 61 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:25,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1585841499, now seen corresponding path program 41 times [2019-08-05 10:31:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:26,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:26,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:26,116 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:26,978 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2019-08-05 10:31:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:26,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:26,979 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:31:26,979 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:31:26,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=708, Invalid=1842, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:31:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 27. [2019-08-05 10:31:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:26,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:26,983 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:26,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:26,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:26,983 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:26,984 INFO L418 AbstractCegarLoop]: === Iteration 62 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1742036067, now seen corresponding path program 42 times [2019-08-05 10:31:26,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:26,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:26,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:27,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:27,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:27,090 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,687 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-08-05 10:31:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:31:27,688 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,689 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:31:27,689 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:31:27,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=638, Invalid=1618, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:31:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:31:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 27. [2019-08-05 10:31:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:27,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,691 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:27,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:27,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,692 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:27,692 INFO L418 AbstractCegarLoop]: === Iteration 63 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1827025509, now seen corresponding path program 43 times [2019-08-05 10:31:27,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:27,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:27,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:27,780 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,423 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2019-08-05 10:31:28,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:28,423 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,424 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:31:28,424 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:28,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=527, Invalid=1279, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 27. [2019-08-05 10:31:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:28,426 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,426 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:28,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:28,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,427 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:28,427 INFO L418 AbstractCegarLoop]: === Iteration 64 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -166730915, now seen corresponding path program 44 times [2019-08-05 10:31:28,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:28,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:28,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:28,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:28,522 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,918 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-08-05 10:31:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:31:28,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,920 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:31:28,920 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:31:28,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=387, Invalid=873, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:31:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 27. [2019-08-05 10:31:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:28,922 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,922 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:28,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:28,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,923 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:28,923 INFO L418 AbstractCegarLoop]: === Iteration 65 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash -237206053, now seen corresponding path program 45 times [2019-08-05 10:31:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:29,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:29,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:29,108 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,336 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-08-05 10:31:29,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:29,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,337 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:31:29,338 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:31:29,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=466, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:31:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 27. [2019-08-05 10:31:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:31:29,340 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 15 [2019-08-05 10:31:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,340 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:31:29,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:31:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:29,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,341 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:31:29,341 INFO L418 AbstractCegarLoop]: === Iteration 66 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1873031965, now seen corresponding path program 10 times [2019-08-05 10:31:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:29,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:29,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:29,892 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,942 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2019-08-05 10:31:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:29,943 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:31:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,943 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:31:29,943 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:31:29,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:31:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-08-05 10:31:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-08-05 10:31:29,945 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 15 [2019-08-05 10:31:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,946 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-08-05 10:31:29,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-08-05 10:31:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:29,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,946 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:31:29,946 INFO L418 AbstractCegarLoop]: === Iteration 67 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1489782616, now seen corresponding path program 11 times [2019-08-05 10:31:29,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:30,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:30,034 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 16 states. [2019-08-05 10:31:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:30,578 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2019-08-05 10:31:30,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:30,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:30,579 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:31:30,579 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:31:30,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=519, Invalid=963, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:31:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 29. [2019-08-05 10:31:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:30,582 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:30,582 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:30,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:30,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:30,583 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:30,583 INFO L418 AbstractCegarLoop]: === Iteration 68 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1491748822, now seen corresponding path program 46 times [2019-08-05 10:31:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:30,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:30,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:30,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:30,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:30,735 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,646 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2019-08-05 10:31:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:31:31,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,648 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:31:31,648 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:31:31,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=652, Invalid=1510, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:31:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 29. [2019-08-05 10:31:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:31,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,651 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:31,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:31,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,651 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:31,652 INFO L418 AbstractCegarLoop]: === Iteration 69 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1552701208, now seen corresponding path program 47 times [2019-08-05 10:31:31,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:31,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:31,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:31,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:31,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:31,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:31,744 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,483 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2019-08-05 10:31:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:31:32,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,484 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:31:32,484 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:31:32,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:31:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 29. [2019-08-05 10:31:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:32,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,486 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:32,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:32,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,486 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:32,486 INFO L418 AbstractCegarLoop]: === Iteration 70 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash -852742122, now seen corresponding path program 48 times [2019-08-05 10:31:32,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:32,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:32,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:32,569 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,421 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2019-08-05 10:31:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:31:33,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,422 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:31:33,422 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:31:33,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=876, Invalid=2316, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:31:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 29. [2019-08-05 10:31:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:33,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,424 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:33,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:33,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,425 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:33,425 INFO L418 AbstractCegarLoop]: === Iteration 71 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1887925976, now seen corresponding path program 49 times [2019-08-05 10:31:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:33,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:33,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:33,577 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:34,439 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2019-08-05 10:31:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:31:34,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:34,440 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:31:34,441 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:31:34,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=931, Invalid=2491, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:31:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:31:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 29. [2019-08-05 10:31:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:34,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:34,443 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:34,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:34,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:34,444 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:34,444 INFO L418 AbstractCegarLoop]: === Iteration 72 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash 949291094, now seen corresponding path program 50 times [2019-08-05 10:31:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:34,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:34,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:34,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:34,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:34,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:34,555 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,387 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2019-08-05 10:31:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:31:35,388 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,389 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:31:35,389 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:31:35,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=934, Invalid=2488, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:31:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:31:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 29. [2019-08-05 10:31:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:35,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,392 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:35,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:35,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,392 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:35,393 INFO L418 AbstractCegarLoop]: === Iteration 73 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1916380824, now seen corresponding path program 51 times [2019-08-05 10:31:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:35,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:35,503 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,287 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2019-08-05 10:31:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:31:36,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,287 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:31:36,288 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:31:36,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=882, Invalid=2310, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:31:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:31:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 29. [2019-08-05 10:31:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:36,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,289 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:36,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:36,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,290 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:36,290 INFO L418 AbstractCegarLoop]: === Iteration 74 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1831391382, now seen corresponding path program 52 times [2019-08-05 10:31:36,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:36,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:36,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:36,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:36,665 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:37,360 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-08-05 10:31:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:31:37,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:37,361 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:31:37,361 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:31:37,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:31:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:31:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 29. [2019-08-05 10:31:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:37,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:37,364 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:37,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:37,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:37,365 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:37,365 INFO L418 AbstractCegarLoop]: === Iteration 75 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash -803281320, now seen corresponding path program 53 times [2019-08-05 10:31:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:37,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:37,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:37,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:37,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:37,499 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,062 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2019-08-05 10:31:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:31:38,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,063 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:31:38,064 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:31:38,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=1531, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:31:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:31:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 29. [2019-08-05 10:31:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:38,066 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,066 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:38,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:38,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,067 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:38,067 INFO L418 AbstractCegarLoop]: === Iteration 76 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -873756458, now seen corresponding path program 54 times [2019-08-05 10:31:38,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:38,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:38,180 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,575 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-08-05 10:31:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:38,575 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,576 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:31:38,576 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:31:38,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=456, Invalid=1026, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:31:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 29. [2019-08-05 10:31:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:38,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,579 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:38,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:38,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,580 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:38,580 INFO L418 AbstractCegarLoop]: === Iteration 77 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1236481560, now seen corresponding path program 55 times [2019-08-05 10:31:38,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:38,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:38,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:38,723 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,955 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-08-05 10:31:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:38,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,956 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:31:38,957 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:31:38,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:31:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 29. [2019-08-05 10:31:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-08-05 10:31:38,959 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 16 [2019-08-05 10:31:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,959 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-08-05 10:31:38,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-08-05 10:31:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:38,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,960 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:31:38,960 INFO L418 AbstractCegarLoop]: === Iteration 78 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2065616618, now seen corresponding path program 11 times [2019-08-05 10:31:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:39,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:39,082 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 16 states. [2019-08-05 10:31:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,138 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-08-05 10:31:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:39,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:31:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,139 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:31:39,140 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:31:39,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:31:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-08-05 10:31:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:31:39,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 16 [2019-08-05 10:31:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,142 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:31:39,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:31:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:39,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,142 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:31:39,143 INFO L418 AbstractCegarLoop]: === Iteration 79 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1063410755, now seen corresponding path program 12 times [2019-08-05 10:31:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:39,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:39,247 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 17 states. [2019-08-05 10:31:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:39,838 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2019-08-05 10:31:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:31:39,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:39,840 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:31:39,840 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:31:39,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=601, Invalid=1121, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:31:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 31. [2019-08-05 10:31:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:39,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:39,843 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:39,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:39,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:39,843 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:39,844 INFO L418 AbstractCegarLoop]: === Iteration 80 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1061444549, now seen corresponding path program 56 times [2019-08-05 10:31:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:39,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:39,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:39,951 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,718 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2019-08-05 10:31:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:40,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,719 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:31:40,719 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:31:40,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=765, Invalid=1785, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:31:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 31. [2019-08-05 10:31:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:40,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,721 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:40,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:40,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,722 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:40,722 INFO L418 AbstractCegarLoop]: === Iteration 81 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1000492163, now seen corresponding path program 57 times [2019-08-05 10:31:40,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:40,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:40,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:40,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:40,817 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:41,853 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2019-08-05 10:31:41,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:31:41,853 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:41,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:41,854 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:31:41,854 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:31:41,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=927, Invalid=2379, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:31:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:31:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 31. [2019-08-05 10:31:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:41,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:41,857 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:41,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:41,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:41,858 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:41,858 INFO L418 AbstractCegarLoop]: === Iteration 82 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash 889031803, now seen corresponding path program 58 times [2019-08-05 10:31:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:41,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:41,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:41,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:41,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:41,970 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,910 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2019-08-05 10:31:42,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:31:42,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,911 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:31:42,911 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:31:42,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1063, Invalid=2843, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:31:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:31:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 31. [2019-08-05 10:31:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:42,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,915 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:42,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:42,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,916 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:42,916 INFO L418 AbstractCegarLoop]: === Iteration 83 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash -665267395, now seen corresponding path program 59 times [2019-08-05 10:31:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:43,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:43,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:43,056 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:44,172 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2019-08-05 10:31:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:31:44,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:44,173 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:31:44,173 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:31:44,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1155, Invalid=3135, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:31:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:31:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 31. [2019-08-05 10:31:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:44,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:44,176 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:44,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:44,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:44,177 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:44,177 INFO L418 AbstractCegarLoop]: === Iteration 84 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1603902277, now seen corresponding path program 60 times [2019-08-05 10:31:44,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:44,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:44,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:44,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:44,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:44,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:44,746 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:45,802 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2019-08-05 10:31:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:31:45,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:45,803 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:31:45,803 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:31:45,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1191, Invalid=3231, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:31:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:31:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 31. [2019-08-05 10:31:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:45,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:45,805 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:45,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:45,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:45,806 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-08-05 10:31:45,806 INFO L418 AbstractCegarLoop]: === Iteration 85 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash -636812547, now seen corresponding path program 61 times [2019-08-05 10:31:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:45,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:45,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:45,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:45,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:45,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:45,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:45,970 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:47,215 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2019-08-05 10:31:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:31:47,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:47,216 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:31:47,216 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:31:47,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1165, Invalid=3125, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:31:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:31:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 31. [2019-08-05 10:31:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:47,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:47,219 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:47,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:47,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:47,220 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:47,220 INFO L418 AbstractCegarLoop]: === Iteration 86 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -721801989, now seen corresponding path program 62 times [2019-08-05 10:31:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:47,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:47,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:47,420 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,335 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-08-05 10:31:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:31:48,335 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,336 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:31:48,337 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:31:48,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1077, Invalid=2829, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:31:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:31:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 31. [2019-08-05 10:31:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:48,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,340 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:48,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:48,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,340 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:48,341 INFO L418 AbstractCegarLoop]: === Iteration 87 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 938492605, now seen corresponding path program 63 times [2019-08-05 10:31:48,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:48,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:48,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:48,635 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,476 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2019-08-05 10:31:49,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:31:49,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,477 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:31:49,477 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:31:49,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=933, Invalid=2373, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:31:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:31:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 31. [2019-08-05 10:31:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:49,479 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,480 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:49,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:49,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,480 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:49,481 INFO L418 AbstractCegarLoop]: === Iteration 88 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 868017467, now seen corresponding path program 64 times [2019-08-05 10:31:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:49,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:49,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:49,614 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,369 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-08-05 10:31:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:31:50,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,370 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:31:50,370 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:31:50,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=745, Invalid=1805, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:31:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:31:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 31. [2019-08-05 10:31:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:50,372 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,372 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:50,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:50,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,372 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:50,372 INFO L418 AbstractCegarLoop]: === Iteration 89 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1316711811, now seen corresponding path program 65 times [2019-08-05 10:31:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:50,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:50,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:50,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:50,526 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,016 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-08-05 10:31:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:31:51,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,017 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:31:51,018 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:51,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=531, Invalid=1191, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 31. [2019-08-05 10:31:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:51,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,020 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:51,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:51,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,021 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:51,021 INFO L418 AbstractCegarLoop]: === Iteration 90 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash -323842693, now seen corresponding path program 66 times [2019-08-05 10:31:51,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:51,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:51,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:51,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:51,146 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,449 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2019-08-05 10:31:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:51,450 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,450 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:31:51,450 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:31:51,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:31:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 31. [2019-08-05 10:31:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-08-05 10:31:51,452 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 17 [2019-08-05 10:31:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,452 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-08-05 10:31:51,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-08-05 10:31:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:51,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,452 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:31:51,453 INFO L418 AbstractCegarLoop]: === Iteration 91 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 390328893, now seen corresponding path program 12 times [2019-08-05 10:31:51,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:51,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:51,590 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 17 states. [2019-08-05 10:31:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:51,683 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2019-08-05 10:31:51,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:51,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:31:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:51,684 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:31:51,684 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:31:51,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:31:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-08-05 10:31:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:31:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-08-05 10:31:51,686 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 17 [2019-08-05 10:31:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:51,686 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-08-05 10:31:51,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-08-05 10:31:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:51,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:51,687 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:31:51,687 INFO L418 AbstractCegarLoop]: === Iteration 92 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:51,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:51,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1391973368, now seen corresponding path program 13 times [2019-08-05 10:31:51,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:51,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:51,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:51,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:51,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:51,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:51,963 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 18 states. [2019-08-05 10:31:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:52,689 INFO L93 Difference]: Finished difference Result 196 states and 227 transitions. [2019-08-05 10:31:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:31:52,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:52,691 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:31:52,691 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:31:52,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=689, Invalid=1291, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:31:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:31:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 33. [2019-08-05 10:31:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:52,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:52,693 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:52,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:52,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:52,693 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:31:52,693 INFO L418 AbstractCegarLoop]: === Iteration 93 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1393939574, now seen corresponding path program 67 times [2019-08-05 10:31:52,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:52,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:52,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:52,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:52,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:52,805 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:31:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,720 INFO L93 Difference]: Finished difference Result 191 states and 221 transitions. [2019-08-05 10:31:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:31:53,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,722 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:31:53,722 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:31:53,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=887, Invalid=2083, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:31:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:31:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 33. [2019-08-05 10:31:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:53,723 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,724 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:53,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:53,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,724 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1] [2019-08-05 10:31:53,724 INFO L418 AbstractCegarLoop]: === Iteration 94 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1454891960, now seen corresponding path program 68 times [2019-08-05 10:31:53,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:53,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:53,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:53,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:53,925 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:31:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,000 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2019-08-05 10:31:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:31:55,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,002 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:31:55,002 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:31:55,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1089, Invalid=2817, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:31:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:31:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 33. [2019-08-05 10:31:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:55,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,004 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:55,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:55,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,005 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1] [2019-08-05 10:31:55,005 INFO L418 AbstractCegarLoop]: === Iteration 95 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:55,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -950551370, now seen corresponding path program 69 times [2019-08-05 10:31:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:55,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:55,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:55,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:55,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:55,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:55,172 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:31:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:56,370 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2019-08-05 10:31:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:31:56,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:56,372 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:31:56,372 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:31:56,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1268, Invalid=3424, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:31:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:31:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-08-05 10:31:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:56,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:56,374 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:56,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:56,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:56,375 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1, 1] [2019-08-05 10:31:56,375 INFO L418 AbstractCegarLoop]: === Iteration 96 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1790116728, now seen corresponding path program 70 times [2019-08-05 10:31:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:56,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:56,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:56,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:56,511 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:31:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,109 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2019-08-05 10:31:58,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:31:58,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,110 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:31:58,110 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:31:58,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1403, Invalid=3853, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:31:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:31:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 33. [2019-08-05 10:31:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:58,113 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,113 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:58,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:58,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,114 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1] [2019-08-05 10:31:58,114 INFO L418 AbstractCegarLoop]: === Iteration 97 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 851481846, now seen corresponding path program 71 times [2019-08-05 10:31:58,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:58,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:58,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:58,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:58,237 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:31:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:59,511 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2019-08-05 10:31:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:31:59,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:31:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:59,513 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:31:59,513 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:31:59,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:31:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:31:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 33. [2019-08-05 10:31:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:31:59,515 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:31:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:59,515 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:31:59,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:31:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:59,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:59,516 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 10:31:59,516 INFO L418 AbstractCegarLoop]: === Iteration 98 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1818571576, now seen corresponding path program 72 times [2019-08-05 10:31:59,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:59,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:31:59,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:59,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:59,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:59,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:59,664 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:00,913 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2019-08-05 10:32:00,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:32:00,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:00,915 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:32:00,915 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:32:00,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1487, Invalid=4063, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:32:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 33. [2019-08-05 10:32:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:00,917 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:00,917 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:00,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:00,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:00,917 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:00,918 INFO L418 AbstractCegarLoop]: === Iteration 99 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1733582134, now seen corresponding path program 73 times [2019-08-05 10:32:00,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:00,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:00,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:01,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:01,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:01,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:01,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:01,113 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:02,522 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2019-08-05 10:32:02,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:32:02,522 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:02,523 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:32:02,523 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:32:02,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1424, Invalid=3832, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:32:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 33. [2019-08-05 10:32:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:02,526 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:02,526 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:02,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:02,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:02,527 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:02,527 INFO L418 AbstractCegarLoop]: === Iteration 100 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash -901090568, now seen corresponding path program 74 times [2019-08-05 10:32:02,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:02,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:02,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:02,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:02,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:02,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:02,735 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:03,798 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2019-08-05 10:32:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:32:03,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:03,799 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:32:03,799 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:32:03,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1293, Invalid=3399, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:32:03,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:32:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 33. [2019-08-05 10:32:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:03,801 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:03,801 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:03,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:03,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:03,801 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:03,802 INFO L418 AbstractCegarLoop]: === Iteration 101 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash -971565706, now seen corresponding path program 75 times [2019-08-05 10:32:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:03,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:03,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:03,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:03,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:03,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:03,928 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:04,787 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 10:32:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:05,037 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2019-08-05 10:32:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:32:05,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:05,038 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:32:05,038 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:32:05,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1103, Invalid=2803, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:32:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 33. [2019-08-05 10:32:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:05,040 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:05,040 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:05,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:05,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:05,041 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:05,041 INFO L418 AbstractCegarLoop]: === Iteration 102 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1138672312, now seen corresponding path program 76 times [2019-08-05 10:32:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:05,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:05,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:05,176 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:05,888 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2019-08-05 10:32:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:32:05,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:05,889 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:32:05,889 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:32:05,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=869, Invalid=2101, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:32:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 33. [2019-08-05 10:32:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:05,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:05,892 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:05,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:05,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:05,892 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:05,893 INFO L418 AbstractCegarLoop]: === Iteration 103 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2131541430, now seen corresponding path program 77 times [2019-08-05 10:32:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:05,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:06,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:06,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:06,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:06,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:06,057 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,588 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2019-08-05 10:32:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:06,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,589 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:32:06,589 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:32:06,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=612, Invalid=1368, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:32:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2019-08-05 10:32:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:06,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,592 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:06,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:06,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,592 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:06,593 INFO L418 AbstractCegarLoop]: === Iteration 104 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1449254280, now seen corresponding path program 78 times [2019-08-05 10:32:06,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:06,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:06,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:06,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:06,763 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,067 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-08-05 10:32:07,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:32:07,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,068 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:32:07,068 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:32:07,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=359, Invalid=697, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:32:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:32:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-08-05 10:32:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:32:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-08-05 10:32:07,070 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2019-08-05 10:32:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,070 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-08-05 10:32:07,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-08-05 10:32:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:32:07,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,071 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:32:07,071 INFO L418 AbstractCegarLoop]: === Iteration 105 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -784771594, now seen corresponding path program 13 times [2019-08-05 10:32:07,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:32:07,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:32:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:32:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:32:07,451 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 18 states. [2019-08-05 10:32:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:07,519 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-08-05 10:32:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:32:07,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:32:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:07,520 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:32:07,520 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:32:07,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:32:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-08-05 10:32:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:32:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-08-05 10:32:07,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2019-08-05 10:32:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:07,523 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-08-05 10:32:07,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:32:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-08-05 10:32:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:07,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:07,524 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:32:07,524 INFO L418 AbstractCegarLoop]: === Iteration 106 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash 199469853, now seen corresponding path program 14 times [2019-08-05 10:32:07,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:07,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:07,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:07,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:07,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:07,708 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 19 states. [2019-08-05 10:32:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:08,468 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 10:32:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:32:08,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:08,469 INFO L225 Difference]: With dead ends: 217 [2019-08-05 10:32:08,469 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:32:08,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=783, Invalid=1473, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:32:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 35. [2019-08-05 10:32:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:08,471 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:08,471 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:08,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:08,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:08,472 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:08,472 INFO L418 AbstractCegarLoop]: === Iteration 107 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 201436059, now seen corresponding path program 79 times [2019-08-05 10:32:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:08,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:08,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:08,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:08,659 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,628 INFO L93 Difference]: Finished difference Result 212 states and 244 transitions. [2019-08-05 10:32:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:09,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,629 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:32:09,629 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:32:09,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1018, Invalid=2404, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:32:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 35. [2019-08-05 10:32:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:09,631 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,631 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:09,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:09,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,632 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:09,632 INFO L418 AbstractCegarLoop]: === Iteration 108 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:09,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,632 INFO L82 PathProgramCache]: Analyzing trace with hash 262388445, now seen corresponding path program 80 times [2019-08-05 10:32:09,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:09,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:09,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:09,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:09,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:09,749 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:10,881 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2019-08-05 10:32:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:32:10,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:10,882 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:32:10,883 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:32:10,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1264, Invalid=3292, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:32:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 35. [2019-08-05 10:32:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:10,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:10,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:10,887 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:10,887 INFO L418 AbstractCegarLoop]: === Iteration 109 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2143054885, now seen corresponding path program 81 times [2019-08-05 10:32:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:10,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:10,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:11,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:11,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:11,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:11,002 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:12,521 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2019-08-05 10:32:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:32:12,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:12,521 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:32:12,521 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:32:12,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1491, Invalid=4059, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:32:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 35. [2019-08-05 10:32:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:12,523 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:12,523 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:12,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:12,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:12,524 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:12,524 INFO L418 AbstractCegarLoop]: === Iteration 110 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:12,524 INFO L82 PathProgramCache]: Analyzing trace with hash 597613213, now seen corresponding path program 82 times [2019-08-05 10:32:12,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:12,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:12,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:12,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:12,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:12,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:12,709 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:14,083 INFO L93 Difference]: Finished difference Result 191 states and 220 transitions. [2019-08-05 10:32:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:32:14,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:14,084 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:32:14,084 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:32:14,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1675, Invalid=4645, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:32:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 35. [2019-08-05 10:32:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:14,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:14,087 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:14,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:14,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:14,087 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:14,088 INFO L418 AbstractCegarLoop]: === Iteration 111 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -341021669, now seen corresponding path program 83 times [2019-08-05 10:32:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:14,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:14,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:14,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:14,341 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:15,712 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2019-08-05 10:32:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:32:15,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:15,713 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:32:15,713 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:32:15,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1798, Invalid=5008, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:32:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 35. [2019-08-05 10:32:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:15,715 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:15,715 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:15,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:15,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:15,716 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:15,716 INFO L418 AbstractCegarLoop]: === Iteration 112 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 626068061, now seen corresponding path program 84 times [2019-08-05 10:32:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:15,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:15,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:15,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:15,858 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,295 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2019-08-05 10:32:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:32:17,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,295 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:32:17,296 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:32:17,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1848, Invalid=5124, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:32:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 35. [2019-08-05 10:32:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:17,297 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,297 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:17,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:17,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,298 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2019-08-05 10:32:17,298 INFO L418 AbstractCegarLoop]: === Iteration 113 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 541078619, now seen corresponding path program 85 times [2019-08-05 10:32:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:17,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:17,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:18,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:18,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:18,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:18,054 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,395 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2019-08-05 10:32:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:32:19,395 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,396 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:32:19,396 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:32:19,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2059 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1819, Invalid=4987, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:32:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 35. [2019-08-05 10:32:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:19,398 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,398 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:19,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:19,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,398 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:19,398 INFO L418 AbstractCegarLoop]: === Iteration 114 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2093594083, now seen corresponding path program 86 times [2019-08-05 10:32:19,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:19,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:19,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:19,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:19,528 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:20,834 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-08-05 10:32:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:32:20,834 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:20,835 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:32:20,835 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:32:20,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=4609, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:32:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 35. [2019-08-05 10:32:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:20,837 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:20,837 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:20,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:20,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:20,837 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:20,838 INFO L418 AbstractCegarLoop]: === Iteration 115 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2130898075, now seen corresponding path program 87 times [2019-08-05 10:32:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:20,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:20,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:20,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:20,963 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:22,106 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2019-08-05 10:32:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:32:22,107 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:22,107 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:32:22,107 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:32:22,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1530, Invalid=4020, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:32:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:32:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 35. [2019-08-05 10:32:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:22,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:22,109 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:22,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:22,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:22,110 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:22,110 INFO L418 AbstractCegarLoop]: === Iteration 116 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash -53831203, now seen corresponding path program 88 times [2019-08-05 10:32:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:22,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:22,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:22,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:22,246 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:23,456 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2019-08-05 10:32:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:32:23,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:23,457 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:32:23,457 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:32:23,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1288, Invalid=3268, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:32:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:32:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 35. [2019-08-05 10:32:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:23,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:23,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:23,460 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:23,460 INFO L418 AbstractCegarLoop]: === Iteration 117 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 939037915, now seen corresponding path program 89 times [2019-08-05 10:32:23,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:23,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:23,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:23,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:23,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:23,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:23,661 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:24,468 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2019-08-05 10:32:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:24,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:24,469 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:32:24,469 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:32:24,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1003, Invalid=2419, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:32:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 35. [2019-08-05 10:32:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:24,471 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:24,471 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:24,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:24,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:24,472 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:24,472 INFO L418 AbstractCegarLoop]: === Iteration 118 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1653209501, now seen corresponding path program 90 times [2019-08-05 10:32:24,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:24,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:24,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:24,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:24,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:24,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:24,881 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:25,448 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-08-05 10:32:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:32:25,449 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:25,449 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:32:25,449 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:32:25,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=699, Invalid=1557, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:32:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 35. [2019-08-05 10:32:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:25,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:25,451 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:25,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:25,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:25,452 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:25,452 INFO L418 AbstractCegarLoop]: === Iteration 119 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1977275109, now seen corresponding path program 91 times [2019-08-05 10:32:25,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:25,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:25,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:25,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:25,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:25,688 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,193 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-08-05 10:32:26,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:32:26,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,194 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:32:26,194 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:32:26,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=784, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:32:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:32:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 35. [2019-08-05 10:32:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:32:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-08-05 10:32:26,196 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 19 [2019-08-05 10:32:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,196 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-08-05 10:32:26,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-08-05 10:32:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:32:26,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,197 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:32:26,197 INFO L418 AbstractCegarLoop]: === Iteration 120 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1441818973, now seen corresponding path program 14 times [2019-08-05 10:32:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:26,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:32:26,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:32:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:32:26,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:32:26,356 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 19 states. [2019-08-05 10:32:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,429 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-08-05 10:32:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:32:26,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:32:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,430 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:32:26,430 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:32:26,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=220, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:32:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-08-05 10:32:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:32:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-08-05 10:32:26,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 19 [2019-08-05 10:32:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,433 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-08-05 10:32:26,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:32:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-08-05 10:32:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:26,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,433 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:32:26,433 INFO L418 AbstractCegarLoop]: === Iteration 121 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1886566552, now seen corresponding path program 15 times [2019-08-05 10:32:26,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:26,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:26,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:26,624 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 20 states. [2019-08-05 10:32:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:27,461 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2019-08-05 10:32:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:27,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:27,462 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:32:27,463 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:32:27,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=883, Invalid=1667, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:32:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 37. [2019-08-05 10:32:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:27,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:27,464 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:27,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:27,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:27,465 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:27,465 INFO L418 AbstractCegarLoop]: === Iteration 122 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1888532758, now seen corresponding path program 92 times [2019-08-05 10:32:27,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:27,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:27,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:27,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:27,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:27,908 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:28,990 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2019-08-05 10:32:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:32:28,991 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:28,991 INFO L225 Difference]: With dead ends: 234 [2019-08-05 10:32:28,991 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:32:28,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1158, Invalid=2748, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:32:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 37. [2019-08-05 10:32:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:28,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:28,993 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:28,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:28,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:28,994 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:28,994 INFO L418 AbstractCegarLoop]: === Iteration 123 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1949485144, now seen corresponding path program 93 times [2019-08-05 10:32:28,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:29,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:29,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:29,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:29,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:29,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:29,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:29,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:29,163 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,468 INFO L93 Difference]: Finished difference Result 228 states and 261 transitions. [2019-08-05 10:32:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:32:30,468 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,469 INFO L225 Difference]: With dead ends: 228 [2019-08-05 10:32:30,469 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:32:30,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1452, Invalid=3804, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:32:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 37. [2019-08-05 10:32:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:30,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,471 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:30,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:30,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,471 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:30,471 INFO L418 AbstractCegarLoop]: === Iteration 124 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash -455958186, now seen corresponding path program 94 times [2019-08-05 10:32:30,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:30,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:30,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:30,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:30,607 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:32,081 INFO L93 Difference]: Finished difference Result 221 states and 253 transitions. [2019-08-05 10:32:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:32:32,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:32,082 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:32:32,083 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:32:32,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1732, Invalid=4748, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:32:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 37. [2019-08-05 10:32:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:32,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:32,085 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:32,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:32,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:32,085 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:32,085 INFO L418 AbstractCegarLoop]: === Iteration 125 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2010257384, now seen corresponding path program 95 times [2019-08-05 10:32:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:32,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:32,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:32,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:32,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:32,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:32,210 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:34,109 INFO L93 Difference]: Finished difference Result 213 states and 244 transitions. [2019-08-05 10:32:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:32:34,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:34,110 INFO L225 Difference]: With dead ends: 213 [2019-08-05 10:32:34,111 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:32:34,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1971, Invalid=5511, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:32:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:32:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 37. [2019-08-05 10:32:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:34,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:34,113 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:34,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:34,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:34,114 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:34,114 INFO L418 AbstractCegarLoop]: === Iteration 126 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1346075030, now seen corresponding path program 96 times [2019-08-05 10:32:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:34,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:34,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:34,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:34,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:34,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:34,263 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:35,880 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2019-08-05 10:32:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:32:35,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:35,881 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:32:35,882 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:32:35,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2501 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2148, Invalid=6042, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:32:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:32:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 37. [2019-08-05 10:32:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:35,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:35,884 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:35,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:35,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:35,884 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:35,884 INFO L418 AbstractCegarLoop]: === Iteration 127 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1981802536, now seen corresponding path program 97 times [2019-08-05 10:32:35,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:35,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:35,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:36,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:36,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:36,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:36,045 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:37,794 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2019-08-05 10:32:37,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:32:37,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:37,795 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:32:37,795 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:32:37,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2248, Invalid=6308, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:32:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:32:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 37. [2019-08-05 10:32:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:37,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:37,797 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:37,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:37,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:37,798 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 10:32:37,798 INFO L418 AbstractCegarLoop]: === Iteration 128 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2066791978, now seen corresponding path program 98 times [2019-08-05 10:32:37,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:37,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:37,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:38,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:38,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:38,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:38,162 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:39,854 INFO L93 Difference]: Finished difference Result 183 states and 211 transitions. [2019-08-05 10:32:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:32:39,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:39,855 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:32:39,857 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:32:39,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2671 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2262, Invalid=6294, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:32:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:32:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 37. [2019-08-05 10:32:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:39,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:39,860 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:39,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:39,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:39,864 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-05 10:32:39,864 INFO L418 AbstractCegarLoop]: === Iteration 129 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -406497384, now seen corresponding path program 99 times [2019-08-05 10:32:39,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:40,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:40,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:40,333 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:41,951 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2019-08-05 10:32:41,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:32:41,951 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:41,952 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:32:41,952 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:32:41,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2187, Invalid=6003, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:32:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:32:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 37. [2019-08-05 10:32:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:41,954 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:41,955 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:41,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:41,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:41,955 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:41,955 INFO L418 AbstractCegarLoop]: === Iteration 130 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -476972522, now seen corresponding path program 100 times [2019-08-05 10:32:41,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:41,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:41,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:42,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:42,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:42,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:42,103 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:43,817 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2019-08-05 10:32:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:32:43,817 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:43,818 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:32:43,818 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:32:43,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2026, Invalid=5456, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:32:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:32:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 37. [2019-08-05 10:32:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:43,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:43,820 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:43,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:43,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:43,821 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:43,821 INFO L418 AbstractCegarLoop]: === Iteration 131 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:43,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1633265496, now seen corresponding path program 101 times [2019-08-05 10:32:43,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:43,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:43,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:43,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:43,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:43,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:43,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:43,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:43,994 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:45,314 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2019-08-05 10:32:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:32:45,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:45,314 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:32:45,315 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:32:45,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1788, Invalid=4692, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:32:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 37. [2019-08-05 10:32:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:45,316 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:45,316 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:45,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:45,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:45,317 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:45,317 INFO L418 AbstractCegarLoop]: === Iteration 132 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1668832682, now seen corresponding path program 102 times [2019-08-05 10:32:45,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:45,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:45,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:45,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:45,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:45,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:45,526 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:46,649 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2019-08-05 10:32:46,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:32:46,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:46,650 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:32:46,650 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:32:46,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1488, Invalid=3768, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:32:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:32:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 37. [2019-08-05 10:32:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:46,652 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:46,652 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:46,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:46,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:46,653 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:46,653 INFO L418 AbstractCegarLoop]: === Iteration 133 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:46,653 INFO L82 PathProgramCache]: Analyzing trace with hash -954661096, now seen corresponding path program 103 times [2019-08-05 10:32:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:46,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:46,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:46,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:46,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:46,812 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,635 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2019-08-05 10:32:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:32:47,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,636 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:32:47,636 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:32:47,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1147, Invalid=2759, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:32:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:32:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 37. [2019-08-05 10:32:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:47,638 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:47,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:47,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,639 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:47,639 INFO L418 AbstractCegarLoop]: === Iteration 134 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -290178410, now seen corresponding path program 104 times [2019-08-05 10:32:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:47,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:47,808 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:48,627 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-08-05 10:32:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:48,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:48,628 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:32:48,628 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:32:48,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=792, Invalid=1758, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:32:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 37. [2019-08-05 10:32:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:48,630 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:48,631 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:48,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:48,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:48,632 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:48,632 INFO L418 AbstractCegarLoop]: === Iteration 135 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1166051624, now seen corresponding path program 105 times [2019-08-05 10:32:48,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:48,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:48,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:48,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:48,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:48,857 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:49,206 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2019-08-05 10:32:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:32:49,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:49,207 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:32:49,207 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:32:49,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=456, Invalid=876, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:32:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:32:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 37. [2019-08-05 10:32:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:32:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-08-05 10:32:49,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 20 [2019-08-05 10:32:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:49,211 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-08-05 10:32:49,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-08-05 10:32:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:32:49,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:49,212 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:32:49,212 INFO L418 AbstractCegarLoop]: === Iteration 136 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1746649814, now seen corresponding path program 15 times [2019-08-05 10:32:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:49,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:32:49,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:49,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:49,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:32:49,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:32:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:32:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:32:49,462 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 20 states. [2019-08-05 10:32:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:49,581 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-08-05 10:32:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:32:49,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:32:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:49,582 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:32:49,582 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:32:49,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=242, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:32:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2019-08-05 10:32:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:32:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-08-05 10:32:49,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 20 [2019-08-05 10:32:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:49,585 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-08-05 10:32:49,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:32:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-08-05 10:32:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:49,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:49,585 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:32:49,586 INFO L418 AbstractCegarLoop]: === Iteration 137 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1648010627, now seen corresponding path program 16 times [2019-08-05 10:32:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:49,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:49,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:49,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:49,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:49,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:49,779 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 21 states. [2019-08-05 10:32:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:50,647 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2019-08-05 10:32:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:32:50,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:50,648 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:32:50,648 INFO L226 Difference]: Without dead ends: 228 [2019-08-05 10:32:50,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=989, Invalid=1873, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-08-05 10:32:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 39. [2019-08-05 10:32:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:50,651 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:50,651 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:50,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:50,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:50,652 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:32:50,652 INFO L418 AbstractCegarLoop]: === Iteration 138 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1646044421, now seen corresponding path program 106 times [2019-08-05 10:32:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:50,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:50,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:50,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:50,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:50,811 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:32:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:51,975 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2019-08-05 10:32:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:32:51,975 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:51,975 INFO L225 Difference]: With dead ends: 257 [2019-08-05 10:32:51,976 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:32:51,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1307, Invalid=3115, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:32:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:32:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 39. [2019-08-05 10:32:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:51,978 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:51,978 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:51,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:51,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:51,978 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1] [2019-08-05 10:32:51,978 INFO L418 AbstractCegarLoop]: === Iteration 139 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1585092035, now seen corresponding path program 107 times [2019-08-05 10:32:51,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:51,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:51,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:52,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:52,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:52,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:52,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:52,182 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:32:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:53,794 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2019-08-05 10:32:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:32:53,794 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:53,795 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:32:53,795 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:32:53,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=4353, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:32:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:32:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 39. [2019-08-05 10:32:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:53,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:53,797 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:53,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:53,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:53,797 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1, 1] [2019-08-05 10:32:53,798 INFO L418 AbstractCegarLoop]: === Iteration 140 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 304431931, now seen corresponding path program 108 times [2019-08-05 10:32:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:53,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:53,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:54,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:54,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:54,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:54,016 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:32:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:55,594 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2019-08-05 10:32:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:32:55,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:55,595 INFO L225 Difference]: With dead ends: 244 [2019-08-05 10:32:55,596 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 10:32:55,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1991, Invalid=5491, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:32:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 10:32:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 39. [2019-08-05 10:32:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:55,597 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:55,598 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:55,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:55,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:55,598 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1] [2019-08-05 10:32:55,598 INFO L418 AbstractCegarLoop]: === Iteration 141 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1249867267, now seen corresponding path program 109 times [2019-08-05 10:32:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:55,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:55,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:55,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:55,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:55,843 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:32:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:57,601 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2019-08-05 10:32:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:32:57,601 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:57,602 INFO L225 Difference]: With dead ends: 236 [2019-08-05 10:32:57,602 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:32:57,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2619 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2291, Invalid=6451, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:32:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:32:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 39. [2019-08-05 10:32:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:57,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:57,604 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:57,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:57,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:57,605 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1] [2019-08-05 10:32:57,605 INFO L418 AbstractCegarLoop]: === Iteration 142 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2106465147, now seen corresponding path program 110 times [2019-08-05 10:32:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:57,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:57,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:57,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:32:57,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:32:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:32:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:32:57,759 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:32:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:59,853 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2019-08-05 10:32:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:32:59,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:32:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:59,854 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:32:59,854 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:32:59,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2529, Invalid=7173, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:32:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:32:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 39. [2019-08-05 10:32:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:32:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:32:59,857 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:32:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:59,857 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:32:59,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:32:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:32:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:32:59,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:59,857 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1] [2019-08-05 10:32:59,857 INFO L418 AbstractCegarLoop]: === Iteration 143 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1221412419, now seen corresponding path program 111 times [2019-08-05 10:32:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:59,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:32:59,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:00,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:00,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:00,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:00,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:00,085 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:01,944 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2019-08-05 10:33:01,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:33:01,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:01,945 INFO L225 Difference]: With dead ends: 217 [2019-08-05 10:33:01,945 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:33:01,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3268 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2687, Invalid=7615, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:33:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 39. [2019-08-05 10:33:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:01,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:01,947 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:01,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:01,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:01,947 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1, 1] [2019-08-05 10:33:01,948 INFO L418 AbstractCegarLoop]: === Iteration 144 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1306401861, now seen corresponding path program 112 times [2019-08-05 10:33:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:01,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:01,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:02,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:02,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:02,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:02,094 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:04,303 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2019-08-05 10:33:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:33:04,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:04,304 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:33:04,304 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:33:04,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2753, Invalid=7753, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:33:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:33:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 39. [2019-08-05 10:33:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:04,306 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:04,306 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:04,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:04,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:04,307 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2019-08-05 10:33:04,307 INFO L418 AbstractCegarLoop]: === Iteration 145 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 353892733, now seen corresponding path program 113 times [2019-08-05 10:33:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:04,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:04,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:04,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:04,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:04,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:04,453 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:06,297 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2019-08-05 10:33:06,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:33:06,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:06,298 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:33:06,298 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:33:06,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2721, Invalid=7581, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:33:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:33:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 39. [2019-08-05 10:33:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:06,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:06,300 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:06,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:06,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:06,301 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1, 1] [2019-08-05 10:33:06,301 INFO L418 AbstractCegarLoop]: === Iteration 146 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 283417595, now seen corresponding path program 114 times [2019-08-05 10:33:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:06,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:06,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:06,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:06,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:06,456 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:08,302 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2019-08-05 10:33:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:33:08,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:08,302 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:33:08,303 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:33:08,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2591, Invalid=7111, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:33:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 39. [2019-08-05 10:33:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:08,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:08,306 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:08,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:08,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:08,306 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1] [2019-08-05 10:33:08,307 INFO L418 AbstractCegarLoop]: === Iteration 147 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1901311683, now seen corresponding path program 115 times [2019-08-05 10:33:08,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:08,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:08,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:08,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:08,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:08,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:08,490 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:10,297 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2019-08-05 10:33:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:33:10,297 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:10,298 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:33:10,298 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:33:10,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2369, Invalid=6373, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:33:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:33:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 39. [2019-08-05 10:33:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:10,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:10,300 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:10,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:10,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:10,300 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1] [2019-08-05 10:33:10,301 INFO L418 AbstractCegarLoop]: === Iteration 148 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -908442565, now seen corresponding path program 116 times [2019-08-05 10:33:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:10,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:10,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:10,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:10,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:10,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:10,451 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:11,947 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2019-08-05 10:33:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:33:11,947 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:11,948 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:33:11,948 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:33:11,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2067, Invalid=5415, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:33:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:33:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 39. [2019-08-05 10:33:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:11,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:11,950 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:11,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:11,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:11,950 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1] [2019-08-05 10:33:11,951 INFO L418 AbstractCegarLoop]: === Iteration 149 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash -194270979, now seen corresponding path program 117 times [2019-08-05 10:33:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:11,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:11,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:12,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:12,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:12,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:12,119 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:13,283 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2019-08-05 10:33:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:33:13,283 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:13,284 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:33:13,284 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:33:13,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1703, Invalid=4303, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:33:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:33:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 39. [2019-08-05 10:33:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:13,286 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:13,286 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:13,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:13,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:13,286 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1, 1] [2019-08-05 10:33:13,286 INFO L418 AbstractCegarLoop]: === Iteration 150 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 470211707, now seen corresponding path program 118 times [2019-08-05 10:33:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:13,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:13,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:13,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:13,474 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:14,644 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2019-08-05 10:33:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:14,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:14,645 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:33:14,645 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:33:14,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1301, Invalid=3121, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:33:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 39. [2019-08-05 10:33:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:14,647 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:14,647 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:14,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:14,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:14,648 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1] [2019-08-05 10:33:14,648 INFO L418 AbstractCegarLoop]: === Iteration 151 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -405661507, now seen corresponding path program 119 times [2019-08-05 10:33:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:14,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:14,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:14,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:14,847 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:15,489 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2019-08-05 10:33:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:33:15,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:15,490 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:33:15,490 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:33:15,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=891, Invalid=1971, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:33:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:33:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 39. [2019-08-05 10:33:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:15,492 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:15,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:15,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:15,493 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:15,493 INFO L418 AbstractCegarLoop]: === Iteration 152 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1787927365, now seen corresponding path program 120 times [2019-08-05 10:33:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:15,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:15,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:15,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:15,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:15,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:15,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:15,672 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:16,018 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-08-05 10:33:16,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:33:16,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:16,019 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:33:16,020 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:33:16,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:33:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:33:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 39. [2019-08-05 10:33:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-08-05 10:33:16,021 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 21 [2019-08-05 10:33:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:16,022 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-08-05 10:33:16,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-08-05 10:33:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:16,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:16,022 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:33:16,023 INFO L418 AbstractCegarLoop]: === Iteration 153 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1688496003, now seen corresponding path program 16 times [2019-08-05 10:33:16,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:16,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:16,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:16,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:16,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:16,210 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 21 states. [2019-08-05 10:33:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:16,286 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2019-08-05 10:33:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:33:16,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:33:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:16,287 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:33:16,287 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:33:16,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=197, Invalid=265, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:33:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-08-05 10:33:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:33:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-08-05 10:33:16,288 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 21 [2019-08-05 10:33:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:16,289 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-08-05 10:33:16,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-08-05 10:33:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:16,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:16,290 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:33:16,290 INFO L418 AbstractCegarLoop]: === Iteration 154 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 449246520, now seen corresponding path program 17 times [2019-08-05 10:33:16,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:16,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:16,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:16,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:16,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:16,625 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 22 states. [2019-08-05 10:33:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:17,577 INFO L93 Difference]: Finished difference Result 286 states and 325 transitions. [2019-08-05 10:33:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:33:17,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:17,578 INFO L225 Difference]: With dead ends: 286 [2019-08-05 10:33:17,579 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 10:33:17,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1101, Invalid=2091, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:33:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 10:33:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 41. [2019-08-05 10:33:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:17,581 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:17,581 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:17,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:17,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:17,582 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:17,582 INFO L418 AbstractCegarLoop]: === Iteration 155 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 451212726, now seen corresponding path program 121 times [2019-08-05 10:33:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:17,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:17,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:17,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=282, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:17,736 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:19,191 INFO L93 Difference]: Finished difference Result 281 states and 319 transitions. [2019-08-05 10:33:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:33:19,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:19,192 INFO L225 Difference]: With dead ends: 281 [2019-08-05 10:33:19,192 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:33:19,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1465, Invalid=3505, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:33:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:33:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 41. [2019-08-05 10:33:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:19,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:19,195 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:19,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:19,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:19,195 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1] [2019-08-05 10:33:19,195 INFO L418 AbstractCegarLoop]: === Iteration 156 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 512165112, now seen corresponding path program 122 times [2019-08-05 10:33:19,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:19,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:19,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:19,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:19,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:19,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:19,358 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:20,943 INFO L93 Difference]: Finished difference Result 275 states and 312 transitions. [2019-08-05 10:33:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:33:20,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:20,944 INFO L225 Difference]: With dead ends: 275 [2019-08-05 10:33:20,944 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:33:20,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1867, Invalid=4939, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:33:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:33:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 41. [2019-08-05 10:33:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:20,947 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:20,948 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:20,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:20,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:20,948 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1, 1] [2019-08-05 10:33:20,948 INFO L418 AbstractCegarLoop]: === Iteration 157 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1893278218, now seen corresponding path program 123 times [2019-08-05 10:33:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:20,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:20,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:21,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:21,121 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:22,857 INFO L93 Difference]: Finished difference Result 268 states and 304 transitions. [2019-08-05 10:33:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:33:22,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:22,858 INFO L225 Difference]: With dead ends: 268 [2019-08-05 10:33:22,858 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:33:22,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2268, Invalid=6288, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:33:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 41. [2019-08-05 10:33:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:22,860 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:22,860 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:22,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:22,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:22,861 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1] [2019-08-05 10:33:22,861 INFO L418 AbstractCegarLoop]: === Iteration 158 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash 847389880, now seen corresponding path program 124 times [2019-08-05 10:33:22,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:22,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:22,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:23,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:23,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:23,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:23,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:23,050 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:25,282 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2019-08-05 10:33:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:33:25,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:25,283 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:33:25,283 INFO L226 Difference]: Without dead ends: 232 [2019-08-05 10:33:25,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2635, Invalid=7465, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-08-05 10:33:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 41. [2019-08-05 10:33:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:25,286 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:25,286 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:25,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:25,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:25,286 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1] [2019-08-05 10:33:25,286 INFO L418 AbstractCegarLoop]: === Iteration 159 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -91245002, now seen corresponding path program 125 times [2019-08-05 10:33:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:25,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:25,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:25,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:25,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:25,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:25,481 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:27,596 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2019-08-05 10:33:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:33:27,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:27,598 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:33:27,598 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:33:27,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3575 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2941, Invalid=8401, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:33:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:33:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 41. [2019-08-05 10:33:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:27,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:27,601 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:27,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:27,601 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:27,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:27,602 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1, 1] [2019-08-05 10:33:27,602 INFO L418 AbstractCegarLoop]: === Iteration 160 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 875844728, now seen corresponding path program 126 times [2019-08-05 10:33:27,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:27,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:27,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:27,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:27,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:27,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:27,824 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:30,247 INFO L93 Difference]: Finished difference Result 241 states and 274 transitions. [2019-08-05 10:33:30,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:33:30,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:30,248 INFO L225 Difference]: With dead ends: 241 [2019-08-05 10:33:30,248 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 10:33:30,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3940 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3165, Invalid=9045, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:33:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 10:33:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 41. [2019-08-05 10:33:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:30,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:30,251 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:30,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:30,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:30,251 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1] [2019-08-05 10:33:30,251 INFO L418 AbstractCegarLoop]: === Iteration 161 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 790855286, now seen corresponding path program 127 times [2019-08-05 10:33:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:30,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:30,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:30,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:30,422 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:32,635 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2019-08-05 10:33:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:33:32,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:32,636 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:33:32,636 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:33:32,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4135 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3292, Invalid=9364, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:33:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:33:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 41. [2019-08-05 10:33:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:32,639 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:32,639 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:32,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:32,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:32,639 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 10:33:32,639 INFO L418 AbstractCegarLoop]: === Iteration 162 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1843817416, now seen corresponding path program 128 times [2019-08-05 10:33:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:32,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:32,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:32,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:32,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:32,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:32,836 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:35,203 INFO L93 Difference]: Finished difference Result 218 states and 249 transitions. [2019-08-05 10:33:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:33:35,204 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:35,204 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:33:35,204 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:33:35,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4148 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3313, Invalid=9343, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:33:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:33:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 41. [2019-08-05 10:33:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:35,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:35,208 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:35,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:35,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:35,208 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-05 10:33:35,208 INFO L418 AbstractCegarLoop]: === Iteration 163 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1914292554, now seen corresponding path program 129 times [2019-08-05 10:33:35,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:35,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:35,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:35,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:35,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:35,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:35,478 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:37,727 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 10:33:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:33:37,727 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:37,728 INFO L225 Difference]: With dead ends: 205 [2019-08-05 10:33:37,728 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:33:37,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3979 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3225, Invalid=8985, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:33:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:33:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 41. [2019-08-05 10:33:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:37,730 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:37,731 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:37,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:37,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:37,731 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1] [2019-08-05 10:33:37,731 INFO L418 AbstractCegarLoop]: === Iteration 164 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash 195945464, now seen corresponding path program 130 times [2019-08-05 10:33:37,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:37,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:37,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:37,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:37,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:37,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:37,981 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,104 INFO L93 Difference]: Finished difference Result 191 states and 220 transitions. [2019-08-05 10:33:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:33:40,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,105 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:33:40,105 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:33:40,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3640 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3031, Invalid=8311, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:33:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:33:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 41. [2019-08-05 10:33:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:40,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,108 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:40,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:40,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,109 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1, 1] [2019-08-05 10:33:40,109 INFO L418 AbstractCegarLoop]: === Iteration 165 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1188814582, now seen corresponding path program 131 times [2019-08-05 10:33:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:40,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:40,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:40,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:40,282 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:42,077 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-08-05 10:33:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:33:42,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:42,078 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:33:42,078 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:33:42,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2740, Invalid=7360, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:33:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:33:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 41. [2019-08-05 10:33:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:42,081 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:42,081 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:42,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:42,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:42,082 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1] [2019-08-05 10:33:42,082 INFO L418 AbstractCegarLoop]: === Iteration 166 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1902986168, now seen corresponding path program 132 times [2019-08-05 10:33:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:42,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:42,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:42,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:42,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:42,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:42,254 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,854 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2019-08-05 10:33:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:33:43,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,855 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:33:43,855 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:33:43,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2367, Invalid=6189, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:33:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:33:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 41. [2019-08-05 10:33:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:43,857 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,857 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:43,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:43,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,858 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1] [2019-08-05 10:33:43,858 INFO L418 AbstractCegarLoop]: === Iteration 167 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:43,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1727498442, now seen corresponding path program 133 times [2019-08-05 10:33:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:44,067 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:45,618 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2019-08-05 10:33:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:33:45,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:45,619 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:33:45,619 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:33:45,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1933, Invalid=4873, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:33:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:33:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 41. [2019-08-05 10:33:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:45,622 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:45,622 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:45,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:45,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:45,623 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1, 1] [2019-08-05 10:33:45,623 INFO L418 AbstractCegarLoop]: === Iteration 168 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1691595640, now seen corresponding path program 134 times [2019-08-05 10:33:45,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:45,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:45,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:45,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:45,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:45,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:45,910 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,936 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2019-08-05 10:33:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:33:46,936 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,937 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:33:46,937 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:33:46,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1465, Invalid=3505, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:33:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:33:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 41. [2019-08-05 10:33:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:46,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,939 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:46,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:46,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,939 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1] [2019-08-05 10:33:46,940 INFO L418 AbstractCegarLoop]: === Iteration 169 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 309329782, now seen corresponding path program 135 times [2019-08-05 10:33:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:46,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:46,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:47,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:47,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:47,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=282, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:47,160 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:47,882 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-08-05 10:33:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:33:47,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:47,883 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:33:47,883 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:33:47,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=996, Invalid=2196, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:33:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:33:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 41. [2019-08-05 10:33:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:47,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:47,885 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:47,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:47,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:47,886 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:47,886 INFO L418 AbstractCegarLoop]: === Iteration 170 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash 408761144, now seen corresponding path program 136 times [2019-08-05 10:33:47,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:47,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:47,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:48,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:48,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:48,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:48,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:48,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:48,102 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:48,468 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2019-08-05 10:33:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:33:48,468 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:48,469 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:33:48,469 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:33:48,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=565, Invalid=1075, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:33:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:33:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 41. [2019-08-05 10:33:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2019-08-05 10:33:48,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 22 [2019-08-05 10:33:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:48,471 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-08-05 10:33:48,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2019-08-05 10:33:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:48,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:48,471 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:33:48,472 INFO L418 AbstractCegarLoop]: === Iteration 171 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash -803833930, now seen corresponding path program 17 times [2019-08-05 10:33:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:48,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:48,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:48,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:48,675 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand 22 states. [2019-08-05 10:33:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:48,744 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2019-08-05 10:33:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:33:48,744 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:33:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:48,745 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:33:48,745 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:33:48,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=289, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:33:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-08-05 10:33:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:33:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-08-05 10:33:48,747 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 22 [2019-08-05 10:33:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-08-05 10:33:48,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-08-05 10:33:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:48,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:48,748 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:33:48,748 INFO L418 AbstractCegarLoop]: === Iteration 172 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1039708637, now seen corresponding path program 18 times [2019-08-05 10:33:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:48,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:48,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:49,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:49,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:49,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:49,204 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 23 states. [2019-08-05 10:33:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:50,500 INFO L93 Difference]: Finished difference Result 311 states and 352 transitions. [2019-08-05 10:33:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:33:50,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:33:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:50,501 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:33:50,501 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 10:33:50,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1219, Invalid=2321, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:33:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 10:33:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 43. [2019-08-05 10:33:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:33:50,503 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:33:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:50,503 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:33:50,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:33:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:50,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:50,504 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:33:50,504 INFO L418 AbstractCegarLoop]: === Iteration 173 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1041674843, now seen corresponding path program 137 times [2019-08-05 10:33:50,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:50,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:50,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:50,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:50,674 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:33:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:52,015 INFO L93 Difference]: Finished difference Result 306 states and 346 transitions. [2019-08-05 10:33:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:33:52,015 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:33:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:52,016 INFO L225 Difference]: With dead ends: 306 [2019-08-05 10:33:52,016 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:33:52,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:33:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:33:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 43. [2019-08-05 10:33:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:33:52,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:33:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:52,019 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:33:52,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:33:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:52,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:52,020 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1] [2019-08-05 10:33:52,020 INFO L418 AbstractCegarLoop]: === Iteration 174 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1102627229, now seen corresponding path program 138 times [2019-08-05 10:33:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:52,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:52,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:52,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:52,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:52,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:52,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:52,377 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:33:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:54,123 INFO L93 Difference]: Finished difference Result 300 states and 339 transitions. [2019-08-05 10:33:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:33:54,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:33:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:54,124 INFO L225 Difference]: With dead ends: 300 [2019-08-05 10:33:54,124 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:33:54,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2094, Invalid=5562, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:33:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:33:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 43. [2019-08-05 10:33:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:33:54,126 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:33:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:54,127 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:33:54,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:33:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:54,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:54,127 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1, 1] [2019-08-05 10:33:54,127 INFO L418 AbstractCegarLoop]: === Iteration 175 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1302816101, now seen corresponding path program 139 times [2019-08-05 10:33:54,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:54,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:54,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:54,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:54,367 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:33:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:56,534 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2019-08-05 10:33:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:33:56,534 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:33:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:56,535 INFO L225 Difference]: With dead ends: 293 [2019-08-05 10:33:56,535 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 10:33:56,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2563, Invalid=7139, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:33:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 10:33:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 43. [2019-08-05 10:33:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:33:56,537 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:33:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:56,538 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:33:56,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:33:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:56,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:56,538 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1] [2019-08-05 10:33:56,538 INFO L418 AbstractCegarLoop]: === Iteration 176 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1437851997, now seen corresponding path program 140 times [2019-08-05 10:33:56,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:56,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:56,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:56,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:56,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:56,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:56,704 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:33:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:58,806 INFO L93 Difference]: Finished difference Result 285 states and 322 transitions. [2019-08-05 10:33:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:33:58,806 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:33:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:58,807 INFO L225 Difference]: With dead ends: 285 [2019-08-05 10:33:58,807 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:33:58,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3544 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3003, Invalid=8553, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:33:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:33:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 43. [2019-08-05 10:33:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:33:58,810 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:33:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:58,810 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:33:58,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:33:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:58,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:58,810 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1, 1] [2019-08-05 10:33:58,811 INFO L418 AbstractCegarLoop]: === Iteration 177 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 499217115, now seen corresponding path program 141 times [2019-08-05 10:33:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:58,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:58,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:59,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:59,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:59,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:59,064 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:01,680 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2019-08-05 10:34:01,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:34:01,681 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:01,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:01,681 INFO L225 Difference]: With dead ends: 276 [2019-08-05 10:34:01,681 INFO L226 Difference]: Without dead ends: 248 [2019-08-05 10:34:01,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3384, Invalid=9726, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-08-05 10:34:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 43. [2019-08-05 10:34:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:01,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:01,684 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:01,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:01,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:01,685 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:01,685 INFO L418 AbstractCegarLoop]: === Iteration 178 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1466306845, now seen corresponding path program 142 times [2019-08-05 10:34:01,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:01,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:01,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:01,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:01,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:01,852 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:04,464 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2019-08-05 10:34:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:34:04,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:04,465 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:34:04,466 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:34:04,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3682, Invalid=10598, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:34:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:34:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 43. [2019-08-05 10:34:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:04,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:04,468 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:04,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:04,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:04,469 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1, 1] [2019-08-05 10:34:04,469 INFO L418 AbstractCegarLoop]: === Iteration 179 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1381317403, now seen corresponding path program 143 times [2019-08-05 10:34:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:04,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:04,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:04,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:04,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:04,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:04,674 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:07,470 INFO L93 Difference]: Finished difference Result 255 states and 289 transitions. [2019-08-05 10:34:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-08-05 10:34:07,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:07,476 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:34:07,477 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:34:07,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4987 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3879, Invalid=11127, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:34:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:34:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 43. [2019-08-05 10:34:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:07,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:07,481 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:07,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:07,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:07,482 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1] [2019-08-05 10:34:07,482 INFO L418 AbstractCegarLoop]: === Iteration 180 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1253355299, now seen corresponding path program 144 times [2019-08-05 10:34:07,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:07,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:07,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:07,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:07,776 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:10,569 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2019-08-05 10:34:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 10:34:10,569 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:10,570 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:34:10,570 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:34:10,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5102 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3963, Invalid=11289, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:34:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:34:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 43. [2019-08-05 10:34:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:10,573 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:10,573 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:10,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:10,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:10,574 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2019-08-05 10:34:10,574 INFO L418 AbstractCegarLoop]: === Iteration 181 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1323830437, now seen corresponding path program 145 times [2019-08-05 10:34:10,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:10,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:10,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:10,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:10,746 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:13,306 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2019-08-05 10:34:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-08-05 10:34:13,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:13,307 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:34:13,307 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:34:13,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5014 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3928, Invalid=11078, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:34:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:34:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 43. [2019-08-05 10:34:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:13,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:13,310 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:13,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:13,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:13,311 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1] [2019-08-05 10:34:13,311 INFO L418 AbstractCegarLoop]: === Iteration 182 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash 786407581, now seen corresponding path program 146 times [2019-08-05 10:34:13,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:13,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:13,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:13,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:13,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:13,496 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,046 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2019-08-05 10:34:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:34:16,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,053 INFO L225 Difference]: With dead ends: 216 [2019-08-05 10:34:16,053 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:34:16,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4729 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3774, Invalid=10506, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:34:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:34:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 43. [2019-08-05 10:34:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:16,055 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,056 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1, 1] [2019-08-05 10:34:16,056 INFO L418 AbstractCegarLoop]: === Iteration 183 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1779276699, now seen corresponding path program 147 times [2019-08-05 10:34:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:16,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:16,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:16,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:16,275 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:18,483 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-08-05 10:34:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:34:18,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:18,484 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:34:18,484 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 10:34:18,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4265 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3507, Invalid=9603, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 10:34:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 43. [2019-08-05 10:34:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:18,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:18,486 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:18,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:18,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:18,487 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:18,487 INFO L418 AbstractCegarLoop]: === Iteration 184 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1801519011, now seen corresponding path program 148 times [2019-08-05 10:34:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:18,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:18,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:18,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:18,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:18,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:18,713 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:20,855 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2019-08-05 10:34:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:34:20,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:20,856 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:34:20,856 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:34:20,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3139, Invalid=8417, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:34:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:34:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 43. [2019-08-05 10:34:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:20,858 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:20,858 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:20,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:20,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:20,859 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1, 1] [2019-08-05 10:34:20,859 INFO L418 AbstractCegarLoop]: === Iteration 185 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1137036325, now seen corresponding path program 149 times [2019-08-05 10:34:20,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:20,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:20,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:21,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:21,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:21,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:21,049 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:22,791 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2019-08-05 10:34:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:34:22,792 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:22,792 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:34:22,792 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:34:22,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2688, Invalid=7014, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:34:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:34:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 43. [2019-08-05 10:34:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:22,795 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:22,795 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:22,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:22,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:22,796 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1] [2019-08-05 10:34:22,796 INFO L418 AbstractCegarLoop]: === Iteration 186 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2012909539, now seen corresponding path program 150 times [2019-08-05 10:34:22,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:22,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:22,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:23,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:23,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:23,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:23,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:23,012 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:24,521 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2019-08-05 10:34:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:34:24,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:24,522 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:34:24,522 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:34:24,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2178, Invalid=5478, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:34:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:34:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 43. [2019-08-05 10:34:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:24,524 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:24,524 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:24,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:24,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:24,524 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1, 1] [2019-08-05 10:34:24,524 INFO L418 AbstractCegarLoop]: === Iteration 187 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 899791899, now seen corresponding path program 151 times [2019-08-05 10:34:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:24,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:24,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:24,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:24,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:24,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:24,722 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:26,086 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2019-08-05 10:34:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:26,086 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:26,087 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:34:26,087 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:34:26,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1639, Invalid=3911, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:34:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 43. [2019-08-05 10:34:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:26,089 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:26,089 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:26,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:26,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:26,089 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1] [2019-08-05 10:34:26,089 INFO L418 AbstractCegarLoop]: === Iteration 188 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash 999223261, now seen corresponding path program 152 times [2019-08-05 10:34:26,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:26,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:26,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:26,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:26,289 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:27,023 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2019-08-05 10:34:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:34:27,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:27,024 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:34:27,025 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:34:27,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1107, Invalid=2433, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:34:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:34:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 43. [2019-08-05 10:34:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:27,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:27,027 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:27,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:27,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:27,027 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:27,028 INFO L418 AbstractCegarLoop]: === Iteration 189 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -213371813, now seen corresponding path program 153 times [2019-08-05 10:34:27,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:27,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:27,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:27,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:27,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:27,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:27,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:27,381 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:27,794 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2019-08-05 10:34:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:34:27,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:27,795 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:34:27,795 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:34:27,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1182, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:34:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:34:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 43. [2019-08-05 10:34:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:34:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2019-08-05 10:34:27,797 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 23 [2019-08-05 10:34:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:27,797 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2019-08-05 10:34:27,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2019-08-05 10:34:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:34:27,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:27,798 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:34:27,798 INFO L418 AbstractCegarLoop]: === Iteration 190 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash 850886557, now seen corresponding path program 18 times [2019-08-05 10:34:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:27,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:34:27,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:28,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:28,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:34:28,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:34:28,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:34:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:34:28,031 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 23 states. [2019-08-05 10:34:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:28,097 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-08-05 10:34:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:34:28,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:34:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:28,098 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:34:28,098 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:34:28,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=314, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:34:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-08-05 10:34:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:34:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-08-05 10:34:28,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 23 [2019-08-05 10:34:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:28,100 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-08-05 10:34:28,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:34:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-08-05 10:34:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:28,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:28,101 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:34:28,101 INFO L418 AbstractCegarLoop]: === Iteration 191 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2130802216, now seen corresponding path program 19 times [2019-08-05 10:34:28,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:28,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:28,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:28,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:28,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:28,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:28,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:28,297 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 24 states. [2019-08-05 10:34:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:29,411 INFO L93 Difference]: Finished difference Result 337 states and 380 transitions. [2019-08-05 10:34:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:34:29,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:29,412 INFO L225 Difference]: With dead ends: 337 [2019-08-05 10:34:29,412 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 10:34:29,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1343, Invalid=2563, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:34:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 10:34:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 45. [2019-08-05 10:34:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:29,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:29,414 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:29,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:29,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:29,415 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1] [2019-08-05 10:34:29,415 INFO L418 AbstractCegarLoop]: === Iteration 192 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2128836010, now seen corresponding path program 154 times [2019-08-05 10:34:29,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:29,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:29,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:29,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:29,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:29,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:29,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:29,600 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:31,347 INFO L93 Difference]: Finished difference Result 332 states and 374 transitions. [2019-08-05 10:34:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:31,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:31,348 INFO L225 Difference]: With dead ends: 332 [2019-08-05 10:34:31,348 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:34:31,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1808, Invalid=4354, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:34:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 45. [2019-08-05 10:34:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:31,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:31,350 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:31,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:31,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:31,351 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1] [2019-08-05 10:34:31,351 INFO L418 AbstractCegarLoop]: === Iteration 193 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2067883624, now seen corresponding path program 155 times [2019-08-05 10:34:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:31,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:31,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:31,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:31,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:31,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=348, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:31,548 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:33,399 INFO L93 Difference]: Finished difference Result 326 states and 367 transitions. [2019-08-05 10:34:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:34:33,400 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:33,401 INFO L225 Difference]: With dead ends: 326 [2019-08-05 10:34:33,401 INFO L226 Difference]: Without dead ends: 290 [2019-08-05 10:34:33,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2334, Invalid=6222, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:34:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-05 10:34:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 45. [2019-08-05 10:34:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:33,403 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:33,403 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:33,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:33,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:33,403 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1, 1] [2019-08-05 10:34:33,403 INFO L418 AbstractCegarLoop]: === Iteration 194 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:33,404 INFO L82 PathProgramCache]: Analyzing trace with hash -178359658, now seen corresponding path program 156 times [2019-08-05 10:34:33,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:33,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:33,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:33,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:33,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:33,577 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:35,953 INFO L93 Difference]: Finished difference Result 319 states and 359 transitions. [2019-08-05 10:34:35,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:34:35,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:35,953 INFO L225 Difference]: With dead ends: 319 [2019-08-05 10:34:35,954 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 10:34:35,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2876, Invalid=8044, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:34:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 10:34:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 45. [2019-08-05 10:34:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:35,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:35,955 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:35,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:35,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:35,956 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1] [2019-08-05 10:34:35,956 INFO L418 AbstractCegarLoop]: === Iteration 195 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1732658856, now seen corresponding path program 157 times [2019-08-05 10:34:35,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:35,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:35,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:36,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:36,136 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:38,492 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2019-08-05 10:34:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:34:38,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:38,493 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:34:38,493 INFO L226 Difference]: Without dead ends: 279 [2019-08-05 10:34:38,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3395, Invalid=9715, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:34:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-08-05 10:34:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 45. [2019-08-05 10:34:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:38,496 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:38,496 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:38,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:38,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:38,496 INFO L399 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1, 1] [2019-08-05 10:34:38,496 INFO L418 AbstractCegarLoop]: === Iteration 196 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1623673558, now seen corresponding path program 158 times [2019-08-05 10:34:38,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:38,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:38,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:38,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:38,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:38,733 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:41,683 INFO L93 Difference]: Finished difference Result 302 states and 340 transitions. [2019-08-05 10:34:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-08-05 10:34:41,683 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:41,683 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:34:41,684 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:34:41,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4841 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3858, Invalid=11148, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:34:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:34:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 45. [2019-08-05 10:34:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:41,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:41,686 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:41,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:41,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:41,687 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1, 1] [2019-08-05 10:34:41,687 INFO L418 AbstractCegarLoop]: === Iteration 197 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1704204008, now seen corresponding path program 159 times [2019-08-05 10:34:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:41,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:41,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:41,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:41,870 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:44,760 INFO L93 Difference]: Finished difference Result 292 states and 329 transitions. [2019-08-05 10:34:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-08-05 10:34:44,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:44,761 INFO L225 Difference]: With dead ends: 292 [2019-08-05 10:34:44,761 INFO L226 Difference]: Without dead ends: 264 [2019-08-05 10:34:44,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5473 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4238, Invalid=12274, Unknown=0, NotChecked=0, Total=16512 [2019-08-05 10:34:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-08-05 10:34:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 45. [2019-08-05 10:34:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:44,764 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:44,764 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:44,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:44,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:44,765 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1, 1] [2019-08-05 10:34:44,765 INFO L418 AbstractCegarLoop]: === Iteration 198 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1789193450, now seen corresponding path program 160 times [2019-08-05 10:34:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:44,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:44,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:45,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:45,022 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:48,280 INFO L93 Difference]: Finished difference Result 281 states and 317 transitions. [2019-08-05 10:34:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:34:48,280 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:48,281 INFO L225 Difference]: With dead ends: 281 [2019-08-05 10:34:48,281 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:34:48,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5919 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4514, Invalid=13042, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:34:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:34:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 45. [2019-08-05 10:34:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:48,283 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:48,283 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:48,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:48,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:48,283 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1, 1] [2019-08-05 10:34:48,284 INFO L418 AbstractCegarLoop]: === Iteration 199 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash -128898856, now seen corresponding path program 161 times [2019-08-05 10:34:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:48,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:48,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:48,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:48,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:48,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:48,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:48,569 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:51,868 INFO L93 Difference]: Finished difference Result 269 states and 304 transitions. [2019-08-05 10:34:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-08-05 10:34:51,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:51,869 INFO L225 Difference]: With dead ends: 269 [2019-08-05 10:34:51,869 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 10:34:51,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6155 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4671, Invalid=13419, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:34:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 10:34:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 45. [2019-08-05 10:34:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:51,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:51,872 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:51,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:51,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:51,873 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 10:34:51,873 INFO L418 AbstractCegarLoop]: === Iteration 200 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash -199373994, now seen corresponding path program 162 times [2019-08-05 10:34:51,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:51,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:51,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:52,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:52,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:34:52,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:34:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:34:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:34:52,091 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 24 states. [2019-08-05 10:34:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:54,986 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2019-08-05 10:34:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-08-05 10:34:54,986 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:34:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:54,987 INFO L225 Difference]: With dead ends: 256 [2019-08-05 10:34:54,987 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:34:54,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6169 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4700, Invalid=13390, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:34:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:34:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 45. [2019-08-05 10:34:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-08-05 10:34:54,989 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 24 [2019-08-05 10:34:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:54,990 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-08-05 10:34:54,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:34:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-08-05 10:34:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:34:54,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:54,990 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-05 10:34:54,990 INFO L418 AbstractCegarLoop]: === Iteration 201 === [UselessIncrementErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1910864024, now seen corresponding path program 163 times [2019-08-05 10:34:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:54,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:34:54,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:34:55,124 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:34:55,124 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:34:55,129 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:34:55,129 INFO L202 PluginConnector]: Adding new model UselessIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:34:55 BoogieIcfgContainer [2019-08-05 10:34:55,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:34:55,131 INFO L168 Benchmark]: Toolchain (without parser) took 243990.96 ms. Allocated memory was 133.2 MB in the beginning and 261.6 MB in the end (delta: 128.5 MB). Free memory was 109.5 MB in the beginning and 187.3 MB in the end (delta: -77.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,131 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.21 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,132 INFO L168 Benchmark]: Boogie Preprocessor took 23.78 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,132 INFO L168 Benchmark]: RCFGBuilder took 325.73 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 96.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,133 INFO L168 Benchmark]: TraceAbstraction took 243598.62 ms. Allocated memory was 133.2 MB in the beginning and 261.6 MB in the end (delta: 128.5 MB). Free memory was 96.2 MB in the beginning and 191.1 MB in the end (delta: -94.8 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:34:55,134 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.21 ms. Allocated memory is still 133.2 MB. Free memory was 109.5 MB in the beginning and 107.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.78 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 106.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.73 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 96.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243598.62 ms. Allocated memory was 133.2 MB in the beginning and 261.6 MB in the end (delta: 128.5 MB). Free memory was 96.2 MB in the beginning and 191.1 MB in the end (delta: -94.8 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 9]: Timeout (TraceAbstraction) Unable to prove that procedure postcondition always holds (line 9). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 243.5s OverallTime, 201 OverallIterations, 19 TraceHistogramMax, 205.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3208 SDtfs, 9365 SDslu, 21110 SDs, 0 SdLazy, 49574 SolverSat, 15389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11455 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250313 ImplicationChecksByTransitivity, 187.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 200 MinimizatonAttempts, 18586 StatesRemovedByMinimization, 200 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 3470 NumberOfCodeBlocks, 3470 NumberOfCodeBlocksAsserted, 200 NumberOfCheckSat, 3270 ConstructedInterpolants, 0 QuantifiedInterpolants, 285000 SizeOfPredicates, 400 NumberOfNonLiveVariables, 12595 ConjunctsInSsa, 3270 ConjunctsInUnsatCore, 200 InterpolantComputations, 1 PerfectInterpolantSequences, 0/13300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown