emptiness.cc 20 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2009, 2011, 2012, 2013, 2014, 2015, 2016 Laboratoire de
3
// Recherche et Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
4
// Copyright (C) 2004, 2005 Laboratoire d'Informatique de Paris 6 (LIP6),
5
// département Systèmes Répartis Coopératifs (SRC), Université Pierre
6
7
8
9
10
11
// et Marie Curie.
//
// 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
12
// the Free Software Foundation; either version 3 of the License, or
13
14
15
16
17
18
19
20
// (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
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#include <sstream>
24
#include <memory>
25
26
27
28
29
30
31
32
33
34
#include <spot/twaalgos/emptiness.hh>
#include <spot/twaalgos/bfssteps.hh>
#include <spot/twaalgos/gtec/gtec.hh>
#include <spot/twaalgos/gv04.hh>
#include <spot/twaalgos/magic.hh>
#include <spot/misc/hash.hh>
#include <spot/twaalgos/se05.hh>
#include <spot/twaalgos/tau03.hh>
#include <spot/twaalgos/tau03opt.hh>
#include <spot/twa/bddprint.hh>
35
36
37

namespace spot
{
38
39
40

  // emptiness_check_result
  //////////////////////////////////////////////////////////////////////
41

42
  twa_run_ptr
43
44
  emptiness_check_result::accepting_run()
  {
45
    return nullptr;
46
47
  }

48
49
50
51
52
53
  const unsigned_statistics*
  emptiness_check_result::statistics() const
  {
    return dynamic_cast<const unsigned_statistics*>(this);
  }

54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
  const char*
  emptiness_check_result::parse_options(char* options)
  {
    option_map old(o_);
    const char* s = o_.parse_options(options);
    options_updated(old);
    return s;
  }

  void
  emptiness_check_result::options_updated(const option_map&)
  {
  }


69
70
71
  // emptiness_check
  //////////////////////////////////////////////////////////////////////

72
73
74
75
  emptiness_check::~emptiness_check()
  {
  }

76
77
78
79
80
81
  const unsigned_statistics*
  emptiness_check::statistics() const
  {
    return dynamic_cast<const unsigned_statistics*>(this);
  }

82
83
84
85
86
87
  const ec_statistics*
  emptiness_check::emptiness_check_statistics() const
  {
    return dynamic_cast<const ec_statistics*>(this);
  }

88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
  const char*
  emptiness_check::parse_options(char* options)
  {
    option_map old(o_);
    const char* s = o_.parse_options(options);
    options_updated(old);
    return s;
  }

  void
  emptiness_check::options_updated(const option_map&)
  {
  }

  bool
  emptiness_check::safe() const
  {
    return true;
  }

108
109
110
111
112
  std::ostream&
  emptiness_check::print_stats(std::ostream& os) const
  {
    return os;
  }
113

114
115
116
117
118
119
120
121
  // emptiness_check_instantiator
  //////////////////////////////////////////////////////////////////////

  namespace
  {
    struct ec_algo
    {
      const char* name;
122
      emptiness_check_ptr(*construct)(const const_twa_ptr&,
123
                                      spot::option_map);
124
125
126
127
128
129
      unsigned int min_acc;
      unsigned int max_acc;
    };

    ec_algo ec_algos[] =
      {
130
131
132
133
134
135
        { "Cou99",     couvreur99,                    0, -1U },
        { "CVWY90",    magic_search,                  0,   1 },
        { "GV04",      explicit_gv04_check,           0,   1 },
        { "SE05",      se05,                          0,   1 },
        { "Tau03",     explicit_tau03_search,         1, -1U },
        { "Tau03_opt", explicit_tau03_opt_search,     0, -1U },
136
137
138
139
      };
  }

  emptiness_check_instantiator::emptiness_check_instantiator(option_map o,
140
                                                             void* i)
141
142
143
144
145
    : o_(o), info_(i)
  {
  }

  unsigned int
146
  emptiness_check_instantiator::min_sets() const
147
148
149
150
151
  {
    return static_cast<ec_algo*>(info_)->min_acc;
  }

  unsigned int
152
  emptiness_check_instantiator::max_sets() const
153
154
155
156
  {
    return static_cast<ec_algo*>(info_)->max_acc;
  }

157
  emptiness_check_ptr
158
  emptiness_check_instantiator::instantiate(const const_twa_ptr& a) const
159
160
161
162
  {
    return static_cast<ec_algo*>(info_)->construct(a, o_);
  }

163
164
  emptiness_check_instantiator_ptr
  make_emptiness_check_instantiator(const char* name, const char** err)
165
166
167
168
169
170
171
172
173
  {
    // Skip spaces.
    while (*name && strchr(" \t\n", *name))
      ++name;

    const char* opt_str = strchr(name, '(');
    option_map o;
    if (opt_str)
      {
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
        const char* opt_start = opt_str + 1;
        const char* opt_end = strchr(opt_start, ')');
        if (!opt_end)
          {
            *err = opt_start;
            return nullptr;
          }
        std::string opt(opt_start, opt_end);

        const char* res = o.parse_options(opt.c_str());
        if (res)
          {
            *err  = opt.c_str() - res + opt_start;
            return nullptr;
          }
189
190
191
192
193
194
195
196
197
198
199
200
201
202
      }

    if (!opt_str)
      opt_str = name + strlen(name);

    // Ignore spaces before `(' (or trailing spaces).
    while (opt_str > name && strchr(" \t\n", *--opt_str))
      continue;
    std::string n(name, opt_str + 1);


    ec_algo* info = ec_algos;
    for (unsigned i = 0; i < sizeof(ec_algos)/sizeof(*ec_algos); ++i, ++info)
      if (n == info->name)
203
204
        {
          *err = nullptr;
205

206
          struct emptiness_check_instantiator_aux:
207
            public emptiness_check_instantiator
208
209
210
211
212
213
214
215
          {
            emptiness_check_instantiator_aux(option_map o, void* i):
              emptiness_check_instantiator(o, i)
            {
            }
          };
          return std::make_shared<emptiness_check_instantiator_aux>(o, info);
        }
216
    *err = name;
217
    return nullptr;
218
219
  }

220
  // twa_run
221
222
  //////////////////////////////////////////////////////////////////////

223
224
225
226
227
228
229
230
231
232
233
234
235
  twa_run::~twa_run()
  {
    for (auto i : prefix)
      i.s->destroy();
    for (auto i : cycle)
      i.s->destroy();
  }

  twa_run::twa_run(const twa_run& run)
  {
    aut = run.aut;
    for (step s : run.prefix)
      {
236
237
        s.s = s.s->clone();
        prefix.push_back(s);
238
239
240
      }
    for (step s : run.cycle)
      {
241
242
        s.s = s.s->clone();
        cycle.push_back(s);
243
244
245
246
247
248
249
250
      }
  }

  twa_run&
  twa_run::operator=(const twa_run& run)
  {
    if (&run != this)
      {
251
252
        this->~twa_run();
        new(this) twa_run(run);
253
254
255
256
257
      }
    return *this;
  }

  std::ostream&
258
  operator<<(std::ostream& os, const twa_run& run)
259
  {
260
    auto& a = run.aut;
261
262
263
264
265
266
267
    bdd_dict_ptr d = a->get_dict();

    auto pstep = [&](const twa_run::step& st)
    {
      os << "  " << a->format_state(st.s) << "\n  |  ";
      bdd_print_formula(os, d, st.label);
      if (st.acc)
268
        os << '\t' << st.acc;
269
270
271
      os << '\n';
    };

272
273
    os << "Prefix:\n";
    for (auto& s: run.prefix)
274
      pstep(s);
275
276
    os << "Cycle:\n";
    for (auto& s: run.cycle)
277
278
279
280
281
282
      pstep(s);
    return os;
  }

  namespace
  {
283
    class shortest_path final: public bfs_steps
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
    {
    public:
      shortest_path(const const_twa_ptr& a)
        : bfs_steps(a), target(nullptr)
      {
      }

      ~shortest_path()
      {
        state_set::const_iterator i = seen.begin();
        while (i != seen.end())
          {
            const state* ptr = *i;
            ++i;
            ptr->destroy();
          }
      }

      void
      set_target(const state_set* t)
      {
        target = t;
      }

      const state*
      search(const state* start, twa_run::steps& l)
      {
311
        return this->bfs_steps::search(filter(start), l);
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
      }

      const state*
      filter(const state* s)
      {
        state_set::const_iterator i = seen.find(s);
        if (i == seen.end())
          seen.insert(s);
        else
          {
            s->destroy();
            s = *i;
          }
        return s;
      }

      bool
      match(twa_run::step&, const state* dest)
      {
        return target->find(dest) != target->end();
      }

    private:
      state_set seen;
      const state_set* target;
    };
  }

  twa_run_ptr twa_run::reduce() const
  {
    auto& a = aut;
    auto res = std::make_shared<twa_run>(a);
    state_set ss;
    shortest_path shpath(a);
    shpath.set_target(&ss);

    // We want to find a short segment of the original cycle that
    // contains all acceptance conditions.

    const state* segment_start; // The initial state of the segment.
    const state* segment_next; // The state immediately after the segment.

    // Start from the end of the original cycle, and rewind until all
    // acceptance sets have been seen.
    acc_cond::mark_t seen_acc = 0U;
    twa_run::steps::const_iterator seg = cycle.end();
    do
      {
        assert(seg != cycle.begin());
361
        --seg;
362
363
364
365
366
367
368
369
370
371
372
373
374
        seen_acc |= seg->acc;
      }
    while (!a->acc().accepting(seen_acc));
    segment_start = seg->s;

    // Now go forward and ends the segment as soon as we have seen all
    // acceptance sets, cloning it in our result along the way.
    seen_acc = 0U;
    do
      {
        assert(seg != cycle.end());
        seen_acc |= seg->acc;

375
376
        twa_run::step st = { seg->s->clone(), seg->label, seg->acc };
        res->cycle.push_back(st);
377

378
        ++seg;
379
380
381
382
383
384
385
386
387
388
389
390
      }
    while (!a->acc().accepting(seen_acc));
    segment_next = seg == cycle.end() ? cycle.front().s : seg->s;

    // Close this cycle if needed, that is, compute a cycle going
    // from the state following the segment to its starting state.
    if (segment_start != segment_next)
      {
        ss.insert(segment_start);
        const state* s = shpath.search(segment_next->clone(), res->cycle);
        ss.clear();
        assert(s->compare(segment_start) == 0);
391
        (void)s;
392
393
394
395
396
397
398
      }

    // Compute the prefix: it's the shortest path from the initial
    // state of the automata to any state of the cycle.

    // Register all states from the cycle as target of the BFS.
    for (twa_run::steps::const_iterator i = res->cycle.begin();
399
         i != res->cycle.end(); ++i)
400
401
402
403
404
405
406
407
408
409
410
411
      ss.insert(i->s);

    const state* prefix_start = a->get_init_state();
    // There are two cases: either the initial state is already on
    // the cycle, or it is not.  If it is, we will have to rotate
    // the cycle so it begins on this position.  Otherwise we will shift
    // the cycle so it begins on the state that follows the prefix.
    // cycle_entry_point is that state.
    const state* cycle_entry_point;
    state_set::const_iterator ps = ss.find(prefix_start);
    if (ps != ss.end())
      {
412
413
414
        // The initial state is on the cycle.
        prefix_start->destroy();
        cycle_entry_point = *ps;
415
416
417
      }
    else
      {
418
        // This initial state is outside the cycle.  Compute the prefix.
419
420
421
422
423
424
        cycle_entry_point = shpath.search(prefix_start, res->prefix);
      }

    // Locate cycle_entry_point on the cycle.
    twa_run::steps::iterator cycle_ep_it;
    for (cycle_ep_it = res->cycle.begin();
425
426
         cycle_ep_it != res->cycle.end()
           && cycle_entry_point->compare(cycle_ep_it->s); ++cycle_ep_it)
427
428
429
430
431
      continue;
    assert(cycle_ep_it != res->cycle.end());

    // Now shift the cycle so it starts on cycle_entry_point.
    res->cycle.splice(res->cycle.end(), res->cycle,
432
                      res->cycle.begin(), cycle_ep_it);
433
434
435
436
437
438
439
440
441
442
443
444

    return res;
  }

  bool twa_run::replay(std::ostream& os, bool debug) const
  {
    const state* s = aut->get_init_state();
    int serial = 1;
    const twa_run::steps* l;
    std::string in;
    acc_cond::mark_t all_acc = 0U;
    bool all_acc_seen = false;
445
    state_map<std::set<int>> seen;
446
447
448

    if (prefix.empty())
      {
449
450
451
452
        l = &cycle;
        in = "cycle";
        if (!debug)
          os << "No prefix.\nCycle:\n";
453
454
455
      }
    else
      {
456
457
458
459
        l = &prefix;
        in = "prefix";
        if (!debug)
          os << "Prefix:\n";
460
461
462
463
464
465
      }

    twa_run::steps::const_iterator i = l->begin();

    if (s->compare(i->s))
      {
466
467
468
469
470
471
472
        if (debug)
          os << "ERROR: First state of run (in " << in << "): "
             << aut->format_state(i->s)
             << "\ndoes not match initial state of automata: "
             << aut->format_state(s) << '\n';
        s->destroy();
        return false;
473
474
475
476
      }

    for (; i != l->end(); ++serial)
      {
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
        if (debug)
          {
            // Keep track of the serial associated to each state so we
            // can note duplicate states and make the replay easier to read.
            auto o = seen.find(s);
            std::ostringstream msg;
            if (o != seen.end())
              {
                for (auto d: o->second)
                  msg << " == " << d;
                o->second.insert(serial);
                s->destroy();
                s = o->first;
              }
            else
              {
                seen[s].insert(serial);
              }
            os << "state " << serial << " in " << in << msg.str() << ": ";
          }
        else
          {
            os << "  ";
          }
        os << aut->format_state(s) << '\n';

        // expected outgoing transition
        bdd label = i->label;
        acc_cond::mark_t acc = i->acc;

        // compute the next expected state
        const state* next;
        ++i;
        if (i != l->end())
          {
            next = i->s;
          }
        else
          {
            if (l == &prefix)
              {
                l = &cycle;
                in = "cycle";
                i = l->begin();
                if (!debug)
                  os << "Cycle:\n";
              }
            next = l->begin()->s;
          }

        // browse the actual outgoing transitions
        twa_succ_iterator* j = aut->succ_iter(s);
        // When not debugging, S is not used as key in SEEN, so we can
        // destroy it right now.
        if (!debug)
          s->destroy();
        if (j->first())
          do
            {
              if (j->cond() != label
                  || j->acc() != acc)
                continue;

              const state* s2 = j->dst();
              if (s2->compare(next))
                {
                  s2->destroy();
                  continue;
                }
              else
                {
                  s = s2;
                  break;
                }
            }
          while (j->next());
        if (j->done())
          {
            if (debug)
              {
                os << "ERROR: no transition with label="
                   << bdd_format_formula(aut->get_dict(), label)
                   << " and acc=" << aut->acc().format(acc)
                   << " leaving state " << serial
                   << " for state " << aut->format_state(next) << '\n'
                   << "The following transitions leave state " << serial
                   << ":\n";
                if (j->first())
                  do
                    {
                      const state* s2 = j->dst();
                      os << "  * label="
                         << bdd_format_formula(aut->get_dict(),
                                               j->cond())
                         << " and acc="
                         << (aut->acc().format
                             (j->acc()))
                         << " going to " << aut->format_state(s2) << '\n';
                      s2->destroy();
                    }
                  while (j->next());
              }
            aut->release_iter(j);
            s->destroy();
            return false;
          }
        if (debug)
          {
            os << "transition with label="
               << bdd_format_formula(aut->get_dict(), label)
               << " and acc=" << aut->acc().format(acc)
               << std::endl;
          }
        else
          {
            os << "  |  ";
            bdd_print_formula(os, aut->get_dict(), label);
            os << '\t';
            aut->acc().format(acc);
            os << std::endl;
          }
        aut->release_iter(j);

        // Sum acceptance conditions.
        //
        // (Beware l and i designate the next step to consider.
        // Therefore if i is at the beginning of the cycle, `acc'
        // contains the acceptance conditions of the last transition
        // in the prefix; we should not account it.)
        if (l == &cycle && i != l->begin())
          {
            all_acc |= acc;
            if (!all_acc_seen && aut->acc().accepting(all_acc))
              {
                all_acc_seen = true;
                if (debug)
                  os << "all acceptance conditions ("
                     << aut->acc().format(all_acc)
                     << ") have been seen\n";
              }
          }
618
619
620
621
      }
    s->destroy();
    if (!aut->acc().accepting(all_acc))
      {
622
623
624
625
626
627
628
        if (debug)
          os << "ERROR: The cycle's acceptance conditions ("
             << aut->acc().format(all_acc)
             << ") do not\nmatch those of the automaton ("
             << aut->acc().format(aut->acc().all_sets())
             << ")\n";
        return false;
629
630
      }

631
    auto o = seen.begin();
632
633
    while (o != seen.end())
      {
634
635
636
637
        // Advance the iterator before deleting the "key" pointer.
        const state* ptr = o->first;
        ++o;
        ptr->destroy();
638
639
640
641
642
      }

    return true;
  }

643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
  /// Note that this works only if the automaton is a twa_graph_ptr.
  void twa_run::highlight(unsigned color)
  {
    auto a = std::dynamic_pointer_cast<twa_graph>
      (std::const_pointer_cast<twa>(aut));
    if (!a)
      throw std::runtime_error("highlight() only work for twa_graph");

    auto h = new std::map<unsigned, unsigned>; // highlighted edges

    unsigned src = a->get_init_state_number();
    auto l = prefix.empty() ? &cycle : &prefix;
    auto e = l->end();
    for (auto i = l->begin(); i != e;)
      {
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
        bdd label = i->label;
        acc_cond::mark_t acc = i->acc;
        unsigned dst;
        ++i;
        if (i != e)
          {
            dst = a->state_number(i->s);
          }
        else if (l == &prefix)
          {
            l = &cycle;
            i = l->begin();
            e = l->end();
            dst = a->state_number(i->s);
          }
        else
          {
            dst = a->state_number(l->begin()->s);
          }

        for (auto& t: a->out(src))
          if (t.dst == dst && t.cond == label && t.acc == acc)
            {
              (*h)[a->get_graph().index_of_edge(t)] = color;
              break;
            }
        src = dst;
685
686
687
688
      }
    a->set_named_prop("highlight-edges", h);
  }

689
  twa_graph_ptr
690
  twa_run::as_twa() const
691
  {
692
    auto d = aut->get_dict();
693
    auto res = make_twa_graph(d);
694
695
    res->copy_ap_of(aut);
    res->copy_acceptance_of(aut);
696

697
    const state* s = aut->get_init_state();
698
699
    unsigned src;
    unsigned dst;
700
    const twa_run::steps* l;
701
    acc_cond::mark_t seen_acc = 0U;
702

703
    state_map<unsigned> seen;
704

705
706
    if (prefix.empty())
        l = &cycle;
707
    else
708
        l = &prefix;
709

710
    twa_run::steps::const_iterator i = l->begin();
711
712

    assert(s->compare(i->s) == 0);
713
    src = res->new_state();
714
    seen.emplace(i->s, src);
715

716
    for (; i != l->end();)
717
718
719
      {
        // expected outgoing transition
        bdd label = i->label;
720
        acc_cond::mark_t acc = i->acc;
721
722
723
724
725
726
727
728
729
730

        // compute the next expected state
        const state* next;
        ++i;
        if (i != l->end())
          {
            next = i->s;
          }
        else
          {
731
            if (l == &prefix)
732
              {
733
                l = &cycle;
734
735
736
737
738
                i = l->begin();
              }
            next = l->begin()->s;
          }

739
        // browse the actual outgoing transitions and
740
741
742
        // look for next;
        const state* the_next = nullptr;
        for (auto j: aut->succ(s))
743
          {
744
745
            if (j->cond() != label
                || j->acc() != acc)
746
747
              continue;

748
            const state* s2 = j->dst();
749
            if (s2->compare(next) == 0)
750
              {
751
752
753
754
                the_next = s2;
                break;
              }
            s2->destroy();
755
          }
756
757
        assert(res);
        s->destroy();
758
        s = the_next;
759
760


761
762
763
764
        auto p = seen.emplace(next, 0);
        if (p.second)
          p.first->second = res->new_state();
        dst = p.first->second;
765

766
767
        res->new_edge(src, dst, label, acc);
        src = dst;
768
769

        // Sum acceptance conditions.
770
        if (l == &cycle && i != l->begin())
771
          seen_acc |= acc;
772
      }
773

774
    s->destroy();
775

776
    assert(aut->acc().accepting(seen_acc));
777
778
779
    return res;
  }

780
}