ltl2tgba.cc 46.1 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
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
12
// the Free Software Foundation; either version 3 of the License, or
13
14
15
16
17
18
19
20
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#include <iostream>
24
#include <iomanip>
25
#include <cassert>
26
27
#include <fstream>
#include <string>
28
#include <cstdlib>
29
#include "ltlvisit/tostring.hh"
30
#include "ltlvisit/apcollect.hh"
31
#include "ltlast/allnodes.hh"
32
#include "ltlparse/public.hh"
33
#include "tgbaalgos/ltl2tgba_lacim.hh"
34
#include "tgbaalgos/ltl2tgba_fm.hh"
35
#include "tgbaalgos/ltl2taa.hh"
36
#include "tgba/bddprint.hh"
37
#include "tgbaalgos/save.hh"
38
#include "tgbaalgos/dotty.hh"
39
#include "tgbaalgos/lbtt.hh"
40
#include "tgba/tgbatba.hh"
41
#include "tgba/tgbasgba.hh"
42
#include "tgbaalgos/degen.hh"
43
#include "tgba/tgbaproduct.hh"
44
#include "tgba/futurecondcol.hh"
45
#include "tgbaalgos/reducerun.hh"
46
#include "tgbaparse/public.hh"
47
#include "neverparse/public.hh"
48
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
49
#include "tgbaalgos/minimize.hh"
50
#include "taalgos/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"
Thomas Badie's avatar
Thomas Badie committed
60
#include "misc/unique_ptr.hh"
61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/emptiness_stats.hh"
64
#include "tgbaalgos/scc.hh"
65
#include "tgbaalgos/isdet.hh"
66
#include "tgbaalgos/cycles.hh"
67
#include "tgbaalgos/isweakscc.hh"
68
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
69
#include "tgbaalgos/simulation.hh"
70

71
#include "taalgos/tgba2ta.hh"
72
#include "taalgos/dotty.hh"
73
#include "taalgos/stats.hh"
74

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

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

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

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

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

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

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

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

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

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

	    << "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
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
202
	    << "  -R3   use SCC to reduce the automaton" << std::endl
203
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
204
205
206
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
207
	    << "  -RDS  reduce the automaton with direct simulation"
208
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
209
	    << "  -RRS  reduce the automaton with reverse simulation"
Thomas Badie's avatar
Thomas Badie committed
210
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
211
	    << "  -RIS  iterate both direct and reverse simulations"
212
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
213
            << "  -Rm   attempt to WDBA-minimize the automaton" << std::endl
214
	    << std::endl
215
216
217
            << "  -RM   attempt to WDBA-minimize the automaton unless the "
	    << "result is bigger" << std::endl
	    << std::endl
218

219
            << "Automaton conversion:" << std::endl
220
221
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
222
	    << "  -s    convert to explicit automaton, and number states "
223
	    << "in DFS order" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
224
	    << "  -S    convert to explicit automaton, and number states "
225
	    << "in BFS order" << std::endl
226
227
	    << std::endl

228
229
230
231
232
233
234
235
236
237
238
239
240
241
	    << "Conversion to Testing Automaton:" << std::endl
 	    << "  -TA   output a Generalized Testing Automaton (GTA),\n"
	    << "          or a Testing Automaton (TA) with -DS\n"
 	    << "  -lv   add an artificial livelock state to obtain a "
	    << "Single-pass (G)TA\n"
            << "  -sp   convert into a single-pass (G)TA without artificial "
	    << "livelock state\n"
	    << "  -in   do not use an artificial initial state\n"
            << "  -TGTA output a Transition-based Generalized TA"
            << std::endl
	    << "  -RT   reduce the (G)TA/TGTA using bisimulation.\n"
            << std::endl

	    << "Options for performing emptiness checks (on TGBA):" << std::endl
242
243
244
	    << "  -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
245
	    << std::endl
246
247
248
249
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
250
	    << "  -g    graph the accepting run on the automaton (requires -e)"
251
	    << std::endl
252
253
254
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
255
256
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
257
258
259
260
261
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
262
263
264
265
266
267
268
269
270
271
272
273
274
	    << "  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
275
276
277
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
278
	    << std::endl
279
280
281
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
282
283
284
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
285
	    << "  -KC   list cycles in automaton" << std::endl
286
	    << "  -KW   list weak SCCs" << std::endl
287
	    << "  -N    output the never clain for Spin (implies -DS)"
288
289
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
290
	    << " (implies -DS)" << std::endl
291
292
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
293
	    << std::endl
294
295
296
297
298
299
	    << "  -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
300
	    << "  -8    output UTF-8 formulae" << std::endl
301
302
303
304
	    << "  -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"
305
	    << std::endl
306
	    << std::endl;
307

308
309
310
311
312
313
314
315
  exit(2);
}

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

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

378

379
  for (;;)
380
    {
381
      if (argc < formula_index + 2)
382
	syntax(argv[0]);
383
384
385

      ++formula_index;

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

588
	  spot::tgba_parse_error_list pel;
589
590
591
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
592
593
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
594
	    return 2;
595
	  s->merge_transitions();
596
	  tm.stop("reading -P's argument");
597
	  system = s;
598
	}
599
600
      else if (!strcmp(argv[formula_index], "-r"))
	{
601
602
	  output = 1;
	}
603
604
      else if (!strcmp(argv[formula_index], "-r1"))
	{
605
606
	  simpltl = true;
	  redopt.reduce_basics = true;
607
608
609
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
610
611
	  simpltl = true;
	  redopt.event_univ = true;
612
613
614
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
615
616
	  simpltl = true;
	  redopt.synt_impl = true;
617
618
619
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
620
621
622
623
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
624
	}
625
626
      else if (!strcmp(argv[formula_index], "-r5"))
	{
627
628
	  simpltl = true;
	  redopt.containment_checks = true;
629
630
631
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
632
633
634
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
635
636
637
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
638
639
640
641
642
643
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
644
	}
645
646
647
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
648
	}
649
650
651
652
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
653
	{
654
	  // For backward compatibility, make all these options
655
	  // equal to -RDS.
656
	  reduction_dir_sim = true;
657
	}
Thomas Badie's avatar
Thomas Badie committed
658
659
660
661
      else if (!strcmp(argv[formula_index], "-RRS"))
        {
          reduction_rev_sim = true;
        }
662
663
      else if (!strcmp(argv[formula_index], "-R3"))
	{
664
	  scc_filter = true;
665
	}
666
667
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
668
	  scc_filter = true;
669
670
	  scc_filter_all = true;
	}
671
672
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
673
	  symbolic_scc_pruning = true;
674
	}
675
676
      else if (!strcmp(argv[formula_index], "-rd"))
	{
677
	  display_reduced_form = true;
678
	}
679
680
681
682
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
683
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
684
        {
685
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
686
        }
687
688
689
690
      else if (!strcmp(argv[formula_index], "-RIS"))
        {
          reduction_iterated_sim = true;
        }
691
      else if (!strcmp(argv[formula_index], "-rL"))
692
693
694
695
696
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
697
698
699
700
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
701
702
703
704
705
      else if (!strcmp(argv[formula_index], "-RM"))
        {
          opt_minimize = true;
	  reject_bigger = true;
        }
706
707
708
709
      else if (!strcmp(argv[formula_index], "-RT"))
        {
          opt_bisim_ta = true;
        }
710
711
712
713
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
714
715
716
717
718
719
720
721
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
722
723
724
725
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
726
727
728
729
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
730
731
732
733
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
734
      else if (!strcmp(argv[formula_index], "-TGTA"))
735
        {
736
          tgta_opt = true;
737
        }
738
739
740
741
      else if (!strcmp(argv[formula_index], "-lv"))
        {
          opt_with_artificial_livelock = true;
        }
742
743
744
745
      else if (!strcmp(argv[formula_index], "-sp"))
        {
          opt_single_pass_emptiness_check = true;
        }
746
747
748
749
      else if (!strcmp(argv[formula_index], "-in"))
        {
          opt_with_artificial_initial_state = false;
        }
750
751
752
753
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
754
755
756
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
757
	  translation = TransFM;
758
	  // Parse -U's argument.
759
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
760
761
762
	  while (tok)
	    {
	      unobservables->insert
763
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
764
	      tok = strtok(0, ", \t;");
765
766
	    }
	}
767
768
769
770
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
771
772
      else if (!strcmp(argv[formula_index], "-x"))
	{
773
	  translation = TransFM;
774
775
	  fm_exprop_opt = true;
	}
776
777
778
779
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
780
781
782
783
784
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
785
786
      else if (!strcmp(argv[formula_index], "-y"))
	{
787
	  translation = TransFM;
788
789
	  fm_symb_merge_opt = false;
	}
790
791
792
793
      else
	{
	  break;
	}
794
795
    }

796
  if ((graph_run_opt || graph_run_tgba_opt)
797
      && (!echeck_inst || !expect_counter_example))
798
    {
799
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
800
801
802
      exit(1);
    }

803
804
805
806
  std::string input;

  if (file_opt)
    {
807
      tm.start("reading formula");
808
      if (strcmp(argv[formula_index], "-"))
809
	{
810
	  std::ifstream fin(argv[formula_index]);
811
	  if (!fin)
812
813
814
815
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
816

817
	  if (!std::getline(fin, input, '\0'))
818
819
820
821
822
823
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
824
	{
825
	  std::getline(std::cin, input, '\0');
826
	}
827
      tm.stop("reading formula");
828
829
830
831
832
833
    }
  else
    {
      input = argv[formula_index];
    }

834
  const spot::ltl::formula* f = 0;
835
  if (!from_file) // Reading a formula, not reading an automaton from a file.
836
    {
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
      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;
878
	}
879
    }
880

881
  if (f || from_file)
882
    {
883
      spot::tgba_bdd_concrete* concrete = 0;
884
      const spot::tgba* to_free = 0;
885
      const spot::tgba* to_free2 = 0;
886
      spot::tgba* a = 0;
887

888
889
      if (from_file)
	{
890
	  spot::tgba_explicit_string* e;
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
	  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
906
	    {
907
	      spot::neverclaim_parse_error_list pel;
908
	      tm.start("parsing neverclaim");
909
910
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
911
	      tm.stop("parsing neverclaim");
912
913
914
915
916
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
917
		}
918
	      assume_sba = true;
919
	    }
920
	  e->merge_transitions();
921
	}
922
      else
923
	{
924
925
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
926
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
927
928

	  if (simp)
929
	    {
930
	      tm.start("reducing formula");
931
	      const spot::ltl::formula* t = simp->simplify(f);
932
	      f->destroy();
933
	      tm.stop("reducing formula");
934
	      f = t;
935
936
937
938
939
940
941
	      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;
		}
942
943
944
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
945
	    }
946

947
948
949
950
951
952
953
954
955
	  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;
	    }

956
	  tm.start("translating formula");
957
958
959
960
961
962
963
964
	  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,
965
				       fm_red ? simp : 0);
966
967
968
969
970
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
971
972
973
974
975
	      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);