postproc.cc 18.6 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2012-2018 Laboratoire de Recherche et Développement
3
// de l'Epita (LRDE).
4
5
6
7
8
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 3 of the License, or
10
11
12
13
14
15
16
17
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
18
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
19

20
21
22
23
24
25
#include <spot/twaalgos/postproc.hh>
#include <spot/twaalgos/minimize.hh>
#include <spot/twaalgos/simulation.hh>
#include <spot/twaalgos/sccfilter.hh>
#include <spot/twaalgos/degen.hh>
#include <spot/twaalgos/stripacc.hh>
26
#include <cstdlib>
27
28
29
30
31
32
33
34
35
#include <spot/misc/optionmap.hh>
#include <spot/twaalgos/powerset.hh>
#include <spot/twaalgos/isdet.hh>
#include <spot/twaalgos/dtbasat.hh>
#include <spot/twaalgos/dtwasat.hh>
#include <spot/twaalgos/complete.hh>
#include <spot/twaalgos/totgba.hh>
#include <spot/twaalgos/sbacc.hh>
#include <spot/twaalgos/sepsets.hh>
36
#include <spot/twaalgos/determinize.hh>
37
#include <spot/twaalgos/alternation.hh>
38
#include <spot/twaalgos/parity.hh>
39
40
#include <spot/twaalgos/cobuchi.hh>
#include <spot/twaalgos/dot.hh>
41
42
43

namespace spot
{
44
45
  namespace
  {
46
47
    static twa_graph_ptr
    ensure_ba(twa_graph_ptr& a)
48
    {
49
      if (a->num_sets() == 0)
50
51
52
53
54
        {
          auto m = a->set_buchi();
          for (auto& t: a->edges())
            t.acc = m;
        }
55
56
57
      return a;
    }
  }
58

59
60
61
62
  postprocessor::postprocessor(const option_map* opt)
  {
    if (opt)
      {
63
64
65
66
67
        degen_order_ = opt->get("degen-order", 0);
        degen_reset_ = opt->get("degen-reset", 1);
        degen_cache_ = opt->get("degen-lcache", 1);
        degen_lskip_ = opt->get("degen-lskip", 1);
        degen_lowinit_ = opt->get("degen-lowinit", 0);
68
        degen_remscc_ = opt->get("degen-remscc", 1);
69
70
71
72
73
74
75
76
        det_scc_ = opt->get("det-scc", 1);
        det_simul_ = opt->get("det-simul", 1);
        det_stutter_ = opt->get("det-stutter", 1);
        simul_ = opt->get("simul", -1);
        scc_filter_ = opt->get("scc-filter", -1);
        ba_simul_ = opt->get("ba-simul", -1);
        tba_determinisation_ = opt->get("tba-det", 0);
        sat_minimize_ = opt->get("sat-minimize", 0);
77
78
        sat_incr_steps_ = opt->get("sat-incr-steps", -2); // -2 or any num < -1
        sat_langmap_ = opt->get("sat-langmap", 0);
79
80
81
82
83
84
        sat_acc_ = opt->get("sat-acc", 0);
        sat_states_ = opt->get("sat-states", 0);
        state_based_ = opt->get("state-based", 0);
        wdba_minimize_ = opt->get("wdba-minimize", 1);

        if (sat_acc_ && sat_minimize_ == 0)
85
          sat_minimize_ = 1;        // Dicho.
86
87
88
89
90
91
92
93
94
95
        if (sat_states_ && sat_minimize_ == 0)
          sat_minimize_ = 1;
        if (sat_minimize_)
          {
            tba_determinisation_ = 1;
            if (sat_acc_ <= 0)
              sat_acc_ = -1;
            if (sat_states_ <= 0)
              sat_states_ = -1;
          }
96
97
98
99
100
101

        // Set default param value if not provided and used.
        if (sat_minimize_ == 2 && sat_incr_steps_ < 0) // Assume algorithm.
            sat_incr_steps_ = 6;
        else if (sat_minimize_ == 3 && sat_incr_steps_ < -1) // Incr algorithm.
            sat_incr_steps_ = 2;
102
103
104
      }
  }

105
106
  twa_graph_ptr
  postprocessor::do_simul(const twa_graph_ptr& a, int opt)
107
  {
108
109
    if (!has_separate_sets(a))
      return a;
110
    switch (opt)
111
112
      {
      case 0:
113
        return a;
114
      case 1:
115
        return simulation(a);
116
      case 2:
117
        return cosimulation(a);
118
119
      case 3:
      default:
120
        return iterated_simulations(a);
121
122
123
      }
  }

124
  twa_graph_ptr
125
  postprocessor::do_sba_simul(const twa_graph_ptr& a, int opt)
126
  {
127
128
    if (ba_simul_ <= 0)
      return a;
129
130
131
    switch (opt)
      {
      case 0:
132
        return a;
133
      case 1:
134
        return simulation_sba(a);
135
      case 2:
136
        return cosimulation_sba(a);
137
138
      case 3:
      default:
139
        return iterated_simulations_sba(a);
140
141
142
      }
  }

143
144
  twa_graph_ptr
  postprocessor::do_degen(const twa_graph_ptr& a)
145
  {
146
    auto d = degeneralize(a,
147
148
                          degen_reset_, degen_order_,
                          degen_cache_, degen_lskip_,
149
                          degen_lowinit_, degen_remscc_);
150
    return do_sba_simul(d, ba_simul_);
151
152
  }

153
154
155
156
157
158
159
160
161
  twa_graph_ptr
  postprocessor::do_degen_tba(const twa_graph_ptr& a)
  {
    return degeneralize_tba(a,
                            degen_reset_, degen_order_,
                            degen_cache_, degen_lskip_,
                            degen_lowinit_, degen_remscc_);
  }

162
163
164
165
166
  twa_graph_ptr
  postprocessor::do_scc_filter(const twa_graph_ptr& a, bool arg)
  {
    if (scc_filter_ == 0)
      return a;
167
    // If the automaton is weak, using transition-based acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
168
    // won't help, so let's preserve state-based acceptance.
169
    if ((state_based_ || a->prop_inherently_weak().is_true())
170
        && a->prop_state_acc().is_true())
171
      return scc_filter_states(a, arg);
172
173
174
175
176
177
178
179
180
181
    else
      return scc_filter(a, arg);
  }

  twa_graph_ptr
  postprocessor::do_scc_filter(const twa_graph_ptr& a)
  {
    return do_scc_filter(a, scc_filter_ > 1);
  }

182
183
#define PREF_ (pref_ & (Small | Deterministic))
#define COMP_ (pref_ & Complete)
184
#define SBACC_ (pref_ & SBAcc)
185
#define COLORED_ (pref_ & Colored)
186

187
  twa_graph_ptr
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
188
  postprocessor::run(twa_graph_ptr a, formula f)
189
  {
190
191
192
193
194
195
196
197
198
    if (simul_ < 0)
      simul_ = (level_ == Low) ? 1 : 3;
    if (ba_simul_ < 0)
      ba_simul_ = (level_ == High) ? 3 : 0;
    if (scc_filter_ < 0)
      scc_filter_ = 1;
    if (type_ == BA || SBACC_)
      state_based_ = true;

199
    bool via_gba = (type_ == BA) || (type_ == TGBA) || (type_ == Monitor);
200
    bool want_parity = (type_ & Parity) == Parity;
201
202
203
    if (COLORED_ && !want_parity)
      throw std::runtime_error("postprocessor: the Colored setting only works "
                               "for parity acceptance");
204
205
206
207
208
209
210
211
212
213
214

    auto finalize = [&](twa_graph_ptr tmp)
      {
        if (COMP_)
          tmp = complete(tmp);
        if (want_parity && tmp->acc().is_generalized_buchi())
          tmp = SBACC_ ? do_degen(tmp) : do_degen_tba(tmp);
        if (SBACC_)
          tmp = sbacc(tmp);
        if (want_parity)
          {
215
216
            if (COLORED_)
              colorize_parity_here(tmp);
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
            parity_kind kind = parity_kind_any;
            parity_style style = parity_style_any;
            if ((type_ & ParityMin) == ParityMin)
              kind = parity_kind_min;
            else if ((type_ & ParityMax) == ParityMax)
              kind = parity_kind_max;
            if ((type_ & ParityOdd) == ParityOdd)
              style = parity_style_odd;
            else if ((type_ & ParityEven) == ParityEven)
              style = parity_style_even;
            change_parity_here(tmp, kind, style);
          }
        return tmp;
      };

232
    if (!a->is_existential() &&
233
234
235
236
237
238
239
        // We will probably have to revisit this condition later.
        // Currently, the intent is that postprocessor should never
        // return an alternating automaton, unless it is called with
        // its laxest settings.
        !(type_ == Generic && PREF_ == Any && level_ == Low))
      a = remove_alternation(a);

240
    if ((via_gba && !a->acc().is_generalized_buchi())
241
        || (want_parity && !a->acc().is_parity()))
242
      {
243
244
245
        a = to_generalized_buchi(a);
        if (PREF_ == Any && level_ == Low)
          a = do_scc_filter(a, true);
246
      }
247

248
    if (PREF_ == Any && level_ == Low
249
250
251
        && (type_ == Generic
            || type_ == TGBA
            || (type_ == BA && a->is_sba())
252
            || (type_ == Monitor && a->num_sets() == 0)
253
254
            || (want_parity && a->acc().is_parity())
            || (type_ == CoBuchi && a->acc().is_co_buchi())))
255
      return finalize(a);
256

257
    int original_acc = a->num_sets();
258

259
    // Remove useless SCCs.
260
    if (type_ == Monitor)
261
262
263
      // Do not bother about acceptance conditions, they will be
      // ignored.
      a = scc_filter_states(a);
264
    else
265
      a = do_scc_filter(a, (PREF_ == Any));
266

267
268
    if (type_ == Monitor)
      {
269
270
271
272
273
        if (PREF_ == Deterministic)
          a = minimize_monitor(a);
        else
          strip_acceptance_here(a);

274
        if (PREF_ != Any)
275
          {
276
277
278
279
280
            if (PREF_ != Deterministic)
              a = do_simul(a, simul_);

            // For Small,High we return the smallest between the output of
            // the simulation, and that of the deterministic minimization.
281
            // Prefer the deterministic automaton in case of equality.
282
283
284
            if (PREF_ == Small && level_ == High && simul_)
              {
                auto m = minimize_monitor(a);
285
                if (m->num_states() <= a->num_states())
286
287
288
                  a = m;
              }
            a->remove_unused_ap();
289
          }
290
        return finalize(a);
291
292
      }

293
    if (PREF_ == Any)
294
      {
295
296
        if (type_ == BA)
          a = do_degen(a);
297
298
        else if (type_ == CoBuchi)
          a = to_nca(a);
299
        return finalize(a);
300
301
      }

302
    bool dba_is_wdba = false;
303
    bool dba_is_minimal = false;
304
305
    twa_graph_ptr dba = nullptr;
    twa_graph_ptr sim = nullptr;
306
307
308

    // (Small,Low) is the only configuration where we do not run
    // WDBA-minimization.
309
    if ((PREF_ != Small || level_ != Low) && wdba_minimize_)
310
      {
311
312
313
314
        bool reject_bigger = (PREF_ == Small) && (level_ == Medium);
        dba = minimize_obligation(a, f, nullptr, reject_bigger);
        if (dba
            && dba->prop_inherently_weak().is_true()
315
            && dba->prop_universal().is_true())
316
317
318
319
320
321
322
323
324
325
326
327
          {
            // The WDBA is a BA, so no degeneralization is required.
            // We just need to add an acceptance set if there is none.
            dba_is_minimal = dba_is_wdba = true;
            if (type_ == BA)
              ensure_ba(dba);
          }
        else
          {
            // Minimization failed.
            dba = nullptr;
          }
328
329
330
331
      }

    // Run a simulation when wdba failed (or was not run), or
    // at hard levels if we want a small output.
332
    if (!dba || (level_ == High && PREF_ == Small))
333
      {
334
335
336
337
338
339
340
341
342
343
344
345
346
        if (((SBACC_ && a->prop_state_acc().is_true())
             || (type_ == BA && a->is_sba()))
            && !tba_determinisation_)
          {
            sim = do_sba_simul(a, ba_simul_);
          }
        else
          {
            sim = do_simul(a, simul_);
            // Degeneralize the result of the simulation if needed.
            // No need to do that if tba_determinisation_ will be used.
            if (type_ == BA && !tba_determinisation_)
              sim = do_degen(sim);
347
348
            else if (want_parity && !sim->acc().is_parity())
              sim = do_degen_tba(sim);
349
350
351
            else if (SBACC_ && !tba_determinisation_)
              sim = sbacc(sim);
          }
352
353
      }

354
355
356
357
    // If WDBA failed, but the simulation returned a deterministic
    // automaton, use it as dba.
    assert(dba || sim);
    if (!dba && is_deterministic(sim))
358
      {
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
        std::swap(sim, dba);
        // We postponed degeneralization above i case we would need
        // to perform TBA-determinisation, but now it is clear
        // that we won't perform it.  So do degeneralize.
        if (tba_determinisation_)
          {
            if (type_ == BA)
              {
                dba = do_degen(dba);
                assert(is_deterministic(dba));
              }
            else if (SBACC_)
              {
                dba = sbacc(dba);
                assert(is_deterministic(dba));
              }
          }
376
      }
377
378
379

    // If we don't have a DBA, attempt tba-determinization if requested.
    if (tba_determinisation_ && !dba)
380
      {
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
        twa_graph_ptr tmpd = nullptr;
        if (PREF_ == Deterministic
            && f
            && f.is_syntactic_recurrence()
            && sim->num_sets() > 1)
          tmpd = degeneralize_tba(sim);

        auto in = tmpd ? tmpd : sim;

        // These thresholds are arbitrary.
        //
        // For producing Small automata, we assume that a
        // deterministic automaton that is twice the size of the
        // original will never get reduced to a smaller one.  We also
        // do not want more than 2^13 cycles in an SCC.
        //
        // For Deterministic automata, we accept automata that
        // are 8 times bigger, with no more that 2^15 cycle per SCC.
        // The cycle threshold is the most important limit here.  You
        // may up it if you want to try producing larger automata.
        auto tmp =
          tba_determinize_check(in,
                                (PREF_ == Small) ? 2 : 8,
                                1 << ((PREF_ == Small) ? 13 : 15),
                                f);
        if (tmp && tmp != in)
          {
            // There is no point in running the reverse simulation on
            // a deterministic automaton, since all prefixes are
            // unique.
            dba = simulation(tmp);
          }
        if (dba && PREF_ == Deterministic)
          {
            // disregard the result of the simulation.
            sim = nullptr;
          }
        else
          {
            // degeneralize sim, because we did not do it earlier
            if (type_ == BA)
              sim = do_degen(sim);
          }
424
425
      }

426
    if ((PREF_ == Deterministic && (type_ == Generic || want_parity)) && !dba)
427
      {
428
429
430
431
432
        dba = tgba_determinize(to_generalized_buchi(sim),
                               false, det_scc_, det_simul_, det_stutter_);
        if (level_ != Low)
          dba = simulation(dba);
        sim = nullptr;
433
434
      }

435
436
437
    // Now dba contains either the result of WDBA-minimization (in
    // that case dba_is_wdba=true), or some deterministic automaton
    // that is either the result of the simulation or of the
438
439
440
441
    // TBA-determinization (dba_is_wdba=false in both cases), or a
    // parity automaton coming from tgba_determinize().  If the dba is
    // a WDBA, we do not have to run SAT-minimization.  A negative
    // value in sat_minimize_ can force its use for debugging.
442
    if (sat_minimize_ && dba && (!dba_is_wdba || sat_minimize_ < 0))
443
      {
444
445
        if (type_ == Generic)
          throw std::runtime_error
446
            ("postproc() not yet updated to mix sat-minimize and Generic");
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
        unsigned target_acc;
        if (type_ == BA)
          target_acc = 1;
        else if (sat_acc_ != -1)
          target_acc = sat_acc_;
        else
          // Take the number of acceptance conditions from the input
          // automaton, not from dba, because dba often has been
          // degeneralized by tba_determinize_check().  Make sure it
          // is at least 1.
          target_acc = original_acc > 0 ? original_acc : 1;

        const_twa_graph_ptr in = nullptr;
        if (target_acc == 1)
          {
            // If we are seeking a minimal DBA with unknown number of
            // states, then we should start from the degeneralized,
            // because the input TBA might be smaller.
            if (state_based_)
              in = degeneralize(dba);
            else
              in = degeneralize_tba(dba);
          }
        else
          {
            in = dba;
          }

        twa_graph_ptr res = complete(in);
        if (target_acc == 1)
          {
            if (sat_states_ != -1)
              res = dtba_sat_synthetize(res, sat_states_, state_based_);
480
            else if (sat_minimize_ == 1)
481
              res = dtba_sat_minimize_dichotomy
482
483
484
485
                (res, state_based_, sat_langmap_);
            else if (sat_minimize_ == 2)
              res = dtba_sat_minimize_assume(res, state_based_, -1,
                                             sat_incr_steps_);
486
            else if (sat_minimize_ == 3)
487
488
489
490
              res = dtba_sat_minimize_incr(res, state_based_, -1,
                                           sat_incr_steps_);
            else // if (sat_minimize == 4 || sat_minimize == -1)
              res = dtba_sat_minimize(res, state_based_);
491
492
493
494
495
496
497
498
          }
        else
          {
            if (sat_states_ != -1)
              res = dtwa_sat_synthetize
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
                 sat_states_, state_based_);
499
500
            else if (sat_minimize_ == 1)
              res = dtwa_sat_minimize_dichotomy
501
502
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
503
                 state_based_, sat_langmap_);
504
            else if (sat_minimize_ == 2)
505
              res = dtwa_sat_minimize_assume
506
507
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
508
                 state_based_, -1, false, sat_incr_steps_);
509
            else if (sat_minimize_ == 3)
510
511
512
              res = dtwa_sat_minimize_incr
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
513
514
515
                 state_based_, -1, false, sat_incr_steps_);
            else // if (sat_minimize_ == 4 || sat_minimize_ == -1)
              res = dtwa_sat_minimize
516
517
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
518
                 state_based_);
519
          }
520
521
522
523
524
525

        if (res)
          {
            dba = do_scc_filter(res, true);
            dba_is_minimal = true;
          }
526
527
      }

528
529
530
    // Degeneralize the dba resulting from tba-determinization or
    // sat-minimization (which is a TBA) if requested and needed.
    if (dba && !dba_is_wdba && type_ == BA
531
        && !(dba_is_minimal && state_based_ && dba->num_sets() == 1))
532
      dba = degeneralize(dba);
533
534
535

    if (dba && sim)
      {
536
537
538
539
        if (dba->num_states() > sim->num_states())
          dba = nullptr;
        else
          sim = nullptr;
540
541
      }

542
    if (level_ == High && scc_filter_ != 0)
543
      {
544
545
546
547
548
549
550
551
552
553
554
555
        if (dba)
          {
            // Do that even for WDBA, to remove marks from transitions
            // leaving trivial SCCs.
            dba = do_scc_filter(dba, true);
            assert(!sim);
          }
        else if (sim)
          {
            sim = do_scc_filter(sim, true);
            assert(!dba);
          }
556
      }
557
558
559

    sim = dba ? dba : sim;

560
    sim->remove_unused_ap();
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575

    if (type_ == CoBuchi)
      {
        unsigned ns = sim->num_states();
        if (PREF_ == Deterministic)
          sim = to_dca(sim);
        else
          sim = to_nca(sim);

        // if the input of to_dca/to_nca was weak, the number of
        // states has not changed, and running simulation is useless.
        if (level_ != Low && ns < sim->num_states())
          sim = do_simul(sim, simul_);
      }

576
    return finalize(sim);
577
578
  }
}