ltl2tgba.cc 31.5 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Laboratoire
2
3
// d'Informatique de Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (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 "misc/timer.hh"
52

53
#include "tgbaalgos/stats.hh"
54
#include "tgbaalgos/scc.hh"
55
56
#include "tgbaalgos/emptiness_stats.hh"

57
58
59
void
syntax(char* prog)
{
60
61
62
63
64
65
66
67
68
  // 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
69
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
70
	    << std::endl
71
72
73
74
75
76
77

            << "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
78
	    << std::endl
79
80
81

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
82
	    << std::endl
83
	    << "  -X    do not compute an automaton, read it from a file"
84
	    << std::endl
85
86
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
87
	    << std::endl
88
89
90
	    << std::endl

	    << "Translation algorithm:" << std::endl
martinez's avatar
martinez committed
91
            << "  -f    use Couvreur's FM algorithm for translation"
92
	    << std::endl
93
94
95
            << "  -l    use Couvreur's LaCIM algorithm for translation "
	    << "(default)"
	    << std::endl
96
            << "  -taa  use Tauriainen's TAA-based algorithm for translation"
martinez's avatar
martinez committed
97
	    << std::endl
98
99
100
101
102
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
	    << "  -c    enable language containment checks (implies -f)"
	    << std::endl
103
104
105
106
	    << "  -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
107
108
109
	    << "  -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
110
111
112
113
114
            << "  -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)"
115
	    << std::endl
116
117
118
119
            << "  -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
120
	    << std::endl
121
122
123
124

	    << "Options for Couvreur's LaCIM algorithm (-l):" << std::endl
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
125
	    << std::endl
126
127
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
128
	    << std::endl
129
	    << "  -R    same as -r, but as a set" << std::endl
130
	    << std::endl
131
132

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
133
	    << std::endl
134
	    << "  -c    enable language containment checks" << std::endl
135
	    << std::endl
136
137

	    << "Formula simplification (before translation):"
138
	    << std::endl
martinez's avatar
martinez committed
139
140
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
141
	    << "universality" << std::endl
martinez's avatar
martinez committed
142
	    << "  -r3   reduce formula using implication between "
143
	    << "sub-formulae" << std::endl
144
145
146
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
147
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
148
149
150
151
152
153
154
155
156
157
158
159
160
161
	    << "  -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
162
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
163
	    << "(use -L for more reduction)"
164
	    << std::endl
165
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
166
	    << "(use -L for more reduction)"
167
	    << std::endl
168
169
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
170
	    << std::endl
171
172
173
	    << "  -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
174
	    << std::endl
175
176
177
178
179

	    << "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
180
	    << std::endl
181
	    << "  -g    graph the accepting run on the automaton (requires -e)"
182
	    << std::endl
183
184
185
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
186
187
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
188
189
190
191
192
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
	    << "  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;
230
231
232
233
234
235
236
237
  exit(2);
}

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

238
  bool debug_opt = false;
239
  bool paper_opt = false;
240
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
241
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
242
  enum { TransFM, TransLaCIM, TransTAA } translation = TransLaCIM;
243
  int fm_red = spot::ltl::Reduce_None;
244
  bool fm_exprop_opt = false;
245
  bool fm_symb_merge_opt = true;
246
  bool file_opt = false;
247
  int output = 0;
248
  int formula_index = 0;
249
250
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
251
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
252
  bool expect_counter_example = false;
253
  bool from_file = false;
254
  int reduc_aut = spot::Reduce_None;
255
  int redopt = spot::ltl::Reduce_None;
256
257
  bool display_reduce_form = false;
  bool display_rel_sim = false;
258
  bool display_parity_game = false;
259
  bool post_branching = false;
260
  bool fair_loop_approx = false;
261
  bool graph_run_opt = false;
262
  bool graph_run_tgba_opt = false;
263
  bool opt_reduce = false;
264
  bool containment = false;
265
  bool show_fc = false;
266
  bool spin_comments = false;
267
268
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
269
  spot::tgba_explicit_string* system = 0;
270
  spot::tgba* product = 0;
271
  spot::tgba* product_to_free = 0;
272
  spot::bdd_dict* dict = new spot::bdd_dict();
273
274
  spot::timer_map tm;
  bool use_timer = false;
275

276
  for (;;)
277
    {
278
      if (argc < formula_index + 2)
279
	syntax(argv[0]);
280
281
282

      ++formula_index;

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

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
471
	}
472
473
      else if (!strcmp(argv[formula_index], "-r"))
	{
474
475
	  output = 1;
	}
476
477
478
479
480
481
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
482
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
483
484
485
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
486
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
487
488
489
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
490
491
492
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
493
	}
494
495
      else if (!strcmp(argv[formula_index], "-r5"))
	{
496
	  redopt |= spot::ltl::Reduce_Containment_Checks;
497
498
499
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
500
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
501
502
503
504
505
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
506
507
508
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
509
	}
martinez's avatar
martinez committed
510
511
512
513
514
515
516
517
518
      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"))
519
	{
martinez's avatar
martinez committed
520
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
521
	}
martinez's avatar
martinez committed
522
      else if (!strcmp(argv[formula_index], "-R2t"))
523
	{
martinez's avatar
martinez committed
524
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
      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;
	}
542
543
544
545
546
547
548
549
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
550
551
552
553
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
554
555
556
557
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
558
559
560
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
561
	  translation = TransFM;
562
	  // Parse -U's argument.
563
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
564
565
566
567
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
568
	      tok = strtok(0, ", \t;");
569
570
	    }
	}
571
572
573
574
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
575
576
      else if (!strcmp(argv[formula_index], "-x"))
	{
577
	  translation = TransFM;
578
579
	  fm_exprop_opt = true;
	}
580
581
582
583
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
584
585
      else if (!strcmp(argv[formula_index], "-y"))
	{
586
	  translation = TransFM;
587
588
	  fm_symb_merge_opt = false;
	}
589
590
591
592
      else
	{
	  break;
	}
593
594
    }

595
  if ((graph_run_opt || graph_run_tgba_opt)
596
      && (!echeck_inst || !expect_counter_example))
597
    {
598
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
599
600
601
      exit(1);
    }

602
603
604
605
  std::string input;

  if (file_opt)
    {
606
      tm.start("reading formula");
607
      if (strcmp(argv[formula_index], "-"))
608
	{
609
	  std::ifstream fin(argv[formula_index]);
610
	  if (!fin)
611
612
613
614
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
615

616
	  if (!std::getline(fin, input, '\0'))
617
618
619
620
621
622
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
623
	{
624
	  std::getline(std::cin, input, '\0');
625
	}
626
      tm.stop("reading formula");
627
628
629
630
631
632
    }
  else
    {
      input = argv[formula_index];
    }

633
634
635
636
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
      spot::ltl::parse_error_list pel;
637
      tm.start("parsing formula");
638
      f = spot::ltl::parse(input, pel, env, debug_opt);
639
      tm.stop("parsing formula");
640
641
642
      exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
    }
  if (f || from_file)
643
    {
644
645
646
647
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

648
649
650
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
651
	  spot::tgba_explicit_string* e;
652
	  tm.start("parsing automaton");
653
654
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
655
	  tm.stop("parsing automaton");
656
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
657
658
659
660
661
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
662
	  e->merge_transitions();
663
	}
664
      else
665
	{
666
	  if (redopt != spot::ltl::Reduce_None)
667
	    {
668
	      tm.start("reducing formula");
669
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
670
	      f->destroy();
671
	      tm.stop("reducing formula");
672
	      f = t;
673
674
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
675
	    }
676

677
	  tm.start("translating formula");
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
	  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:
	      a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      break;
	    }
695
	  tm.stop("translating formula");
696
	  to_free = a;
697
	}
698

699
      spot::tgba_tba_proxy* degeneralized = 0;
700
      spot::tgba_sgba_proxy* state_labeled = 0;
701

702
703
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
704
	  && degeneralize_opt == NoDegen
705
706
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
707
708
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
709
	a = degeneralized = new spot::tgba_tba_proxy(a);
710
711
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
712
713
714
715
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
716

717
718
719
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
720
	  tm.start("reducing formula automaton");
721
	  a = aut_red = new spot::tgba_reduc(a);
722
723
724
725

	  if (reduc_aut & spot::Reduce_Scc)
	    aut_red->prune_scc();

martinez's avatar
martinez committed
726
727
728
729
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
730
	    {
martinez's avatar
martinez committed
731
732
733
734
735
	      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))
736
737
738
739
740
741
742
743
		{
		  rel_dir =
		    spot::get_direct_relation_simulation(a,
							 std::cout,
							 display_parity_game);
		  assert(rel_dir);
		}
	      if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
martinez's avatar
martinez committed
744
				    spot::Reduce_transition_Del_Sim))
745
746
747
748
749
750
751
		{
		  rel_del =
		    spot::get_delayed_relation_simulation(a,
							  std::cout,
							  display_parity_game);
		  assert(rel_del);
		}
752
753

	      if (display_rel_sim)
martinez's avatar
martinez committed
754
755
756
757
758
759
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
760

martinez's avatar
martinez committed
761
762
763
764
765
766
767
768
769
770
771
772
773
	      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);

	      if (rel_dir)
		spot::free_relation_simulation(rel_dir);
	      if (rel_del)
		spot::free_relation_simulation(rel_del);
774
	    }
775
	  tm.stop("reducing formula automaton");
776
777
	}

778
779
780
781
782
783
784
785
786
787
788
789
790
      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;
	}

791
792
      spot::tgba* product_degeneralized = 0;

793
      if (system)
794
795
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
796
797
798
799
800
801

	  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)
802
803
804
805
806
807
808
809
            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);
        }
810

811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
      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);
	    }
	}

829
830
831
832
833
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

834
      if (output != -1)
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
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
	  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);
878
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
		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");
895
	}
896

897
      if (echeck_inst)
898
	{
899
900
901
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
902
903
	  do
	    {
904
	      tm.start("running emptiness check");
905
	      spot::emptiness_check_result* res = ec->check();
906
907
	      tm.stop("running emptiness check");

908
909
910
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
911
                  std::cout << std::left << std::setw(25)
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
                            << 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
932
                    std::cout << "no stats, , ";
933
934
935
936
937
938
939
940
941
942
943
944
                  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 &&
945
		      (!expect_counter_example || ec->safe()))
946
947
948
                    exit_code = 1;

                  if (!res)
949
                    {
950
                      std::cout << "no accepting run found";
951
                      if (!ec->safe() && expect_counter_example)
952
953
                        {
                          std::cout << " even if expected" << std::endl;
954
955
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
956
957
958
959
960
961
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
962
                    }
963
964
                  else
                    {
965

966
		      tm.start("computing accepting run");
967
                      spot::tgba_run* run = res->accepting_run();
968
969
		      tm.stop("computing accepting run");

970
971
972
973
974
975
976
977
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
978
			      tm.start("reducing accepting run");
979
980
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
981
			      tm.stop("reducing accepting run");
982
983
984
                              delete run;
                              run = redrun;
                            }
985
			  tm.start("printing accepting run");
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
                          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;
1005
			  tm.stop("printing accepting run");
1006
1007
1008
                        }
                    }
                }
1009
1010
	      delete res;
	    }
1011
	  while (search_many);
1012
	  delete ec;
martinez's avatar
martinez committed
1013
1014
	}

1015
1016
      if (show_fc)
	delete a;
1017
      if (f)
1018
        f->destroy();
1019
1020
      delete product_degeneralized;
      delete product_to_free;
1021
      delete system;
1022
1023
      delete expl;
      delete aut_red;
1024
      delete degeneralized;
1025
      delete state_labeled;
1026
      delete to_free;
1027
      delete echeck_inst;
1028
1029
1030
1031
1032
1033
    }
  else
    {
      exit_code = 1;
    }

1034
1035
1036
  if (use_timer)
    tm.print(std::cout);

1037
1038
1039
1040
  if (unobservables)
    {
      for (spot::ltl::atomic_prop_set::iterator i =
	     unobservables->begin(); i != unobservables->end(); ++i)
1041
	(*i)->destroy();
1042
1043
1044
      delete unobservables;
    }

1045
1046
1047
1048
1049
  spot::ltl::atomic_prop::dump_instances(std::cerr);
  spot::ltl::unop::dump_instances(std::cerr);
  spot::ltl::binop::dump_instances(std::cerr);
  spot::ltl::multop::dump_instances(std::cerr);
  spot::ltl::automatop::dump_instances(std::cerr);
1050
1051
1052
1053
  assert(spot::ltl::atomic_prop::instance_count() == 0);
  assert(spot::ltl::unop::instance_count() == 0);
  assert(spot::ltl::binop::instance_count() == 0);
  assert(spot::ltl::multop::instance_count() == 0);
1054
  assert(spot::ltl::automatop::instance_count() == 0);
1055
  delete dict;
1056
1057
  return exit_code;
}