ltl2tgba.cc 42.8 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 "tgbaalgos/degen.hh"
45
#include "tgba/tgbaproduct.hh"
46
#include "tgba/futurecondcol.hh"
47
#include "tgbaalgos/reducerun.hh"
48
#include "tgbaparse/public.hh"
49
#include "neverparse/public.hh"
50
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
51
#include "tgbaalgos/minimize.hh"
52
#include "taalgos/minimize.hh"
53
#include "tgbaalgos/neverclaim.hh"
54
#include "tgbaalgos/replayrun.hh"
55
#include "tgbaalgos/rundotdec.hh"
56
#include "tgbaalgos/sccfilter.hh"
57
#include "tgbaalgos/safety.hh"
58
#include "tgbaalgos/eltl2tgba_lacim.hh"
59
#include "tgbaalgos/gtec/gtec.hh"
60
#include "eltlparse/public.hh"
61
#include "misc/timer.hh"
62
#include "tgbaalgos/stats.hh"
63
#include "tgbaalgos/scc.hh"
64
#include "tgbaalgos/emptiness_stats.hh"
65
66
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
67
#include "tgbaalgos/simulation.hh"
68

69
#include "taalgos/tgba2ta.hh"
70
#include "taalgos/dotty.hh"
71
#include "taalgos/stats.hh"
72

73
74
75
76
77
78
79
80
81
82
83
84
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)	   \
85
86
87
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
88
89
90
  return s;
}

91
92
93
void
syntax(char* prog)
{
94
95
96
97
98
  // 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;

99
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
100
	    << std::endl
101
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
102
	    << std::endl
103
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
104
	    << std::endl
105

106
107
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
108
109
110
111
	    << "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
112
	    << std::endl
113
114
115

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
116
	    << std::endl
117
	    << "  -X    do not compute an automaton, read it from a file"
118
	    << std::endl
119
120
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
121
122
123
124
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
125
126
127
	    << std::endl

	    << "Translation algorithm:" << std::endl
128
            << "  -f    use Couvreur's FM algorithm for LTL"
129
	    << " (default)" << std::endl
130
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
131
	    << std::endl
132
133
134
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
135
	    << std::endl
136
137
138
	    << std::endl

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

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

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

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

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

210
            << "Automaton conversion:" << std::endl
211
212
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
213
214
215
216
	    << "  -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
217
218
	    << std::endl

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

  	  	<< "Options for Testing Automata:"
 	    << std::endl
 	    << "  -TA    Translate an LTL formula into a Testing automata"
286
287
288
 	    << std::endl
            << std::endl
            << "  -TM    Translate an LTL formula into a minimal Testing automata"
289
290
            << std::endl
            << std::endl
Ala-Eddine Ben-Salem's avatar
Ala-Eddine Ben-Salem committed
291
            << "  -lv    Translate an LTL formula into a Testing automata with an artificial livelock accepting state (Single-pass Testing Automata)"
292
293
294
            << std::endl
            << std::endl
            << "  -in    Translate an LTL formula into a Testing automata without artificial initial state"
295
296
            << std::endl
            << std::endl
Ala-Eddine Ben-Salem's avatar
Ala-Eddine Ben-Salem committed
297
            << "  -STGTA    Translate an LTL formula into a STGTA (Single-pass Transition-based Generalised Testing Automata)"
298
299
            << std::endl;

300

301
302
303
304
305
306
307
308
  exit(2);
}

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

309
  bool debug_opt = false;
310
  bool paper_opt = false;
311
  bool utf8_opt = false;
312
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
313
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
314
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
315
    translation = TransFM;
316
  bool fm_red = false;
317
  bool fm_exprop_opt = false;
318
  bool fm_symb_merge_opt = true;
319
  bool file_opt = false;
320
  int output = 0;
321
  int formula_index = 0;
322
323
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
324
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
325
  bool expect_counter_example = false;
326
327
  bool accepting_run = false;
  bool accepting_run_replay = false;
328
  bool from_file = false;
329
  bool read_neverclaim = false;
330
  bool scc_filter = false;
331
  bool simpltl = false;
332
333
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false,
					   false, false, false);
334
  bool simpcache_stats = false;
335
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
336
  bool symbolic_scc_pruning = false;
337
  bool display_reduced_form = false;
338
  bool post_branching = false;
339
  bool fair_loop_approx = false;
340
  bool graph_run_opt = false;
341
  bool graph_run_tgba_opt = false;
342
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
343
  bool opt_minimize = false;
344
  bool opt_monitor = false;
345
  bool containment = false;
346
  bool show_fc = false;
347
  bool spin_comments = false;
348
349
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
350
  spot::tgba* system = 0;
351
352
  const spot::tgba* product = 0;
  const spot::tgba* product_to_free = 0;
353
  spot::bdd_dict* dict = new spot::bdd_dict();
354
355
  spot::timer_map tm;
  bool use_timer = false;
356
  bool assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
357
358
  bool reduction_dir_sim = false;
  spot::tgba* temp_dir_sim = 0;
359
  bool ta_opt = false;
360
  bool tgbta_opt = false;
361
362
  bool opt_with_artificial_livelock = false;
  bool opt_with_artificial_initial_state = true;
363

364

365
  for (;;)
366
    {
367
      if (argc < formula_index + 2)
368
	syntax(argv[0]);
369
370
371

      ++formula_index;

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

566
	  spot::tgba_parse_error_list pel;
567
568
569
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
570
571
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
572
	    return 2;
573
	  s->merge_transitions();
574
	  tm.stop("reading -P's argument");
575
	  system = s;
576
	}
577
578
      else if (!strcmp(argv[formula_index], "-r"))
	{
579
580
	  output = 1;
	}
581
582
      else if (!strcmp(argv[formula_index], "-r1"))
	{
583
584
	  simpltl = true;
	  redopt.reduce_basics = true;
585
586
587
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
588
589
	  simpltl = true;
	  redopt.event_univ = true;
590
591
592
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
593
594
	  simpltl = true;
	  redopt.synt_impl = true;
595
596
597
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
598
599
600
601
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
602
	}
603
604
      else if (!strcmp(argv[formula_index], "-r5"))
	{
605
606
	  simpltl = true;
	  redopt.containment_checks = true;
607
608
609
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
610
611
612
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
613
614
615
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
616
617
618
619
620
621
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
622
	}
623
624
625
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
626
	}
627
628
629
630
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
631
	{
632
	  // For backward compatibility, make all these options
633
	  // equal to -RDS.
634
	  reduction_dir_sim = true;
635
636
637
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
638
	  scc_filter = true;
639
	}
640
641
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
642
	  scc_filter = true;
643
644
	  scc_filter_all = true;
	}
645
646
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
647
	  symbolic_scc_pruning = true;
648
	}
649
650
      else if (!strcmp(argv[formula_index], "-rd"))
	{
651
	  display_reduced_form = true;
652
	}
653
654
655
656
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
657
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
658
        {
659
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
660
        }
661
      else if (!strcmp(argv[formula_index], "-rL"))
662
663
664
665
666
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
667
668
669
670
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
671
672
673
674
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
675
676
677
678
679
680
681
682
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
683
684
685
686
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
687
688
689
690
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
691
692
693
694
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
695
696
697
698
699
      else if (!strcmp(argv[formula_index], "-TM"))
        {
          ta_opt = true;
          opt_minimize = true;
        }
Ala-Eddine Ben-Salem's avatar
Ala-Eddine Ben-Salem committed
700
      else if (!strcmp(argv[formula_index], "-STGTA"))
701
702
703
        {
          tgbta_opt = true;
        }
704
705
706
707
708
709
710
711
      else if (!strcmp(argv[formula_index], "-lv"))
        {
          opt_with_artificial_livelock = true;
        }
      else if (!strcmp(argv[formula_index], "-in"))
        {
          opt_with_artificial_initial_state = false;
        }
712
713
714
715
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
716
717
718
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
719
	  translation = TransFM;
720
	  // Parse -U's argument.
721
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
722
723
724
	  while (tok)
	    {
	      unobservables->insert
725
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
726
	      tok = strtok(0, ", \t;");
727
728
	    }
	}
729
730
731
732
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
733
734
      else if (!strcmp(argv[formula_index], "-x"))
	{
735
	  translation = TransFM;
736
737
	  fm_exprop_opt = true;
	}
738
739
740
741
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
742
743
744
745
746
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
747
748
      else if (!strcmp(argv[formula_index], "-y"))
	{
749
	  translation = TransFM;
750
751
	  fm_symb_merge_opt = false;
	}
752
753
754
755
      else
	{
	  break;
	}
756
757
    }

758
  if ((graph_run_opt || graph_run_tgba_opt)
759
      && (!echeck_inst || !expect_counter_example))
760
    {
761
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
762
763
764
      exit(1);
    }

765
766
767
768
  std::string input;

  if (file_opt)
    {
769
      tm.start("reading formula");
770
      if (strcmp(argv[formula_index], "-"))
771
	{
772
	  std::ifstream fin(argv[formula_index]);
773
	  if (!fin)
774
775
776
777
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
778

779
	  if (!std::getline(fin, input, '\0'))
780
781
782
783
784
785
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
786
	{
787
	  std::getline(std::cin, input, '\0');
788
	}
789
      tm.stop("reading formula");
790
791
792
793
794
795
    }
  else
    {
      input = argv[formula_index];
    }

796
  const spot::ltl::formula* f = 0;
797
  if (!from_file) // Reading a formula, not reading an automaton from a file.
798
    {
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
      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;
840
	}
841
    }
842

843
  if (f || from_file)
844
    {
845
      spot::tgba_bdd_concrete* concrete = 0;
846
      const spot::tgba* to_free = 0;
847
      spot::tgba* a = 0;
848

849
850
      if (from_file)
	{
851
	  spot::tgba_explicit_string* e;
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
	  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
867
	    {
868
	      spot::neverclaim_parse_error_list pel;
869
	      tm.start("parsing neverclaim");
870
871
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
872
	      tm.stop("parsing neverclaim");
873
874
875
876
877
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
878
		}
879
	      assume_sba = true;
880
	    }
881
	  e->merge_transitions();
882
	}
883
      else
884
	{
885
886
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
887
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
888
889

	  if (simp)
890
	    {
891
	      tm.start("reducing formula");
892
	      const spot::ltl::formula* t = simp->simplify(f);
893
	      f->destroy();
894
	      tm.stop("reducing formula");
895
	      f = t;
896
897
898
899
900
901
902
	      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;
		}
903
904
905
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
906
	    }
907

908
909
910
911
912
913
914
915
916
	  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;
	    }

917
	  tm.start("translating formula");
918
919
920
921
922
923
924
925
	  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,
926
				       fm_red ? simp : 0);
927
928
929
930
931
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
932
933
934
935
936
	      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);
937
938
	      break;
	    }
939
	  tm.stop("translating formula");
940
	  to_free = a;
941

942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
	  if (simp && simpcache_stats)
	    {
	      simp->print_stats(std::cerr);
	      bddStat s;
	      bdd_stats(&s);
	      std::cerr << "BDD produced: " << s.produced
			<< "\n    nodenum: " << s.nodenum
			<< "\n    maxnodenum: " << s.maxnodenum
			<< "\n    freenodes: " <<  s.freenodes
			<< "\n    minfreenodes: " << s.minfreenodes
			<< "\n    varnum: " <<  s.varnum
			<< "\n    cachesize: " << s.cachesize
			<< "\n    gbcnum: " << s.gbcnum
			<< std::endl;
	      bdd_fprintstat(stderr);
	      dict->dump(std::cerr);
	    }
959
	  delete simp;
960
	}
961

962
      if (opt_monitor && !scc_filter)
963
	{
964
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
965
966
	    symbolic_scc_pruning = true;
	  else
967
	    scc_filter = true;
968
969
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
970
971
      if (symbolic_scc_pruning)
        {
972
973
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
974
975
976
977
978
979
980
981
982
983
984
985
986
	  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)
987
988
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
989
990
991
992
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

993
994
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
995
      const spot::tgba* aut_scc = 0;
996
      if (scc_filter)
997
998
	{
	  tm.start("reducing A_f w/ SCC");
999
	  aut_scc = a = spot::scc_filter(a, scc_filter_all);
1000
	  tm.stop("reducing A_f w/ SCC");
1001
	  assume_sba = false;
1002
1003
	}

1004
      const spot::tgba* degeneralized = 0;