ltl2tgba.cc 33.6 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Laboratoire
2
3
// d'Informatique de Paris 6 (LIP6), dpartement Systmes Rpartis
// Coopratifs (SRC), Universit Pierre et Marie Curie.
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
//
// 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.

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

56
#include "tgbaalgos/stats.hh"
57
#include "tgbaalgos/scc.hh"
58
59
#include "tgbaalgos/emptiness_stats.hh"

60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
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)	   \
R=!U(!$0, !$1)";
  return s;
}

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

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

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

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
101
	    << std::endl
102
	    << "  -X    do not compute an automaton, read it from a file"
103
	    << std::endl
104
105
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
106
	    << std::endl
107
108
109
	    << std::endl

	    << "Translation algorithm:" << std::endl
martinez's avatar
martinez committed
110
            << "  -f    use Couvreur's FM algorithm for translation"
111
	    << std::endl
112
113
114
            << "  -l    use Couvreur's LaCIM algorithm for translation "
	    << "(default)"
	    << std::endl
115
            << "  -taa  use Tauriainen's TAA-based algorithm for translation"
martinez's avatar
martinez committed
116
	    << std::endl
117
118
119
120
121
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
	    << "  -c    enable language containment checks (implies -f)"
	    << std::endl
122
123
124
125
	    << "  -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
126
127
128
	    << "  -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
129
130
131
132
133
            << "  -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)"
134
	    << std::endl
135
136
137
138
            << "  -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
139
	    << std::endl
140
141
142
143

	    << "Options for Couvreur's LaCIM algorithm (-l):" << std::endl
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
144
	    << std::endl
145
	    << "  -A    same as -a, but as a set" << std::endl
146
	    << "  -xltl translate an extended LTL, not an LTL" << std::endl
147
	    << "  -r    display the relation BDD, not the reachability graph"
148
	    << std::endl
149
	    << "  -R    same as -r, but as a set" << std::endl
150
	    << std::endl
151
152

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
153
	    << std::endl
154
	    << "  -c    enable language containment checks" << std::endl
155
	    << std::endl
156
157

	    << "Formula simplification (before translation):"
158
	    << std::endl
martinez's avatar
martinez committed
159
160
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
161
	    << "universality" << std::endl
martinez's avatar
martinez committed
162
	    << "  -r3   reduce formula using implication between "
163
	    << "sub-formulae" << std::endl
164
165
166
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
167
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
168
169
170
171
172
173
174
175
176
177
178
179
180
181
	    << "  -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
182
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
183
	    << "(use -L for more reduction)"
184
	    << std::endl
185
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
186
	    << "(use -L for more reduction)"
187
	    << std::endl
188
189
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
190
	    << std::endl
191
	    << "  -R3   use SCC to reduce the automata" << std::endl
192
	    << "  -R3b  delete unaccepting SCC directly on the BDD" << std::endl
193
194
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
195
	    << std::endl
196
197
198
199
200

	    << "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
201
	    << std::endl
202
	    << "  -g    graph the accepting run on the automaton (requires -e)"
203
	    << std::endl
204
205
206
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
207
208
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
209
210
211
212
213
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
	    << "  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;
251
252
253
254
255
256
257
258
  exit(2);
}

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

259
  bool debug_opt = false;
260
  bool paper_opt = false;
261
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
262
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
263
  enum { TransFM, TransLaCIM, TransTAA } translation = TransLaCIM;
264
  int fm_red = spot::ltl::Reduce_None;
265
  bool fm_exprop_opt = false;
266
  bool fm_symb_merge_opt = true;
267
  bool file_opt = false;
268
  int output = 0;
269
  int formula_index = 0;
270
271
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
272
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
273
  bool expect_counter_example = false;
274
  bool from_file = false;
275
  int reduc_aut = spot::Reduce_None;
276
  int redopt = spot::ltl::Reduce_None;
277
278
  bool eltl = false;
  bool delete_unaccepting_scc = false;
279
280
  bool display_reduce_form = false;
  bool display_rel_sim = false;
281
  bool display_parity_game = false;
282
  bool post_branching = false;
283
  bool fair_loop_approx = false;
284
  bool graph_run_opt = false;
285
  bool graph_run_tgba_opt = false;
286
  bool opt_reduce = false;
287
  bool containment = false;
288
  bool show_fc = false;
289
  bool spin_comments = false;
290
291
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
292
  spot::tgba_explicit_string* system = 0;
293
  spot::tgba* product = 0;
294
  spot::tgba* product_to_free = 0;
295
  spot::bdd_dict* dict = new spot::bdd_dict();
296
297
  spot::timer_map tm;
  bool use_timer = false;
298

299
  for (;;)
300
    {
301
      if (argc < formula_index + 2)
302
	syntax(argv[0]);
303
304
305

      ++formula_index;

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

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
498
	}
499
500
      else if (!strcmp(argv[formula_index], "-r"))
	{
501
502
	  output = 1;
	}
503
504
505
506
507
508
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
509
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
510
511
512
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
513
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
514
515
516
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
517
518
519
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
520
	}
521
522
      else if (!strcmp(argv[formula_index], "-r5"))
	{
523
	  redopt |= spot::ltl::Reduce_Containment_Checks;
524
525
526
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
527
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
528
529
530
531
532
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
533
534
535
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
536
	}
martinez's avatar
martinez committed
537
538
539
540
541
542
543
544
545
      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"))
546
	{
martinez's avatar
martinez committed
547
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
548
	}
martinez's avatar
martinez committed
549
      else if (!strcmp(argv[formula_index], "-R2t"))
550
	{
martinez's avatar
martinez committed
551
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
552
553
554
555
556
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
557
558
559
560
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
	  delete_unaccepting_scc = true;
	}
561
562
563
564
565
566
567
568
569
570
571
572
      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;
	}
573
574
575
576
577
578
579
580
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
581
582
583
584
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
585
586
587
588
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
589
590
591
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
592
	  translation = TransFM;
593
	  // Parse -U's argument.
594
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
595
596
597
598
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
599
	      tok = strtok(0, ", \t;");
600
601
	    }
	}
602
603
604
605
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
606
607
      else if (!strcmp(argv[formula_index], "-x"))
	{
608
	  translation = TransFM;
609
610
	  fm_exprop_opt = true;
	}
611
612
613
614
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
615
616
      else if (!strcmp(argv[formula_index], "-y"))
	{
617
	  translation = TransFM;
618
619
	  fm_symb_merge_opt = false;
	}
620
621
622
623
      else
	{
	  break;
	}
624
625
    }

626
  if ((graph_run_opt || graph_run_tgba_opt)
627
      && (!echeck_inst || !expect_counter_example))
628
    {
629
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
630
631
632
      exit(1);
    }

633
634
635
636
  std::string input;

  if (file_opt)
    {
637
      tm.start("reading formula");
638
      if (strcmp(argv[formula_index], "-"))
639
	{
640
	  std::ifstream fin(argv[formula_index]);
641
	  if (!fin)
642
643
644
645
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
646

647
	  if (!std::getline(fin, input, '\0'))
648
649
650
651
652
653
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
654
	{
655
	  std::getline(std::cin, input, '\0');
656
	}
657
      tm.stop("reading formula");
658
659
660
661
662
663
    }
  else
    {
      input = argv[formula_index];
    }

664
665
666
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
      if (!eltl)
        {
          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);
	}
      else if (!file_opt || output == 6)
        {
	  // Call the LTL parser first to handle abbreviations such as
	  // [] when the formula is not given in a file or when the
	  // output in done in LBTT's format. The ELTL parser is then
	  // called with usual LTL operators.
	  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);
        }
      else
        {
	  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);
	}
701
702
    }
  if (f || from_file)
703
    {
704
705
706
707
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

708
709
710
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
711
	  spot::tgba_explicit_string* e;
712
	  tm.start("parsing automaton");
713
714
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
715
	  tm.stop("parsing automaton");
716
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
717
718
719
720
721
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
722
	  e->merge_transitions();
723
	}
724
      else
725
	{
726
	  if (redopt != spot::ltl::Reduce_None)
727
	    {
728
	      tm.start("reducing formula");
729
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
730
	      f->destroy();
731
	      tm.stop("reducing formula");
732
	      f = t;
733
734
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
735
	    }
736

737
	  tm.start("translating formula");
738
739
740
741
742
743
744
745
746
747
748
749
750
751
	  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,
				       fm_red, containment);
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
752
753
754
755
	      if (!eltl)
		a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      else
		a = concrete = spot::eltl_to_tgba_lacim(f, dict);
756
757
	      break;
	    }
758
	  tm.stop("translating formula");
759
	  to_free = a;
760
	}
761

762
      spot::tgba_tba_proxy* degeneralized = 0;
763
      spot::tgba_sgba_proxy* state_labeled = 0;
764

765
766
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
767
	  && degeneralize_opt == NoDegen
768
769
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
770
771
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
772
	a = degeneralized = new spot::tgba_tba_proxy(a);
773
774
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
775
776
777
778
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
779

780
781
782
783
784
785
786
787
788
      if (delete_unaccepting_scc)
        {
	  tm.start("reducing A_f w/ SCC on BDD");
	  if (spot::tgba_bdd_concrete* bc =
	      dynamic_cast<spot::tgba_bdd_concrete*>(a))
	      bc->delete_unaccepting_scc();
	  tm.stop("reducing A_f w/ SCC on BDD");
	}

789
      spot::tgba_reduc* aut_red = 0;
790
      spot::tgba* aut_scc = 0;
791
792
      if (reduc_aut != spot::Reduce_None)
	{
793
794

	  if (reduc_aut & spot::Reduce_Scc)
795
	    {
796
	      tm.start("reducing A_f w/ SCC");
797
	      a = aut_scc = spot::scc_filter(a);
798
	      tm.stop("reducing A_f w/ SCC");
799
	    }
800

801
	  if (reduc_aut & ~spot::Reduce_Scc)
802
	    {
803
	      tm.start("reducing A_f w/ sim.");
804
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
805
806

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
807
808
809
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
810
		{
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
		  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);
847

martinez's avatar
martinez committed
848
		  if (rel_dir)
849
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
850
		  if (rel_del)
851
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
852
		}
853
	      tm.stop("reducing A_f w/ sim.");
854
855
856
	    }
	}

857
858
859
860
861
862
863
864
865
866
867
868
869
      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;
	}

870
871
      spot::tgba* product_degeneralized = 0;

872
      if (system)
873
874
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
875
876
877
878
879
880

	  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)
881
882
883
884
885
886
887
888
            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);
        }
889

890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
      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);
	    }
	}

908
909
910
911
912
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

913
      if (output != -1)
914
	{
915
916
917
918
919
920
921
922
923
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
	  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);
957
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
		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");
974
	}
975

976
      if (echeck_inst)
977
	{
978
979
980
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
981
982
	  do
	    {
983
	      tm.start("running emptiness check");
984
	      spot::emptiness_check_result* res = ec->check();
985
986
	      tm.stop("running emptiness check");

987
988
989
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
990
                  std::cout << std::left << std::setw(25)
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
                            << 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
1011
                    std::cout << "no stats, , ";
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
                  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 &&
1024
		      (!expect_counter_example || ec->safe()))
1025
1026
1027
                    exit_code = 1;

                  if (!res)
1028
                    {
1029
                      std::cout << "no accepting run found";
1030
                      if (!ec->safe() && expect_counter_example)
1031
1032
                        {
                          std::cout << " even if expected" << std::endl;
1033
1034
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
1035
1036
1037
1038
1039
1040
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
1041
                    }
1042
1043
                  else
                    {
1044

1045
		      tm.start("computing accepting run");
1046
                      spot::tgba_run* run = res->accepting_run();
1047
1048
		      tm.stop("computing accepting run");

1049
1050
1051
1052
1053
1054
1055
1056
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
1057
			      tm.start("reducing accepting run");
1058
1059
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
1060
			      tm.stop("reducing accepting run");
1061
1062
1063
                              delete run;
                              run = redrun;
                            }
1064
			  tm.start("printing accepting run");
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
                          if (graph_run_opt)
                            {
                              spot::tgba_run_dotty_decorator deco(run);
                              spot::dotty_reachable(std::cout, a, &deco);
                            }
                          else if (graph_run_tgba_opt)
                            {
                              spot::tgba* ar = spot::tgba_run_to_tgba(a, run);
                              spot::dotty_reachable(std::cout, ar);
                              delete ar;
                            }
                          else
                            {
                              spot::print_tgba_run(std::cout, a, run);
                              if (!spot::replay_tgba_run(std::cout, a, run,
                                                                        true))
                                exit_code = 1;
                            }
                          delete run;
1084
			  tm.stop("printing accepting run");
1085
1086
1087
                        }
                    }
                }
1088
1089
	      delete res;
	    }
1090
	  while (search_many);
1091
	  delete ec;
martinez's avatar
martinez committed
1092
1093
	}

1094
1095
      if (show_fc)
	delete a;
1096
      if (f)
1097
        f->destroy();
1098
1099
      delete product_degeneralized;
      delete product_to_free;
1100
      delete system;
1101
1102
      delete expl;
      delete aut_red;
1103
      delete aut_scc;
1104
      delete degeneralized;