ltl2tgba.cc 46.2 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"
Thomas Badie's avatar
Thomas Badie committed
62
#include "misc/unique_ptr.hh"
63
#include "tgbaalgos/stats.hh"
64
#include "tgbaalgos/scc.hh"
65
#include "tgbaalgos/emptiness_stats.hh"
66
#include "tgbaalgos/scc.hh"
67
#include "tgbaalgos/isdet.hh"
68
#include "tgbaalgos/cycles.hh"
69
#include "tgbaalgos/isweakscc.hh"
70
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
71
#include "tgbaalgos/simulation.hh"
72

73
#include "taalgos/tgba2ta.hh"
74
#include "taalgos/dotty.hh"
75
#include "taalgos/stats.hh"
76

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

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

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

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

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

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

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

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

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

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

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

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

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

310
311
312
313
314
315
316
317
  exit(2);
}

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

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

380

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

      ++formula_index;

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

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

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

805
806
807
808
  std::string input;

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

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

836
  const spot::ltl::formula* f = 0;
837
  if (!from_file) // Reading a formula, not reading an automaton from a file.
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
878
879
      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;
880
	}
881
    }
882

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

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

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

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

958
	  tm.start("translating formula");
959
960
961
962
963
964
965
966
	  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,
967
				       fm_red ? simp : 0);
968
969
970
971
972
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
973
974
975
976
977
	      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);
978
979
	      break;
	    }
980
	  tm.stop("translating formula");
981
	  to_free = a;
Alexandre Duret-Lutz's avatar