emptchk.cc 5.63 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
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
// -*- coding: utf-8 -*-
// Copyright (C) 2014 Laboratoire de Recherche et Développement de
// l'Epita (LRDE).
//
// 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 3 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 this program.  If not, see <http://www.gnu.org/licenses/>.

#include <iostream>
#include <fstream>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include "ltlparse/public.hh"
#include "ltlast/allnodes.hh"
#include "tgba/futurecondcol.hh"
#include "tgbaalgos/ltl2tgba_fm.hh"
#include "tgbaalgos/ltl2taa.hh"
#include "tgbaalgos/sccfilter.hh"
#include "tgbaalgos/degen.hh"
#include "tgba/tgbaproduct.hh"
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/dotty.hh"
#include "tgbaalgos/dupexp.hh"
#include "tgbaalgos/emptiness.hh"

void
syntax(char* prog)
{
  std::cerr << prog << " file" << std::endl;
  exit(2);
}

int
main(int argc, char** argv)
{
  if (argc != 2)
    syntax(argv[0]);
  std::ifstream input(argv[1]);
  if (!input)
    {
      std::cerr << "failed to open " << argv[1] << '\n';
      return 2;
    }


  auto d = spot::make_bdd_dict();

  std::string s;
  unsigned line = 0;
  while (std::getline(input, s))
    {
      ++line;
      std::cout << "========================================================\n";
      std::cout << line << ": " << s << '\n';
      if (s.empty() || s[0] == '#') // Skip comments
	continue;

      std::vector<std::string> tokens;
      {
	std::istringstream ss(s);
	std::string form;
	while (std::getline(ss, form, ','))
	  {
	    std::string tmp;
	    while (form.size() > 0 && form.back() == '\\'
		   && std::getline(ss, tmp, ','))
	      {
		form.back() = ',';
		form += tmp;
	      }
	    tokens.push_back(form);
	  }
      }

      if (tokens.size() != 2)
	{
	  std::cerr << "Expecting two tokens on input line.\n";
	  exit(2);
	}

      int runs = atoi(tokens[0].c_str());

      spot::ltl::parse_error_list pe;
      auto f = spot::ltl::parse(tokens[1], pe);
      if (spot::ltl::format_parse_errors(std::cerr, tokens[1], pe))
	return 2;

      auto d = spot::make_bdd_dict();

      // Build many different automata from this formula.
      spot::const_tgba_ptr aut[4];
      {
	auto a = spot::ltl_to_taa(f, d);
	aut[0] = a;
	aut[1] = spot::degeneralize_tba(a);
      }
      {
	auto a = spot::ltl_to_tgba_fm(f, d);
	aut[2] = a;
	aut[3] = spot::degeneralize(a);
      }

      const char* algos[] = {
	"Cou99", "Cou99(shy)",
	"CVWY90", "CVWY90(bsh=10M)", "CVWY90(repeated)",
	"SE05", "SE05(bsh=10M)", "SE05(repeated)",
	"Tau03_opt", "GV04",
      };

      for (auto& algo: algos)
	{
	  const char* err;
	  auto i = spot::emptiness_check_instantiator::construct(algo, &err);
	  if (!i)
	    {
	      std::cerr << "Failed to parse `" << err <<  '\'' << std::endl;
	      exit(2);
	    }

	  for (unsigned j = 0; j < sizeof(aut)/sizeof(*aut); ++j)
	    {
	      auto a = aut[j];
	      std::cout << "** Testing aut[" << j << "] using " << algo << '\n';
	      unsigned n_acc = a->number_of_acceptance_conditions();
	      unsigned n_max = i->max_acceptance_conditions();
	      if (n_max < n_acc)
		{
		  std::cout << "Skipping because automaton has " << n_acc
			    << " acceptance sets, and " << algo
			    << " accepts at most " << n_max << ".\n";
		  continue;
		}
	      unsigned n_min = i->min_acceptance_conditions();
	      if (n_min > n_acc)
		{
		  std::cout << "Skipping because automaton has " << n_acc
			    << " acceptance sets, and " << algo
			    << " wants at least " << n_min << ".\n";
		  continue;
		}

	      auto ec = i->instantiate(a);
	      bool search_many = i->options().get("repeated");
	      assert(ec);
	      int ce_found = 0;
	      do
		{
		  auto res = ec->check();
		  if (res)
		    {
		      ++ce_found;
		      std::cout << ce_found << " counterexample found\n";
                      auto run = res->accepting_run();
		      if (run)
			{
			  auto ar = spot::tgba_run_to_tgba(a, run);
			  spot::dotty_reachable(std::cout, ar, false);
			  delete run;
			}
		      std::cout << '\n';
		      if (runs == 0)
			{
			  std::cerr << "ERROR: Expected no counterexample.\n";
			  exit(1);
			}
		      delete res;
		    }
		  else
		    {
		      if (ce_found)
			std::cout << "No more counterexample found.\n\n";
		      else
			std::cout << "No counterexample found.\n\n";
		      break;
		    }
		}
	      while (search_many);

	      // The expected number of runs is only for TAA translations
	      if (search_many && runs > ce_found && j < 2)
		{
		  std::cerr << "ERROR: only " << ce_found
			    << " counterexamples founds, expected at least "
			    << runs << '\n';
		  exit(1);
		}
	      if (!search_many && ec->safe() && runs && !ce_found)
		{
		  std::cerr << "ERROR: expected a counterexample.\n";
		  exit(1);
		}

	      delete ec;
	    }
	  delete i;
	}
      f->destroy();
    }

  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);
  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);
  return 0;
}