ltl2tgba.cc 37.1 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
2
// Copyright (C) 2007, 2008, 2009, 2010 Laboratoire de Recherche et
// Dveloppement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
3
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
// Paris 6 (LIP6), dpartement Systmes Rpartis
5
// Coopratifs (SRC), Universit Pierre et Marie Curie.
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//
// 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.

24
#include <iostream>
25
#include <iomanip>
26
#include <cassert>
27
28
#include <fstream>
#include <string>
29
#include <cstdlib>
30
#include "ltlvisit/contain.hh"
31
#include "ltlvisit/tostring.hh"
32
#include "ltlvisit/apcollect.hh"
33
#include "ltlast/allnodes.hh"
34
#include "ltlparse/public.hh"
35
#include "tgbaalgos/ltl2tgba_lacim.hh"
36
#include "tgbaalgos/ltl2tgba_fm.hh"
37
#include "tgbaalgos/ltl2taa.hh"
38
#include "tgba/bddprint.hh"
39
#include "tgbaalgos/save.hh"
40
#include "tgbaalgos/dotty.hh"
41
#include "tgbaalgos/lbtt.hh"
42
#include "tgba/tgbatba.hh"
43
#include "tgba/tgbasgba.hh"
44
#include "tgba/tgbaproduct.hh"
45
#include "tgba/futurecondcol.hh"
46
#include "tgbaalgos/reducerun.hh"
47
#include "tgbaparse/public.hh"
48
#include "neverparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "tgbaalgos/neverclaim.hh"
52
#include "tgbaalgos/reductgba_sim.hh"
53
#include "tgbaalgos/replayrun.hh"
54
#include "tgbaalgos/rundotdec.hh"
55
#include "tgbaalgos/sccfilter.hh"
56
#include "tgbaalgos/safety.hh"
57
58
#include "tgbaalgos/eltl2tgba_lacim.hh"
#include "eltlparse/public.hh"
59
#include "misc/timer.hh"
60

61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
64
#include "tgbaalgos/emptiness_stats.hh"

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

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

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

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

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
108
	    << std::endl
109
	    << "  -X    do not compute an automaton, read it from a file"
110
	    << std::endl
111
112
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
113
114
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
115
	    << std::endl
116
117
118
	    << std::endl

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
131
132
133
134
	    << "  -fr1  use -r1 (see below) at each step of FM" << std::endl
	    << "  -fr2  use -r2 (see below) at each step of FM" << std::endl
	    << "  -fr3  use -r3 (see below) at each step of FM" << std::endl
	    << "  -fr4  use -r4 (see below) at each step of FM" << std::endl
135
136
137
	    << "  -fr5  use -r5 (see below) at each step of FM" << std::endl
	    << "  -fr6  use -r6 (see below) at each step of FM" << std::endl
	    << "  -fr7  use -r7 (see below) at each step of FM" << std::endl
138
139
140
141
142
            << "  -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)"
143
	    << std::endl
144
145
146
147
            << "  -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
148
	    << std::endl
149

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

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

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

	    << "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
196
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
197
	    << "(use -L for more reduction)"
198
	    << std::endl
199
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
200
	    << "(use -L for more reduction)"
201
	    << std::endl
202
203
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
204
	    << std::endl
205
	    << "  -R3   use SCC to reduce the automata" << std::endl
206
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
207
208
209
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
210
211
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
Felix Abecassis's avatar
Felix Abecassis committed
212
            << "  -Rm   attempt to minimize the automata" << std::endl
213
	    << std::endl
214
215
216
217
218

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

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

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

330
  for (;;)
331
    {
332
      if (argc < formula_index + 2)
333
	syntax(argv[0]);
334
335
336

      ++formula_index;

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

541
542
	  spot::tgba_parse_error_list pel;
	  system = spot::tgba_parse(argv[formula_index] + 2,
543
				    pel, dict, env, env, debug_opt);
544
545
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
546
547
	    return 2;
	  system->merge_transitions();
548

549
	  tm.stop("reading -P's argument");
550
	}
551
552
      else if (!strcmp(argv[formula_index], "-r"))
	{
553
554
	  output = 1;
	}
555
556
557
558
559
560
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
561
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
562
563
564
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
565
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
566
567
568
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
569
570
571
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
572
	}
573
574
      else if (!strcmp(argv[formula_index], "-r5"))
	{
575
	  redopt |= spot::ltl::Reduce_Containment_Checks;
576
577
578
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
579
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
580
581
582
583
584
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
585
586
587
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
588
	}
martinez's avatar
martinez committed
589
590
591
592
593
594
595
596
597
      else if (!strcmp(argv[formula_index], "-R1q"))
	{
	  reduc_aut |= spot::Reduce_quotient_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R1t"))
	{
	  reduc_aut |= spot::Reduce_transition_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R2q"))
598
	{
martinez's avatar
martinez committed
599
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
600
	}
martinez's avatar
martinez committed
601
      else if (!strcmp(argv[formula_index], "-R2t"))
602
	{
martinez's avatar
martinez committed
603
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
604
605
606
607
608
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
609
610
611
612
613
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
614
615
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
616
	  symbolic_scc_pruning = true;
617
	}
618
619
620
621
622
623
624
625
626
627
628
629
      else if (!strcmp(argv[formula_index], "-rd"))
	{
	  display_reduce_form = true;
	}
      else if (!strcmp(argv[formula_index], "-Rd"))
	{
	  display_rel_sim = true;
	}
      else if (!strcmp(argv[formula_index], "-RD"))
	{
	  display_parity_game = true;
	}
Felix Abecassis's avatar
Felix Abecassis committed
630
631
632
633
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
634
635
636
637
638
639
640
641
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
642
643
644
645
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
646
647
648
649
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
650
651
652
653
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
654
655
656
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
657
	  translation = TransFM;
658
	  // Parse -U's argument.
659
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
660
661
662
663
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
664
	      tok = strtok(0, ", \t;");
665
666
	    }
	}
667
668
669
670
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
671
672
      else if (!strcmp(argv[formula_index], "-x"))
	{
673
	  translation = TransFM;
674
675
	  fm_exprop_opt = true;
	}
676
677
678
679
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
680
681
682
683
684
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
685
686
      else if (!strcmp(argv[formula_index], "-y"))
	{
687
	  translation = TransFM;
688
689
	  fm_symb_merge_opt = false;
	}
690
691
692
693
      else
	{
	  break;
	}
694
695
    }

696
  if ((graph_run_opt || graph_run_tgba_opt)
697
      && (!echeck_inst || !expect_counter_example))
698
    {
699
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
700
701
702
      exit(1);
    }

703
704
705
706
  std::string input;

  if (file_opt)
    {
707
      tm.start("reading formula");
708
      if (strcmp(argv[formula_index], "-"))
709
	{
710
	  std::ifstream fin(argv[formula_index]);
711
	  if (!fin)
712
713
714
715
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
716

717
	  if (!std::getline(fin, input, '\0'))
718
719
720
721
722
723
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
724
	{
725
	  std::getline(std::cin, input, '\0');
726
	}
727
      tm.stop("reading formula");
728
729
730
731
732
733
    }
  else
    {
      input = argv[formula_index];
    }

734
  spot::ltl::formula* f = 0;
735
  if (!from_file) // Reading a formula, not reading an automaton from a file.
736
    {
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
      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;
778
	}
779
780
    }
  if (f || from_file)
781
    {
782
783
784
785
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

786
787
      if (from_file)
	{
788
	  spot::tgba_explicit_string* e;
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
	  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
804
	    {
805
	      spot::neverclaim_parse_error_list pel;
806
	      tm.start("parsing neverclaim");
807
808
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
809
	      tm.stop("parsing neverclaim");
810
811
812
813
814
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
815
		}
816
	    }
817
	  e->merge_transitions();
818
	}
819
      else
820
	{
821
	  if (redopt != spot::ltl::Reduce_None)
822
	    {
823
	      tm.start("reducing formula");
824
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
825
	      f->destroy();
826
	      tm.stop("reducing formula");
827
	      f = t;
828
829
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
830
	    }
831

832
	  tm.start("translating formula");
833
834
835
836
837
838
839
840
	  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,
841
				       fm_red);
842
843
844
845
846
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
847
848
849
850
851
	      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);
852
853
	      break;
	    }
854
	  tm.stop("translating formula");
855
	  to_free = a;
856
	}
857

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
      if (symbolic_scc_pruning)
        {
	  spot::tgba_bdd_concrete* bc =
	    dynamic_cast<spot::tgba_bdd_concrete*>(a);
	  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)
		bc->delete_unaccepting_scc();
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

880
881
882
883
884
885
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
      spot::tgba* aut_scc = 0;
      if (reduc_aut & spot::Reduce_Scc)
	{
	  tm.start("reducing A_f w/ SCC");
886
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
887
888
889
	  tm.stop("reducing A_f w/ SCC");
	}

890
      spot::tgba_tba_proxy* degeneralized = 0;
891
      spot::tgba_sgba_proxy* state_labeled = 0;
892

893
894
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
895
	  && degeneralize_opt == NoDegen
896
897
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
898
899
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
900
	a = degeneralized = new spot::tgba_tba_proxy(a);
901
902
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
903
904
905
906
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
907

Felix Abecassis's avatar
Felix Abecassis committed
908
909
910
911
      spot::tgba_explicit* minimized = 0;
      if (opt_minimize)
        a = minimized = minimize(a);

912
913
914
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
915
	  if (reduc_aut & ~spot::Reduce_Scc)
916
	    {
917
	      tm.start("reducing A_f w/ sim.");
918
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
919
920

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
921
922
923
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
924
		{
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
		  spot::direct_simulation_relation* rel_dir = 0;
		  spot::delayed_simulation_relation* rel_del = 0;

		  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
				   spot::Reduce_transition_Dir_Sim))
		    {
		      rel_dir =
			spot::get_direct_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_dir);
		    }
		  if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
					spot::Reduce_transition_Del_Sim))
		    {
		      rel_del =
			spot::get_delayed_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_del);
		    }

		  if (display_rel_sim)
		    {
		      if (rel_dir)
			aut_red->display_rel_sim(rel_dir, std::cout);
		      if (rel_del)
			aut_red->display_rel_sim(rel_del, std::cout);
		    }

		  if (reduc_aut & spot::Reduce_quotient_Dir_Sim)
		    aut_red->quotient_state(rel_dir);
		  if (reduc_aut & spot::Reduce_transition_Dir_Sim)
		    aut_red->delete_transitions(rel_dir);
		  if (reduc_aut & spot::Reduce_quotient_Del_Sim)
		    aut_red->quotient_state(rel_del);
		  if (reduc_aut & spot::Reduce_transition_Del_Sim)
		    aut_red->delete_transitions(rel_del);
961

martinez's avatar
martinez committed
962
		  if (rel_dir)
963
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
964
		  if (rel_del)
965
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
966
		}
967
	      tm.stop("reducing A_f w/ sim.");
968
969
970
	    }
	}

971
972
973
974
975
976
977
978
979
980
981
982
983
      spot::tgba_explicit* expl = 0;
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

984
985
      spot::tgba* product_degeneralized = 0;

986
      if (system)
987
988
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
989
990
991
992
993
994

	  unsigned int n_acc = a->number_of_acceptance_conditions();
	  if (echeck_inst
	      && degeneralize_opt == NoDegen
	      && n_acc > 1
	      && echeck_inst->max_acceptance_conditions() < n_acc)
995
996
997
998
999
1000
1001
1002
            degeneralize_opt = DegenTBA;
          if (degeneralize_opt == DegenTBA)
            a = product = product_degeneralized =
                                            new spot::tgba_tba_proxy(product);
          else if (degeneralize_opt == DegenSBA)
            a = product = product_degeneralized =
                                            new spot::tgba_sba_proxy(product);
        }
1003

1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
      if (echeck_inst
	  && (a->number_of_acceptance_conditions()
	      < echeck_inst->min_acceptance_conditions()))
	{
	  if (!paper_opt)
	    {
	      std::cerr << echeck_algo << " requires at least "
			<< echeck_inst->min_acceptance_conditions()
			<< " acceptance conditions." << std::endl;
	      exit(1);
	    }
	  else
	    {
	      std::cout << std::endl;
	      exit(0);
	    }
	}

1022
1023
1024
1025
1026
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

1027
      if (output != -1)
1028
	{
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
	  tm.start("producing output");
	  switch (output)
	    {
	    case 0:
	      spot::dotty_reachable(std::cout, a);
	      break;
	    case 1:
	      if (concrete)
		spot::bdd_print_dot(std::cout, concrete->get_dict(),
				    concrete->get_core_data().relation);
	      break;
	    case 2:
	      if (concrete)
		spot::bdd_print_dot(std::cout, concrete->get_dict(),
				    concrete->
				    get_core_data().acceptance_conditions);
	      break;
	    case 3:
	      if (concrete)
		spot::bdd_print_set(std::cout, concrete->get_dict(),
				    concrete->get_core_data().relation);
	      break;
	    case 4:
	      if (concrete)
		spot::bdd_print_set(std::cout, concrete->get_dict(),
				    concrete->
				    get_core_data().acceptance_conditions);
	      break;
	    case 5:
	      a->get_dict()->dump(std::cout);
	      break;
	    case 6:
	      spot::lbtt_reachable(std::cout, a);
	      break;
	    case 7:
	      spot::tgba_save_reachable(std::cout, a);
	      break;
	    case 8:
	      {
		assert(degeneralize_opt == DegenSBA);
		const spot::tgba_sba_proxy* s =
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
		  dynamic_cast<const spot::tgba_sba_proxy*>(a);
		if (s)
		  spot::never_claim_reachable(std::cout, s, f, spin_comments);
		else
		  {
		    // It is possible that we have applied other
		    // operations to the automaton since its initial
		    // degeneralization.  Let's degeneralize again!
		    s = new spot::tgba_sba_proxy(a);
		    spot::never_claim_reachable(std::cout, s, f, spin_comments);
		    delete s;
		  }
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
		break;
	      }
	    case 9:
	      stats_reachable(a).dump(std::cout);
	      build_scc_stats(a).dump(std::cout);
	      break;
	    case 10:
	      dump_scc_dot(a, std::cout, false);
	      break;
	    case 11:
	      dump_scc_dot(a, std::cout, true);
	      break;
1094
1095
1096
	    case 12:
	      stats_reachable(a).dump(std::cout);
	      break;
1097
1098
1099
1100
1101
1102
	    case 13:
	      std::cout << (is_safety_automaton(a) ?
			    "is a safety automaton" :
			    "may not be a safety automaton")
			<< std::endl;
	      break;
1103
1104
1105
1106
	    default:
	      assert(!"unknown output option");
	    }
	  tm.stop("producing output");
1107
	}
1108

1109
      if (echeck_inst)