ltl2tgba.cc 40.7 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
70
71
#include "taalgos/sba2ta.hh"
#include "taalgos/dotty.hh"

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

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

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

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

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

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

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

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

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

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

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

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

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

  	  	<< "Options for Testing Automata:"
 	    << std::endl
 	    << "  -TA    Translate an LTL formula into a Testing automata"
285
286
287
288
289
 	    << std::endl
            << std::endl
            << "  -TM    Translate an LTL formula into a minimal Testing automata"
            << std::endl;

290

291
292
293
294
295
296
297
298
  exit(2);
}

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

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

351

352
  for (;;)
353
    {
354
      if (argc < formula_index + 2)
355
	syntax(argv[0]);
356
357
358

      ++formula_index;

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

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

733
  if ((graph_run_opt || graph_run_tgba_opt)
734
      && (!echeck_inst || !expect_counter_example))
735
    {
736
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
737
738
739
      exit(1);
    }

740
741
742
743
  std::string input;

  if (file_opt)
    {
744
      tm.start("reading formula");
745
      if (strcmp(argv[formula_index], "-"))
746
	{
747
	  std::ifstream fin(argv[formula_index]);
748
	  if (!fin)
749
750
751
752
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
753

754
	  if (!std::getline(fin, input, '\0'))
755
756
757
758
759
760
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
761
	{
762
	  std::getline(std::cin, input, '\0');
763
	}
764
      tm.stop("reading formula");
765
766
767
768
769
770
    }
  else
    {
      input = argv[formula_index];
    }

771
  const spot::ltl::formula* f = 0;
772
  if (!from_file) // Reading a formula, not reading an automaton from a file.
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
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
      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;
815
	}
816
    }
817

818
  if (f || from_file)
819
    {
820
      spot::tgba_bdd_concrete* concrete = 0;
821
      const spot::tgba* to_free = 0;
822
      spot::tgba* a = 0;
823

824
825
      if (from_file)
	{
826
	  spot::tgba_explicit_string* e;
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
	  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
842
	    {
843
	      spot::neverclaim_parse_error_list pel;
844
	      tm.start("parsing neverclaim");
845
846
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
847
	      tm.stop("parsing neverclaim");
848
849
850
851
852
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
853
		}
854
	      assume_sba = true;
855
	    }
856
	  e->merge_transitions();
857
	}
858
      else
859
	{
860
861
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
862
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
863
864

	  if (simp)
865
	    {
866
	      tm.start("reducing formula");
867
	      const spot::ltl::formula* t = simp->simplify(f);
868
	      f->destroy();
869
	      tm.stop("reducing formula");
870
	      f = t;
871
872
873
874
875
876
877
	      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;
		}
878
879
880
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
881
	    }
882

883
884
885
886
887
888
889
890
891
	  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;
	    }

892
	  tm.start("translating formula");
893
894
895
896
897
898
899
900
	  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,
901
				       fm_red ? simp : 0);
902
903
904
905
906
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
907
908
909
910
911
	      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);
912
913
	      break;
	    }
914
	  tm.stop("translating formula");
915
	  to_free = a;
916

917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
	  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);
	    }
934
	  delete simp;
935
	}
936

937
      if (opt_monitor && !scc_filter)
938
	{
939
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
940
941
	    symbolic_scc_pruning = true;
	  else
942
	    scc_filter = true;
943
944
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
945
946
      if (symbolic_scc_pruning)
        {
947
948
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
949
950
951
952
953
954
955
956
957
958
959
960
961
	  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)
962
963
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
964
965
966
967
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

968
969
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
970
      const spot::tgba* aut_scc = 0;
971
      if (scc_filter)
972
973
	{
	  tm.start("reducing A_f w/ SCC");
974
	  aut_scc = a = spot::scc_filter(a, scc_filter_all);
975
	  tm.stop("reducing A_f w/ SCC");
976
	  assume_sba = false;
977
978
	}

979
      const spot::tgba* degeneralized = 0;
980

981
      spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
982
      if (opt_minimize)
983
	{
984
985
986
987
988
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
989
	    {
990
	      // if (!f)
991
992
993
994
995
996
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
997
	    }
998
999
1000
1001
1002
1003
1004
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
1005
1006
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
1007
	      assume_sba = true;
1008
	    }
1009
	}<