dtgbasat.cc 24.2 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// -*- coding: utf-8 -*-
// Copyright (C) 2013 Laboratoire de Recherche et Développement
// de l'Epita.
//
// 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
// the Free Software Foundation; either version 3 of the License, or
// (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
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

#include <iostream>
#include <fstream>
#include <sstream>
#include "dtgbasat.hh"
#include "reachiter.hh"
#include <map>
#include <utility>
#include "scc.hh"
#include "tgba/bddprint.hh"
#include "ltlast/constant.hh"
#include "stats.hh"
#include "ltlenv/defaultenv.hh"
#include "misc/tmpfile.hh"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
33
#include "misc/satsolver.hh"
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299

// If the following DEBUG macro is set to 1, the temporary files used
// to communicate with the SAT-solver will be left in the current
// directory.  (The files dtgba-sat.cnf and dtgba-sat.out contain the
// input and output for the last successful minimization attempted, or
// for the only failed attempt if the minimization failed.)
//
// Additionally, the CNF file will be output with a comment before
// each clause, and an additional output file (dtgba-sat.dbg) will be
// created with a list of all positive variables in the result and
// their meaning.
//
// Note that the code use unique temporary filenames, so it is safe to
// run several such minimizations in parallel.  It only when DEBUG=1
// that some of these files will be renamed to the above hard-coded
// names, possibly causing confusion if multiple minimizations are
// debugged in parallel and in the same directory.

#define DEBUG 0
#if DEBUG
#define dout out << "c "
#else
#define dout while (0) out
#endif


namespace spot
{
  namespace
  {

    static bdd_dict* debug_dict = 0;

    struct transition
    {
      int src;
      bdd cond;
      int dst;

      transition(int src, bdd cond, int dst)
	: src(src), cond(cond), dst(dst)
      {
      }

      bool operator<(const transition& other) const
      {
	if (this->src < other.src)
	  return true;
	if (this->src > other.src)
	  return false;
	if (this->dst < other.dst)
	  return true;
	if (this->dst > other.dst)
	  return false;
	return this->cond.id() < other.cond.id();
      }

      bool operator==(const transition& other) const
      {
	return (this->src == other.src
		&& this->dst == other.dst
		&& this->cond.id() == other.cond.id());
      }
    };

    struct transition_acc
    {
      int src;
      bdd cond;
      bdd acc;
      int dst;

      transition_acc(int src, bdd cond, bdd acc, int dst)
	: src(src), cond(cond), acc(acc), dst(dst)
      {
      }

      bool operator<(const transition_acc& other) const
      {
	if (this->src < other.src)
	  return true;
	if (this->src > other.src)
	  return false;
	if (this->dst < other.dst)
	  return true;
	if (this->dst > other.dst)
	  return false;
	if (this->cond.id() < other.cond.id())
	  return true;
	if (this->cond.id() > other.cond.id())
	  return false;
	return this->acc.id() < other.acc.id();
      }

      bool operator==(const transition_acc& other) const
      {
	return (this->src == other.src
		&& this->dst == other.dst
		&& this->cond.id() == other.cond.id()
		&& this->acc.id() == other.acc.id());
      }
    };

    struct state_pair
    {
      int a;
      int b;

      state_pair(int a, int b)
	: a(a), b(b)
      {
      }

      bool operator<(const state_pair& other) const
      {
	if (this->a < other.a)
	  return true;
	if (this->a > other.a)
	  return false;
	if (this->b < other.b)
	  return true;
	if (this->b > other.b)
	  return false;
	return false;
      }
    };

    struct path
    {
      int src_cand;
      int src_ref;
      int dst_cand;
      int dst_ref;
      bdd acc_cand;
      bdd acc_ref;

      path(int src_cand, int src_ref,
	   int dst_cand, int dst_ref,
	   bdd acc_cand, bdd acc_ref)
	: src_cand(src_cand), src_ref(src_ref),
	  dst_cand(dst_cand), dst_ref(dst_ref),
	  acc_cand(acc_cand), acc_ref(acc_ref)
      {
      }

      bool operator<(const path& other) const
      {
	if (this->src_cand < other.src_cand)
	  return true;
	if (this->src_cand > other.src_cand)
	  return false;
	if (this->src_ref < other.src_ref)
	  return true;
	if (this->src_ref > other.src_ref)
	  return false;
	if (this->dst_cand < other.dst_cand)
	  return true;
	if (this->dst_cand > other.dst_cand)
	  return false;
	if (this->dst_ref < other.dst_ref)
	  return true;
	if (this->dst_ref > other.dst_ref)
	  return false;
	if (this->acc_ref.id() < other.acc_ref.id())
	  return true;
	if (this->acc_ref.id() > other.acc_ref.id())
	  return false;
	if (this->acc_cand.id() < other.acc_cand.id())
	  return true;
	if (this->acc_cand.id() > other.acc_cand.id())
	  return false;

	return false;
      }

    };

    std::ostream& operator<<(std::ostream& os, const state_pair& p)
    {
      os << "<" << p.a << "," << p.b << ">";
      return os;
    }

    std::ostream& operator<<(std::ostream& os, const transition& t)
    {
      os << "<" << t.src << ","
	 << bdd_format_formula(debug_dict, t.cond)
	 << "," << t.dst << ">";
      return os;
    }


    std::ostream& operator<<(std::ostream& os, const transition_acc& t)
    {
      os << "<" << t.src << ","
	 << bdd_format_formula(debug_dict, t.cond) << ","
	 << bdd_format_accset(debug_dict, t.acc)
	 << "," << t.dst << ">";
      return os;
    }

    std::ostream& operator<<(std::ostream& os, const path& p)
    {
      os << "<"
	 << p.src_cand << ","
	 << p.src_ref << ","
	 << p.dst_cand << ","
	 << p.dst_ref << ", "
	 << bdd_format_accset(debug_dict, p.acc_cand) << ", "
	 << bdd_format_accset(debug_dict, p.acc_ref) << ">";
      return os;
    }

    struct dict
    {
      dict(const tgba* a)
	: aut(a)
      {
      }

      const tgba* aut;
      typedef std::map<transition, int> trans_map;
      typedef std::map<transition_acc, int> trans_acc_map;
      trans_map transid;
      trans_acc_map transaccid;
      typedef std::map<int, transition> rev_map;
      typedef std::map<int, transition_acc> rev_acc_map;
      rev_map revtransid;
      rev_acc_map revtransaccid;

      std::map<state_pair, int> prodid;
      std::map<path, int> pathid;
      int nvars;
      typedef Sgi::hash_map<const state*, int,
			    state_ptr_hash, state_ptr_equal> state_map;
      typedef Sgi::hash_map<int, const state*> int_map;
      state_map state_to_int;
      int_map int_to_state;
      int cand_size;
      unsigned int cand_nacc;
      std::vector<bdd> cand_acc; // size cand_nacc

      std::vector<bdd> all_cand_acc;
      std::vector<bdd> all_ref_acc;

      bdd cand_all_acc;
      bdd ref_all_acc;

      ~dict()
      {
	state_map::const_iterator s = state_to_int.begin();
	while (s != state_to_int.end())
	  // Always advance the iterator before deleting the key.
	  s++->first->destroy();

	aut->get_dict()->unregister_all_my_variables(this);
      }
    };


    class filler_dfs: public tgba_reachable_iterator_depth_first
    {
    protected:
      dict& d;
      int size_;
      bdd ap_;
300
      bool state_based_;
301
    public:
302
303
304
      filler_dfs(const tgba* aut, dict& d, bdd ap, bool state_based)
	: tgba_reachable_iterator_depth_first(aut), d(d), ap_(ap),
	  state_based_(state_based)
305
306
307
308
309
310
311
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
361
362
363
364
365
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
      {
	d.nvars = 0;

	bdd_dict* bd = aut->get_dict();
	ltl::default_environment& env = ltl::default_environment::instance();

	d.cand_acc.resize(d.cand_nacc);
	d.all_cand_acc.push_back(bddfalse);

	bdd allneg = bddtrue;
	for (unsigned n = 0; n < d.cand_nacc; ++n)
	  {
	    std::ostringstream s;
	    s << n;
	    const ltl::formula* af = env.require(s.str());
	    int v = bd->register_acceptance_variable(af, &d);
	    af->destroy();
	    d.cand_acc[n] = bdd_ithvar(v);
	    allneg &= bdd_nithvar(v);
	  }
	for (unsigned n = 0; n < d.cand_nacc; ++n)
	  {
	    bdd c = bdd_exist(allneg, d.cand_acc[n]) & d.cand_acc[n];
	    d.cand_acc[n] = c;

	    size_t s = d.all_cand_acc.size();
	    for (size_t i = 0; i < s; ++i)
	      d.all_cand_acc.push_back(d.all_cand_acc[i] | c);
	  }
	d.cand_all_acc = bdd_support(allneg);
	d.ref_all_acc = bdd_support(aut->all_acceptance_conditions());

	bdd refall = d.ref_all_acc;
	bdd refnegall = aut->neg_acceptance_conditions();

	d.all_ref_acc.push_back(bddfalse);
	while (refall != bddtrue)
	  {
	    bdd v = bdd_ithvar(bdd_var(refall));
	    bdd c = bdd_exist(refnegall, v) & v;

	    size_t s = d.all_ref_acc.size();
	    for (size_t i = 0; i < s; ++i)
	      d.all_ref_acc.push_back(d.all_ref_acc[i] | c);

	    refall = bdd_high(refall);
	  }
      }

      int size()
      {
	return size_;
      }

      void end()
      {
	size_ = seen.size();

	if (d.cand_size == -1)
	  d.cand_size = size_ - 1;

	int seen_size = seen.size();
	for (int i = 1; i <= seen_size; ++i)
	  {
	    for (int j = 1; j <= d.cand_size; ++j)
	      {
		d.prodid[state_pair(j, i)] = ++d.nvars;


		for (int k = 1; k <= seen_size; ++k)
		  for (int l = 1; l <= d.cand_size; ++l)
		    {
		      size_t sf = d.all_cand_acc.size();
		      for (size_t f = 0; f < sf; ++f)
			{
			  size_t sfp = d.all_ref_acc.size();
			  for (size_t fp = 0; fp < sfp; ++fp)
			    {
			      path p(j, i, l, k,
				     d.all_cand_acc[f],
				     d.all_ref_acc[fp]);
			      d.pathid[p] = ++d.nvars;
			    }

			}
		    }
	      }
	  }

	for (dict::state_map::const_iterator i = seen.begin();
	     i != seen.end(); ++i)
	  d.int_to_state[i->second] = i->first;

	std::swap(d.state_to_int, seen);

400
401
402
403
	if (!state_based_)
	  {
	    for (int i = 1; i <= d.cand_size; ++i)
	      for (int j = 1; j <= d.cand_size; ++j)
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
		  bdd all = bddtrue;
		  while (all != bddfalse)
		    {
		      bdd one = bdd_satoneset(all, ap_, bddfalse);
		      all -= one;

		      transition t(i, one, j);
		      d.transid[t] = ++d.nvars;
		      d.revtransid.insert(dict::rev_map::
					  value_type(d.nvars, t));

		      // Create the variable for the accepting transition
		      // immediately afterwards.  It helps parsing the
		      // result.
		      for (unsigned n = 0; n < d.cand_nacc; ++n)
			{
			  transition_acc ta(i, one, d.cand_acc[n], j);
			  d.transaccid[ta] = ++d.nvars;
			  d.revtransaccid.insert(dict::rev_acc_map::
						 value_type(d.nvars, ta));
			}
		    }
		}
	  }
	else // state based
	  {
	    for (int i = 1; i <= d.cand_size; ++i)
	      for (unsigned n = 0; n < d.cand_nacc; ++n)
		{
		  ++d.nvars;
		  for (int j = 1; j <= d.cand_size; ++j)
		    {
		      bdd all = bddtrue;
		      while (all != bddfalse)
			{
			  bdd one = bdd_satoneset(all, ap_, bddfalse);
			  all -= one;
442

443
444
445
446
447
448
449
450
451
452
453
454
			  transition_acc ta(i, one, d.cand_acc[n], j);
			  d.transaccid[ta] = d.nvars;
			  d.revtransaccid.insert(dict::rev_acc_map::
						 value_type(d.nvars, ta));
			}
		    }
		}
	    for (int i = 1; i <= d.cand_size; ++i)
	      for (int j = 1; j <= d.cand_size; ++j)
		{
		  bdd all = bddtrue;
		  while (all != bddfalse)
455
		    {
456
457
458
459
460
461
462
		      bdd one = bdd_satoneset(all, ap_, bddfalse);
		      all -= one;

		      transition t(i, one, j);
		      d.transid[t] = ++d.nvars;
		      d.revtransid.insert(dict::rev_map::
					  value_type(d.nvars, t));
463
464
		    }
		}
465
	  }
466
467
468
469
      }
    };

    static
470
471
    void dtgba_to_sat(std::ostream& out, const tgba* ref, dict& d,
		      bool state_based)
472
473
474
475
476
477
478
479
480
481
482
483
484
485
    {
      int nclauses = 0;
      int ref_size = 0;

      scc_map sm(ref);
      sm.build_map();
      bdd ap = sm.aprec_set_of(sm.initial());

#if DEBUG
      debug_dict = ref->get_dict();
#endif

      // Number all the SAT variable we may need.
      {
486
	filler_dfs f(ref, d, ap, state_based);
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
	f.run();
	ref_size = f.size();
      }

      // empty automaton is impossible
      if (d.cand_size == 0)
	{
	  out << "p cnf 1 2\n-1 0\n1 0\n";
	  return;
	}

      // An empty line for the header
      out << "                                                 \n";

      dout << "(8) the candidate automaton is complete\n";
      for (int q1 = 1; q1 <= d.cand_size; ++q1)
	{
	  bdd all = bddtrue;
	  while (all != bddfalse)
	    {
	      bdd s = bdd_satoneset(all, ap, bddfalse);
	      all -= s;

#if DEBUG
	      dout;
	      for (int q2 = 1; q2 <= d.cand_size; q2++)
		{
		  transition t(q1, s, q2);
		  out << t << "δ";
		  if (q2 != d.cand_size)
		    out << " ∨ ";
		}
	      out << "\n";
#endif

	      for (int q2 = 1; q2 <= d.cand_size; q2++)
		{
		  transition t(q1, s, q2);
		  int ti = d.transid[t];

		  out << ti << " ";
		}
	      out << "0\n";
	      ++nclauses;
	    }
	}

      dout << "(9) the initial state is reachable\n";
      dout << state_pair(1, 1) << "\n";
      out << d.prodid[state_pair(1, 1)] << " 0\n";
      ++nclauses;

      for (std::map<state_pair, int>::const_iterator pit = d.prodid.begin();
	   pit != d.prodid.end(); ++pit)
	{
	  int q1 = pit->first.a;
	  int q1p = pit->first.b;

	  dout << "(9) states Cand[" << q1 << "] and Ref[" << q1p
	       << "] are 0-length paths\n";
	  path p(q1, q1p, q1, q1p, bddfalse, bddfalse);
	  dout << pit->first << " → " << p << "\n";
	  out << -pit->second << " " << d.pathid[p] <<" 0\n";
	  ++nclauses;

	  dout << "(10) augmenting paths based on Cand[" << q1
	       << "] and Ref[" << q1p << "]\n";
	  tgba_succ_iterator* it = ref->succ_iter(d.int_to_state[q1p]);
	  for (it->first(); !it->done(); it->next())
	    {
	      const state* dps = it->current_state();
	      int dp = d.state_to_int[dps];
	      dps->destroy();

	      bdd all = it->current_condition();
	      while (all != bddfalse)
		{
		  bdd s = bdd_satoneset(all, ap, bddfalse);
		  all -= s;

		  for (int q2 = 1; q2 <= d.cand_size; q2++)
		    {
		      transition t(q1, s, q2);
		      int ti = d.transid[t];

		      state_pair p2(q2, dp);
		      int succ = d.prodid[p2];

575
576
577
		      if (pit->second == succ)
			continue;

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
618
619
620
621
622
623
624
625
626
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
		      dout << pit->first << " ∧ " << t << "δ → " << p2 << "\n";
		      out << -pit->second << " " << -ti << " "
			  << succ << " 0\n";
		      ++nclauses;
		    }
		}
	    }
	  delete it;
	}

      bdd all_acc = ref->all_acceptance_conditions();

      // construction of constraints (11,12,13)
      for (int q1 = 1; q1 <= d.cand_size; ++q1)
	for (int q1p = 1; q1p <= ref_size; ++q1p)
	  for (int q2 = 1; q2 <= d.cand_size; ++q2)
	    for (int q2p = 1; q2p <= ref_size; ++q2p)
	      {
		size_t sf = d.all_cand_acc.size();
		size_t sfp = d.all_ref_acc.size();
		for (size_t f = 0; f < sf; ++f)
		  for (size_t fp = 0; fp < sfp; ++fp)
		    {
		      path p(q1, q1p, q2, q2p,
			     d.all_cand_acc[f], d.all_ref_acc[fp]);

		      dout << "(11&12&13) paths from " << p << "\n";

		      int pid = d.pathid[p];

		      tgba_succ_iterator* it =
			ref->succ_iter(d.int_to_state[q2p]);

		      for (it->first(); !it->done(); it->next())
			{
			  const state* dps = it->current_state();
			  int dp = d.state_to_int[dps];
			  dps->destroy();

			  for (int q3 = 1; q3 <= d.cand_size; ++q3)
			    {
			      bdd all = it->current_condition();
			      bdd curacc = it->current_acceptance_conditions();

			      while (all != bddfalse)
				{
				  bdd l = bdd_satoneset(all, ap, bddfalse);
				  all -= l;

				  transition t(q2, l, q3);
				  int ti = d.transid[t];

				  if (dp == q1p && q3 == q1) // (11,12) loop
				    {
				      bdd unio =  curacc | d.all_ref_acc[fp];
				      if (unio != all_acc)
					{
#if DEBUG
					  dout << "(11) " << p << " ∧ "
					       << t << "δ → ¬(";

					  bdd all_ = d.all_cand_acc.back();
					  all_ -= d.all_cand_acc[f];
					  bool notfirst = false;
					  while (all_ != bddfalse)
					    {
					      bdd one = bdd_satone(all_);
					      all_ -= one;

					      transition_acc ta(q2, l,
								one, q1);
					      if (notfirst)
						out << " ∧ ";
					      else
						notfirst = true;
					      out << ta << "FC";
					    }
					  out << ")\n";
#endif // DEBUG
					  out << -pid << " " << -ti;

					  // 11
					  bdd all_f = d.all_cand_acc.back();
					  all_f -= d.all_cand_acc[f];
					  while (all_f != bddfalse)
					    {
					      bdd one = bdd_satone(all_f);
					      all_f -= one;

667
668
					      transition_acc ta(q2, l,
								one, q1);
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
					      int tai = d.transaccid[ta];
					      assert(tai != 0);
					      out << " " << -tai;
					    }
					  out << " 0\n";
					  ++nclauses;
					}
				      else
					{
#if DEBUG
					  dout << "(12) " << p << " ∧ "
					       << t << "δ → (";

					  bdd all_ = d.all_cand_acc.back();
					  all_ -= d.all_cand_acc[f];
					  bool notfirst = false;
					  while (all_ != bddfalse)
					    {
					      bdd one = bdd_satone(all_);
					      all_ -= one;

690
691
					      transition_acc ta(q2, l,
								one, q1);
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
					      if (notfirst)
						out << " ∧ ";
					      else
						notfirst = true;
					      out << ta << "FC";
					    }
					  out << ")\n";
#endif // DEBUG
					  // 12
					  bdd all_f = d.all_cand_acc.back();
					  all_f -= d.all_cand_acc[f];
					  while (all_f != bddfalse)
					    {
					      bdd one = bdd_satone(all_f);
					      all_f -= one;

708
709
					      transition_acc ta(q2, l,
								one, q1);
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
					      int tai = d.transaccid[ta];
					      assert(tai != 0);

					      out << -pid << " " << -ti
						  << " " << tai << " 0\n";
					      ++nclauses;
					    }
					  // out << -pid << " " << -ti
					  //     << " " << pcompid << " 0\n";
					  // ++nclauses;
					}
				    }
				  // (13) augmenting paths (always).
				  {
				    size_t sf = d.all_cand_acc.size();
				    for (size_t f = 0; f < sf; ++f)
				      {

					bdd f2 = p.acc_cand |
					  d.all_cand_acc[f];
					bdd f2p = p.acc_ref | curacc;

					path p2(p.src_cand, p.src_ref,
						q3, dp, f2, f2p);
734
735
736
					int p2id = d.pathid[p2];
					if (pid == p2id)
					  continue;
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
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
820
#if DEBUG
					dout << "(13) " << p << " ∧ "
					     << t << "δ ";

					bdd biga_ = d.all_cand_acc[f];
					while (biga_ != bddfalse)
					  {
					    bdd a = bdd_satone(biga_);
					    biga_ -= a;

					    transition_acc ta(q2, l, a, q3);
					    out <<  " ∧ " << ta << "FC";
					  }
					biga_ = d.all_cand_acc.back()
					  - d.all_cand_acc[f];
					while (biga_ != bddfalse)
					  {
					    bdd a = bdd_satone(biga_);
					    biga_ -= a;

					    transition_acc ta(q2, l, a, q3);
					    out << " ∧ ¬" << ta << "FC";
					  }
					out << " → " << p2 << "\n";
#endif
					out << -pid << " " << -ti << " ";
					bdd biga = d.all_cand_acc[f];
					while (biga != bddfalse)
					  {
					    bdd a = bdd_satone(biga);
					    biga -= a;

					    transition_acc ta(q2, l, a, q3);
					    int tai = d.transaccid[ta];
					    out << -tai << " ";
					  }
					biga = d.all_cand_acc.back()
					  - d.all_cand_acc[f];
					while (biga != bddfalse)
					  {
					    bdd a = bdd_satone(biga);
					    biga -= a;

					    transition_acc ta(q2, l, a, q3);
					    int tai = d.transaccid[ta];
					    out << tai << " ";
					  }

					out << p2id << " 0\n";
					++nclauses;
				      }
				  }
				}
			    }
			}
		      delete it;
		    }
	      }

      out.seekp(0);
      out << "p cnf " << d.nvars << " " << nclauses;
    }



    static std::string
    get_solution(const char* filename)
    {
      std::fstream in(filename, std::ios_base::in);
      std::string line;
      while (std::getline(in, line))
	{
	  if (line.empty() || line[0] == 'c')
	    continue;
	  if (line[0] == 'v')
	    break;
	}
      if (line[0] == 'v')
	return line.c_str() + 1;
      return "";
    }


    static tgba_explicit_number*
821
822
    sat_build(const std::string& solution, dict& satdict, const tgba* aut,
	      bool state_based)
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
    {
      bdd_dict* autdict = aut->get_dict();
      tgba_explicit_number* a = new tgba_explicit_number(autdict);
      autdict->register_all_variables_of(aut, a);
      autdict->unregister_all_typed_variables(bdd_dict::acc, aut);
      a->set_acceptance_conditions(satdict.all_cand_acc.back());

      for (int s = 1; s < satdict.cand_size; ++s)
	a->add_state(s);

      std::stringstream sol(solution);
      state_explicit_number::transition* last_aut_trans = 0;
      const transition* last_sat_trans = 0;

#if DEBUG
      std::fstream out("dtgba-sat.dbg",
		       std::ios_base::trunc | std::ios_base::out);
      std::set<int> positive;
#else
      // "out" is not used, but it has to exist for the dout() macro to
      // compile.
      std::ostream& out(std::cout);
#endif

      dout << "--- transition variables ---\n";
848
      std::map<int, bdd> state_acc;
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
      for (;;)
	{
	  int v;
	  sol >> v;
	  if (!sol)
	    break;

	  if (v < 0)  // FIXME: maybe we can have (v < NNN)?
	    continue;

#if DEBUG
	  positive.insert(v);
#endif

	  dict::rev_map::const_iterator t = satdict.revtransid.find(v);

	  if (t != satdict.revtransid.end())
	    {
	      last_aut_trans = a->create_transition(t->second.src,
						    t->second.dst);
	      last_aut_trans->condition = t->second.cond;
	      last_sat_trans = &t->second;

	      dout << v << "\t" << t->second << \n";
873
874
875
876
877
878
879
880

	      if (state_based)
		{
		  std::map<int, bdd>::const_iterator i =
		    state_acc.find(t->second.src);
		  if (i != state_acc.end())
		    last_aut_trans->acceptance_conditions = i->second;
		}
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
	    }
	  else
	    {
	      dict::rev_acc_map::const_iterator ta;
	      ta = satdict.revtransaccid.find(v);
	      // This assumes that the sat solvers output variables in
	      // increasing order.
	      if (ta != satdict.revtransaccid.end())
		{
		  dout << v << "\t" << ta->second << "F\n";

		  if (last_sat_trans &&
		      ta->second.src == last_sat_trans->src &&
		      ta->second.cond == last_sat_trans->cond &&
		      ta->second.dst == last_sat_trans->dst)
896
897
898
899
900
901
902
903
		    {
		      assert(!state_based);
		      last_aut_trans->acceptance_conditions |= ta->second.acc;
		    }
		  else if (state_based)
		    {
		      state_acc[ta->second.src] |= ta->second.acc;
		    }
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
		}
	    }
	}
#if DEBUG
      dout << "--- state_pair variables ---\n";
      for (std::map<state_pair, int>::const_iterator pit =
	     satdict.prodid.begin(); pit != satdict.prodid.end(); ++pit)
	if (positive.find(pit->second) != positive.end())
	  dout << pit->second << "\t" << pit->first << "\n";

      dout << "--- pathit variables ---\n";
      for (std::map<path, int>::const_iterator pit =
	     satdict.pathid.begin();
	   pit != satdict.pathid.end(); ++pit)
	if (positive.find(pit->second) != positive.end())
	  dout << pit->second << "\t" << pit->first << "C\n";
#endif

      a->merge_transitions();

      return a;
    }

    static bool
    xrename(const char* from, const char* to)
    {
      if (!rename(from, to))
	return false;
      std::ostringstream msg;
      msg << "cannot rename " << from << " to " << to;
      perror(msg.str().c_str());
      return true;
    }
  }

  tgba_explicit_number*
940
941
  dtgba_sat_minimize(const tgba* a, unsigned cand_nacc,
		     int target_state_number, bool state_based)
942
  {
943
944
945
946
    int ref_states =
      target_state_number == -1
      ? stats_reachable(a).states - 1
      : target_state_number;
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967

    std::string current_solution;
    std::string last_solution;
    dict* last = 0;
    dict* current = 0;
    temporary_file* cnf = 0;
    temporary_file* out = 0;

    do
      {
	if (DEBUG && current)
	  {
	    xrename(out->name(), "dtgba-sat.out");
	    xrename(cnf->name(), "dtgba-sat.cnf");
	  }
	delete out;
	delete cnf;
	std::swap(current_solution, last_solution);
	delete last;
	last = current;
	current = new dict(a);
968
	current->cand_size = ref_states--;
969
970
971
972
973
974
	current->cand_nacc = cand_nacc;

	cnf = create_tmpfile("dtgba-sat-", ".cnf");

	std::fstream cnfs(cnf->name(),
			  std::ios_base::trunc | std::ios_base::out);
975
	dtgba_to_sat(cnfs, a, *current, state_based);
976
977
	cnfs.close();

978
	out = create_tmpfile("dtgba-sat-", ".out");
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
979
	satsolver(cnf, out);
980
981
	current_solution = get_solution(out->name());
      }
982
    while (target_state_number == -1 && !current_solution.empty());
983

984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
    if (target_state_number != -1)
      {
	std::swap(current_solution, last_solution);
	if (last_solution.empty())
	  {
	    last = 0;
	    delete current;
	  }
	else
	  {
	    last = current;
	  }
      }
    else
      {
	delete current;
      }
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013

    tgba_explicit_number* res;
    if (last == 0)
      {
	res = 0;
	if (DEBUG)
	  {
	    xrename(out->name(), "dtgba-sat.out");
	    xrename(cnf->name(), "dtgba-sat.cnf");
	  }
      }
    else
      {
1014
	res = sat_build(last_solution, *last, a, state_based);
1015
1016
1017
1018
1019
1020
1021
1022
1023
	delete last;
      }

    delete out;
    delete cnf;
    return res;
  }

}