dtgbasat.cc 25.9 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
#include "isweakscc.hh"
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

// 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 "
56
#define trace std::cerr
57
#else
58
59
#define dout while (0) std::cout
#define trace dout
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
#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());
      }
    };

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
    struct src_cond
    {
      int src;
      bdd cond;

      src_cond(int src, bdd cond)
	: src(src), cond(cond)
      {
      }

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

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

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
    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 path
    {
      int src_cand;
      int src_ref;
      int dst_cand;
      int dst_ref;
      bdd acc_cand;
      bdd acc_ref;

173
174
175
176
177
178
179
      path(int src_cand, int src_ref)
	: src_cand(src_cand), src_ref(src_ref),
	  dst_cand(src_cand), dst_ref(src_ref),
	  acc_cand(bddfalse), acc_ref(bddfalse)
      {
      }

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
300
301
302
      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 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<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_;
303
      bool state_based_;
304
      scc_map& sm_;
305
    public:
306
307
      filler_dfs(const tgba* aut, dict& d, bdd ap, bool state_based,
		 scc_map& sm)
308
	: tgba_reachable_iterator_depth_first(aut), d(d), ap_(ap),
309
	  state_based_(state_based), sm_(sm)
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
      {
	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;

371
372
	for (dict::state_map::const_iterator i2 = seen.begin();
	     i2 != seen.end(); ++i2)
373
	  {
374
375
376
	    int i = i2->second;
	    d.int_to_state[i] = i2->first;
	    unsigned i_scc = sm_.scc_of_state(i2->first);
377
378
	    bool is_weak = is_weak_scc(sm_, i_scc);

379
380
	    for (int j = 1; j <= d.cand_size; ++j)
	      {
381
382
383
384
385
386
387
388
		for (dict::state_map::const_iterator k2 = seen.begin();
		     k2 != seen.end(); ++k2)
		  {
		    int k = k2->second;
		    if (sm_.scc_of_state(k2->first) != i_scc)
		      continue;
		    for (int l = 1; l <= d.cand_size; ++l)
		      {
389
390
			size_t sfp = is_weak ? 1 : d.all_ref_acc.size();
			for (size_t fp = 0; fp < sfp; ++fp)
391
			  {
392
393
			    size_t sf = d.all_cand_acc.size();
			    for (size_t f = 0; f < sf; ++f)
394
395
396
397
398
399
400
401
402
403
			      {
				path p(j, i, l, k,
				       d.all_cand_acc[f],
				       d.all_ref_acc[fp]);
				d.pathid[p] = ++d.nvars;
			      }

			  }
		      }
		  }
404
405
406
407
408
	      }
	  }

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

409
410
411
412
	if (!state_based_)
	  {
	    for (int i = 1; i <= d.cand_size; ++i)
	      for (int j = 1; j <= d.cand_size; ++j)
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
		  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;
451

452
453
454
455
456
457
458
459
460
461
462
463
			  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)
464
		    {
465
466
467
468
469
470
471
		      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));
472
473
		    }
		}
474
	  }
475
476
477
478
      }
    };

    static
479
480
    void dtgba_to_sat(std::ostream& out, const tgba* ref, dict& d,
		      bool state_based)
481
    {
482
      clause_counter nclauses;
483
484
485
486
487
488
      int ref_size = 0;

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

489
490
491
492
493
494
495
496
497
498
499
      // Count the number of atomic propositions
      int nap = 0;
      {
	bdd cur = ap;
	while (cur != bddtrue)
	  {
	    ++nap;
	    cur = bdd_high(cur);
	  }
	nap = 1 << nap;
      }
500
501
502

      // Number all the SAT variable we may need.
      {
503
	filler_dfs f(ref, d, ap, state_based, sm);
504
505
506
507
508
509
510
511
512
513
514
515
516
517
	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";

518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
#if DEBUG
      debug_dict = ref->get_dict();
      dout << "ref_size: " << ref_size << "\n";
      dout << "cand_size: " << d.cand_size << "\n";
#endif

      dout << "symmetry-breaking clauses\n";
      int j = 0;
      bdd all = bddtrue;
      while (all != bddfalse)
 	{
 	  bdd s = bdd_satoneset(all, ap, bddfalse);
 	  all -= s;
 	  for (int i = 1; i < d.cand_size; ++i)
 	    for (int k = (i - 1) * nap + j + 3; k <= d.cand_size; ++k)
	      {
		transition t(i, s, k);
		int ti = d.transid[t];
		dout << "¬" << t << "\n";
		out << -ti << " 0\n";
		++nclauses;
	      }
 	  ++j;
 	}
542
      if (!nclauses.nb_clauses())
543
544
 	dout << "(none)\n";

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
      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";
579
580
      dout << path(1, 1) << "\n";
      out << d.pathid[path(1, 1)] << " 0\n";
581
582
      ++nclauses;

583
584
      for (int q1 = 1; q1 <= d.cand_size; ++q1)
	for (int q1p = 1; q1p <= ref_size; ++q1p)
585
586
587
	{
	  dout << "(10) augmenting paths based on Cand[" << q1
	       << "] and Ref[" << q1p << "]\n";
588
589
590
	  path p1(q1, q1p);
	  int p1id = d.pathid[p1];

591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
	  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];

609
610
		      path p2(q2, dp);
		      int succ = d.pathid[p2];
611

612
		      if (p1id == succ)
613
614
			continue;

615
616
		      dout << p1 << " ∧ " << t << "δ → " << p2 << "\n";
		      out << -p1id << " " << -ti << " " << succ << " 0\n";
617
618
619
620
621
622
623
624
625
626
		      ++nclauses;
		    }
		}
	    }
	  delete it;
	}

      bdd all_acc = ref->all_acceptance_conditions();

      // construction of constraints (11,12,13)
627
628
629
630
631
632
633
634
635
      for (int q1p = 1; q1p <= ref_size; ++q1p)
	{
	  unsigned q1p_scc = sm.scc_of_state(d.int_to_state[q1p]);
	  for (int q2p = 1; q2p <= ref_size; ++q2p)
	    {
	      // We are only interested in transition that can form a
	      // cycle, so they must belong to the same SCC.
	      if (sm.scc_of_state(d.int_to_state[q2p]) != q1p_scc)
		continue;
636
637
638
	      bool is_weak = is_weak_scc(sm, q1p_scc);
	      bool is_acc = sm.accepting(q1p_scc);

639
640
641
642
	      for (int q1 = 1; q1 <= d.cand_size; ++q1)
		for (int q2 = 1; q2 <= d.cand_size; ++q2)
		  {
		    size_t sf = d.all_cand_acc.size();
643
		    size_t sfp = is_weak ? 1 : d.all_ref_acc.size();
644
645
646
647
648
		    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]);
649

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

652
			  int pid = d.pathid[p];
653

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

657
			  for (it->first(); !it->done(); it->next())
658
			    {
659
660
661
			      const state* dps = it->current_state();
			      // Skip destinations not in the SCC.
			      if (sm.scc_of_state(dps) != q1p_scc)
662
				{
663
664
665
666
667
				  dps->destroy();
				  continue;
				}
			      int dp = d.state_to_int[dps];
			      dps->destroy();
668

669
670
671
672
673
			      for (int q3 = 1; q3 <= d.cand_size; ++q3)
				{
				  bdd all = it->current_condition();
				  bdd curacc =
				    it->current_acceptance_conditions();
674

675
				  while (all != bddfalse)
676
				    {
677
678
				      bdd l = bdd_satoneset(all, ap, bddfalse);
				      all -= l;
679

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

683
				      if (dp == q1p && q3 == q1) // (11,12) loop
684
					{
685
686
687
688
					  if ((!is_acc) ||
					      (!is_weak &&
					       (curacc |
						d.all_ref_acc[fp]) != all_acc))
689
					    {
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
#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";
711
#endif // DEBUG
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
					      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;

						  transition_acc ta(q2, l,
								    one, q1);
						  int tai = d.transaccid[ta];
						  assert(tai != 0);
						  out << " " << -tai;
						}
					      out << " 0\n";
729
730
					      ++nclauses;
					    }
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
761
762
763
764
765
766
767
768
769
770
771
772
					  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;

						  transition_acc ta(q2, l,
								    one, q1);
						  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;

						  transition_acc ta(q2, l,
								    one, q1);
						  int tai = d.transaccid[ta];
						  assert(tai != 0);

						  out << -pid << " " << -ti
						      << " " << tai << " 0\n";
						  ++nclauses;
						}
					    }
773
					}
774
				      // (13) augmenting paths (always).
775
				      {
776
777
					size_t sf = d.all_cand_acc.size();
					for (size_t f = 0; f < sf; ++f)
778
779
					  {

780
781
					    bdd f2 = p.acc_cand |
					      d.all_cand_acc[f];
782
783
					    bdd f2p = is_weak ? bddfalse
					      : p.acc_ref | curacc;
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
					    path p2(p.src_cand, p.src_ref,
						    q3, dp, f2, f2p);
					    int p2id = d.pathid[p2];
					    if (pid == p2id)
					      continue;
#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";
814
#endif
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
					    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;
840
841
					  }
				      }
842
				    }
843
844
				}
			    }
845
			  delete it;
846
			}
847
848
849
		  }
	    }
	}
850
      out.seekp(0);
851
      out << "p cnf " << d.nvars << " " << nclauses.nb_clauses();
852
853
854
    }

    static tgba_explicit_number*
855
    sat_build(const sat_solution& solution, dict& satdict, const tgba* aut,
856
	      bool state_based)
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
    {
      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);

      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);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
873
      out.exceptions(std::ifstream::failbit | std::ifstream::badbit);
874
875
876
877
      std::set<int> positive;
#endif

      dout << "--- transition variables ---\n";
878
      std::map<int, bdd> state_acc;
879
      std::set<src_cond> seen_trans;
880
881
      for (sat_solution::const_iterator i = solution.begin();
	   i != solution.end(); ++i)
882
	{
883
	  int v = *i;
884
885
886
887
888
889
890
891
892
893
894
895

	  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())
	    {
896
897
898
899
900
901
902
903
	      // Skip (s,l,d2) if we have already seen some (s,l,d1).
	      if (seen_trans.insert(src_cond(t->second.src,
					     t->second.cond)).second)
		{
		  last_aut_trans = a->create_transition(t->second.src,
							t->second.dst);
		  last_aut_trans->condition = t->second.cond;
		  last_sat_trans = &t->second;
904

905
		  dout << v << "\t" << t->second << \n";
906

907
908
909
910
911
912
913
		  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;
		    }
914
		}
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
	    }
	  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)
930
931
932
933
934
935
936
937
		    {
		      assert(!state_based);
		      last_aut_trans->acceptance_conditions |= ta->second.acc;
		    }
		  else if (state_based)
		    {
		      state_acc[ta->second.src] |= ta->second.acc;
		    }
938
939
940
941
		}
	    }
	}
#if DEBUG
942
      dout << "--- pathid variables ---\n";
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
      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*
968
969
  dtgba_sat_synthetize(const tgba* a, unsigned target_acc_number,
		       int target_state_number, bool state_based)
970
  {
971
972
973
    trace << "dtgba_sat_synthetize(..., acc = " << target_acc_number
	  << ", states = " << target_state_number
	  << ", state_based = " << state_based << ")\n";
974
975
976
977
    dict* current = 0;
    temporary_file* cnf = 0;
    temporary_file* out = 0;

978
979
980
981
    current = new dict(a);
    current->cand_size = target_state_number;
    current->cand_nacc = target_acc_number;

982
983
984
985
986
    try
      {
	cnf = create_tmpfile("dtgba-sat-", ".cnf");
	std::fstream cnfs(cnf->name(),
			  std::ios_base::trunc | std::ios_base::out);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
987
	cnfs.exceptions(std::ifstream::failbit | std::ifstream::badbit);
988
989
990
991
992
993
994
995
996
997
998
	dtgba_to_sat(cnfs, a, *current, state_based);
	cnfs.close();
      }
    catch (...)
      {
	if (DEBUG)
	  xrename(cnf->name(), "dgtba-sat.cnf");
	delete current;
	delete cnf;
	throw;
      }
999
1000
1001
1002

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

1003
    sat_solution solution = satsolver_get_solution(out->name());
1004
1005
1006
1007
1008
1009

    tgba_explicit_number* res = 0;
    if (!solution.empty())
      res = sat_build(solution, *current, a, state_based);

    delete current;
1010

1011
    if (DEBUG)
1012
      {
1013
1014
	xrename(out->name(), "dtgba-sat.out");
	xrename(cnf->name(), "dtgba-sat.cnf");
1015
      }
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030

    delete out;
    delete cnf;
    trace << "dtgba_sat_synthetize(...) = " << res << "\n";
    return res;
  }

  tgba_explicit_number*
  dtgba_sat_minimize(const tgba* a, unsigned target_acc_number,
		     bool state_based)
  {
    int n_states = stats_reachable(a).states;

    tgba_explicit_number* prev = 0;
    for (;;)
1031
      {
1032
1033
1034
1035
1036
1037
1038
	tgba_explicit_number* next =
	  dtgba_sat_synthetize(prev ? prev : a, target_acc_number,
			       --n_states, state_based);
	if (next == 0)
	  break;
	delete prev;
	prev = next;
1039
      }
1040
1041
1042
1043
1044
1045
1046
1047
1048
    return prev;
  }

  tgba_explicit_number*
  dtgba_sat_minimize_dichotomy(const tgba* a, unsigned target_acc_number,
			       bool state_based)
  {
    int max_states = stats_reachable(a).states - 1;
    int min_states = 1;
1049

1050
1051
    tgba_explicit_number* prev = 0;
    while (min_states <= max_states)
1052
      {
1053
1054
1055
1056
1057
	int target = (max_states + min_states) / 2;
	tgba_explicit_number* next =
	  dtgba_sat_synthetize(prev ? prev : a, target_acc_number, target,
			       state_based);
	if (next == 0)
1058
	  {
1059
1060
1061
1062
1063
1064
1065
	    min_states = target + 1;
	  }
	else
	  {
	    delete prev;
	    prev = next;
	    max_states = target - 1;
1066
1067
	  }
      }
1068
    return prev;
1069
1070
1071
  }

}