ltl2tgba.cc 55.7 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
3
4
5
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014
// Laboratoire de Recherche et Développement de l'Epita (LRDE).
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire
// d'Informatique de Paris 6 (LIP6), département Systèmes Répartis
6
// Coopératifs (SRC), Université Pierre et Marie Curie.
7
8
9
10
11
//
// 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
12
// the Free Software Foundation; either version 3 of the License, or
13
14
15
16
17
18
19
20
// (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
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#include <iostream>
24
#include <iomanip>
25
#include <cassert>
26
27
#include <fstream>
#include <string>
28
#include <cstdlib>
29
#include "ltlvisit/tostring.hh"
30
#include "ltlvisit/apcollect.hh"
31
#include "ltlast/allnodes.hh"
32
#include "ltlparse/public.hh"
33
#include "tgbaalgos/ltl2tgba_lacim.hh"
34
#include "tgbaalgos/ltl2tgba_fm.hh"
35
#include "tgbaalgos/ltl2taa.hh"
36
#include "tgba/bddprint.hh"
37
#include "tgbaalgos/save.hh"
38
#include "tgbaalgos/dotty.hh"
39
#include "tgbaalgos/lbtt.hh"
40
#include "tgba/tgbatba.hh"
41
#include "tgba/tgbasgba.hh"
42
#include "tgbaalgos/degen.hh"
43
#include "tgba/tgbaproduct.hh"
44
#include "tgba/futurecondcol.hh"
45
#include "tgbaalgos/reducerun.hh"
46
#include "tgbaparse/public.hh"
47
#include "neverparse/public.hh"
48
#include "dstarparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "taalgos/minimize.hh"
52
#include "tgbaalgos/neverclaim.hh"
53
#include "tgbaalgos/replayrun.hh"
54
#include "tgbaalgos/rundotdec.hh"
55
#include "tgbaalgos/sccfilter.hh"
56
#include "tgbaalgos/safety.hh"
57
#include "tgbaalgos/gtec/gtec.hh"
58
#include "misc/timer.hh"
59
#include "tgbaalgos/stats.hh"
60
#include "tgbaalgos/scc.hh"
61
#include "tgbaalgos/emptiness_stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/sccinfo.hh"
64
#include "tgbaalgos/isdet.hh"
65
#include "tgbaalgos/cycles.hh"
66
#include "tgbaalgos/isweakscc.hh"
67
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
68
#include "tgbaalgos/simulation.hh"
69
#include "tgbaalgos/compsusp.hh"
70
#include "tgbaalgos/powerset.hh"
71
#include "tgbaalgos/dtgbacomp.hh"
72
73
#include "tgbaalgos/complete.hh"
#include "tgbaalgos/dtbasat.hh"
74
#include "tgbaalgos/dtgbasat.hh"
75

76
#include "taalgos/tgba2ta.hh"
77
#include "taalgos/dotty.hh"
78
#include "taalgos/stats.hh"
79

80
81
82
83
84
85
86
87
88
89
90
91
std::string
ltl_defs()
{
  std::string s = "\
X=(0 1 true	   \
   1 2 $0	   \
   accept 2)	   \
U=(0 0 $0	   \
   0 1 $1	   \
   accept 1)	   \
G=(0 0 $0)	   \
F=U(true, $0)	   \
92
93
94
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
95
96
97
  return s;
}

98
99
100
void
syntax(char* prog)
{
101
102
103
104
105
  // Display the supplied name unless it appears to be a libtool wrapper.
  char* slash = strrchr(prog, '/');
  if (slash && (strncmp(slash + 1, "lt-", 3) == 0))
    prog = slash + 4;

106
  std::cerr << "Usage: "<< prog << " [-f|-l|-taa] [OPTIONS...] formula"
107
	    << std::endl
108
            << "       "<< prog << " [-f|-l|-taa] -F [OPTIONS...] file"
109
	    << std::endl
110
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
111
	    << std::endl
112

113
114
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
115
116
117
118
	    << "Optionally multiply this automaton by another"
	    << " automaton read from a file." << std::endl
            << "Output the result in various formats, or perform an emptiness "
            << "check." << std::endl
119
	    << std::endl
120
121
122

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
123
	    << std::endl
124
	    << "  -X    do not compute an automaton, read it from a file"
125
	    << std::endl
126
127
128
129
	    << "  -XD   do not compute an automaton, read it from an"
	    << " ltl2dstar file" << std::endl
	    << "  -XDB  read the from an ltl2dstar file and convert it to "
	    << "TGBA" << std::endl
130
131
	    << "  -XDD  read the from an ltl2dstar file and convert it to "
	    << "TGBA,\n       keeping it deterministic when possible\n"
132
133
	    << "  -XL   do not compute an automaton, read it from an"
	    << " LBTT file" << std::endl
134
135
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
136
137
138
139
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
140
141
142
	    << std::endl

	    << "Translation algorithm:" << std::endl
143
            << "  -f    use Couvreur's FM algorithm for LTL"
144
	    << " (default)" << std::endl
145
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
146
	    << std::endl
147
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
148
	    << std::endl
149
150
	    << "  -u    use Compositional translation"
	    << std::endl
151
152
153
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
154
155
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
156
157
158
159
160
            << "  -L    fair-loop approximation (implies -f)" << std::endl
            << "  -p    branching postponement (implies -f)" << std::endl
            << "  -U[PROPS]  consider atomic properties of the formula as "
	    << "exclusive events, and" << std::endl
	    << "        PROPS as unobservables events (implies -f)"
161
	    << std::endl
162
163
164
165
            << "  -x    try to produce a more deterministic automaton "
	    << "(implies -f)" << std::endl
	    << "  -y    do not merge states with same symbolic representation "
	    << "(implies -f)" << std::endl
166
	    << std::endl
167

168
	    << "Options for Couvreur's LaCIM algorithm (-l):"
169
	    << std::endl
170
171
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
172
	    << std::endl
173
174
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
175
	    << std::endl
176
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
177
178
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
179
	    << std::endl
180
181

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
182
	    << std::endl
183
	    << "  -c    enable language containment checks (implies -taa)"
184
	    << std::endl
185
	    << std::endl
186
187

	    << "Formula simplification (before translation):"
188
	    << std::endl
martinez's avatar
martinez committed
189
190
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
191
	    << "universality" << std::endl
martinez's avatar
martinez committed
192
	    << "  -r3   reduce formula using implication between "
193
	    << "sub-formulae" << std::endl
194
195
196
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
197
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
198
	    << "  -rd   display the reduced formula" << std::endl
199
	    << "  -rD   dump statistics about the simplifier cache" << std::endl
200
	    << "  -rL   disable basic rewritings producing larger formulas"
201
202
	    << std::endl
	    << "  -ru   lift formulae that are eventual and universal"
203
	    << std::endl << std::endl
204
205
206
207
208
209
210

	    << "Automaton degeneralization (after translation):"
	    << std::endl
            << "  -lS   move generalized acceptance conditions to states "
	    << "(SGBA)" << std::endl
	    << "  -D    degeneralize the automaton as a TBA" << std::endl
	    << "  -DS   degeneralize the automaton as an SBA" << std::endl
211
212
213
214
	    << "          (append z/Z, o/O, l/L: to turn on/off options "
            << "(default: zol)\n "
	    << "          z: level resetting, o: adaptive order, "
	    << "l: level cache)\n"
215
216
217
218
	    << std::endl

	    << "Automaton simplifications (after translation):"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
219
	    << "  -R3   use SCC to reduce the automaton" << std::endl
220
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
221
222
223
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
224
	    << "  -RDS  reduce the automaton with direct simulation"
225
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
226
	    << "  -RRS  reduce the automaton with reverse simulation"
Thomas Badie's avatar
Thomas Badie committed
227
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
228
	    << "  -RIS  iterate both direct and reverse simulations"
229
	    << std::endl
Thomas Badie's avatar
Thomas Badie committed
230
231
            << "  -RDCS reduce the automaton with direct simulation"
            << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
232
            << "  -Rm   attempt to WDBA-minimize the automaton" << std::endl
233
	    << std::endl
234
235
            << "  -RM   attempt to WDBA-minimize the automaton unless the "
	    << "result is bigger" << std::endl
236
	    << "  -RQ   determinize a TGBA (assuming it's legal!)" << std::endl
237
	    << std::endl
238

239
            << "Automaton conversion:" << std::endl
240
241
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
242
	    << "  -s    convert to explicit automaton, and number states "
243
	    << "in DFS order" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
244
	    << "  -S    convert to explicit automaton, and number states "
245
	    << "in BFS order" << std::endl
246
247
	    << std::endl

248
249
250
251
252
253
254
255
256
257
258
259
260
261
	    << "Conversion to Testing Automaton:" << std::endl
 	    << "  -TA   output a Generalized Testing Automaton (GTA),\n"
	    << "          or a Testing Automaton (TA) with -DS\n"
 	    << "  -lv   add an artificial livelock state to obtain a "
	    << "Single-pass (G)TA\n"
            << "  -sp   convert into a single-pass (G)TA without artificial "
	    << "livelock state\n"
	    << "  -in   do not use an artificial initial state\n"
            << "  -TGTA output a Transition-based Generalized TA"
            << std::endl
	    << "  -RT   reduce the (G)TA/TGTA using bisimulation.\n"
            << std::endl

	    << "Options for performing emptiness checks (on TGBA):" << std::endl
262
263
264
	    << "  -e[ALGO]  run emptiness check, expect and compute an "
	    << "accepting run" << std::endl
	    << "  -E[ALGO]  run emptiness check, expect no accepting run"
martinez's avatar
martinez committed
265
	    << std::endl
266
267
268
269
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
270
	    << "  -g    graph the accepting run on the automaton (requires -e)"
271
	    << std::endl
272
273
274
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
275
276
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
277
278
279
280
281
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
282
283
284
285
286
287
288
289
290
291
292
293
294
	    << "  Tau03_opt(OPTIONS)" << std::endl
	    << std::endl

	    << "If no emptiness check is run, the automaton will be output "
	    << "in dot format" << std::endl << "by default.  This can be "
	    << "changed with the following options." << std::endl
	    << std::endl

	    << "Output options (if no emptiness check):" << std::endl
	    << "  -b    output the automaton in the format of spot"
            << std::endl
            << "  -FC   dump the automaton showing future conditions on states"
	    << std::endl
295
296
297
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
298
	    << std::endl
299
300
301
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
302
303
304
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
305
	    << "  -KC   list cycles in automaton" << std::endl
306
	    << "  -KW   list weak SCCs" << std::endl
307
	    << "  -N    output the never clain for Spin (implies -DS)"
308
309
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
310
	    << " (implies -DS)" << std::endl
311
312
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
313
	    << std::endl
314
315
316
317
318
319
	    << "  -t    output automaton in LBTT's format" << std::endl
	    << std::endl

	    << "Miscellaneous options:" << std::endl
	    << "  -0    produce minimal output dedicated to the paper"
	    << std::endl
320
	    << "  -8    output UTF-8 formulae" << std::endl
321
322
323
324
	    << "  -d    turn on traces during parsing" << std::endl
            << "  -T    time the different phases of the translation"
	    << std::endl
	    << "  -v    display the BDD variables used by the automaton"
325
	    << std::endl
326
	    << std::endl;
327

328
329
330
  exit(2);
}

Thomas Badie's avatar
Thomas Badie committed
331
332
333
334
335
336
static int
to_int(const char* s)
{
  char* endptr;
  int res = strtol(s, &endptr, 10);
  if (*endptr)
337
338
339
340
    {
      std::cerr << "Failed to parse `" << s << "' as an integer." << std::endl;
      exit(1);
    }
Thomas Badie's avatar
Thomas Badie committed
341
342
343
  return res;
}

344
345
346
347
348
int
main(int argc, char** argv)
{
  int exit_code = 0;

349
  bool debug_opt = false;
350
  bool paper_opt = false;
351
  bool utf8_opt = false;
352
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
353
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
354
  enum { TransFM, TransLaCIM, TransTAA, TransCompo } translation = TransFM;
355
  bool fm_red = false;
356
  bool fm_exprop_opt = false;
357
  bool fm_symb_merge_opt = true;
358
  bool file_opt = false;
359
  bool degen_reset = true;
360
  bool degen_order = false;
361
  bool degen_cache = true;
362
  int output = 0;
363
  int formula_index = 0;
364
365
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
366
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
367
  bool expect_counter_example = false;
368
369
  bool accepting_run = false;
  bool accepting_run_replay = false;
370
  bool from_file = false;
371
372
  enum { ReadSpot, ReadLbtt, ReadNeverclaim, ReadDstar } readformat = ReadSpot;
  bool nra2nba = false;
373
  bool dra2dba = false;
374
  bool scc_filter = false;
375
  bool simpltl = false;
376
377
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false,
					   false, false, false);
378
  bool simpcache_stats = false;
379
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
380
  bool symbolic_scc_pruning = false;
381
  bool display_reduced_form = false;
382
  bool post_branching = false;
383
  bool fair_loop_approx = false;
384
  bool graph_run_opt = false;
385
  bool graph_run_tgba_opt = false;
386
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
387
  bool opt_minimize = false;
388
  bool opt_determinize = false;
389
390
  unsigned opt_determinize_threshold = 0;
  unsigned opt_o_threshold = 0;
391
  bool opt_dtgbacomp = false;
392
  bool reject_bigger = false;
393
  bool opt_bisim_ta = false;
394
  bool opt_monitor = false;
395
  bool containment = false;
396
  bool show_fc = false;
397
  bool spin_comments = false;
398
399
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
400
  spot::tgba* system_aut = 0;
401
  const spot::tgba* product_to_free = 0;
402
  spot::bdd_dict* dict = new spot::bdd_dict();
403
404
  spot::timer_map tm;
  bool use_timer = false;
Thomas Badie's avatar
Thomas Badie committed
405
  bool reduction_dir_sim = false;
Thomas Badie's avatar
Thomas Badie committed
406
  bool reduction_rev_sim = false;
407
  bool reduction_iterated_sim = false;
Thomas Badie's avatar
Thomas Badie committed
408
409
410
  bool reduction_dont_care_sim = false;
  int limit_dont_care_sim = 0;
  bool reduction_iterated_dont_care_sim = false;
Thomas Badie's avatar
Thomas Badie committed
411
  spot::tgba* temp_dir_sim = 0;
412
  bool ta_opt = false;
413
  bool tgta_opt = false;
414
  bool opt_with_artificial_initial_state = true;
415
416
  bool opt_single_pass_emptiness_check = false;
  bool opt_with_artificial_livelock = false;
Thomas Badie's avatar
Thomas Badie committed
417
  spot::tgba* temp_rev_sim = 0;
418
  spot::tgba* temp_iterated_sim = 0;
Thomas Badie's avatar
Thomas Badie committed
419
420
  spot::tgba* temp_dont_care_sim = 0;
  spot::tgba* temp_dont_care_iterated_sim = 0;
421
422
423
424
425
  bool cs_nowdba = true;
  bool cs_wdba_smaller = false;
  bool cs_nosimul = true;
  bool cs_early_start = false;
  bool cs_oblig = false;
426
427
  bool opt_complete = false;
  int opt_dtbasat = -1;
428
  int opt_dtgbasat = -1;
429

430
  for (;;)
431
    {
432
      if (argc < formula_index + 2)
433
	syntax(argv[0]);
434
435
436

      ++formula_index;

437
438
439
440
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
441
442
443
444
445
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
446
      else if (!strcmp(argv[formula_index], "-a"))
447
448
449
	{
	  output = 2;
	}
450
      else if (!strcmp(argv[formula_index], "-A"))
451
	{
452
	  output = 4;
453
	}
454
      else if (!strcmp(argv[formula_index], "-b"))
455
	{
456
	  output = 7;
457
	}
458
459
460
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
461
	  translation = TransTAA;
462
	}
463
464
465
466
467
468
469
470
471
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
472
      else if (!strcmp(argv[formula_index], "-d"))
473
474
475
	{
	  debug_opt = true;
	}
476
477
      else if (!strcmp(argv[formula_index], "-D"))
	{
478
479
	  degeneralize_opt = DegenTBA;
	}
480
481
      else if (!strcmp(argv[formula_index], "-DC"))
	{
482
	  opt_dtgbacomp = true;
483
	}
484
      else if (!strncmp(argv[formula_index], "-DS", 3))
485
486
	{
	  degeneralize_opt = DegenSBA;
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
	  const char* p = argv[formula_index] + 3;
	  while (*p)
	    {
	      switch (*p++)
		{
		case 'o':
		  degen_order = true;
		  break;
		case 'O':
		  degen_order = false;
		  break;
		case 'z':
		  degen_reset = true;
		  break;
		case 'Z':
		  degen_reset = false;
		  break;
		case 'l':
		  degen_cache = true;
		  break;
		case 'L':
		  degen_cache = false;
		  break;
		}
	    }
512
	}
513
      else if (!strncmp(argv[formula_index], "-e", 2))
514
        {
515
516
517
518
519
520
521
522
523
524
	  echeck_algo = 2 + argv[formula_index];
	  if (!*echeck_algo)
	    echeck_algo = "Cou99";

	  const char* err;
	  echeck_inst =
	    spot::emptiness_check_instantiator::construct(echeck_algo, &err);
	  if (!echeck_inst)
	    {
	      std::cerr << "Failed to parse argument of -e near `"
525
			<< err <<  '\'' << std::endl;
526
527
	      exit(2);
	    }
528
529
530
          expect_counter_example = true;
          output = -1;
        }
531
      else if (!strncmp(argv[formula_index], "-E", 2))
532
        {
533
534
535
536
537
538
539
540
541
542
	  const char* echeck_algo = 2 + argv[formula_index];
	  if (!*echeck_algo)
	    echeck_algo = "Cou99";

	  const char* err;
	  echeck_inst =
	    spot::emptiness_check_instantiator::construct(echeck_algo, &err);
	  if (!echeck_inst)
	    {
	      std::cerr << "Failed to parse argument of -e near `"
543
			<< err <<  '\'' << std::endl;
544
545
	      exit(2);
	    }
546
547
548
          expect_counter_example = false;
          output = -1;
        }
549
550
      else if (!strcmp(argv[formula_index], "-f"))
	{
551
	  translation = TransFM;
552
	}
553
      else if (!strcmp(argv[formula_index], "-fr"))
554
	{
555
	  fm_red = true;
556
	  translation = TransFM;
557
	}
558
559
560
561
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
562
563
564
565
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
566
567
      else if (!strcmp(argv[formula_index], "-g"))
	{
568
	  accepting_run = true;
569
570
	  graph_run_opt = true;
	}
571
572
      else if (!strcmp(argv[formula_index], "-G"))
	{
573
	  accepting_run = true;
574
575
	  graph_run_tgba_opt = true;
	}
576
577
578
579
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
580
581
582
583
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
584
585
586
587
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
588
589
590
591
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
592
593
594
595
596
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
597
598
	  system_aut = spot::kripke_parse(argv[formula_index] + 3,
					  pel, dict, env, debug_opt);
599
600
601
602
603
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
604
605
606
607
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
608
609
610
611
      else if (!strcmp(argv[formula_index], "-KC"))
	{
	  output = 15;
	}
612
613
614
615
      else if (!strcmp(argv[formula_index], "-KW"))
	{
	  output = 16;
	}
616
617
618
619
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
620
621
622
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
623
	  translation = TransFM;
624
	}
625
626
627
628
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
629
630
      else if (!strcmp(argv[formula_index], "-m"))
	{
631
	  opt_reduce = true;
632
	}
martinez's avatar
martinez committed
633
634
      else if (!strcmp(argv[formula_index], "-N"))
	{
635
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
636
637
	  output = 8;
	}
638
639
640
641
642
643
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
644
      else if (!strncmp(argv[formula_index], "-O", 2))
645
	{
646
	  output = 14;
647
          opt_minimize = true;
648
649
	  if (argv[formula_index][2] != 0)
	    opt_o_threshold = to_int(argv[formula_index] + 2);
650
	}
651
652
653
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
654
	  translation = TransFM;
655
	}
656
657
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
658
659
	  tm.start("reading -P's argument");

660
	  spot::tgba_parse_error_list pel;
661
	  spot::tgba_digraph* s;
662
663
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
664
665
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
666
	    return 2;
667
	  s->merge_transitions();
668
	  tm.stop("reading -P's argument");
669
	  system_aut = s;
670
	}
671
672
      else if (!strcmp(argv[formula_index], "-r"))
	{
673
674
	  output = 1;
	}
675
676
      else if (!strcmp(argv[formula_index], "-r1"))
	{
677
678
	  simpltl = true;
	  redopt.reduce_basics = true;
679
680
681
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
682
683
	  simpltl = true;
	  redopt.event_univ = true;
684
685
686
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
687
688
	  simpltl = true;
	  redopt.synt_impl = true;
689
690
691
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
692
693
694
695
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
696
	}
697
698
      else if (!strcmp(argv[formula_index], "-r5"))
	{
699
700
	  simpltl = true;
	  redopt.containment_checks = true;
701
702
703
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
704
705
706
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
707
708
709
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
710
711
712
713
714
715
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
716
	}
717
718
719
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
720
	}
721
722
723
724
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
725
	{
726
	  // For backward compatibility, make all these options
727
	  // equal to -RDS.
728
	  reduction_dir_sim = true;
729
	}
Thomas Badie's avatar
Thomas Badie committed
730
731
732
733
      else if (!strcmp(argv[formula_index], "-RRS"))
        {
          reduction_rev_sim = true;
        }
734
735
      else if (!strcmp(argv[formula_index], "-R3"))
	{
736
	  scc_filter = true;
737
	}
738
739
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
740
	  scc_filter = true;
741
742
	  scc_filter_all = true;
	}
743
744
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
745
	  symbolic_scc_pruning = true;
746
	}
747
748
      else if (!strcmp(argv[formula_index], "-rd"))
	{
749
	  display_reduced_form = true;
750
	}
751
752
753
754
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
755
756
757
758
      else if (!strcmp(argv[formula_index], "-RC"))
	{
	  opt_complete = true;
	}
759
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
760
        {
761
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
762
        }
763
764
765
766
      else if (!strcmp(argv[formula_index], "-RIS"))
        {
          reduction_iterated_sim = true;
        }
Thomas Badie's avatar
Thomas Badie committed
767
768
769
770
771
772
773
774
775
776
777
778
      else if (!strncmp(argv[formula_index], "-RDCS", 5))
        {
          reduction_dont_care_sim = true;
          if (argv[formula_index][5] == '=')
            limit_dont_care_sim = to_int(argv[formula_index] + 6);
        }
      else if (!strncmp(argv[formula_index], "-RDCIS", 6))
        {
          reduction_iterated_dont_care_sim = true;
          if (argv[formula_index][6] == '=')
            limit_dont_care_sim = to_int(argv[formula_index] + 7);
        }
779
      else if (!strcmp(argv[formula_index], "-rL"))
780
781
782
783
784
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
785
786
787
788
789
790
791
792
      else if (!strncmp(argv[formula_index], "-RG", 3))
        {
	  if (argv[formula_index][3] != 0)
	    opt_dtgbasat = to_int(argv[formula_index] + 3);
	  else
	    opt_dtgbasat = 0;
          //output = -1;
        }
793
794
795
796
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
797
798
799
800
801
      else if (!strcmp(argv[formula_index], "-RM"))
        {
          opt_minimize = true;
	  reject_bigger = true;
        }
802
      else if (!strncmp(argv[formula_index], "-RQ", 3))
803
804
        {
          opt_determinize = true;
805
806
	  if (argv[formula_index][3] != 0)
	    opt_determinize_threshold = to_int(argv[formula_index] + 3);
807
        }
808
809
810
811
812
      else if (!strncmp(argv[formula_index], "-RS", 3))
        {
	  if (argv[formula_index][3] != 0)
	    opt_dtbasat = to_int(argv[formula_index] + 3);
	  else
813
	    opt_dtbasat = 0;
814
815
          //output = -1;
        }
816
817
818
      else if (!strcmp(argv[formula_index], "-RT"))
        {
          opt_bisim_ta = true;
819
820
821
822
823
824
	}
      else if (!strcmp(argv[formula_index], "-ru"))
        {
	  simpltl = true;
	  redopt.event_univ = true;
	  redopt.favor_event_univ = true;
825
        }
826
827
828
829
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
830
831
832
833
834
835
836
837
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
838
839
840
841
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
842
843
844
845
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
846
847
848
849
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
850
      else if (!strcmp(argv[formula_index], "-TGTA"))
851
        {
852
          tgta_opt = true;
853
        }
854
855
856
857
      else if (!strcmp(argv[formula_index], "-lv"))
        {
          opt_with_artificial_livelock = true;
        }
858
859
860
861
      else if (!strcmp(argv[formula_index], "-sp"))
        {
          opt_single_pass_emptiness_check = true;
        }
862
863
864
865
      else if (!strcmp(argv[formula_index], "-in"))
        {
          opt_with_artificial_initial_state = false;
        }
866
867
868
869
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
870
871
872
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
873
	  translation = TransFM;
874
	  // Parse -U's argument.
875
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
876
877
878
	  while (tok)
	    {
	      unobservables->insert
879
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
880
	      tok = strtok(0, ", \t;");
881
882
	    }
	}
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
      else if (!strncmp(argv[formula_index], "-u", 2))
	{
	  translation = TransCompo;
	  const char* c = argv[formula_index] + 2;
	  while (*c != 0)
	    {
	      switch (*c)
		{
		case '2':
		  cs_nowdba = false;
		  cs_wdba_smaller = true;
		  break;
		case 'w':
		  cs_nowdba = false;
		  cs_wdba_smaller = false;
		  break;
		case 's':
		  cs_nosimul = false;
		  break;
		case 'e':
		  cs_early_start = true;
		  break;
		case 'W':
		  cs_nowdba = true;
		  break;
		case 'S':
		  cs_nosimul = true;
		  break;
		case 'E':
		  cs_early_start = false;
		  break;
		case 'o':
		  cs_oblig = true;
		  break;
		case 'O':
		  cs_oblig = false;
		  break;
		default:
		  std::cerr << "Unknown suboption `" << *c
			    << "' for option -u" << std::endl;
		}
	      ++c;
	    }
	}
927
928
929
930
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
931
932
      else if (!strcmp(argv[formula_index], "-x"))
	{
933
	  translation = TransFM;
934
935
	  fm_exprop_opt = true;
	}
936
937
938
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
939
	  readformat = ReadSpot;
940
	}
941
      else if (!strcmp(argv[formula_index], "-XD"))
942
943
	{
	  from_file = true;
944
945
946
947
948
949
950
	  readformat = ReadDstar;
	}
      else if (!strcmp(argv[formula_index], "-XDB"))
	{
	  from_file = true;
	  readformat = ReadDstar;
	  nra2nba = true;
951
	}
952
953
954
955
956
957
958
      else if (!strcmp(argv[formula_index], "-XDD"))
	{
	  from_file = true;
	  readformat = ReadDstar;
	  nra2nba = true;
	  dra2dba = true;
	}
959
960
961
      else if (!strcmp(argv[formula_index], "-XL"))
	{
	  from_file = true;
962
963
964
965
966
967
	  readformat = ReadLbtt;
	}
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  readformat = ReadNeverclaim;
968
	}
969
970
      else if (!strcmp(argv[formula_index], "-y"))
	{
971
	  translation = TransFM;
972
973
	  fm_symb_merge_opt = false;
	}
974
975
976
977
      else
	{
	  break;
	}
978
979
    }

980
  if ((graph_run_opt || graph_run_tgba_opt)
981
      && (!echeck_inst || !expect_counter_example))
982
    {
983
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;