ltl2tgba.cc 38 KB
Newer Older
1
2
3
// -*- coding: utf-8 -*-
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
5
6
// Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (SRC), Université Pierre et Marie Curie.
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
//
// 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.

25
#include <iostream>
26
#include <iomanip>
27
#include <cassert>
28
29
#include <fstream>
#include <string>
30
#include <cstdlib>
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/replayrun.hh"
53
#include "tgbaalgos/rundotdec.hh"
54
#include "tgbaalgos/sccfilter.hh"
55
#include "tgbaalgos/safety.hh"
56
#include "tgbaalgos/eltl2tgba_lacim.hh"
57
#include "tgbaalgos/gtec/gtec.hh"
58
#include "eltlparse/public.hh"
59
#include "misc/timer.hh"
60
#include "tgbaalgos/stats.hh"
61
#include "tgbaalgos/scc.hh"
62
#include "tgbaalgos/emptiness_stats.hh"
63
64
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
65
#include "tgbaalgos/simulation.hh"
66

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

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

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

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

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

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
134
135
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
136
137
138
139
140
            << "  -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)"
141
	    << std::endl
142
143
144
145
            << "  -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
146
	    << std::endl
147

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

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

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

	    << "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
194
	    << "  -R3   use SCC to reduce the automata" << std::endl
195
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
196
197
198
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
199
200
201
	    << "  -RDS  minimize the automaton with direct simulation"
	    << std::endl
            << "  -Rm   attempt to WDBA-minimize the automata" << std::endl
202
	    << std::endl
203

204
            << "Automaton conversion:" << std::endl
205
206
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
207
208
209
210
	    << "  -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
211
212
	    << std::endl

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

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

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

334

335
  for (;;)
336
    {
337
      if (argc < formula_index + 2)
338
	syntax(argv[0]);
339
340
341

      ++formula_index;

342
343
344
345
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
346
347
348
349
350
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
351
      else if (!strcmp(argv[formula_index], "-a"))
352
353
354
	{
	  output = 2;
	}
355
      else if (!strcmp(argv[formula_index], "-A"))
356
	{
357
	  output = 4;
358
	}
359
      else if (!strcmp(argv[formula_index], "-b"))
360
	{
361
	  output = 7;
362
	}
363
364
365
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
366
	  translation = TransTAA;
367
	}
368
369
370
371
372
373
374
375
376
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
377
      else if (!strcmp(argv[formula_index], "-d"))
378
379
380
	{
	  debug_opt = true;
	}
381
382
      else if (!strcmp(argv[formula_index], "-D"))
	{
383
384
385
386
387
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
388
	}
389
      else if (!strncmp(argv[formula_index], "-e", 2))
390
        {
391
392
393
394
395
396
397
398
399
400
401
402
403
	  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);
	    }
404
405
406
          expect_counter_example = true;
          output = -1;
        }
407
      else if (!strncmp(argv[formula_index], "-E", 2))
408
        {
409
410
411
412
413
414
415
416
417
418
419
420
421
	  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);
	    }
422
423
424
          expect_counter_example = false;
          output = -1;
        }
425
426
      else if (!strcmp(argv[formula_index], "-f"))
	{
427
	  translation = TransFM;
428
	}
429
      else if (!strcmp(argv[formula_index], "-fr"))
430
	{
431
	  fm_red = true;
432
	  translation = TransFM;
433
	}
434
435
436
437
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
438
439
440
441
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
442
443
      else if (!strcmp(argv[formula_index], "-g"))
	{
444
	  accepting_run = true;
445
446
	  graph_run_opt = true;
	}
447
448
      else if (!strcmp(argv[formula_index], "-G"))
	{
449
	  accepting_run = true;
450
451
	  graph_run_tgba_opt = true;
	}
452
453
454
455
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
456
457
458
459
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
460
461
462
463
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
464
465
466
467
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
468
469
470
471
472
473
474
475
476
477
478
479
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
	  system = spot::kripke_parse(argv[formula_index] + 3,
				      pel, dict, env, debug_opt);
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
480
481
482
483
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
484
485
486
487
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
488
489
490
491
492
493
494
495
496
497
      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;
	}
498
499
500
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
501
	  translation = TransFM;
502
	}
503
504
505
506
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
507
508
      else if (!strcmp(argv[formula_index], "-m"))
	{
509
	  opt_reduce = true;
510
	}
martinez's avatar
martinez committed
511
512
      else if (!strcmp(argv[formula_index], "-N"))
	{
513
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
514
515
	  output = 8;
	}
516
517
518
519
520
521
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
522
523
      else if (!strcmp(argv[formula_index], "-O"))
	{
524
	  output = 14;
525
          opt_minimize = true;
526
	}
527
528
529
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
530
	  translation = TransFM;
531
	}
532
533
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
534
535
	  tm.start("reading -P's argument");

536
	  spot::tgba_parse_error_list pel;
537
538
539
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
540
541
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
542
	    return 2;
543
	  s->merge_transitions();
544
	  tm.stop("reading -P's argument");
545
	  system = s;
546
	}
547
548
      else if (!strcmp(argv[formula_index], "-r"))
	{
549
550
	  output = 1;
	}
551
552
      else if (!strcmp(argv[formula_index], "-r1"))
	{
553
554
	  simpltl = true;
	  redopt.reduce_basics = true;
555
556
557
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
558
559
	  simpltl = true;
	  redopt.event_univ = true;
560
561
562
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
563
564
	  simpltl = true;
	  redopt.synt_impl = true;
565
566
567
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
568
569
570
571
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
572
	}
573
574
      else if (!strcmp(argv[formula_index], "-r5"))
	{
575
576
	  simpltl = true;
	  redopt.containment_checks = true;
577
578
579
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
580
581
582
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
583
584
585
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
586
587
588
589
590
591
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
592
	}
593
594
595
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
596
	}
597
598
599
600
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
601
	{
602
	  // For backward compatibility, make all these options
603
	  // equal to -RDS.
604
	  reduction_dir_sim = true;
605
606
607
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
608
	  scc_filter = true;
609
	}
610
611
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
612
	  scc_filter = true;
613
614
	  scc_filter_all = true;
	}
615
616
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
617
	  symbolic_scc_pruning = true;
618
	}
619
620
      else if (!strcmp(argv[formula_index], "-rd"))
	{
621
	  display_reduced_form = true;
622
	}
623
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
624
        {
625
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
626
        }
627
      else if (!strcmp(argv[formula_index], "-Rm"))
628
        {
629
          opt_minimize = true;
630
        }
631
632
633
634
635
636
      else if (!strcmp(argv[formula_index], "-rs"))
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
637
638
639
640
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
641
642
643
644
645
646
647
648
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
649
650
651
652
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
653
654
655
656
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
657
658
659
660
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
661
662
663
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
664
	  translation = TransFM;
665
	  // Parse -U's argument.
666
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
667
668
669
	  while (tok)
	    {
	      unobservables->insert
670
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
671
	      tok = strtok(0, ", \t;");
672
673
	    }
	}
674
675
676
677
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
678
679
      else if (!strcmp(argv[formula_index], "-x"))
	{
680
	  translation = TransFM;
681
682
	  fm_exprop_opt = true;
	}
683
684
685
686
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
687
688
689
690
691
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
692
693
      else if (!strcmp(argv[formula_index], "-y"))
	{
694
	  translation = TransFM;
695
696
	  fm_symb_merge_opt = false;
	}
697
698
699
700
      else
	{
	  break;
	}
701
702
    }

703
  if ((graph_run_opt || graph_run_tgba_opt)
704
      && (!echeck_inst || !expect_counter_example))
705
    {
706
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
707
708
709
      exit(1);
    }

710
711
712
713
  std::string input;

  if (file_opt)
    {
714
      tm.start("reading formula");
715
      if (strcmp(argv[formula_index], "-"))
716
	{
717
	  std::ifstream fin(argv[formula_index]);
718
	  if (!fin)
719
720
721
722
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
723

724
	  if (!std::getline(fin, input, '\0'))
725
726
727
728
729
730
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
731
	{
732
	  std::getline(std::cin, input, '\0');
733
	}
734
      tm.stop("reading formula");
735
736
737
738
739
740
    }
  else
    {
      input = argv[formula_index];
    }

741
  const spot::ltl::formula* f = 0;
742
  if (!from_file) // Reading a formula, not reading an automaton from a file.
743
    {
744
745
746
747
748
749
750
751
752
753
754
755
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
      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;
785
	}
786
    }
787

788
  if (f || from_file)
789
    {
790
      spot::tgba_bdd_concrete* concrete = 0;
791
      const spot::tgba* to_free = 0;
792
      spot::tgba* a = 0;
793

794
795
      if (from_file)
	{
796
	  spot::tgba_explicit_string* e;
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
	  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
812
	    {
813
	      spot::neverclaim_parse_error_list pel;
814
	      tm.start("parsing neverclaim");
815
816
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
817
	      tm.stop("parsing neverclaim");
818
819
820
821
822
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
823
		}
824
	    }
825
	  e->merge_transitions();
826
	}
827
      else
828
	{
829
830
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
831
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
832
833

	  if (simp)
834
	    {
835
	      tm.start("reducing formula");
836
	      const spot::ltl::formula* t = simp->simplify(f);
837
	      f->destroy();
838
	      tm.stop("reducing formula");
839
	      f = t;
840
841
842
843
844
845
846
	      if (display_reduced_form)
		{
		  if (utf8_opt)
		    std::cout << spot::ltl::to_utf8_string(f) << std::endl;
		  else
		    std::cout << spot::ltl::to_string(f) << std::endl;
		}
847
	    }
848

849
850
851
852
853
854
855
856
857
	  if (f->is_psl_formula()
	      && !f->is_ltl_formula()
	      && translation != TransFM)
	    {
	      std::cerr << "Only the FM algorithm can translate PSL formulae;"
			<< " I'm using it for this formula." << std::endl;
	      translation = TransFM;
	    }

858
	  tm.start("translating formula");
859
860
861
862
863
864
865
866
	  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,
867
				       fm_red ? simp : 0);
868
869
870
871
872
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
873
874
875
876
877
	      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);
878
879
	      break;
	    }
880
	  tm.stop("translating formula");
881
	  to_free = a;
882
883

	  delete simp;
884
	}
885

886
      if (opt_monitor && !scc_filter)
887
	{
888
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
889
890
	    symbolic_scc_pruning = true;
	  else
891
	    scc_filter = true;
892
893
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
894
895
      if (symbolic_scc_pruning)
        {
896
897
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
898
899
900
901
902
903
904
905
906
907
908
909
910
	  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)
911
912
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
913
914
915
916
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

917
918
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
919
      const spot::tgba* aut_scc = 0;
920
      if (scc_filter)
921
922
	{
	  tm.start("reducing A_f w/ SCC");
923
	  aut_scc = a = spot::scc_filter(a, scc_filter_all);
924
925
926
	  tm.stop("reducing A_f w/ SCC");
	}

927
      const spot::tgba* degeneralized = 0;
928

929
      spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
930
      if (opt_minimize)
931
	{
932
933
934
935
936
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
937
	    {
938
	      // if (!f)
939
940
941
942
943
944
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
945
	    }
946
947
948
949
950
951
952
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
953
954
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
955
	      assume_sba = true;
956
	    }
957
	}
Felix Abecassis's avatar
Felix Abecassis committed
958

Thomas Badie's avatar
Thomas Badie committed
959
960
961
962
963
964
965
966
967
968

      if (reduction_dir_sim)
        {
          tm.start("Reduction w/ direct simulation");
          temp_dir_sim = spot::simulation(a);
          a = temp_dir_sim;
          tm.stop("Reduction w/ direct simulation");
        }


969
970
971
972
973
974
975
976
977
978
979
980
981
982
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
	  && degeneralize_opt == NoDegen
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
	{
	  degeneralize_opt = DegenTBA;
	  assume_sba = false;
	}

      if (!assume_sba && !opt_monitor)
	{
	  if (degeneralize_opt == DegenTBA)
	    {
983
	      degeneralized = a = new spot::tgba_tba_proxy(a);
984
985
986
	    }
	  else if (degeneralize_opt == DegenSBA)
	    {
987
	      degeneralized = a = new spot::tgba_sba_proxy(a);
988
989
990
991
	      assume_sba = true;
	    }
	  else if (labeling_opt == StateLabeled)
	    {
992
	      degeneralized = a = new spot::tgba_sgba_proxy(a);
993
994
995
	    }
	}

996
997
998
      if (opt_monitor)
	{
	  tm.start("Monitor minimization");
999
	  minimized = a = minimize_monitor(a);
1000
	  tm.stop("Monitor minimization");
1001
1002
1003
	  assume_sba = false; 	// All states are accepting, so double
				// circles in the dot output are
				// pointless.
1004
1005
	}

1006
      const spot::tgba* expl = 0;
1007
1008
1009
1010
1011
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS: