ltl2tgba.cc 39.5 KB
Newer Older
1
// Copyright (C) 2007, 2008, 2009, 2010, 2011 Laboratoire de Recherche et
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
2
// Dveloppement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
3
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
// Paris 6 (LIP6), dpartement Systmes Rpartis
5
// Coopratifs (SRC), Universit Pierre et Marie Curie.
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//
// 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.

24
#include <iostream>
25
#include <iomanip>
26
#include <cassert>
27
28
#include <fstream>
#include <string>
29
#include <cstdlib>
30
#include "ltlvisit/contain.hh"
31
#include "ltlvisit/tostring.hh"
32
#include "ltlvisit/apcollect.hh"
33
#include "ltlast/allnodes.hh"
34
#include "ltlparse/public.hh"
35
#include "tgbaalgos/ltl2tgba_lacim.hh"
36
#include "tgbaalgos/ltl2tgba_fm.hh"
37
#include "tgbaalgos/ltl2taa.hh"
38
#include "tgba/bddprint.hh"
39
#include "tgbaalgos/save.hh"
40
#include "tgbaalgos/dotty.hh"
41
#include "tgbaalgos/lbtt.hh"
42
#include "tgba/tgbatba.hh"
43
#include "tgba/tgbasgba.hh"
44
#include "tgba/tgbaproduct.hh"
45
#include "tgba/futurecondcol.hh"
46
#include "tgbaalgos/reducerun.hh"
47
#include "tgbaparse/public.hh"
48
#include "neverparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "tgbaalgos/neverclaim.hh"
52
#include "tgbaalgos/reductgba_sim.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

62
#include "tgbaalgos/stats.hh"
63
#include "tgbaalgos/scc.hh"
64
65
#include "tgbaalgos/emptiness_stats.hh"

66
67
68
69
70
71
72
73
74
75
76
77
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)	   \
78
79
80
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
81
82
83
  return s;
}

84
85
86
void
syntax(char* prog)
{
87
88
89
90
91
  // 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;

92
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
93
	    << std::endl
94
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
95
	    << std::endl
96
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
97
	    << std::endl
98

99
100
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
101
102
103
104
	    << "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
105
	    << std::endl
106
107
108

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
109
	    << std::endl
110
	    << "  -X    do not compute an automaton, read it from a file"
111
	    << std::endl
112
113
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
114
115
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
116
	    << std::endl
117
118
119
	    << std::endl

	    << "Translation algorithm:" << std::endl
120
            << "  -f    use Couvreur's FM algorithm for LTL"
121
	    << "(default)"
122
	    << std::endl
123
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
124
	    << std::endl
125
126
127
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
128
	    << std::endl
129
130
131
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
132
133
134
135
	    << "  -fr1  use -r1 (see below) at each step of FM" << std::endl
	    << "  -fr2  use -r2 (see below) at each step of FM" << std::endl
	    << "  -fr3  use -r3 (see below) at each step of FM" << std::endl
	    << "  -fr4  use -r4 (see below) at each step of FM" << std::endl
136
137
138
	    << "  -fr5  use -r5 (see below) at each step of FM" << std::endl
	    << "  -fr6  use -r6 (see below) at each step of FM" << std::endl
	    << "  -fr7  use -r7 (see below) at each step of FM" << std::endl
139
140
141
142
143
            << "  -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)"
144
	    << std::endl
145
146
147
148
            << "  -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
149
	    << std::endl
150

151
152
	    << "Options for Couvreur's LaCIM algorithm (-l or -le):"
	    << std::endl
153
154
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
155
	    << std::endl
156
	    << "  -A    same as -a, but as a set" << std::endl
157
158
	    << "  -lo   pre-define standard LTL operators as automata "
	    << "(implies -le)" << std::endl
159
	    << "  -r    display the relation BDD, not the reachability graph"
160
	    << std::endl
161
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
162
163
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
164
	    << std::endl
165
166

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
167
	    << std::endl
168
	    << "  -c    enable language containment checks (implies -taa)"
169
	    << std::endl
170
	    << std::endl
171
172

	    << "Formula simplification (before translation):"
173
	    << std::endl
martinez's avatar
martinez committed
174
175
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
176
	    << "universality" << std::endl
martinez's avatar
martinez committed
177
	    << "  -r3   reduce formula using implication between "
178
	    << "sub-formulae" << std::endl
179
180
181
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
182
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
183
184
185
186
187
188
189
190
191
192
193
194
195
	    << "  -rd   display the reduced formula" << std::endl
	    << std::endl

	    << "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
	    << std::endl

	    << "Automaton simplifications (after translation):"
	    << std::endl
196
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
197
	    << "(use -L for more reduction)"
198
	    << std::endl
199
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
200
	    << "(use -L for more reduction)"
201
	    << std::endl
202
203
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
204
	    << std::endl
205
	    << "  -R3   use SCC to reduce the automata" << std::endl
206
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
207
208
209
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
210
211
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
Felix Abecassis's avatar
Felix Abecassis committed
212
            << "  -Rm   attempt to minimize the automata" << std::endl
213
	    << std::endl
214

215
            << "Automaton conversion:" << std::endl
216
217
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
218
219
220
221
	    << "  -s    convert to explicit automata, and number states "
	    << "in DFS order" << std::endl
	    << "  -S    convert to explicit automata, and number states "
	    << "in BFS order" << std::endl
222
223
	    << std::endl

224
225
226
227
	    << "Options for performing emptiness checks:" << std::endl
	    << "  -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
228
	    << std::endl
229
230
231
232
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
233
	    << "  -g    graph the accepting run on the automaton (requires -e)"
234
	    << std::endl
235
236
237
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
238
239
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
240
241
242
243
244
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
245
246
247
248
249
250
251
252
253
254
255
256
257
	    << "  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
258
259
260
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
261
	    << std::endl
262
263
264
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
265
266
267
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
268
	    << "  -N    output the never clain for Spin (implies -DS)"
269
270
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
271
	    << " (implies -DS)" << std::endl
272
273
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
274
	    << std::endl
275
276
277
278
279
280
281
282
283
284
285
	    << "  -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
	    << "  -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"
	    << std::endl;
286
287
288
289
290
291
292
293
  exit(2);
}

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

294
  bool debug_opt = false;
295
  bool paper_opt = false;
296
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
297
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
298
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
299
    translation = TransFM;
300
  int fm_red = spot::ltl::Reduce_None;
301
  bool fm_exprop_opt = false;
302
  bool fm_symb_merge_opt = true;
303
  bool file_opt = false;
304
  int output = 0;
305
  int formula_index = 0;
306
307
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
308
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
309
  bool expect_counter_example = false;
310
311
  bool accepting_run = false;
  bool accepting_run_replay = false;
312
  bool from_file = false;
313
  bool read_neverclaim = false;
314
  int reduc_aut = spot::Reduce_None;
315
  int redopt = spot::ltl::Reduce_None;
316
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
317
  bool symbolic_scc_pruning = false;
318
319
  bool display_reduce_form = false;
  bool display_rel_sim = false;
320
  bool display_parity_game = false;
321
  bool post_branching = false;
322
  bool fair_loop_approx = false;
323
  bool graph_run_opt = false;
324
  bool graph_run_tgba_opt = false;
325
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
326
  bool opt_minimize = false;
327
  bool opt_monitor = false;
328
  bool containment = false;
329
  bool show_fc = false;
330
  bool spin_comments = false;
331
332
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
333
  spot::tgba_explicit_string* system = 0;
334
335
  const spot::tgba* product = 0;
  const spot::tgba* product_to_free = 0;
336
  spot::bdd_dict* dict = new spot::bdd_dict();
337
338
  spot::timer_map tm;
  bool use_timer = false;
339
  bool assume_sba = false;
340

341
  for (;;)
342
    {
343
      if (argc < formula_index + 2)
344
	syntax(argv[0]);
345
346
347

      ++formula_index;

348
349
350
351
352
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-a"))
353
354
355
	{
	  output = 2;
	}
356
      else if (!strcmp(argv[formula_index], "-A"))
357
	{
358
	  output = 4;
359
	}
360
      else if (!strcmp(argv[formula_index], "-b"))
361
	{
362
	  output = 7;
363
	}
364
365
366
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
367
	  translation = TransTAA;
368
	}
369
370
371
372
373
374
375
376
377
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
378
      else if (!strcmp(argv[formula_index], "-d"))
379
380
381
	{
	  debug_opt = true;
	}
382
383
      else if (!strcmp(argv[formula_index], "-D"))
	{
384
385
386
387
388
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
389
	}
390
      else if (!strncmp(argv[formula_index], "-e", 2))
391
        {
392
393
394
395
396
397
398
399
400
401
402
403
404
	  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 `"
			<< err <<  "'" << std::endl;
	      exit(2);
	    }
405
406
407
          expect_counter_example = true;
          output = -1;
        }
408
      else if (!strncmp(argv[formula_index], "-E", 2))
409
        {
410
411
412
413
414
415
416
417
418
419
420
421
422
	  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 `"
			<< err <<  "'" << std::endl;
	      exit(2);
	    }
423
424
425
          expect_counter_example = false;
          output = -1;
        }
426
427
      else if (!strcmp(argv[formula_index], "-f"))
	{
428
	  translation = TransFM;
429
	}
430
431
      else if (!strcmp(argv[formula_index], "-fr1"))
	{
432
	  translation = TransFM;
433
434
435
436
	  fm_red |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-fr2"))
	{
437
	  translation = TransFM;
438
439
440
441
	  fm_red |= spot::ltl::Reduce_Eventuality_And_Universality;
	}
      else if (!strcmp(argv[formula_index], "-fr3"))
	{
442
	  translation = TransFM;
443
444
445
	  fm_red |= spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr4"))
446
	{
447
	  translation = TransFM;
448
449
450
451
452
453
 	  fm_red |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr5"))
	{
454
	  translation = TransFM;
455
456
457
458
	  fm_red |= spot::ltl::Reduce_Containment_Checks;
	}
      else if (!strcmp(argv[formula_index], "-fr6"))
	{
459
	  translation = TransFM;
460
461
462
	  fm_red |= spot::ltl::Reduce_Containment_Checks_Stronger;
	}
      else if (!strcmp(argv[formula_index], "-fr7"))
463
	{
464
	  translation = TransFM;
465
466
	  fm_red |= spot::ltl::Reduce_All;
	}
467
468
469
470
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
471
472
473
474
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
475
476
      else if (!strcmp(argv[formula_index], "-g"))
	{
477
	  accepting_run = true;
478
479
	  graph_run_opt = true;
	}
480
481
      else if (!strcmp(argv[formula_index], "-G"))
	{
482
	  accepting_run = true;
483
484
	  graph_run_tgba_opt = true;
	}
485
486
487
488
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
489
490
491
492
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
493
494
495
496
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
497
498
499
500
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
501
502
503
504
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
505
506
507
508
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
509
510
511
512
513
514
515
516
517
518
      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;
	}
519
520
521
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
522
	  translation = TransFM;
523
	}
524
525
526
527
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
528
529
      else if (!strcmp(argv[formula_index], "-m"))
	{
530
	  opt_reduce = true;
531
	}
martinez's avatar
martinez committed
532
533
      else if (!strcmp(argv[formula_index], "-N"))
	{
534
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
535
536
	  output = 8;
	}
537
538
539
540
541
542
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
543
544
      else if (!strcmp(argv[formula_index], "-O"))
	{
545
	  output = 14;
546
          opt_minimize = true;
547
	}
548
549
550
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
551
	  translation = TransFM;
552
	}
553
554
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
555
556
	  tm.start("reading -P's argument");

557
558
	  spot::tgba_parse_error_list pel;
	  system = spot::tgba_parse(argv[formula_index] + 2,
559
				    pel, dict, env, env, debug_opt);
560
561
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
562
563
	    return 2;
	  system->merge_transitions();
564

565
	  tm.stop("reading -P's argument");
566
	}
567
568
      else if (!strcmp(argv[formula_index], "-r"))
	{
569
570
	  output = 1;
	}
571
572
573
574
575
576
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
577
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
578
579
580
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
581
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
582
583
584
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
585
586
587
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
588
	}
589
590
      else if (!strcmp(argv[formula_index], "-r5"))
	{
591
	  redopt |= spot::ltl::Reduce_Containment_Checks;
592
593
594
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
595
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
596
597
598
599
600
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
601
602
603
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
604
	}
martinez's avatar
martinez committed
605
606
607
608
609
610
611
612
613
      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"))
614
	{
martinez's avatar
martinez committed
615
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
616
	}
martinez's avatar
martinez committed
617
      else if (!strcmp(argv[formula_index], "-R2t"))
618
	{
martinez's avatar
martinez committed
619
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
620
621
622
623
624
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
625
626
627
628
629
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
630
631
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
632
	  symbolic_scc_pruning = true;
633
	}
634
635
636
637
638
639
640
641
642
643
644
645
      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;
	}
Felix Abecassis's avatar
Felix Abecassis committed
646
647
648
649
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
650
651
652
653
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
654
655
656
657
658
659
660
661
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
662
663
664
665
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
666
667
668
669
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
670
671
672
673
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
674
675
676
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
677
	  translation = TransFM;
678
	  // Parse -U's argument.
679
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
680
681
682
683
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
684
	      tok = strtok(0, ", \t;");
685
686
	    }
	}
687
688
689
690
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
691
692
      else if (!strcmp(argv[formula_index], "-x"))
	{
693
	  translation = TransFM;
694
695
	  fm_exprop_opt = true;
	}
696
697
698
699
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
700
701
702
703
704
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
705
706
      else if (!strcmp(argv[formula_index], "-y"))
	{
707
	  translation = TransFM;
708
709
	  fm_symb_merge_opt = false;
	}
710
711
712
713
      else
	{
	  break;
	}
714
715
    }

716
  if ((graph_run_opt || graph_run_tgba_opt)
717
      && (!echeck_inst || !expect_counter_example))
718
    {
719
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
720
721
722
      exit(1);
    }

723
724
725
726
  std::string input;

  if (file_opt)
    {
727
      tm.start("reading formula");
728
      if (strcmp(argv[formula_index], "-"))
729
	{
730
	  std::ifstream fin(argv[formula_index]);
731
	  if (!fin)
732
733
734
735
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
736

737
	  if (!std::getline(fin, input, '\0'))
738
739
740
741
742
743
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
744
	{
745
	  std::getline(std::cin, input, '\0');
746
	}
747
      tm.stop("reading formula");
748
749
750
751
752
753
    }
  else
    {
      input = argv[formula_index];
    }

754
  spot::ltl::formula* f = 0;
755
  if (!from_file) // Reading a formula, not reading an automaton from a file.
756
    {
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA:
	  {
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
	  }
	  break;
	case TransLaCIM_ELTL:
	  {
	    spot::eltl::parse_error_list p;
	    tm.start("parsing formula");
	    f = spot::eltl::parse_string(input, p, env, false);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
	case TransLaCIM_ELTL_ops:
	  {
	    // Call the LTL parser first to handle operators such as
	    // [] or <> and rewrite the output as a string with G or F.
	    // Then prepend definitions of usual LTL operators, and parse
	    // the result again as an ELTL formula.
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    input = ltl_defs();
	    input += "%";
	    input += spot::ltl::to_string(f, true);
	    f->destroy();
	    spot::eltl::parse_error_list p;
	    f = spot::eltl::parse_string(input, p, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
798
	}
799
800
    }
  if (f || from_file)
801
    {
802
803
804
      const spot::tgba_bdd_concrete* concrete = 0;
      const spot::tgba* to_free = 0;
      const spot::tgba* a = 0;
805

806
807
      if (from_file)
	{
808
	  spot::tgba_explicit_string* e;
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
	  if (!read_neverclaim)
	    {
	      spot::tgba_parse_error_list pel;
	      tm.start("parsing automaton");
	      to_free = a = e = spot::tgba_parse(input, pel, dict,
						 env, env, debug_opt);
	      tm.stop("parsing automaton");
	      if (spot::format_tgba_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
		}
	    }
	  else
824
	    {
825
	      spot::neverclaim_parse_error_list pel;
826
	      tm.start("parsing neverclaim");
827
828
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
829
	      tm.stop("parsing neverclaim");
830
831
832
833
834
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
835
		}
836
	    }
837
	  e->merge_transitions();
838
	}
839
      else
840
	{
841
	  if (redopt != spot::ltl::Reduce_None)
842
	    {
843
	      tm.start("reducing formula");
844
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
845
	      f->destroy();
846
	      tm.stop("reducing formula");
847
	      f = t;
848
849
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
850
	    }
851

852
	  tm.start("translating formula");
853
854
855
856
857
858
859
860
	  switch (translation)
	    {
	    case TransFM:
	      a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
				       fm_symb_merge_opt,
				       post_branching,
				       fair_loop_approx,
				       unobservables,
861
				       fm_red);
862
863
864
865
866
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
867
868
869
870
871
	      a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      break;
	    case TransLaCIM_ELTL:
	    case TransLaCIM_ELTL_ops:
	      a = concrete = spot::eltl_to_tgba_lacim(f, dict);
872
873
	      break;
	    }
874
	  tm.stop("translating formula");
875
	  to_free = a;
876
	}
877

878
879
      if (opt_monitor && ((reduc_aut & spot::Reduce_Scc) == 0))
	{
880
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
881
882
883
884
885
	    symbolic_scc_pruning = true;
	  else
	    reduc_aut |= spot::Reduce_Scc;
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
886
887
      if (symbolic_scc_pruning)
        {
888
889
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
890
891
892
893
894
895
896
897
898
899
900
901
902
	  if (!bc)
	    {
	      std::cerr << ("Error: Automaton is not symbolic: cannot "
			    "prune SCCs symbolically.\n"
			    "       Try -R3 instead of -R3b, or use "
			    "another translation.")
			<< std::endl;
	      exit(2);
	    }
	  else
	    {
	      tm.start("reducing A_f w/ symbolic SCC pruning");
	      if (bc)
903
904
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
905
906
907
908
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

909
910
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
911
      const spot::tgba* aut_scc = 0;
912
913
914
      if (reduc_aut & spot::Reduce_Scc)
	{
	  tm.start("reducing A_f w/ SCC");
915
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
916
917
918
	  tm.stop("reducing A_f w/ SCC");
	}

919
920
      const spot::tgba_tba_proxy* degeneralized = 0;
      const spot::tgba_sgba_proxy* state_labeled = 0;
921

922
923
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
924
	  && degeneralize_opt == NoDegen
925
926
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
927
	degeneralize_opt = DegenTBA;
928

929
      if (degeneralize_opt == DegenTBA)
930
931
932
	{
	  a = degeneralized = new spot::tgba_tba_proxy(a);
	}
933
      else if (degeneralize_opt == DegenSBA)
934
935
936
937
	{
	  a = degeneralized = new spot::tgba_sba_proxy(a);
	  assume_sba = true;
	}
938
      else if (labeling_opt == StateLabeled)
939
940
941
	{
	  a = state_labeled = new spot::tgba_sgba_proxy(a);
	}
942

943
      const spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
944
      if (opt_minimize)
945
	{
946
947
948
949
950
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
951
	    {
952
	      // if (!f)
953
954
955
956
957
958
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
959
	    }
960
961
962
963
964
965
966
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
967
	      assume_sba = true;
968
	    }
969
	}
Felix Abecassis's avatar
Felix Abecassis committed
970

971
972
973
      if (opt_monitor)
	{
	  tm.start("Monitor minimization");
974
	  a = minimized = minimize_monitor(a);
975
	  tm.stop("Monitor minimization");
976
977
978
	  assume_sba = false; 	// All states are accepting, so double
				// circles in the dot output are
				// pointless.
979
980
	}

981
982
983
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
984
	  if (reduc_aut & ~spot::Reduce_Scc)
985
	    {
986
	      tm.start("reducing A_f w/ sim.");
987
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
988
989

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
990
991
992
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
993
		{
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
		  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))
		    {
		      rel_dir =
			spot::get_direct_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_dir);
		    }
		  if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
					spot::Reduce_transition_Del_Sim))
		    {
		      rel_del =
			spot::get_delayed_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_del);
		    }

		  if (display_rel_sim)
		    {
		      if (rel_dir)
			aut_red->display_rel_sim(rel_dir, std::cout);
		      if (rel_del)
			aut_red->display_rel_sim(rel_del, std::cout);
		    }

		  if (reduc_aut & spot::Reduce_quotient_Dir_Sim)
		    aut_red->quotient_state(rel_dir