ltl2tgba.cc 36.2 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"
50
#include "tgbaalgos/neverclaim.hh"
51
#include "tgbaalgos/reductgba_sim.hh"
52
#include "tgbaalgos/replayrun.hh"
53
#include "tgbaalgos/rundotdec.hh"
54
#include "tgbaalgos/sccfilter.hh"
55
56
#include "tgbaalgos/eltl2tgba_lacim.hh"
#include "eltlparse/public.hh"
57
#include "misc/timer.hh"
58

59
#include "tgbaalgos/stats.hh"
60
#include "tgbaalgos/scc.hh"
61
62
#include "tgbaalgos/emptiness_stats.hh"

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

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

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

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

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

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
129
130
131
132
	    << "  -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
133
134
135
	    << "  -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
136
137
138
139
140
            << "  -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)"
141
	    << std::endl
142
143
144
145
            << "  -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
146
	    << std::endl
147

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

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

	    << "Formula simplification (before translation):"
170
	    << std::endl
martinez's avatar
martinez committed
171
172
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
173
	    << "universality" << std::endl
martinez's avatar
martinez committed
174
	    << "  -r3   reduce formula using implication between "
175
	    << "sub-formulae" << std::endl
176
177
178
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
179
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
180
181
182
183
184
185
186
187
188
189
190
191
192
193
	    << "  -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
194
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
195
	    << "(use -L for more reduction)"
196
	    << std::endl
197
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
198
	    << "(use -L for more reduction)"
199
	    << std::endl
200
201
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
202
	    << std::endl
203
	    << "  -R3   use SCC to reduce the automata" << std::endl
204
205
206
207
	    << "  -R3f  clean more acceptance conditions that -R3" << std::endl
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
208
209
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
210
	    << std::endl
211
212
213
214
215

	    << "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
216
	    << std::endl
217
218
219
220
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
221
	    << "  -g    graph the accepting run on the automaton (requires -e)"
222
	    << std::endl
223
224
225
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
226
227
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
228
229
230
231
232
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
	    << "  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
	    << "  -k    display statistics on the automaton of dumping it"
	    << 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
	    << "  -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;
270
271
272
273
274
275
276
277
  exit(2);
}

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

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

322
  for (;;)
323
    {
324
      if (argc < formula_index + 2)
325
	syntax(argv[0]);
326
327
328

      ++formula_index;

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

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
533
	}
534
535
      else if (!strcmp(argv[formula_index], "-r"))
	{
536
537
	  output = 1;
	}
538
539
540
541
542
543
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
544
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
545
546
547
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
548
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
549
550
551
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
552
553
554
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
555
	}
556
557
      else if (!strcmp(argv[formula_index], "-r5"))
	{
558
	  redopt |= spot::ltl::Reduce_Containment_Checks;
559
560
561
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
562
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
563
564
565
566
567
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
568
569
570
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
571
	}
martinez's avatar
martinez committed
572
573
574
575
576
577
578
579
580
      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"))
581
	{
martinez's avatar
martinez committed
582
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
583
	}
martinez's avatar
martinez committed
584
      else if (!strcmp(argv[formula_index], "-R2t"))
585
	{
martinez's avatar
martinez committed
586
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
587
588
589
590
591
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
592
593
594
595
596
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
597
598
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
599
	  symbolic_scc_pruning = true;
600
	}
601
602
603
604
605
606
607
608
609
610
611
612
      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;
	}
613
614
615
616
617
618
619
620
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
621
622
623
624
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
625
626
627
628
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
629
630
631
632
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
633
634
635
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
636
	  translation = TransFM;
637
	  // Parse -U's argument.
638
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
639
640
641
642
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
643
	      tok = strtok(0, ", \t;");
644
645
	    }
	}
646
647
648
649
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
650
651
      else if (!strcmp(argv[formula_index], "-x"))
	{
652
	  translation = TransFM;
653
654
	  fm_exprop_opt = true;
	}
655
656
657
658
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
659
660
661
662
663
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
664
665
      else if (!strcmp(argv[formula_index], "-y"))
	{
666
	  translation = TransFM;
667
668
	  fm_symb_merge_opt = false;
	}
669
670
671
672
      else
	{
	  break;
	}
673
674
    }

675
  if ((graph_run_opt || graph_run_tgba_opt)
676
      && (!echeck_inst || !expect_counter_example))
677
    {
678
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
679
680
681
      exit(1);
    }

682
683
684
685
  std::string input;

  if (file_opt)
    {
686
      tm.start("reading formula");
687
      if (strcmp(argv[formula_index], "-"))
688
	{
689
	  std::ifstream fin(argv[formula_index]);
690
	  if (!fin)
691
692
693
694
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
695

696
	  if (!std::getline(fin, input, '\0'))
697
698
699
700
701
702
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
703
	{
704
	  std::getline(std::cin, input, '\0');
705
	}
706
      tm.stop("reading formula");
707
708
709
710
711
712
    }
  else
    {
      input = argv[formula_index];
    }

713
  spot::ltl::formula* f = 0;
714
  if (!from_file) // Reading a formula, not reading an automaton from a file.
715
    {
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
      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;
757
	}
758
759
    }
  if (f || from_file)
760
    {
761
762
763
764
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

765
766
      if (from_file)
	{
767
	  spot::tgba_explicit_string* e;
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
	  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
783
	    {
784
785
786
787
788
789
790
791
792
793
794
	      spot::neverclaim_parse_error_list pel;
	      tm.start("parsing never claim");
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict, 
						       env, debug_opt);	      
	      tm.stop("parsing never claim");
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
		}	      
795
	    }
796
	  e->merge_transitions();
797
	}
798
      else
799
	{
800
	  if (redopt != spot::ltl::Reduce_None)
801
	    {
802
	      tm.start("reducing formula");
803
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
804
	      f->destroy();
805
	      tm.stop("reducing formula");
806
	      f = t;
807
808
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
809
	    }
810

811
	  tm.start("translating formula");
812
813
814
815
816
817
818
819
	  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,
820
				       fm_red);
821
822
823
824
825
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
826
827
828
829
830
	      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);
831
832
	      break;
	    }
833
	  tm.stop("translating formula");
834
	  to_free = a;
835
	}
836

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
      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");
	    }
	}

859
860
861
862
863
864
      // 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");
865
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
866
867
868
	  tm.stop("reducing A_f w/ SCC");
	}

869
      spot::tgba_tba_proxy* degeneralized = 0;
870
      spot::tgba_sgba_proxy* state_labeled = 0;
871

872
873
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
874
	  && degeneralize_opt == NoDegen
875
876
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
877
878
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
879
	a = degeneralized = new spot::tgba_tba_proxy(a);
880
881
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
882
883
884
885
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
886

887
888
889
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
890
	  if (reduc_aut & ~spot::Reduce_Scc)
891
	    {
892
	      tm.start("reducing A_f w/ sim.");
893
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
894
895

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
896
897
898
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
899
		{
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
		  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);
936

martinez's avatar
martinez committed
937
		  if (rel_dir)
938
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
939
		  if (rel_del)
940
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
941
		}
942
	      tm.stop("reducing A_f w/ sim.");
943
944
945
	    }
	}

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

959
960
      spot::tgba* product_degeneralized = 0;

961
      if (system)
962
963
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
964
965
966
967
968
969

	  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)
970
971
972
973
974
975
976
977
            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);
        }
978

979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
      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);
	    }
	}

997
998
999
1000
1001
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

1002
      if (output != -1)
1003
	{
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
	  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 =
		  static_cast<const spot::tgba_sba_proxy*>(degeneralized);
1046
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
		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;
	    default:
	      assert(!"unknown output option");
	    }
	  tm.stop("producing output");
1063
	}
1064

1065
      if (echeck_inst)
1066
	{
1067
1068
1069
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
1070
1071
	  do
	    {
1072
	      tm.start("running emptiness check");
1073
	      spot::emptiness_check_result* res = ec->check();
1074
1075
	      tm.stop("running emptiness check");

1076
1077
1078
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
1079
                  std::cout << std::left << std::setw(25)
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
                            << echeck_algo << ", ";
                  spot::tgba_statistics a_size =
                                        spot::stats_reachable(ec->automaton());
                  std::cout << std::right << std::setw(10)
                            << a_size.states << ", "
                            << std::right << std::setw(10)
                            << a_size.transitions << ", ";
                  std::cout <<
                            ec->automaton()->number_of_acceptance_conditions()
                            << ", ";
                  const spot::ec_statistics* ecs =
                        dynamic_cast<const spot::ec_statistics*>(ec);
                  if (ecs)
                    std::cout << std::right << std::setw(10)
                              << ecs->states() << ", "
                              << std::right << std::setw(10)
                              << ecs->transitions() << ", "
                              << std::right << std::setw(10)
                              << ecs->max_depth();
                  else
1100
                    std::cout << "no stats, , ";
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
                  if (res)
                    std::cout << ", accepting run found";
                  else
                    std::cout << ", no accepting run found";
                  std::cout << std::endl;
                  std::cout << std::setiosflags(old);
                }
              else
                {
                  if (!graph_run_opt && !graph_run_tgba_opt)
                    ec->print_stats(std::cout);
                  if (expect_counter_example != !!res &&
1113
		      (!expect_counter_example || ec->safe()))
1114
1115
1116
                    exit_code = 1;

                  if (!res)
1117
                    {
1118
                      std::cout << "no accepting run found";
1119
                      if (!ec->safe() && expect_counter_example)
1120
1121
                        {
                          std::cout << " even if expected" << std::endl;
1122
1123
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;