ltsmin.cc 32.9 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
// Copyright (C) 2011, 2012, 2014, 2015, 2016 Laboratoire de Recherche et
3
// Développement 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
#include <ltdl.h>
#include <cstring>
#include <cstdlib>
#include <vector>
24
#include <sstream>
25
26
#include <sys/stat.h>
#include <unistd.h>
27

28
29
30
31
32
// MinGW does not define this.
#ifndef WEXITSTATUS
# define WEXITSTATUS(x) ((x) & 0xff)
#endif

33
#include <spot/ltsmin/ltsmin.hh>
34
35
36
37
38
#include <spot/misc/hashfunc.hh>
#include <spot/misc/fixpool.hh>
#include <spot/misc/mspool.hh>
#include <spot/misc/intvcomp.hh>
#include <spot/misc/intvcmp2.hh>
39
40
41

namespace spot
{
42
43
  namespace
  {
44
45

    ////////////////////////////////////////////////////////////////////////
46
    // spins interface
47
48
49
50
51
52
53

    typedef struct transition_info {
      int* labels; // edge labels, NULL, or pointer to the edge label(s)
      int  group;  // holds transition group or -1 if unknown
    } transition_info_t;

    typedef void (*TransitionCB)(void *ctx,
54
55
                                 transition_info_t *transition_info,
                                 int *dst);
56
  }
57

58
59
  struct spins_interface
  {
60
    lt_dlhandle handle;        // handle to the dynamic library
61
62
63
64
65
66
67
68
69
70
71
72
    void (*get_initial_state)(void *to);
    int (*have_property)();
    int (*get_successors)(void* m, int *in, TransitionCB, void *arg);
    int (*get_state_size)();
    const char* (*get_state_variable_name)(int var);
    int (*get_state_variable_type)(int var);
    int (*get_type_count)();
    const char* (*get_type_name)(int type);
    int (*get_type_value_count)(int type);
    const char* (*get_type_value_name)(int type, int value);

    ~spins_interface()
73
    {
74
      if (handle)
75
        lt_dlclose(handle);
76
77
78
79
80
81
82
      lt_dlexit();
    }
  };

  namespace
  {
    typedef std::shared_ptr<const spins_interface> spins_interface_ptr;
83
84
85
86

    ////////////////////////////////////////////////////////////////////////
    // STATE

87
    struct spins_state final: public state
88
    {
89
      spins_state(int s, fixed_size_pool* p)
90
        : pool(p), size(s), count(1)
91
92
93
94
95
      {
      }

      void compute_hash()
      {
96
97
98
        hash_value = 0;
        for (int i = 0; i < size; ++i)
          hash_value = wang32_hash(hash_value ^ vars[i]);
99
100
      }

101
      spins_state* clone() const override
102
      {
103
104
        ++count;
        return const_cast<spins_state*>(this);
105
106
      }

107
      void destroy() const override
108
      {
109
110
111
        if (--count)
          return;
        pool->deallocate(this);
112
113
      }

114
      size_t hash() const override
115
      {
116
        return hash_value;
117
118
      }

119
      int compare(const state* other) const override
120
      {
121
122
123
124
125
126
127
128
129
        if (this == other)
          return 0;
        const spins_state* o = down_cast<const spins_state*>(other);
        assert(o);
        if (hash_value < o->hash_value)
          return -1;
        if (hash_value > o->hash_value)
          return 1;
        return memcmp(vars, o->vars, size * sizeof(*vars));
130
131
132
133
      }

    private:

134
      ~spins_state()
135
136
137
      {
      }

138
139
    public:
      fixed_size_pool* pool;
140
141
142
      size_t hash_value: 32;
      int size: 16;
      mutable unsigned count: 16;
143
      int vars[0];
144
145
    };

146
    struct spins_compressed_state final: public state
147
    {
148
      spins_compressed_state(int s, multiple_size_pool* p)
149
        : pool(p), size(s), count(1)
150
151
152
153
154
      {
      }

      void compute_hash()
      {
155
156
157
        hash_value = 0;
        for (int i = 0; i < size; ++i)
          hash_value = wang32_hash(hash_value ^ vars[i]);
158
159
      }

160
      spins_compressed_state* clone() const override
161
      {
162
163
        ++count;
        return const_cast<spins_compressed_state*>(this);
164
165
      }

166
      void destroy() const override
167
      {
168
169
170
        if (--count)
          return;
        pool->deallocate(this, sizeof(*this) + size * sizeof(*vars));
171
172
      }

173
      size_t hash() const override
174
      {
175
        return hash_value;
176
177
      }

178
      int compare(const state* other) const override
179
      {
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
        if (this == other)
          return 0;
        const spins_compressed_state* o =
          down_cast<const spins_compressed_state*>(other);
        assert(o);
        if (hash_value < o->hash_value)
          return -1;
        if (hash_value > o->hash_value)
          return 1;

        if (size < o->size)
          return -1;
        if (size > o->size)
          return 1;

        return memcmp(vars, o->vars, size * sizeof(*vars));
196
197
198
199
      }

    private:

200
      ~spins_compressed_state()
201
202
203
204
      {
      }

    public:
205
      multiple_size_pool* pool;
206
207
208
      size_t hash_value: 32;
      int size: 16;
      mutable unsigned count: 16;
209
      int vars[0];
210
211
    };

212
213
214
215
216
    ////////////////////////////////////////////////////////////////////////
    // CALLBACK FUNCTION for transitions.

    struct callback_context
    {
217
      typedef std::list<state*> transitions_t;
218
219
      transitions_t transitions;
      int state_size;
220
221
      void* pool;
      int* compressed;
222
      void (*compress)(const int*, size_t, int*, size_t&);
223
224
225

      ~callback_context()
      {
226
227
        for (auto t: transitions)
          t->destroy();
228
      }
229
230
231
232
233
    };

    void transition_callback(void* arg, transition_info_t*, int *dst)
    {
      callback_context* ctx = static_cast<callback_context*>(arg);
234
      fixed_size_pool* p = static_cast<fixed_size_pool*>(ctx->pool);
235
      spins_state* out =
236
        new(p->allocate()) spins_state(ctx->state_size, p);
237
238
239
240
241
      memcpy(out->vars, dst, ctx->state_size * sizeof(int));
      out->compute_hash();
      ctx->transitions.push_back(out);
    }

242
243
244
    void transition_callback_compress(void* arg, transition_info_t*, int *dst)
    {
      callback_context* ctx = static_cast<callback_context*>(arg);
245
246
247
      multiple_size_pool* p = static_cast<multiple_size_pool*>(ctx->pool);

      size_t csize = ctx->state_size * 2;
248
      ctx->compress(dst, ctx->state_size, ctx->compressed, csize);
249

250
      void* mem = p->allocate(sizeof(spins_compressed_state)
251
                              + sizeof(int) * csize);
252
      spins_compressed_state* out = new(mem) spins_compressed_state(csize, p);
253
      memcpy(out->vars, ctx->compressed, csize * sizeof(int));
254
255
256
257
      out->compute_hash();
      ctx->transitions.push_back(out);
    }

258
259
260
    ////////////////////////////////////////////////////////////////////////
    // SUCC_ITERATOR

261
    class spins_succ_iterator final: public kripke_succ_iterator
262
263
264
    {
    public:

265
      spins_succ_iterator(const callback_context* cc,
266
267
                         bdd cond)
        : kripke_succ_iterator(cond), cc_(cc)
268
269
270
      {
      }

271
272
      void recycle(const callback_context* cc, bdd cond)
      {
273
274
275
        delete cc_;
        cc_ = cc;
        kripke_succ_iterator::recycle(cond);
276
277
      }

278
      ~spins_succ_iterator()
279
      {
280
        delete cc_;
281
282
      }

283
      virtual bool first() override
284
      {
285
286
        it_ = cc_->transitions.begin();
        return it_ != cc_->transitions.end();
287
288
      }

289
      virtual bool next() override
290
      {
291
292
        ++it_;
        return it_ != cc_->transitions.end();
293
294
      }

295
      virtual bool done() const override
296
      {
297
        return it_ == cc_->transitions.end();
298
299
      }

300
      virtual state* dst() const override
301
      {
302
        return (*it_)->clone();
303
304
305
306
307
308
309
      }

    private:
      const callback_context* cc_;
      callback_context::transitions_t::const_iterator it_;
    };

310
311
312
313
314
315
316
317
318
319
320
    ////////////////////////////////////////////////////////////////////////
    // PREDICATE EVALUATION

    typedef enum { OP_EQ, OP_NE, OP_LT, OP_GT, OP_LE, OP_GE } relop;

    struct one_prop
    {
      int var_num;
      relop op;
      int val;
      int bddvar;  // if "var_num op val" is true, output bddvar,
321
                   // else its negation
322
323
324
    };
    typedef std::vector<one_prop> prop_set;

325
326
327
328
329
330
331
332

    struct var_info
    {
      int num;
      int type;
    };


333
    void
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
334
    convert_aps(const atomic_prop_set* aps,
335
336
337
338
                spins_interface_ptr d,
                bdd_dict_ptr dict,
                formula dead,
                prop_set& out)
339
340
    {
      int errors = 0;
341
      std::ostringstream err;
342

343
      int state_size = d->get_state_size();
344
345
346
      typedef std::map<std::string, var_info> val_map_t;
      val_map_t val_map;

347
      for (int i = 0; i < state_size; ++i)
348
349
350
351
352
353
        {
          const char* name = d->get_state_variable_name(i);
          int type = d->get_state_variable_type(i);
          var_info v = { i , type };
          val_map[name] = v;
        }
354

355
      int type_count = d->get_type_count();
356
357
358
      typedef std::map<std::string, int> enum_map_t;
      std::vector<enum_map_t> enum_map(type_count);
      for (int i = 0; i < type_count; ++i)
359
360
361
362
363
        {
          int enum_count = d->get_type_value_count(i);
          for (int j = 0; j < enum_count; ++j)
            enum_map[i].emplace(d->get_type_value_name(i, j), j);
        }
364

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
365
      for (atomic_prop_set::const_iterator ap = aps->begin();
366
367
368
369
370
371
372
373
374
375
376
377
378
379
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
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
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
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
           ap != aps->end(); ++ap)
        {
          if (*ap == dead)
            continue;

          const std::string& str = ap->ap_name();
          const char* s = str.c_str();

          // Skip any leading blank.
          while (*s && (*s == ' ' || *s == '\t'))
            ++s;
          if (!*s)
            {
              err << "Proposition `" << str << "' cannot be parsed.\n";
              ++errors;
              continue;
            }


          char* name = (char*) malloc(str.size() + 1);
          char* name_p = name;
          char* lastdot = nullptr;
          while (*s && (*s != '=') && *s != '<' && *s != '!'  && *s != '>')
            {

              if (*s == ' ' || *s == '\t')
                ++s;
              else
                {
                  if (*s == '.')
                    lastdot = name_p;
                  *name_p++ = *s++;
                }
            }
          *name_p = 0;

          if (name == name_p)
            {
              err << "Proposition `" << str << "' cannot be parsed.\n";
              free(name);
              ++errors;
              continue;
            }

          // Lookup the name
          val_map_t::const_iterator ni = val_map.find(name);
          if (ni == val_map.end())
            {
              // We may have a name such as X.Y.Z
              // If it is not a known variable, it might mean
              // an enumerated variable X.Y with value Z.
              if (lastdot)
                {
                  *lastdot++ = 0;
                  ni = val_map.find(name);
                }

              if (ni == val_map.end())
                {
                  err << "No variable `" << name
                      << "' found in model (for proposition `"
                      << str << "').\n";
                  free(name);
                  ++errors;
                  continue;
                }

              // We have found the enumerated variable, and lastdot is
              // pointing to its expected value.
              int type_num = ni->second.type;
              enum_map_t::const_iterator ei = enum_map[type_num].find(lastdot);
              if (ei == enum_map[type_num].end())
                {
                  err << "No state `" << lastdot << "' known for variable `"
                      << name << "'.\n";
                  err << "Possible states are:";
                  for (auto& ej: enum_map[type_num])
                    err << ' ' << ej.first;
                  err << '\n';

                  free(name);
                  ++errors;
                  continue;
                }

              // At this point, *s should be 0.
              if (*s)
                {
                  err << "Trailing garbage `" << s
                      << "' at end of proposition `"
                      << str << "'.\n";
                  free(name);
                  ++errors;
                  continue;
                }

              // Record that X.Y must be equal to Z.
              int v = dict->register_proposition(*ap, d.get());
              one_prop p = { ni->second.num, OP_EQ, ei->second, v };
              out.push_back(p);
              free(name);
              continue;
            }

          int var_num = ni->second.num;

          if (!*s)                // No operator?  Assume "!= 0".
            {
              int v = dict->register_proposition(*ap, d);
              one_prop p = { var_num, OP_NE, 0, v };
              out.push_back(p);
              free(name);
              continue;
            }

          relop op;

          switch (*s)
            {
            case '!':
              if (s[1] != '=')
                goto report_error;
              op = OP_NE;
              s += 2;
              break;
            case '=':
              if (s[1] != '=')
                goto report_error;
              op = OP_EQ;
              s += 2;
              break;
            case '<':
              if (s[1] == '=')
                {
                  op = OP_LE;
                  s += 2;
                }
              else
                {
                  op = OP_LT;
                  ++s;
                }
              break;
            case '>':
              if (s[1] == '=')
                {
                  op = OP_GE;
                  s += 2;
                }
              else
                {
                  op = OP_GT;
                  ++s;
                }
              break;
            default:
            report_error:
              err << "Unexpected `" << s
                  << "' while parsing atomic proposition `" << str
                  << "'.\n";
              ++errors;
              free(name);
              continue;
            }

          while (*s && (*s == ' ' || *s == '\t'))
            ++s;

          int val = 0; // Initialize to kill a warning from old compilers.
          int type_num = ni->second.type;
          if (type_num == 0 || (*s >= '0' && *s <= '9') || *s == '-')
            {
              char* s_end;
              val = strtol(s, &s_end, 10);
              if (s == s_end)
                {
                  err << "Failed to parse `" << s << "' as an integer.\n";
                  ++errors;
                  free(name);
                  continue;
                }
              s = s_end;
            }
          else
            {
              // We are in a case such as P_0 == S, trying to convert
              // the string S into an integer.
              const char* end = s;
              while (*end && *end != ' ' && *end != '\t')
                ++end;
              std::string st(s, end);

              // Lookup the string.
              enum_map_t::const_iterator ei = enum_map[type_num].find(st);
              if (ei == enum_map[type_num].end())
                {
                  err << "No state `" << st << "' known for variable `"
                      << name << "'.\n";
                  err << "Possible states are:";
                  for (ei = enum_map[type_num].begin();
                       ei != enum_map[type_num].end(); ++ei)
                    err << ' ' << ei->first;
                  err << '\n';

                  free(name);
                  ++errors;
                  continue;
                }
              s = end;
              val = ei->second;
            }

          free(name);

          while (*s && (*s == ' ' || *s == '\t'))
            ++s;
          if (*s)
            {
              err << "Unexpected `" << s
                  << "' while parsing atomic proposition `" << str
                  << "'.\n";
              ++errors;
              continue;
            }


          int v = dict->register_proposition(*ap, d);
          one_prop p = { var_num, op, val, v };
          out.push_back(p);
        }
596

597
      if (errors)
598
        throw std::runtime_error(err.str());
599
600
    }

601
602
603
    ////////////////////////////////////////////////////////////////////////
    // KRIPKE

604
    class spins_kripke final: public kripke
605
606
607
    {
    public:

608
      spins_kripke(spins_interface_ptr d, const bdd_dict_ptr& dict,
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
                   const spot::prop_set* ps, formula dead,
                   int compress)
        : kripke(dict),
          d_(d),
          state_size_(d_->get_state_size()),
          ps_(ps),
          compress_(compress == 0 ? nullptr
                    : compress == 1 ? int_array_array_compress
                    : int_array_array_compress2),
          decompress_(compress == 0 ? nullptr
                      : compress == 1 ? int_array_array_decompress
                      : int_array_array_decompress2),
          uncompressed_(compress ? new int[state_size_ + 30] : nullptr),
          compressed_(compress ? new int[state_size_ * 2] : nullptr),
          statepool_(compress ? sizeof(spins_compressed_state) :
                     (sizeof(spins_state) + state_size_ * sizeof(int))),
          state_condition_last_state_(nullptr),
          state_condition_last_cc_(nullptr)
627
      {
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
        vname_ = new const char*[state_size_];
        format_filter_ = new bool[state_size_];
        for (int i = 0; i < state_size_; ++i)
          {
            vname_[i] = d_->get_state_variable_name(i);
            // We don't want to print variables that can take a single
            // value (e.g. process with a single state) to shorten the
            // output.
            int type = d->get_state_variable_type(i);
            format_filter_[i] =
              (d->get_type_value_count(type) != 1);
          }

        // Register the "dead" proposition.  There are three cases to
        // consider:
        //  * If DEAD is "false", it means we are not interested in finite
        //    sequences of the system.
        //  * If DEAD is "true", we want to check finite sequences as well
        //    as infinite sequences, but do not need to distinguish them.
        //  * If DEAD is any other string, this is the name a property
        //    that should be true when looping on a dead state, and false
        //    otherwise.
        // We handle these three cases by setting ALIVE_PROP and DEAD_PROP
        // appropriately.  ALIVE_PROP is the bdd that should be ANDed
        // to all transitions leaving a live state, while DEAD_PROP should
        // be ANDed to all transitions leaving a dead state.
        if (dead.is_ff())
          {
            alive_prop = bddtrue;
            dead_prop = bddfalse;
          }
        else if (dead.is_tt())
          {
            alive_prop = bddtrue;
            dead_prop = bddtrue;
          }
        else
          {
            int var = dict->register_proposition(dead, d_);
            dead_prop = bdd_ithvar(var);
            alive_prop = bdd_nithvar(var);
          }
670
671
      }

672
      ~spins_kripke()
673
      {
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
        if (iter_cache_)
          {
            delete iter_cache_;
            iter_cache_ = nullptr;
          }
        delete[] format_filter_;
        delete[] vname_;
        if (compress_)
          {
            delete[] uncompressed_;
            delete[] compressed_;
          }
        dict_->unregister_all_my_variables(d_.get());

        delete ps_;

        if (state_condition_last_state_)
          state_condition_last_state_->destroy();
        delete state_condition_last_cc_; // Might be 0 already.
693
694
      }

695
      virtual state* get_init_state() const override
696
      {
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
        if (compress_)
          {
            d_->get_initial_state(uncompressed_);
            size_t csize = state_size_ * 2;
            compress_(uncompressed_, state_size_, compressed_, csize);

            multiple_size_pool* p =
              const_cast<multiple_size_pool*>(&compstatepool_);
            void* mem = p->allocate(sizeof(spins_compressed_state)
                                    + sizeof(int) * csize);
            spins_compressed_state* res = new(mem)
              spins_compressed_state(csize, p);
            memcpy(res->vars, compressed_, csize * sizeof(int));
            res->compute_hash();
            return res;
          }
        else
          {
            fixed_size_pool* p = const_cast<fixed_size_pool*>(&statepool_);
            spins_state* res = new(p->allocate()) spins_state(state_size_, p);
            d_->get_initial_state(res->vars);
            res->compute_hash();
            return res;
          }
721
722
      }

723
      bdd
724
      compute_state_condition_aux(const int* vars) const
725
      {
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
        bdd res = bddtrue;
        for (auto& i: *ps_)
          {
            int l = vars[i.var_num];
            int r = i.val;

            bool cond = false;
            switch (i.op)
              {
              case OP_EQ:
                cond = (l == r);
                break;
              case OP_NE:
                cond = (l != r);
                break;
              case OP_LT:
                cond = (l < r);
                break;
              case OP_GT:
                cond = (l > r);
                break;
              case OP_LE:
                cond = (l <= r);
                break;
              case OP_GE:
                cond = (l >= r);
                break;
              }

            if (cond)
              res &= bdd_ithvar(i.bddvar);
            else
              res &= bdd_nithvar(i.bddvar);
          }
        return res;
761
762
      }

763
764
      callback_context* build_cc(const int* vars, int& t) const
      {
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
        callback_context* cc = new callback_context;
        cc->state_size = state_size_;
        cc->pool =
          const_cast<void*>(compress_
                            ? static_cast<const void*>(&compstatepool_)
                            : static_cast<const void*>(&statepool_));
        cc->compress = compress_;
        cc->compressed = compressed_;
        t = d_->get_successors(nullptr, const_cast<int*>(vars),
                               compress_
                               ? transition_callback_compress
                               : transition_callback,
                               cc);
        assert((unsigned)t == cc->transitions.size());
        return cc;
780
781
      }

782
783
784
      bdd
      compute_state_condition(const state* st) const
      {
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
        // If we just computed it, don't do it twice.
        if (st == state_condition_last_state_)
          return state_condition_last_cond_;

        if (state_condition_last_state_)
          {
            state_condition_last_state_->destroy();
            delete state_condition_last_cc_; // Might be 0 already.
            state_condition_last_cc_ = nullptr;
          }

        const int* vars = get_vars(st);

        bdd res = compute_state_condition_aux(vars);
        int t;
        callback_context* cc = build_cc(vars, t);

        if (t)
          {
            res &= alive_prop;
          }
        else
          {
            res &= dead_prop;

            // Add a self-loop to dead-states if we care about these.
            if (res != bddfalse)
              cc->transitions.push_back(st->clone());
          }

        state_condition_last_cc_ = cc;
        state_condition_last_cond_ = res;
        state_condition_last_state_ = st->clone();

        return res;
820
821
      }

822
823
824
      const int*
      get_vars(const state* st) const
      {
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
        const int* vars;
        if (compress_)
          {
            const spins_compressed_state* s =
              down_cast<const spins_compressed_state*>(st);
            assert(s);

            decompress_(s->vars, s->size, uncompressed_, state_size_);
            vars = uncompressed_;
          }
        else
          {
            const spins_state* s = down_cast<const spins_state*>(st);
            assert(s);
            vars = s->vars;
          }
        return vars;
842
843
844
      }


845
      virtual
846
      spins_succ_iterator* succ_iter(const state* st) const override
847
      {
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
        // This may also compute successors in state_condition_last_cc
        bdd scond = compute_state_condition(st);

        callback_context* cc;
        if (state_condition_last_cc_)
          {
            cc = state_condition_last_cc_;
            state_condition_last_cc_ = nullptr; // Now owned by the iterator.
          }
        else
          {
            int t;
            cc = build_cc(get_vars(st), t);

            // Add a self-loop to dead-states if we care about these.
            if (t == 0 && scond != bddfalse)
              cc->transitions.push_back(st->clone());
          }

        if (iter_cache_)
          {
            spins_succ_iterator* it =
              down_cast<spins_succ_iterator*>(iter_cache_);
            it->recycle(cc, scond);
            iter_cache_ = nullptr;
            return it;
          }
        return new spins_succ_iterator(cc, scond);
876
877
878
      }

      virtual
879
      bdd state_condition(const state* st) const override
880
      {
881
        return compute_state_condition(st);
882
883
884
      }

      virtual
885
      std::string format_state(const state *st) const override
886
      {
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
        const int* vars = get_vars(st);

        std::stringstream res;

        if (state_size_ == 0)
          return "empty state";

        int i = 0;
        for (;;)
          {
            if (!format_filter_[i])
              {
                ++i;
                if (i == state_size_)
                  break;
                continue;
              }
            res << vname_[i] << '=' << vars[i];
            ++i;
            if (i == state_size_)
              break;
            res << ", ";
          }
        return res.str();
911
912
913
      }

    private:
914
      spins_interface_ptr d_;
915
      int state_size_;
916
      const char** vname_;
917
      bool* format_filter_;
918
      const spot::prop_set* ps_;
919
920
      bdd alive_prop;
      bdd dead_prop;
921
922
      void (*compress_)(const int*, size_t, int*, size_t&);
      void (*decompress_)(const int*, size_t, int*, size_t);
923
      int* uncompressed_;
924
      int* compressed_;
925
      fixed_size_pool statepool_;
926
      multiple_size_pool compstatepool_;
927

928
929
930
931
932
      // This cache is used to speedup repeated calls to state_condition()
      // and get_succ().
      // If state_condition_last_state_ != 0, then state_condition_last_cond_
      // contain its (recently computed) condition.  If additionally
      // state_condition_last_cc_ != 0, then it contains the successors.
933
      mutable const state* state_condition_last_state_;
934
935
      mutable bdd state_condition_last_cond_;
      mutable callback_context* state_condition_last_cc_;
936
937
938
    };


939
940
    //////////////////////////////////////////////////////////////////////////
    // LOADER
941
942


943
944
    // Call spins to compile "foo.prom" as "foo.prom.spins" if the latter
    // does not exist already or is older.
945
    static void
946
    compile_model(std::string& filename, const std::string& ext)
947
948
949
    {
      std::string command;
      std::string compiled_ext;
950

951
      if (ext == ".prom" || ext == ".pm" || ext == ".pml")
952
953
954
955
        {
          command = "spins " + filename;
          compiled_ext = ".spins";
        }
956
      else if (ext == ".dve")
957
958
959
960
        {
          command = "divine compile --ltsmin " + filename;
          compiled_ext = "2C";
        }
961
      else
962
963
964
965
966
        {
          throw std::runtime_error(std::string("Unknown extension '")
                                   + ext + "'.  Use '.prom', '.pm', '.pml', "
                                   "'.dve', '.dve2C', or '.prom.spins'.");
        }
967

968
969
      struct stat s;
      if (stat(filename.c_str(), &s) != 0)
970
        throw std::runtime_error(std::string("Cannot open ") + filename);
971

972
      filename += compiled_ext;
973

974
975
976
977
      // Remove any directory, because the new file will
      // be compiled in the current directory.
      size_t pos = filename.find_last_of("/\\");
      if (pos != std::string::npos)
978
        filename = "./" + filename.substr(pos + 1);
979

980
981
      struct stat d;
      if (stat(filename.c_str(), &d) == 0)
982
983
984
        if (s.st_mtime < d.st_mtime)
          // The .spins or .dve2C is up-to-date, no need to recompile it.
          return;
985

986
987
      int res = system(command.c_str());
      if (res)
988
989
990
        throw std::runtime_error(std::string("Execution of '")
                                 + command.c_str() + "' returned exit code "
                                 + std::to_string(WEXITSTATUS(res)));
991
    }
992
993
994

  }

995
996
  ltsmin_model
  ltsmin_model::load(const std::string& file_arg)
997
  {
998
999
1000
1001
1002
1003
    std::string file;
    if (file_arg.find_first_of("/\\") != std::string::npos)
      file = file_arg;
    else
      file = "./" + file_arg;

1004
    std::string ext = file.substr(file.find_last_of("."));
1005
    if (ext != ".spins" && ext != ".dve2C")
1006
      compile_model(file, ext);
1007

1008
    if (lt_dlinit())
1009
      throw std::runtime_error("Failed to initialize libltldl.");
1010
1011
1012
1013

    lt_dlhandle h = lt_dlopen(file.c_str());
    if (!h)
      {
1014
1015
1016
        lt_dlexit();
        throw std::runtime_error(std::string("Failed to load '")
                                 + file + "'.");
1017
1018
      }

1019
    auto d = std::make_shared<spins_interface>();
1020
1021
    d->handle = h;

1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
    // SpinS interface.
    if ((d->get_initial_state = (void (*)(void*))
        lt_dlsym(h, "spins_get_initial_state")))
      {
        d->have_property = nullptr;
        d->get_successors = (int (*)(void*, int*, TransitionCB, void*))
        lt_dlsym(h, "spins_get_successor_all");
        d->get_state_size = (int (*)())
        lt_dlsym(h, "spins_get_state_size");
        d->get_state_variable_name = (const char* (*)(int))
        lt_dlsym(h, "spins_get_state_variable_name");
        d->get_state_variable_type = (int (*)(int))
        lt_dlsym(h, "spins_get_state_variable_type");
        d->get_type_count = (int (*)())
        lt_dlsym(h, "spins_get_type_count");
        d->get_type_name = (const char* (*)(int))
        lt_dlsym(h, "spins_get_type_name");
        d->get_type_value_count = (int (*)(int))
        lt_dlsym(h, "spins_get_type_value_count");
        d->get_type_value_name = (const char* (*)(int, int))
        lt_dlsym(h, "spins_get_type_value_name");
      }
    // dve2 interface.
    else
      {
        d->get_initial_state = (void (*)(void*))
        lt_dlsym(h, "get_initial_state");
        d->have_property = (int (*)())
        lt_dlsym(h, "have_property");
        d->get_successors = (int (*)(void*, int*, TransitionCB, void*))
        lt_dlsym(h, "get_successors");
        d->get_state_size = (int (*)())
        lt_dlsym(h, "get_state_variable_count");
        d->get_state_variable_name = (const char* (*)(int))
        lt_dlsym(h, "get_state_variable_name");
        d->get_state_variable_type = (int (*)(int))
        lt_dlsym(h, "get_state_variable_type");
        d->get_type_count = (int (*)())
        lt_dlsym(h, "get_state_variable_type_count");
        d->get_type_name = (const char* (*)(int))
        lt_dlsym(h, "get_state_variable_type_name");
        d->get_type_value_count = (int (*)(int))
        lt_dlsym(h, "get_state_variable_type_value_count");
        d->get_type_value_name = (const char* (*)(int, int))
        lt_dlsym(h, "get_state_variable_type_value");
      }

1069
    if (!(d->get_initial_state
1070
1071
1072
1073
1074
1075
1076
1077
          && d->get_successors
          && d->get_state_size
          && d->get_state_variable_name
          && d->get_state_variable_type
          && d->get_type_count
          && d->get_type_name
          && d->get_type_value_count
          && d->get_type_value_name))
1078
      throw std::runtime_error(std::string("Failed resolve some symbol"
1079
                                           "while loading '") + file + "'.");
1080

1081
    if (d->have_property && d->have_property())
1082
      throw std::runtime_error("Models with embedded properties "
1083
                               "are not supported.");
1084

1085
1086
1087
1088
1089
1090
    return { d };
  }


  kripke_ptr
  ltsmin_model::kripke(const atomic_prop_set* to_observe,
1091
1092
                       bdd_dict_ptr dict,
                       const formula dead, int compress) const
1093
  {
1094
    spot::prop_set* ps = new spot::prop_set;
1095
1096
    try
      {
1097
        convert_aps(to_observe, iface, dict, dead, *ps);
1098
1099
      }
    catch (std::runtime_error)
1100
      {
1101
1102
1103
        delete ps;
        dict->unregister_all_my_variables(iface.get());
        throw;
1104
      }
1105
1106
1107
1108
1109
1110
1111
    auto res = std::make_shared<spins_kripke>(iface, dict, ps, dead, compress);
    // All atomic propositions have been registered to the bdd_dict
    // for iface, but we also need to add them to the automaton so
    // twa::ap() works.
    for (auto ap: *to_observe)
      res->register_ap(ap);
    return res;
1112
1113
1114
1115
  }

  ltsmin_model::~ltsmin_model()
  {
1116
  }
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153


  int ltsmin_model::state_size() const
  {
    return iface->get_state_size();
  }

  const char* ltsmin_model::state_variable_name(int var) const
  {
    return iface->get_state_variable_name(var);
  }

  int ltsmin_model::state_variable_type(int var) const
  {
    return iface->get_state_variable_type(var);
  }

  int ltsmin_model::type_count() const
  {
    return iface->get_type_count();
  }

  const char* ltsmin_model::type_name(int type) const
  {
    return iface->get_type_name(type);
  }

  int ltsmin_model::type_value_count(int type)
  {
    return iface->get_type_value_count(type);
  }

  const char* ltsmin_model::type_value_name(int type, int val)
  {
    return iface->get_type_value_name(type, val);
  }

1154
}