ltl2tgba.cc 39 KB
Newer Older
1
2
3
// -*- coding: utf-8 -*-
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
5
6
// Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (SRC), Université Pierre et Marie Curie.
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.

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

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

86
87
88
void
syntax(char* prog)
{
89
90
91
92
93
  // 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;

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

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

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
111
	    << std::endl
112
	    << "  -X    do not compute an automaton, read it from a file"
113
	    << std::endl
114
115
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
116
117
118
119
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
120
121
122
	    << std::endl

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
134
135
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << 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
	    << "  -rd   display the reduced formula" << std::endl
181
	    << "  -rD   dump statistics about the simplifier cache" << std::endl
182
183
	    << "  -rL   disable basic rewritings producing larger formulas"
	    << std::endl << std::endl
184
185
186
187
188
189
190
191
192
193
194

	    << "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
195
	    << "  -R3   use SCC to reduce the automata" << std::endl
196
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
197
198
199
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
200
201
202
	    << "  -RDS  minimize the automaton with direct simulation"
	    << std::endl
            << "  -Rm   attempt to WDBA-minimize the automata" << std::endl
203
	    << std::endl
204

205
            << "Automaton conversion:" << std::endl
206
207
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
208
209
210
211
	    << "  -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
212
213
	    << std::endl

214
215
216
217
	    << "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
218
	    << std::endl
219
220
221
222
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
223
	    << "  -g    graph the accepting run on the automaton (requires -e)"
224
	    << std::endl
225
226
227
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
228
229
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
230
231
232
233
234
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
235
236
237
238
239
240
241
242
243
244
245
246
247
	    << "  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
248
249
250
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
251
	    << std::endl
252
253
254
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
255
256
257
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
258
	    << "  -N    output the never clain for Spin (implies -DS)"
259
260
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
261
	    << " (implies -DS)" << std::endl
262
263
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
264
	    << std::endl
265
266
267
268
269
270
	    << "  -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
271
	    << "  -8    output UTF-8 formulae" << std::endl
272
273
274
275
276
	    << "  -d    turn on traces during parsing" << std::endl
            << "  -T    time the different phases of the translation"
	    << std::endl
	    << "  -v    display the BDD variables used by the automaton"
	    << 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
  bool utf8_opt = false;
288
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
289
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
290
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
291
    translation = TransFM;
292
  bool fm_red = false;
293
  bool fm_exprop_opt = false;
294
  bool fm_symb_merge_opt = true;
295
  bool file_opt = false;
296
  int output = 0;
297
  int formula_index = 0;
298
299
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
300
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
301
  bool expect_counter_example = false;
302
303
  bool accepting_run = false;
  bool accepting_run_replay = false;
304
  bool from_file = false;
305
  bool read_neverclaim = false;
306
  bool scc_filter = false;
307
  bool simpltl = false;
308
309
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false,
					   false, false, false);
310
  bool simpcache_stats = false;
311
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
312
  bool symbolic_scc_pruning = false;
313
  bool display_reduced_form = false;
314
  bool post_branching = false;
315
  bool fair_loop_approx = false;
316
  bool graph_run_opt = false;
317
  bool graph_run_tgba_opt = false;
318
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
319
  bool opt_minimize = false;
320
  bool opt_monitor = false;
321
  bool containment = false;
322
  bool show_fc = false;
323
  bool spin_comments = false;
324
325
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
326
  spot::tgba* system = 0;
327
328
  const spot::tgba* product = 0;
  const spot::tgba* product_to_free = 0;
329
  spot::bdd_dict* dict = new spot::bdd_dict();
330
331
  spot::timer_map tm;
  bool use_timer = false;
332
  bool assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
333
334
335
  bool reduction_dir_sim = false;
  spot::tgba* temp_dir_sim = 0;

336

337
  for (;;)
338
    {
339
      if (argc < formula_index + 2)
340
	syntax(argv[0]);
341
342
343

      ++formula_index;

344
345
346
347
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
348
349
350
351
352
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
353
      else if (!strcmp(argv[formula_index], "-a"))
354
355
356
	{
	  output = 2;
	}
357
      else if (!strcmp(argv[formula_index], "-A"))
358
	{
359
	  output = 4;
360
	}
361
      else if (!strcmp(argv[formula_index], "-b"))
362
	{
363
	  output = 7;
364
	}
365
366
367
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
368
	  translation = TransTAA;
369
	}
370
371
372
373
374
375
376
377
378
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
379
      else if (!strcmp(argv[formula_index], "-d"))
380
381
382
	{
	  debug_opt = true;
	}
383
384
      else if (!strcmp(argv[formula_index], "-D"))
	{
385
386
387
388
389
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
390
	}
391
      else if (!strncmp(argv[formula_index], "-e", 2))
392
        {
393
394
395
396
397
398
399
400
401
402
403
404
405
	  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);
	    }
406
407
408
          expect_counter_example = true;
          output = -1;
        }
409
      else if (!strncmp(argv[formula_index], "-E", 2))
410
        {
411
412
413
414
415
416
417
418
419
420
421
422
423
	  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);
	    }
424
425
426
          expect_counter_example = false;
          output = -1;
        }
427
428
      else if (!strcmp(argv[formula_index], "-f"))
	{
429
	  translation = TransFM;
430
	}
431
      else if (!strcmp(argv[formula_index], "-fr"))
432
	{
433
	  fm_red = true;
434
	  translation = TransFM;
435
	}
436
437
438
439
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
440
441
442
443
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
444
445
      else if (!strcmp(argv[formula_index], "-g"))
	{
446
	  accepting_run = true;
447
448
	  graph_run_opt = true;
	}
449
450
      else if (!strcmp(argv[formula_index], "-G"))
	{
451
	  accepting_run = true;
452
453
	  graph_run_tgba_opt = true;
	}
454
455
456
457
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
458
459
460
461
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
462
463
464
465
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
466
467
468
469
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
470
471
472
473
474
475
476
477
478
479
480
481
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
	  system = spot::kripke_parse(argv[formula_index] + 3,
				      pel, dict, env, debug_opt);
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
482
483
484
485
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
486
487
488
489
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
490
491
492
493
494
495
496
497
498
499
      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;
	}
500
501
502
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
503
	  translation = TransFM;
504
	}
505
506
507
508
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
509
510
      else if (!strcmp(argv[formula_index], "-m"))
	{
511
	  opt_reduce = true;
512
	}
martinez's avatar
martinez committed
513
514
      else if (!strcmp(argv[formula_index], "-N"))
	{
515
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
516
517
	  output = 8;
	}
518
519
520
521
522
523
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
524
525
      else if (!strcmp(argv[formula_index], "-O"))
	{
526
	  output = 14;
527
          opt_minimize = true;
528
	}
529
530
531
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
532
	  translation = TransFM;
533
	}
534
535
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
536
537
	  tm.start("reading -P's argument");

538
	  spot::tgba_parse_error_list pel;
539
540
541
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
542
543
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
544
	    return 2;
545
	  s->merge_transitions();
546
	  tm.stop("reading -P's argument");
547
	  system = s;
548
	}
549
550
      else if (!strcmp(argv[formula_index], "-r"))
	{
551
552
	  output = 1;
	}
553
554
      else if (!strcmp(argv[formula_index], "-r1"))
	{
555
556
	  simpltl = true;
	  redopt.reduce_basics = true;
557
558
559
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
560
561
	  simpltl = true;
	  redopt.event_univ = true;
562
563
564
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
565
566
	  simpltl = true;
	  redopt.synt_impl = true;
567
568
569
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
570
571
572
573
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
574
	}
575
576
      else if (!strcmp(argv[formula_index], "-r5"))
	{
577
578
	  simpltl = true;
	  redopt.containment_checks = true;
579
580
581
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
582
583
584
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
585
586
587
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
588
589
590
591
592
593
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
594
	}
595
596
597
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
598
	}
599
600
601
602
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
603
	{
604
	  // For backward compatibility, make all these options
605
	  // equal to -RDS.
606
	  reduction_dir_sim = true;
607
608
609
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
610
	  scc_filter = true;
611
	}
612
613
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
614
	  scc_filter = true;
615
616
	  scc_filter_all = true;
	}
617
618
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
619
	  symbolic_scc_pruning = true;
620
	}
621
622
      else if (!strcmp(argv[formula_index], "-rd"))
	{
623
	  display_reduced_form = true;
624
	}
625
626
627
628
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
629
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
630
        {
631
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
632
        }
633
      else if (!strcmp(argv[formula_index], "-rL"))
634
635
636
637
638
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
639
640
641
642
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
643
644
645
646
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
647
648
649
650
651
652
653
654
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
655
656
657
658
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
659
660
661
662
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
663
664
665
666
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
667
668
669
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
670
	  translation = TransFM;
671
	  // Parse -U's argument.
672
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
673
674
675
	  while (tok)
	    {
	      unobservables->insert
676
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
677
	      tok = strtok(0, ", \t;");
678
679
	    }
	}
680
681
682
683
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
684
685
      else if (!strcmp(argv[formula_index], "-x"))
	{
686
	  translation = TransFM;
687
688
	  fm_exprop_opt = true;
	}
689
690
691
692
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
693
694
695
696
697
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
698
699
      else if (!strcmp(argv[formula_index], "-y"))
	{
700
	  translation = TransFM;
701
702
	  fm_symb_merge_opt = false;
	}
703
704
705
706
      else
	{
	  break;
	}
707
708
    }

709
  if ((graph_run_opt || graph_run_tgba_opt)
710
      && (!echeck_inst || !expect_counter_example))
711
    {
712
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
713
714
715
      exit(1);
    }

716
717
718
719
  std::string input;

  if (file_opt)
    {
720
      tm.start("reading formula");
721
      if (strcmp(argv[formula_index], "-"))
722
	{
723
	  std::ifstream fin(argv[formula_index]);
724
	  if (!fin)
725
726
727
728
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
729

730
	  if (!std::getline(fin, input, '\0'))
731
732
733
734
735
736
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
737
	{
738
	  std::getline(std::cin, input, '\0');
739
	}
740
      tm.stop("reading formula");
741
742
743
744
745
746
    }
  else
    {
      input = argv[formula_index];
    }

747
  const spot::ltl::formula* f = 0;
748
  if (!from_file) // Reading a formula, not reading an automaton from a file.
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
778
779
780
781
782
783
784
785
786
787
788
789
790
      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;
791
	}
792
    }
793

794
  if (f || from_file)
795
    {
796
      spot::tgba_bdd_concrete* concrete = 0;
797
      const spot::tgba* to_free = 0;
798
      spot::tgba* a = 0;
799

800
801
      if (from_file)
	{
802
	  spot::tgba_explicit_string* e;
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
	  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
818
	    {
819
	      spot::neverclaim_parse_error_list pel;
820
	      tm.start("parsing neverclaim");
821
822
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
823
	      tm.stop("parsing neverclaim");
824
825
826
827
828
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
829
		}
830
	      assume_sba = true;
831
	    }
832
	  e->merge_transitions();
833
	}
834
      else
835
	{
836
837
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
838
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
839
840

	  if (simp)
841
	    {
842
	      tm.start("reducing formula");
843
	      const spot::ltl::formula* t = simp->simplify(f);
844
	      f->destroy();
845
	      tm.stop("reducing formula");
846
	      f = t;
847
848
849
850
851
852
853
	      if (display_reduced_form)
		{
		  if (utf8_opt)
		    std::cout << spot::ltl::to_utf8_string(f) << std::endl;
		  else
		    std::cout << spot::ltl::to_string(f) << std::endl;
		}
854
855
856
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
857
	    }
858

859
860
861
862
863
864
865
866
867
	  if (f->is_psl_formula()
	      && !f->is_ltl_formula()
	      && translation != TransFM)
	    {
	      std::cerr << "Only the FM algorithm can translate PSL formulae;"
			<< " I'm using it for this formula." << std::endl;
	      translation = TransFM;
	    }

868
	  tm.start("translating formula");
869
870
871
872
873
874
875
876
	  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,
877
				       fm_red ? simp : 0);
878
879
880
881
882
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
883
884
885
886
887
	      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);
888
889
	      break;
	    }
890
	  tm.stop("translating formula");
891
	  to_free = a;
892

893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
	  if (simp && simpcache_stats)
	    {
	      simp->print_stats(std::cerr);
	      bddStat s;
	      bdd_stats(&s);
	      std::cerr << "BDD produced: " << s.produced
			<< "\n    nodenum: " << s.nodenum
			<< "\n    maxnodenum: " << s.maxnodenum
			<< "\n    freenodes: " <<  s.freenodes
			<< "\n    minfreenodes: " << s.minfreenodes
			<< "\n    varnum: " <<  s.varnum
			<< "\n    cachesize: " << s.cachesize
			<< "\n    gbcnum: " << s.gbcnum
			<< std::endl;
	      bdd_fprintstat(stderr);
	      dict->dump(std::cerr);
	    }
910
	  delete simp;
911
	}
912

913
      if (opt_monitor && !scc_filter)
914
	{
915
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
916
917
	    symbolic_scc_pruning = true;
	  else
918
	    scc_filter = true;
919
920
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
921
922
      if (symbolic_scc_pruning)
        {
923
924
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
925
926
927
928
929
930
931
932
933
934
935
936
937
	  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)
938
939
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
940
941
942
943
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

944
945
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
946
      const spot::tgba* aut_scc = 0;
947
      if (scc_filter)
948
949
	{
	  tm.start("reducing A_f w/ SCC");
950
	  aut_scc = a = spot::scc_filter(a, scc_filter_all);
951
	  tm.stop("reducing A_f w/ SCC");
952
	  assume_sba = false;
953
954
	}

955
      const spot::tgba* degeneralized = 0;
956

957
      spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
958
      if (opt_minimize)
959
	{
960
961
962
963
964
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
965
	    {
966
	      // if (!f)
967
968
969
970
971
972
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
973
	    }
974
975
976
977
978
979
980
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
981
982
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
983
	      assume_sba = true;
984
	    }
985
	}
Felix Abecassis's avatar
Felix Abecassis committed
986

Thomas Badie's avatar
Thomas Badie committed
987
988
989
990
991
992
993

      if (reduction_dir_sim)
        {
          tm.start("Reduction w/ direct simulation");
          temp_dir_sim = spot::simulation(a);
          a = temp_dir_sim;
          tm.stop("Reduction w/ direct simulation");
994
	  assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
995
996
997
        }


998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
      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)
	{
	  degeneralize_opt = DegenTBA;
	  assume_sba = false;
	}

      if (!assume_sba && !opt_monitor)
	{
	  if (degeneralize_opt == DegenTBA)
	    {
1012
	      degeneralized = a = new spot::tgba_tba_proxy(a);
1013
1014
1015
	    }
	  else if (degeneralize_opt == DegenSBA)
	    {