ltl2tgba.cc 57.1 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/eltl2tgba_lacim.hh"
58
#include "tgbaalgos/gtec/gtec.hh"
59
#include "eltlparse/public.hh"
60
#include "misc/timer.hh"
61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/emptiness_stats.hh"
64
#include "tgbaalgos/scc.hh"
65
#include "tgbaalgos/isdet.hh"
66
#include "tgbaalgos/cycles.hh"
67
#include "tgbaalgos/isweakscc.hh"
68
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
69
#include "tgbaalgos/simulation.hh"
70
#include "tgbaalgos/compsusp.hh"
71
#include "tgbaalgos/powerset.hh"
72
#include "tgbaalgos/dtgbacomp.hh"
73
74
#include "tgbaalgos/complete.hh"
#include "tgbaalgos/dtbasat.hh"
75
#include "tgbaalgos/dtgbasat.hh"
76

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

81
82
83
84
85
86
87
88
89
90
91
92
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)	   \
93
94
95
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
96
97
98
  return s;
}

99
100
101
void
syntax(char* prog)
{
102
103
104
105
106
  // 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;

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

114
115
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
116
117
118
119
	    << "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
120
	    << std::endl
121
122
123

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

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
157
158
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
159
160
161
162
163
            << "  -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)"
164
	    << std::endl
165
166
167
168
            << "  -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
169
	    << std::endl
170

171
172
	    << "Options for Couvreur's LaCIM algorithm (-l or -le):"
	    << std::endl
173
174
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
175
	    << std::endl
176
	    << "  -A    same as -a, but as a set" << std::endl
177
178
	    << "  -lo   pre-define standard LTL operators as automata "
	    << "(implies -le)" << std::endl
179
	    << "  -r    display the relation BDD, not the reachability graph"
180
	    << std::endl
181
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
182
183
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
184
	    << std::endl
185
186

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
187
	    << std::endl
188
	    << "  -c    enable language containment checks (implies -taa)"
189
	    << std::endl
190
	    << std::endl
191
192

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

	    << "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
216
217
218
219
	    << "          (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"
220
221
222
223
	    << std::endl

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

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

253
254
255
256
257
258
259
260
261
262
263
264
265
266
	    << "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
267
268
269
	    << "  -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
270
	    << std::endl
271
272
273
274
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
275
	    << "  -g    graph the accepting run on the automaton (requires -e)"
276
	    << std::endl
277
278
279
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
280
281
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
282
283
284
285
286
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
287
288
289
290
291
292
293
294
295
296
297
298
299
	    << "  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
300
301
302
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
303
	    << std::endl
304
305
306
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
307
308
309
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
310
	    << "  -KC   list cycles in automaton" << std::endl
311
	    << "  -KW   list weak SCCs" << std::endl
312
	    << "  -N    output the never clain for Spin (implies -DS)"
313
314
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
315
	    << " (implies -DS)" << std::endl
316
317
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
318
	    << std::endl
319
320
321
322
323
324
	    << "  -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
325
	    << "  -8    output UTF-8 formulae" << std::endl
326
327
328
329
	    << "  -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"
330
	    << std::endl
331
	    << std::endl;
332

333
334
335
  exit(2);
}

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

349
350
351
352
353
int
main(int argc, char** argv)
{
  int exit_code = 0;

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

437
  for (;;)
438
    {
439
      if (argc < formula_index + 2)
440
	syntax(argv[0]);
441
442
443

      ++formula_index;

444
445
446
447
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
448
449
450
451
452
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
453
      else if (!strcmp(argv[formula_index], "-a"))
454
455
456
	{
	  output = 2;
	}
457
      else if (!strcmp(argv[formula_index], "-A"))
458
	{
459
	  output = 4;
460
	}
461
      else if (!strcmp(argv[formula_index], "-b"))
462
	{
463
	  output = 7;
464
	}
465
466
467
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
468
	  translation = TransTAA;
469
	}
470
471
472
473
474
475
476
477
478
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
479
      else if (!strcmp(argv[formula_index], "-d"))
480
481
482
	{
	  debug_opt = true;
	}
483
484
      else if (!strcmp(argv[formula_index], "-D"))
	{
485
486
	  degeneralize_opt = DegenTBA;
	}
487
488
      else if (!strcmp(argv[formula_index], "-DC"))
	{
489
	  opt_dtgbacomp = true;
490
	}
491
      else if (!strncmp(argv[formula_index], "-DS", 3))
492
493
	{
	  degeneralize_opt = DegenSBA;
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
	  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;
		}
	    }
519
	}
520
      else if (!strncmp(argv[formula_index], "-e", 2))
521
        {
522
523
524
525
526
527
528
529
530
531
	  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 `"
532
			<< err <<  '\'' << std::endl;
533
534
	      exit(2);
	    }
535
536
537
          expect_counter_example = true;
          output = -1;
        }
538
      else if (!strncmp(argv[formula_index], "-E", 2))
539
        {
540
541
542
543
544
545
546
547
548
549
	  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 `"
550
			<< err <<  '\'' << std::endl;
551
552
	      exit(2);
	    }
553
554
555
          expect_counter_example = false;
          output = -1;
        }
556
557
      else if (!strcmp(argv[formula_index], "-f"))
	{
558
	  translation = TransFM;
559
	}
560
      else if (!strcmp(argv[formula_index], "-fr"))
561
	{
562
	  fm_red = true;
563
	  translation = TransFM;
564
	}
565
566
567
568
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
569
570
571
572
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
573
574
      else if (!strcmp(argv[formula_index], "-g"))
	{
575
	  accepting_run = true;
576
577
	  graph_run_opt = true;
	}
578
579
      else if (!strcmp(argv[formula_index], "-G"))
	{
580
	  accepting_run = true;
581
582
	  graph_run_tgba_opt = true;
	}
583
584
585
586
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
587
588
589
590
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
591
592
593
594
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
595
596
597
598
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
599
600
601
602
603
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
604
605
	  system_aut = spot::kripke_parse(argv[formula_index] + 3,
					  pel, dict, env, debug_opt);
606
607
608
609
610
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
611
612
613
614
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
615
616
617
618
      else if (!strcmp(argv[formula_index], "-KC"))
	{
	  output = 15;
	}
619
620
621
622
      else if (!strcmp(argv[formula_index], "-KW"))
	{
	  output = 16;
	}
623
624
625
626
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
627
628
629
630
631
632
633
634
635
636
      else if (!strcmp(argv[formula_index], "-le"))
	{
	  /* -lo is documented to imply -le, so do not overwrite it. */
	  if (translation != TransLaCIM_ELTL_ops)
	    translation = TransLaCIM_ELTL;
	}
      else if (!strcmp(argv[formula_index], "-lo"))
	{
	  translation = TransLaCIM_ELTL_ops;
	}
637
638
639
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
640
	  translation = TransFM;
641
	}
642
643
644
645
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
646
647
      else if (!strcmp(argv[formula_index], "-m"))
	{
648
	  opt_reduce = true;
649
	}
martinez's avatar
martinez committed
650
651
      else if (!strcmp(argv[formula_index], "-N"))
	{
652
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
653
654
	  output = 8;
	}
655
656
657
658
659
660
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
661
      else if (!strncmp(argv[formula_index], "-O", 2))
662
	{
663
	  output = 14;
664
          opt_minimize = true;
665
666
	  if (argv[formula_index][2] != 0)
	    opt_o_threshold = to_int(argv[formula_index] + 2);
667
	}
668
669
670
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
671
	  translation = TransFM;
672
	}
673
674
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
675
676
	  tm.start("reading -P's argument");

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