ltl2tgba.cc 19.6 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/gtec/gtec.hh"
#include "tgbaalgos/gtec/ce.hh"
41
#include "tgbaparse/public.hh"
42
#include "tgbaalgos/dupexp.hh"
43
#include "tgbaalgos/neverclaim.hh"
44
#include "tgbaalgos/reductgba_sim.hh"
45
#include "tgbaalgos/replayrun.hh"
46
#include "tgbaalgos/rundotdec.hh"
47

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

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

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

165
  for (;;)
166
    {
167
      if (argc < formula_index + 2)
168
	syntax(argv[0]);
169
170
171

      ++formula_index;

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

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

417
418
419
420
421
422
  if (graph_run_opt && (echeck_algo == "" || !expect_counter_example))
    {
      std::cerr << argv[0] << ": error: -g requires -e." << std::endl;
      exit(1);
    }

423
424
425
426
  std::string input;

  if (file_opt)
    {
427
      if (strcmp(argv[formula_index], "-"))
428
	{
429
	  std::ifstream fin(argv[formula_index]);
430
	  if (!fin)
431
432
433
434
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
435

436
	  if (!std::getline(fin, input, '\0'))
437
438
439
440
441
442
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
443
	{
444
	  std::getline(std::cin, input, '\0');
445
446
447
448
449
450
451
	}
    }
  else
    {
      input = argv[formula_index];
    }

452
  spot::bdd_dict* dict = new spot::bdd_dict();
453
454
455
456
457
458
459
460
461

  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)
462
    {
463
464
465
466
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

467
468
469
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
470
471
	  spot::tgba_explicit* e;
	  to_free = a = e = spot::tgba_parse(input, pel, dict, env, debug_opt);
472
	  if (spot::format_tgba_parse_errors(std::cerr, pel))
473
474
475
476
477
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
478
	  e->merge_transitions();
479
	}
480
      else
481
	{
482
	  if (redopt != spot::ltl::Reduce_None)
483
	    {
484
485
486
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
	      spot::ltl::destroy(f);
	      f = t;
487
488
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
489
	    }
490

491
	  if (fm_opt)
492
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
493
					       fm_symb_merge_opt,
494
					       post_branching,
495
					       fair_loop_approx, unobservables);
496
497
498
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
499

500
      spot::tgba_tba_proxy* degeneralized = 0;
501

502
503
504
505
506
      if (degeneralize_maybe
	  && degeneralize_opt == NoDegen
	  && a->number_of_acceptance_conditions() > 1)
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
507
	a = degeneralized = new spot::tgba_tba_proxy(a);
508
509
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
510

511
512
513
514
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
	  a = aut_red = new spot::tgba_reduc(a);
515
516
517
518

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

martinez's avatar
martinez committed
519
520
521
522
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
523
	    {
martinez's avatar
martinez committed
524
525
526
527
528
	      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))
529
530
531
532
		rel_dir =
		  spot::get_direct_relation_simulation(a,
						       std::cout,
						       display_parity_game);
martinez's avatar
martinez committed
533
534
	      else if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
				    spot::Reduce_transition_Del_Sim))
535
536
537
538
		rel_del =
		  spot::get_delayed_relation_simulation(a,
							std::cout,
							display_parity_game);
539
540

	      if (display_rel_sim)
martinez's avatar
martinez committed
541
542
543
544
545
546
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
547

martinez's avatar
martinez committed
548
549
550
551
552
553
554
555
556
557
558
559
560
	      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);
561
562
563
	    }
	}

564
565
566
567
568
569
570
571
572
573
574
575
576
      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;
	}

577
578
      switch (output)
	{
579
580
581
	case -1:
	  /* No output.  */
	  break;
582
583
584
585
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
586
587
588
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
589
590
	  break;
	case 2:
591
592
593
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
594
				get_core_data().acceptance_conditions);
595
596
	  break;
	case 3:
597
598
599
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
600
601
	  break;
	case 4:
602
603
604
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
605
				get_core_data().acceptance_conditions);
606
	  break;
607
	case 5:
608
	  a->get_dict()->dump(std::cout);
609
	  break;
610
611
612
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
613
	case 8:
614
615
616
617
618
619
620
	  {
	    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;
	  }
621
622
623
	default:
	  assert(!"unknown output option");
	}
624

625
      spot::emptiness_check* ec = 0;
626
627
628
629
      switch (echeck)
	{
	case None:
	  break;
martinez's avatar
martinez committed
630

631
	case Couvreur:
632
633
634
	  ec = new spot::couvreur99_check(a);
	  break;

635
	case Couvreur2:
636
	  ec = new spot::couvreur99_check_shy(a);
637
	  break;
martinez's avatar
martinez committed
638

639
640
        case MagicSearch:
          if (bit_state_hashing)
641
            ec = spot::bit_state_hashing_magic_search(a, heap_size);
642
          else
643
            ec = spot::explicit_magic_search(a);
644
          break;
645

646
647
        case Se05Search:
          if (bit_state_hashing)
648
            ec = spot::bit_state_hashing_se05_search(a, heap_size);
649
          else
650
            ec = spot::explicit_se05_search(a);
651
          break;
652
	}
martinez's avatar
martinez committed
653

654
655
656
657
658
      if (ec)
	{
	  do
	    {
	      spot::emptiness_check_result* res = ec->check();
659
660
	      if (!graph_run_opt)
		ec->print_stats(std::cout);
661
662
	      if (expect_counter_example != !!res &&
                      (!bit_state_hashing || !expect_counter_example))
663
664
665
666
		exit_code = 1;

	      if (!res)
		{
667
668
669
670
671
672
673
674
675
676
677
                  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;
678
679
680
681
682
683
684
		}
	      else
		{

		  spot::tgba_run* run = res->accepting_run();
		  if (!run)
		    {
685
		      std::cout << "an accepting run exists" << std::endl;
686
687
688
		    }
		  else
		    {
689
690
691
		      if (graph_run_opt)
			{
			  spot::tgba_run_dotty_decorator deco(run);
692
			  spot::dotty_reachable(std::cout, a, &deco);
693
694
695
			}
		      else
			{
696
697
			  spot::print_tgba_run(std::cout, a, run);
			  if (!spot::replay_tgba_run(std::cout, a, run, true))
698
699
			    exit_code = 1;
			}
700
701
702
703
704
705
706
		      delete run;
		    }
		}
	      delete res;
	    }
	  while (magic_many);
	  delete ec;
martinez's avatar
martinez committed
707
708
	}

709
710
      if (f)
        spot::ltl::destroy(f);
711
712
713
      delete expl;
      delete degeneralized;
      delete aut_red;
714
      delete to_free;
715
716
717
718
719
720
721
722
723
724
    }
  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);
725
  delete dict;
726
727
  return exit_code;
}