ltl2tgba.cc 20.3 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Copyright (C) 2003, 2004  Laboratoire d'Informatique de Paris 6 (LIP6),
// dpartement Systmes Rpartis Coopratifs (SRC), Universit Pierre
// et Marie Curie.
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 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 Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.

22
23
#include <iostream>
#include <cassert>
24
25
#include <fstream>
#include <string>
26
#include "ltlvisit/destroy.hh"
27
#include "ltlvisit/reduce.hh"
28
#include "ltlvisit/tostring.hh"
29
#include "ltlvisit/apcollect.hh"
30
31
#include "ltlast/allnodes.hh"
#include "ltlparse/public.hh"
32
#include "tgbaalgos/ltl2tgba_lacim.hh"
33
#include "tgbaalgos/ltl2tgba_fm.hh"
34
#include "tgba/bddprint.hh"
35
#include "tgbaalgos/dotty.hh"
36
#include "tgbaalgos/lbtt.hh"
37
#include "tgba/tgbatba.hh"
38
#include "tgbaalgos/magic.hh"
39
40
#include "tgbaalgos/se05.hh"
#include "tgbaalgos/tau03.hh"
41
42
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/gtec/ce.hh"
43
#include "tgbaparse/public.hh"
44
#include "tgbaalgos/dupexp.hh"
45
#include "tgbaalgos/neverclaim.hh"
46
#include "tgbaalgos/reductgba_sim.hh"
47
#include "tgbaalgos/replayrun.hh"
48
#include "tgbaalgos/rundotdec.hh"
49

50
51
52
void
syntax(char* prog)
{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
53
  std::cerr << "Usage: "<< prog << " [OPTIONS...] formula" << std::endl
54
            << "       "<< prog << " -F [OPTIONS...] file" << std::endl
55
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
56
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
57
	    << "Options:" << std::endl
martinez's avatar
martinez committed
58
	    << "  -a    display the acceptance_conditions BDD, not the "
59
	    << "reachability graph"
60
	    << std::endl
martinez's avatar
martinez committed
61
62
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -d    turn on traces during parsing" << std::endl
63
64
	    << "  -D    degeneralize the automaton as a TBA" << std::endl
	    << "  -DS   degeneralize the automaton as an SBA" << std::endl
65
66
67
	    << "  -e[ALGO]  emptiness-check, expect and compute an "
	    << "accepting run" << std::endl
	    << "  -E[ALGO]  emptiness-check, expect no accepting run"
68
	    << std::endl
martinez's avatar
martinez committed
69
70
71
            << "  -f    use Couvreur's FM algorithm for translation"
	    << std::endl
            << "  -F    read the formula from the file" << std::endl
72
	    << "  -g    graph the accepting run on the automaton (requires -e)"
73
	    << std::endl
martinez's avatar
martinez committed
74
            << "  -L    fair-loop approximation (implies -f)" << std::endl
martinez's avatar
martinez committed
75
76
	    << "  -N    display the never clain for Spin "
	    << "(implies -D)" << std::endl
martinez's avatar
martinez committed
77
78
            << "  -p    branching postponement (implies -f)" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
79
	    << std::endl
martinez's avatar
martinez committed
80
81
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
82
	    << "and universality" << std::endl
martinez's avatar
martinez committed
83
	    << "  -r3   reduce formula using implication between "
84
	    << "sub-formulae" << std::endl
martinez's avatar
martinez committed
85
86
87
	    << "  -r4   reduce formula using all rules" << std::endl
	    << "  -rd   display the reduce formula" << std::endl
	    << "  -R    same as -r, but as a set" << std::endl
88
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
89
	    << "(use -L for more reduction)"
90
	    << std::endl
91
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
92
	    << "(use -L for more reduction)"
93
	    << std::endl
94
95
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
96
	    << std::endl
97
98
99
	    << "  -R3   use SCC to reduce the automata" << std::endl
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
martinez's avatar
martinez committed
100
	    << "  -s    convert to explicit automata, and number states "
101
	    << "in DFS order" << std::endl
martinez's avatar
martinez committed
102
	    << "  -S    convert to explicit automata, and number states "
103
	    << "in BFS order" << std::endl
martinez's avatar
martinez committed
104
	    << "  -t    display reachable states in LBTT's format" << std::endl
105
106
            << "  -U[PROPS]  consider atomic properties PROPS as exclusive "
	    << "events (implies -f)" << std::endl
martinez's avatar
martinez committed
107
108
109
	    << "  -v    display the BDD variables used by the automaton"
	    << std::endl
            << "  -x    try to produce a more deterministic automata "
110
	    << "(implies -f)" << std::endl
martinez's avatar
martinez committed
111
	    << "  -X    do not compute an automaton, read it from a file"
112
	    << std::endl
martinez's avatar
martinez committed
113
	    << "  -y    do not merge states with same symbolic representation "
114
115
116
	    << "(implies -f)" << std::endl
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
117
	    << "  couvreur99 (the default)" << std::endl
118
119
	    << "  couvreur99_shy" << std::endl
	    << "  magic_search" << std::endl
120
	    << "  magic_search_repeated" << std::endl
121
122
123
124
	    << "  bsh_magic_search[(heap size in Mo - 10Mo by default)]"
            << std::endl
	    << "  bsh_magic_search_repeated[(heap size in MB - 10MB"
            << " by default)]" << std::endl
125
	    << "  se05_search" << std::endl
126
127
128
129
	    << "  se05_search_repeated" << std::endl
	    << "  bsh_se05_search[(heap size in MB - 10MB by default)]"
            << std::endl
	    << "  bsh_se05_search_repeated[(heap size in MB - 10MB"
130
131
            << " by default)]" << std::endl
	    << "  tau03_search" << std::endl;
132
133
134
135
136
137
138
139
  exit(2);
}

int
main(int argc, char** argv)
{
  int exit_code = 0;

140
  bool debug_opt = false;
141
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
142
  bool degeneralize_maybe = false;
143
  bool fm_opt = false;
144
  bool fm_exprop_opt = false;
145
  bool fm_symb_merge_opt = true;
146
  bool file_opt = false;
147
  int output = 0;
148
  int formula_index = 0;
149
  std::string echeck_algo;
150
151
  enum { None, Couvreur, Couvreur2, MagicSearch, Se05Search, Tau03Search }
                                                                 echeck = None;
152
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
153
  bool search_many = false;
154
155
  bool bit_state_hashing = false;
  int heap_size = 10*1024*1024;
156
  bool expect_counter_example = false;
157
  bool from_file = false;
158
  int reduc_aut = spot::Reduce_None;
159
  int redopt = spot::ltl::Reduce_None;
160
161
  bool display_reduce_form = false;
  bool display_rel_sim = false;
162
  bool display_parity_game = false;
163
  bool post_branching = false;
164
  bool fair_loop_approx = false;
165
  bool graph_run_opt = false;
166
167
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
168

169
  for (;;)
170
    {
171
      if (argc < formula_index + 2)
172
	syntax(argv[0]);
173
174
175

      ++formula_index;

176
177
178
179
180
181
182
183
184
      if (!strcmp(argv[formula_index], "-a"))
	{
	  output = 2;
	}
      else if (!strcmp(argv[formula_index], "-A"))
	{
	  output = 4;
	}
      else if (!strcmp(argv[formula_index], "-d"))
185
186
187
	{
	  debug_opt = true;
	}
188
189
      else if (!strcmp(argv[formula_index], "-D"))
	{
190
191
192
193
194
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
195
	}
196
      else if (!strncmp(argv[formula_index], "-e", 2))
197
198
199
200
201
202
203
204
205
206
207
208
209
        {
          if (argv[formula_index][2] != 0)
            {
              char *p = strchr(argv[formula_index], '(');
              if (p && sscanf(p+1, "%d)", &heap_size) == 1)
                *p = '\0';
              echeck_algo = argv[formula_index] + 2;
            }
          else
            echeck_algo = "couvreur99";
          expect_counter_example = true;
          output = -1;
        }
210
      else if (!strncmp(argv[formula_index], "-E", 2))
211
212
213
214
215
216
217
218
219
220
221
222
223
        {
          if (argv[formula_index][2] != 0)
            {
              char *p = strchr(argv[formula_index], '(');
              if (p && sscanf(p+1, "%d)", &heap_size) == 1)
                *p = '\0';
              echeck_algo = argv[formula_index] + 2;
            }
          else
            echeck_algo = "couvreur99";
          expect_counter_example = false;
          output = -1;
        }
224
225
226
227
228
229
230
231
      else if (!strcmp(argv[formula_index], "-f"))
	{
	  fm_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
232
233
234
235
      else if (!strcmp(argv[formula_index], "-g"))
	{
	  graph_run_opt = true;
	}
236
237
238
239
240
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
	  fm_opt = true;
	}
martinez's avatar
martinez committed
241
242
      else if (!strcmp(argv[formula_index], "-N"))
	{
243
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
244
245
	  output = 8;
	}
246
247
248
249
250
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
	  fm_opt = true;
	}
251
252
      else if (!strcmp(argv[formula_index], "-r"))
	{
253
254
	  output = 1;
	}
255
256
257
258
259
260
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
261
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
262
263
264
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
265
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
266
267
268
269
270
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
271
272
273
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
274
	}
martinez's avatar
martinez committed
275
276
277
278
279
280
281
282
283
      else if (!strcmp(argv[formula_index], "-R1q"))
	{
	  reduc_aut |= spot::Reduce_quotient_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R1t"))
	{
	  reduc_aut |= spot::Reduce_transition_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R2q"))
284
	{
martinez's avatar
martinez committed
285
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
286
	}
martinez's avatar
martinez committed
287
      else if (!strcmp(argv[formula_index], "-R2t"))
288
	{
martinez's avatar
martinez committed
289
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
      else if (!strcmp(argv[formula_index], "-rd"))
	{
	  display_reduce_form = true;
	}
      else if (!strcmp(argv[formula_index], "-Rd"))
	{
	  display_rel_sim = true;
	}
      else if (!strcmp(argv[formula_index], "-RD"))
	{
	  display_parity_game = true;
	}
307
308
309
310
311
312
313
314
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
315
316
317
318
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
319
320
321
322
323
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
	  fm_opt = true;
	  // Parse -U's argument.
324
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
325
326
327
328
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
329
	      tok = strtok(0, ", \t;");
330
331
	    }
	}
332
333
334
335
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
336
337
338
339
340
      else if (!strcmp(argv[formula_index], "-x"))
	{
	  fm_opt = true;
	  fm_exprop_opt = true;
	}
341
342
343
344
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
345
346
347
348
349
      else if (!strcmp(argv[formula_index], "-y"))
	{
	  fm_opt = true;
	  fm_symb_merge_opt = false;
	}
350
351
352
353
      else
	{
	  break;
	}
354
355
    }

356
  if (echeck_algo != "")
357
    {
358
359
360
361
362
363
364
365
366
367
368
      if (echeck_algo == "couvreur99")
	{
	  echeck = Couvreur;
	}
      else if (echeck_algo == "couvreur99_shy")
	{
	  echeck = Couvreur2;
	}
      else if (echeck_algo == "magic_search")
	{
	  echeck = MagicSearch;
369
	  degeneralize_maybe = true;
370
371
372
373
	}
      else if (echeck_algo == "magic_search_repeated")
	{
	  echeck = MagicSearch;
374
	  degeneralize_maybe = true;
375
	  search_many = true;
376
	}
377
378
379
      else if (echeck_algo == "bsh_magic_search")
	{
	  echeck = MagicSearch;
380
	  degeneralize_maybe = true;
381
382
383
384
385
          bit_state_hashing = true;
	}
      else if (echeck_algo == "bsh_magic_search_repeated")
	{
	  echeck = MagicSearch;
386
	  degeneralize_maybe = true;
387
          bit_state_hashing = true;
388
	  search_many = true;
389
	}
390
391
      else if (echeck_algo == "se05_search")
	{
392
	  echeck = Se05Search;
393
	  degeneralize_maybe = true;
394
395
396
	}
      else if (echeck_algo == "se05_search_repeated")
	{
397
	  echeck = Se05Search;
398
	  degeneralize_maybe = true;
399
	  search_many = true;
400
401
402
403
	}
      else if (echeck_algo == "bsh_se05_search")
	{
	  echeck = Se05Search;
404
	  degeneralize_maybe = true;
405
406
407
408
409
          bit_state_hashing = true;
	}
      else if (echeck_algo == "bsh_se05_search_repeated")
	{
	  echeck = Se05Search;
410
	  degeneralize_maybe = true;
411
          bit_state_hashing = true;
412
413
414
415
416
	  search_many = true;
	}
      else if (echeck_algo == "tau03_search")
	{
	  echeck = Tau03Search;
417
	}
418
419
420
421
422
      else
	{
	  std::cerr << "unknown emptiness-check: " << echeck_algo << std::endl;
	  syntax(argv[0]);
	}
423
424
    }

425
426
427
428
429
430
  if (graph_run_opt && (echeck_algo == "" || !expect_counter_example))
    {
      std::cerr << argv[0] << ": error: -g requires -e." << std::endl;
      exit(1);
    }

431
432
433
434
  std::string input;

  if (file_opt)
    {
435
      if (strcmp(argv[formula_index], "-"))
436
	{
437
	  std::ifstream fin(argv[formula_index]);
438
	  if (!fin)
439
440
441
442
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
443

444
	  if (!std::getline(fin, input, '\0'))
445
446
447
448
449
450
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
451
	{
452
	  std::getline(std::cin, input, '\0');
453
454
455
456
457
458
459
	}
    }
  else
    {
      input = argv[formula_index];
    }

460
  spot::bdd_dict* dict = new spot::bdd_dict();
461
462
463
464
465
466
467
468
469

  spot::ltl::formula* f = 0;
  if (!from_file)
    {
      spot::ltl::parse_error_list pel;
      f = spot::ltl::parse(input, pel, env, debug_opt);
      exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
    }
  if (f || from_file)
470
    {
471
472
473
474
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

475
476
477
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
478
479
	  spot::tgba_explicit* e;
	  to_free = a = e = spot::tgba_parse(input, pel, dict, env, debug_opt);
480
	  if (spot::format_tgba_parse_errors(std::cerr, pel))
481
482
483
484
485
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
486
	  e->merge_transitions();
487
	}
488
      else
489
	{
490
	  if (redopt != spot::ltl::Reduce_None)
491
	    {
492
493
494
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
	      spot::ltl::destroy(f);
	      f = t;
495
496
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
497
	    }
498

499
	  if (fm_opt)
500
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
501
					       fm_symb_merge_opt,
502
					       post_branching,
503
					       fair_loop_approx, unobservables);
504
505
506
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
507

508
      spot::tgba_tba_proxy* degeneralized = 0;
509

510
511
512
513
514
      if (degeneralize_maybe
	  && degeneralize_opt == NoDegen
	  && a->number_of_acceptance_conditions() > 1)
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
515
	a = degeneralized = new spot::tgba_tba_proxy(a);
516
517
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
518

519
520
521
522
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
	  a = aut_red = new spot::tgba_reduc(a);
523
524
525
526

	  if (reduc_aut & spot::Reduce_Scc)
	    aut_red->prune_scc();

martinez's avatar
martinez committed
527
528
529
530
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
531
	    {
martinez's avatar
martinez committed
532
533
534
535
536
	      spot::direct_simulation_relation* rel_dir = 0;
	      spot::delayed_simulation_relation* rel_del = 0;

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			       spot::Reduce_transition_Dir_Sim))
537
538
539
540
		rel_dir =
		  spot::get_direct_relation_simulation(a,
						       std::cout,
						       display_parity_game);
martinez's avatar
martinez committed
541
542
	      else if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
				    spot::Reduce_transition_Del_Sim))
543
544
545
546
		rel_del =
		  spot::get_delayed_relation_simulation(a,
							std::cout,
							display_parity_game);
547
548

	      if (display_rel_sim)
martinez's avatar
martinez committed
549
550
551
552
553
554
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
555

martinez's avatar
martinez committed
556
557
558
559
560
561
562
563
564
565
566
567
568
	      if (reduc_aut & spot::Reduce_quotient_Dir_Sim)
		aut_red->quotient_state(rel_dir);
	      if (reduc_aut & spot::Reduce_transition_Dir_Sim)
		aut_red->delete_transitions(rel_dir);
	      if (reduc_aut & spot::Reduce_quotient_Del_Sim)
		aut_red->quotient_state(rel_del);
	      if (reduc_aut & spot::Reduce_transition_Del_Sim)
		aut_red->delete_transitions(rel_del);

	      if (rel_dir)
		spot::free_relation_simulation(rel_dir);
	      if (rel_del)
		spot::free_relation_simulation(rel_del);
569
570
571
	    }
	}

572
573
574
575
576
577
578
579
580
581
582
583
584
      spot::tgba_explicit* expl = 0;
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

585
586
      switch (output)
	{
587
588
589
	case -1:
	  /* No output.  */
	  break;
590
591
592
593
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
594
595
596
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
597
598
	  break;
	case 2:
599
600
601
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
602
				get_core_data().acceptance_conditions);
603
604
	  break;
	case 3:
605
606
607
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
608
609
	  break;
	case 4:
610
611
612
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
613
				get_core_data().acceptance_conditions);
614
	  break;
615
	case 5:
616
	  a->get_dict()->dump(std::cout);
617
	  break;
618
619
620
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
621
	case 8:
622
623
624
625
626
627
628
	  {
	    assert(degeneralize_opt == DegenSBA);
	    const spot::tgba_sba_proxy* s =
	      static_cast<const spot::tgba_sba_proxy*>(degeneralized);
	    spot::never_claim_reachable(std::cout, s, f);
	    break;
	  }
629
630
631
	default:
	  assert(!"unknown output option");
	}
632

633
      spot::emptiness_check* ec = 0;
634
635
636
637
      switch (echeck)
	{
	case None:
	  break;
martinez's avatar
martinez committed
638

639
	case Couvreur:
640
641
642
	  ec = new spot::couvreur99_check(a);
	  break;

643
	case Couvreur2:
644
	  ec = new spot::couvreur99_check_shy(a);
645
	  break;
martinez's avatar
martinez committed
646

647
648
        case MagicSearch:
          if (bit_state_hashing)
649
            ec = spot::bit_state_hashing_magic_search(a, heap_size);
650
          else
651
            ec = spot::explicit_magic_search(a);
652
          break;
653

654
655
        case Se05Search:
          if (bit_state_hashing)
656
            ec = spot::bit_state_hashing_se05_search(a, heap_size);
657
          else
658
            ec = spot::explicit_se05_search(a);
659
          break;
660
661
662
663
664
665
666
667
668
669
670
671
672

	case Tau03Search:
          if (a->number_of_acceptance_conditions() == 0)
            {
              std::cout << "To apply tau03_search, the automaton must have at "
                        << "least on accepting condition. Try with another "
                        << "algorithm." << std::endl;
            }
          else
            {
              ec = spot::explicit_tau03_search(a);
            }
	  break;
673
	}
martinez's avatar
martinez committed
674

675
676
677
678
679
      if (ec)
	{
	  do
	    {
	      spot::emptiness_check_result* res = ec->check();
680
681
	      if (!graph_run_opt)
		ec->print_stats(std::cout);
682
683
	      if (expect_counter_example != !!res &&
                      (!bit_state_hashing || !expect_counter_example))
684
685
686
687
		exit_code = 1;

	      if (!res)
		{
688
689
690
691
692
693
694
695
696
697
698
                  std::cout << "no accepting run found";
                  if (bit_state_hashing && expect_counter_example)
                    {
                      std::cout << " even if expected" << std::endl;
                      std::cout << "this is maybe due to the use of the bit "
                                << "state hashing technic" << std::endl;
                      std::cout << "you can try to increase the heap size "
                                << "or use an explicit storage" << std::endl;
                    }
                  std::cout << std::endl;
                  break;
699
700
701
702
703
704
705
		}
	      else
		{

		  spot::tgba_run* run = res->accepting_run();
		  if (!run)
		    {
706
		      std::cout << "an accepting run exists" << std::endl;
707
708
709
		    }
		  else
		    {
710
711
712
		      if (graph_run_opt)
			{
			  spot::tgba_run_dotty_decorator deco(run);
713
			  spot::dotty_reachable(std::cout, a, &deco);
714
715
716
			}
		      else
			{
717
718
			  spot::print_tgba_run(std::cout, a, run);
			  if (!spot::replay_tgba_run(std::cout, a, run, true))
719
720
			    exit_code = 1;
			}
721
722
723
724
725
		      delete run;
		    }
		}
	      delete res;
	    }
726
	  while (search_many);
727
	  delete ec;
martinez's avatar
martinez committed
728
729
	}

730
731
      if (f)
        spot::ltl::destroy(f);
732
733
734
      delete expl;
      delete degeneralized;
      delete aut_red;
735
      delete to_free;
736
737
738
739
740
741
742
743
744
745
    }
  else
    {
      exit_code = 1;
    }

  assert(spot::ltl::atomic_prop::instance_count() == 0);
  assert(spot::ltl::unop::instance_count() == 0);
  assert(spot::ltl::binop::instance_count() == 0);
  assert(spot::ltl::multop::instance_count() == 0);
746
  delete dict;
747
748
  return exit_code;
}