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

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

62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
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;
}

78
79
80
void
syntax(char* prog)
{
81
82
83
84
85
86
87
88
89
  // 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
90
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
91
	    << std::endl
92
93
94
95
96
97
98

            << "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
99
	    << std::endl
100
101
102

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

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

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

	    << "Options for Couvreur's LaCIM algorithm (-l):" << std::endl
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
146
	    << std::endl
147
	    << "  -A    same as -a, but as a set" << std::endl
148
	    << "  -xltl translate an extended LTL, not an LTL" << std::endl
149
	    << "  -r    display the relation BDD, not the reachability graph"
150
	    << std::endl
151
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
152
153
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
154
	    << std::endl
155
156

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
157
	    << std::endl
158
	    << "  -c    enable language containment checks" << std::endl
159
	    << std::endl
160
161

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

	    << "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
204
	    << std::endl
205
	    << "  -g    graph the accepting run on the automaton (requires -e)"
206
	    << std::endl
207
208
209
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
210
211
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
212
213
214
215
216
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
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
251
252
253
	    << "  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;
254
255
256
257
258
259
260
261
  exit(2);
}

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

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

302
  for (;;)
303
    {
304
      if (argc < formula_index + 2)
305
	syntax(argv[0]);
306
307
308

      ++formula_index;

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

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

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

636
637
638
639
  std::string input;

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

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

667
668
669
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
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
701
702
703
      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);
	}
704
705
    }
  if (f || from_file)
706
    {
707
708
709
710
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
      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");
	    }
	}

787
      spot::tgba_tba_proxy* degeneralized = 0;
788
      spot::tgba_sgba_proxy* state_labeled = 0;
789

790
791
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
792
	  && degeneralize_opt == NoDegen
793
794
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
795
796
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
797
	a = degeneralized = new spot::tgba_tba_proxy(a);
798
799
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
800
801
802
803
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
804

805
      spot::tgba_reduc* aut_red = 0;
806
      spot::tgba* aut_scc = 0;
807
808
      if (reduc_aut != spot::Reduce_None)
	{
809
810

	  if (reduc_aut & spot::Reduce_Scc)
811
	    {
812
	      tm.start("reducing A_f w/ SCC");
813
	      a = aut_scc = spot::scc_filter(a);
814
	      tm.stop("reducing A_f w/ SCC");
815
	    }
816

817
	  if (reduc_aut & ~spot::Reduce_Scc)
818
	    {
819
	      tm.start("reducing A_f w/ sim.");
820
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
821
822

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
823
824
825
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
826
		{
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
		  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);
863

martinez's avatar
martinez committed
864
		  if (rel_dir)
865
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
866
		  if (rel_del)
867
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
868
		}
869
	      tm.stop("reducing A_f w/ sim.");
870
871
872
	    }
	}

873
874
875
876
877
878
879
880
881
882
883
884
885
      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;
	}

886
887
      spot::tgba* product_degeneralized = 0;

888
      if (system)
889
890
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
891
892
893
894
895
896

	  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)
897
898
899
900
901
902
903
904
            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);
        }
905

906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
      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);
	    }
	}

924
925
926
927
928
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

929
      if (output != -1)
930
	{
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
	  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);
973
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
		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");
990
	}
991

992
      if (echeck_inst)
993
	{
994
995
996
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
997
998
	  do
	    {
999
	      tm.start("running emptiness check");
1000
	      spot::emptiness_check_result* res = ec->check();
1001
1002
	      tm.stop("running emptiness check");

1003
1004
1005
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
1006
                  std::cout << std::left << std::setw(25)
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
                            << 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
1027
                    std::cout << "no stats, , ";
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
                  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 &&
1040
		      (!expect_counter_example || ec->safe()))
1041
1042
1043
                    exit_code = 1;

                  if (!res)
1044
                    {
1045
                      std::cout << "no accepting run found";
1046
                      if (!ec->safe() && expect_counter_example)
1047
1048
                        {
                          std::cout << " even if expected" << std::endl;
1049
1050
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
1051
1052
1053
1054
1055
1056
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
1057
                    }
1058
1059
                  else
                    {
1060

1061
		      tm.start("computing accepting run");
1062
                      spot::tgba_run* run = res->accepting_run();
1063
1064
		      tm.stop("computing accepting run");

1065
1066
1067
1068
1069
1070
1071
1072
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
1073
			      tm.start("reducing accepting run");
1074
1075
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
1076
			      tm.stop("reducing accepting run");
1077
1078
1079
                              delete run;
                              run = redrun;
                            }
1080
			  tm.start("printing accepting run");
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
                          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;
1100
			  tm.stop("printing accepting run");
1101
1102
1103
                        }
                    }
                }
1104
1105
	      delete res;
	    }
1106
	  while (search_many);
1107
	  delete ec;
martinez's avatar
martinez committed
1108
1109
	}

1110
1111
      if (show_fc)
	delete a;
1112
      if (f)
1113
        f->destroy();
1114
1115
      delete product_degeneralized;
      delete product_to_free;
Alexandre Duret-Lutz's avatar