3f5470898d
* spot/misc/casts.hh: New inline functions and compile-time checks. * spot/kripke/kripkegraph.hh, spot/ta/taexplicit.cc, spot/ta/taproduct.cc, spot/ta/tgtaproduct.cc, spot/taalgos/tgba2ta.cc, spot/twa/taatgba.hh, spot/twa/taatgba.cc, spot/twa/twagraph.hh, spot/twa/twaproduct.cc, spot/twaalgos/emptiness.cc, spot/twaalgos/stutter.cc, spot/ltsmin/ltsmin.cc, tests/core/ikwiad.cc, tests/core/ngraph.cc: Remove downcast checks from code.
632 lines
16 KiB
C++
632 lines
16 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2014-2017 Laboratoire de Recherche et Développement de l'Epita.
|
|
//
|
|
// 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/>.
|
|
|
|
#pragma once
|
|
|
|
#include <spot/twa/fwd.hh>
|
|
#include <spot/graph/graph.hh>
|
|
#include <spot/graph/ngraph.hh>
|
|
#include <spot/twa/bdddict.hh>
|
|
#include <spot/twa/twa.hh>
|
|
#include <spot/twaalgos/copy.hh>
|
|
#include <spot/tl/formula.hh>
|
|
#include <sstream>
|
|
|
|
namespace spot
|
|
{
|
|
|
|
struct SPOT_API twa_graph_state: public spot::state
|
|
{
|
|
public:
|
|
twa_graph_state() noexcept
|
|
{
|
|
}
|
|
|
|
virtual ~twa_graph_state() noexcept
|
|
{
|
|
}
|
|
|
|
virtual int compare(const spot::state* other) const override
|
|
{
|
|
auto o = down_cast<const twa_graph_state*>(other);
|
|
|
|
// Do not simply return "other - this", it might not fit in an int.
|
|
if (o < this)
|
|
return -1;
|
|
if (o > this)
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
virtual size_t hash() const override
|
|
{
|
|
return
|
|
reinterpret_cast<const char*>(this) - static_cast<const char*>(nullptr);
|
|
}
|
|
|
|
virtual twa_graph_state*
|
|
clone() const override
|
|
{
|
|
return const_cast<twa_graph_state*>(this);
|
|
}
|
|
|
|
virtual void destroy() const override
|
|
{
|
|
}
|
|
};
|
|
|
|
struct SPOT_API twa_graph_edge_data
|
|
{
|
|
bdd cond;
|
|
acc_cond::mark_t acc;
|
|
|
|
explicit twa_graph_edge_data() noexcept
|
|
: cond(bddfalse), acc(0)
|
|
{
|
|
}
|
|
|
|
twa_graph_edge_data(bdd cond, acc_cond::mark_t acc = 0U) noexcept
|
|
: cond(cond), acc(acc)
|
|
{
|
|
}
|
|
|
|
bool operator<(const twa_graph_edge_data& other) const
|
|
{
|
|
if (cond.id() < other.cond.id())
|
|
return true;
|
|
if (cond.id() > other.cond.id())
|
|
return false;
|
|
return acc < other.acc;
|
|
}
|
|
|
|
bool operator==(const twa_graph_edge_data& other) const
|
|
{
|
|
return cond.id() == other.cond.id() &&
|
|
acc == other.acc;
|
|
}
|
|
};
|
|
|
|
|
|
template<class Graph>
|
|
class SPOT_API twa_graph_succ_iterator final:
|
|
public twa_succ_iterator
|
|
{
|
|
private:
|
|
typedef typename Graph::edge edge;
|
|
typedef typename Graph::state_data_t state;
|
|
const Graph* g_;
|
|
edge t_;
|
|
edge p_;
|
|
|
|
public:
|
|
twa_graph_succ_iterator(const Graph* g, edge t)
|
|
: g_(g), t_(t)
|
|
{
|
|
}
|
|
|
|
void recycle(edge t)
|
|
{
|
|
t_ = t;
|
|
}
|
|
|
|
virtual bool first() override
|
|
{
|
|
p_ = t_;
|
|
return p_;
|
|
}
|
|
|
|
virtual bool next() override
|
|
{
|
|
p_ = g_->edge_storage(p_).next_succ;
|
|
return p_;
|
|
}
|
|
|
|
virtual bool done() const override
|
|
{
|
|
return !p_;
|
|
}
|
|
|
|
virtual const twa_graph_state* dst() const override
|
|
{
|
|
SPOT_ASSERT(!done());
|
|
return &g_->state_data(g_->edge_storage(p_).dst);
|
|
}
|
|
|
|
virtual bdd cond() const override
|
|
{
|
|
SPOT_ASSERT(!done());
|
|
return g_->edge_data(p_).cond;
|
|
}
|
|
|
|
virtual acc_cond::mark_t acc() const override
|
|
{
|
|
SPOT_ASSERT(!done());
|
|
return g_->edge_data(p_).acc;
|
|
}
|
|
|
|
edge pos() const
|
|
{
|
|
return p_;
|
|
}
|
|
|
|
};
|
|
|
|
class SPOT_API twa_graph final: public twa
|
|
{
|
|
public:
|
|
typedef digraph<twa_graph_state, twa_graph_edge_data> graph_t;
|
|
// We avoid using graph_t::edge_storage_t because graph_t is not
|
|
// instantiated in the SWIG bindings, and SWIG would therefore
|
|
// handle graph_t::edge_storage_t as an abstract type.
|
|
typedef spot::internal::edge_storage<unsigned, unsigned, unsigned,
|
|
internal::boxed_label
|
|
<twa_graph_edge_data, false>>
|
|
edge_storage_t;
|
|
static_assert(std::is_same<typename graph_t::edge_storage_t,
|
|
edge_storage_t>::value, "type mismatch");
|
|
// We avoid using graph_t::state for the very same reason.
|
|
typedef unsigned state_num;
|
|
static_assert(std::is_same<typename graph_t::state, state_num>::value,
|
|
"type mismatch");
|
|
|
|
protected:
|
|
graph_t g_;
|
|
mutable unsigned init_number_;
|
|
|
|
public:
|
|
twa_graph(const bdd_dict_ptr& dict)
|
|
: twa(dict),
|
|
init_number_(0)
|
|
{
|
|
}
|
|
|
|
explicit twa_graph(const const_twa_graph_ptr& other, prop_set p)
|
|
: twa(other->get_dict()),
|
|
g_(other->g_), init_number_(other->init_number_)
|
|
{
|
|
copy_acceptance_of(other);
|
|
copy_ap_of(other);
|
|
prop_copy(other, p);
|
|
}
|
|
|
|
virtual ~twa_graph()
|
|
{
|
|
}
|
|
|
|
#ifndef SWIG
|
|
template <typename State_Name,
|
|
typename Name_Hash = std::hash<State_Name>,
|
|
typename Name_Equal = std::equal_to<State_Name>>
|
|
using namer = named_graph<graph_t, State_Name, Name_Hash, Name_Equal>;
|
|
|
|
template <typename State_Name,
|
|
typename Name_Hash = std::hash<State_Name>,
|
|
typename Name_Equal = std::equal_to<State_Name>>
|
|
namer<State_Name, Name_Hash, Name_Equal>*
|
|
create_namer()
|
|
{
|
|
return new named_graph<graph_t, State_Name, Name_Hash, Name_Equal>(g_);
|
|
}
|
|
|
|
namer<formula>*
|
|
create_formula_namer()
|
|
{
|
|
return create_namer<formula>();
|
|
}
|
|
|
|
void
|
|
release_formula_namer(namer<formula>* namer, bool keep_names);
|
|
#endif
|
|
|
|
graph_t& get_graph()
|
|
{
|
|
return g_;
|
|
}
|
|
|
|
const graph_t& get_graph() const
|
|
{
|
|
return g_;
|
|
}
|
|
|
|
unsigned num_states() const
|
|
{
|
|
return g_.num_states();
|
|
}
|
|
|
|
unsigned num_edges() const
|
|
{
|
|
return g_.num_edges();
|
|
}
|
|
|
|
void set_init_state(state_num s)
|
|
{
|
|
if (SPOT_UNLIKELY(s >= num_states()))
|
|
throw std::invalid_argument
|
|
("set_init_state() called with nonexisiting state");
|
|
init_number_ = s;
|
|
}
|
|
|
|
void set_init_state(const state* s)
|
|
{
|
|
set_init_state(state_number(s));
|
|
}
|
|
|
|
template<class I>
|
|
void set_univ_init_state(I dst_begin, I dst_end)
|
|
{
|
|
auto ns = num_states();
|
|
for (I i = dst_begin; i != dst_end; ++i)
|
|
if (SPOT_UNLIKELY(*i >= ns))
|
|
throw std::invalid_argument
|
|
("set_univ_init_state() called with nonexisiting state");
|
|
init_number_ = g_.new_univ_dests(dst_begin, dst_end);
|
|
}
|
|
|
|
template<class I>
|
|
void set_univ_init_state(const std::initializer_list<state_num>& il)
|
|
{
|
|
set_univ_init_state(il.begin(), il.end());
|
|
}
|
|
|
|
state_num get_init_state_number() const
|
|
{
|
|
// If the automaton has no state, it has no initial state.
|
|
if (num_states() == 0)
|
|
throw std::runtime_error("automaton has no state at all");
|
|
return init_number_;
|
|
}
|
|
|
|
virtual const twa_graph_state* get_init_state() const override
|
|
{
|
|
unsigned n = get_init_state_number();
|
|
if (SPOT_UNLIKELY(is_alternating()))
|
|
throw std::runtime_error
|
|
("the abstract interface does not support alternating automata");
|
|
return state_from_number(n);
|
|
}
|
|
|
|
virtual twa_succ_iterator*
|
|
succ_iter(const state* st) const override
|
|
{
|
|
auto s = down_cast<const typename graph_t::state_storage_t*>(st);
|
|
SPOT_ASSERT(!s->succ || g_.is_valid_edge(s->succ));
|
|
|
|
if (this->iter_cache_)
|
|
{
|
|
auto it =
|
|
down_cast<twa_graph_succ_iterator<graph_t>*>(this->iter_cache_);
|
|
it->recycle(s->succ);
|
|
this->iter_cache_ = nullptr;
|
|
return it;
|
|
}
|
|
return new twa_graph_succ_iterator<graph_t>(&g_, s->succ);
|
|
}
|
|
|
|
static constexpr bool is_univ_dest(const edge_storage_t& e)
|
|
{
|
|
return is_univ_dest(e.dst);
|
|
}
|
|
|
|
static constexpr bool is_univ_dest(unsigned s)
|
|
{
|
|
// Universal destinations are stored with their most-significant
|
|
// bit set.
|
|
return (int) s < 0;
|
|
}
|
|
|
|
state_num
|
|
state_number(const state* st) const
|
|
{
|
|
auto s = down_cast<const typename graph_t::state_storage_t*>(st);
|
|
return s - &g_.state_storage(0);
|
|
}
|
|
|
|
const twa_graph_state*
|
|
state_from_number(state_num n) const
|
|
{
|
|
return &g_.state_data(n);
|
|
}
|
|
|
|
std::string format_state(unsigned n) const
|
|
{
|
|
std::stringstream ss;
|
|
if (is_univ_dest(n))
|
|
{
|
|
bool notfirst = false;
|
|
for (unsigned d: univ_dests(n))
|
|
{
|
|
if (notfirst)
|
|
ss << '&';
|
|
notfirst = true;
|
|
ss << d;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
ss << n;
|
|
}
|
|
return ss.str();
|
|
}
|
|
|
|
virtual std::string format_state(const state* st) const override
|
|
{
|
|
return format_state(state_number(st));
|
|
}
|
|
|
|
unsigned edge_number(const twa_succ_iterator* it) const
|
|
{
|
|
auto* i = down_cast<const twa_graph_succ_iterator<graph_t>*>(it);
|
|
return i->pos();
|
|
}
|
|
|
|
twa_graph_edge_data& edge_data(const twa_succ_iterator* it)
|
|
{
|
|
return g_.edge_data(edge_number(it));
|
|
}
|
|
|
|
twa_graph_edge_data& edge_data(unsigned t)
|
|
{
|
|
return g_.edge_data(t);
|
|
}
|
|
|
|
const twa_graph_edge_data& edge_data(const twa_succ_iterator* it) const
|
|
{
|
|
return g_.edge_data(edge_number(it));
|
|
}
|
|
|
|
const twa_graph_edge_data& edge_data(unsigned t) const
|
|
{
|
|
return g_.edge_data(t);
|
|
}
|
|
|
|
edge_storage_t& edge_storage(const twa_succ_iterator* it)
|
|
{
|
|
return g_.edge_storage(edge_number(it));
|
|
}
|
|
|
|
edge_storage_t& edge_storage(unsigned t)
|
|
{
|
|
return g_.edge_storage(t);
|
|
}
|
|
|
|
const edge_storage_t
|
|
edge_storage(const twa_succ_iterator* it) const
|
|
{
|
|
return g_.edge_storage(edge_number(it));
|
|
}
|
|
|
|
const edge_storage_t edge_storage(unsigned t) const
|
|
{
|
|
return g_.edge_storage(t);
|
|
}
|
|
|
|
unsigned new_state()
|
|
{
|
|
return g_.new_state();
|
|
}
|
|
|
|
unsigned new_states(unsigned n)
|
|
{
|
|
return g_.new_states(n);
|
|
}
|
|
|
|
unsigned new_edge(unsigned src, unsigned dst,
|
|
bdd cond, acc_cond::mark_t acc = 0U)
|
|
{
|
|
return g_.new_edge(src, dst, cond, acc);
|
|
}
|
|
|
|
unsigned new_acc_edge(unsigned src, unsigned dst,
|
|
bdd cond, bool acc = true)
|
|
{
|
|
if (acc)
|
|
return g_.new_edge(src, dst, cond, this->acc().all_sets());
|
|
else
|
|
return g_.new_edge(src, dst, cond);
|
|
}
|
|
|
|
template<class I>
|
|
unsigned new_univ_edge(unsigned src, I begin, I end,
|
|
bdd cond, acc_cond::mark_t acc = 0U)
|
|
{
|
|
return g_.new_univ_edge(src, begin, end, cond, acc);
|
|
}
|
|
|
|
unsigned new_univ_edge(unsigned src, std::initializer_list<unsigned> dst,
|
|
bdd cond, acc_cond::mark_t acc = 0U)
|
|
{
|
|
return g_.new_univ_edge(src, dst.begin(), dst.end(), cond, acc);
|
|
}
|
|
|
|
#ifndef SWIG
|
|
internal::state_out<const graph_t>
|
|
out(unsigned src) const
|
|
{
|
|
return g_.out(src);
|
|
}
|
|
#endif
|
|
|
|
internal::state_out<graph_t>
|
|
out(unsigned src)
|
|
{
|
|
return g_.out(src);
|
|
}
|
|
|
|
internal::const_universal_dests
|
|
univ_dests(unsigned d) const noexcept
|
|
{
|
|
return g_.univ_dests(d);
|
|
}
|
|
|
|
internal::const_universal_dests
|
|
univ_dests(const edge_storage_t& e) const noexcept
|
|
{
|
|
return g_.univ_dests(e);
|
|
}
|
|
|
|
bool is_alternating() const
|
|
{
|
|
return g_.is_alternating();
|
|
}
|
|
|
|
#ifndef SWIG
|
|
auto states() const
|
|
SPOT_RETURN(g_.states());
|
|
auto states()
|
|
SPOT_RETURN(g_.states());
|
|
|
|
internal::all_trans<const graph_t>
|
|
edges() const noexcept
|
|
{
|
|
return g_.edges();
|
|
}
|
|
#endif
|
|
|
|
internal::all_trans<graph_t>
|
|
edges() noexcept
|
|
{
|
|
return g_.edges();
|
|
}
|
|
|
|
#ifndef SWIG
|
|
auto edge_vector() const
|
|
SPOT_RETURN(g_.edge_vector());
|
|
auto edge_vector()
|
|
SPOT_RETURN(g_.edge_vector());
|
|
|
|
auto is_dead_edge(const graph_t::edge_storage_t& t) const
|
|
SPOT_RETURN(g_.is_dead_edge(t));
|
|
#endif
|
|
|
|
/// Iterate over all edges, and merge those with compatible
|
|
/// extremities and acceptance.
|
|
void merge_edges();
|
|
|
|
/// \brief marge common universal destination
|
|
///
|
|
/// This is already called by merge_edges().
|
|
void merge_univ_dests();
|
|
|
|
/// \brief Remove all dead states
|
|
///
|
|
/// Dead states are all the states that cannot be part of
|
|
/// an infinite run of the automaton. This includes
|
|
/// states without successors, unreachable states, and states
|
|
/// that only have dead successors.
|
|
///
|
|
/// \see purge_unreachable_states
|
|
void purge_dead_states();
|
|
|
|
/// \brief Remove all unreachable states.
|
|
///
|
|
/// A state is unreachable if it cannot be reached from the initial state.
|
|
///
|
|
/// Use this function if you have declared more states than you
|
|
/// actually need in the automaton.
|
|
///
|
|
/// purge_dead_states() will remove more states than
|
|
/// purge_unreachable_states().
|
|
///
|
|
/// \see purge_dead_states
|
|
void purge_unreachable_states();
|
|
|
|
/// \brief Remove unused atomic propositions
|
|
///
|
|
/// Remove, from the list of atomic propositions registered by the
|
|
/// automaton, those that are not actually used by its labels.
|
|
void remove_unused_ap();
|
|
|
|
acc_cond::mark_t state_acc_sets(unsigned s) const
|
|
{
|
|
if (SPOT_UNLIKELY(!(bool)prop_state_acc()))
|
|
throw std::runtime_error
|
|
("state_acc_sets() should only be called on "
|
|
"automata with state-based acceptance");
|
|
for (auto& t: g_.out(s))
|
|
// Stop at the first edge, since the remaining should be
|
|
// labeled identically.
|
|
return t.acc;
|
|
return 0U;
|
|
}
|
|
|
|
bool state_is_accepting(unsigned s) const
|
|
{
|
|
if (SPOT_UNLIKELY(!(bool)prop_state_acc()))
|
|
throw std::runtime_error
|
|
("state_is_accepting() should only be called on "
|
|
"automata with state-based acceptance");
|
|
for (auto& t: g_.out(s))
|
|
// Stop at the first edge, since the remaining should be
|
|
// labeled identically.
|
|
return acc().accepting(t.acc);
|
|
return false;
|
|
}
|
|
|
|
bool state_is_accepting(const state* s) const
|
|
{
|
|
return state_is_accepting(state_number(s));
|
|
}
|
|
|
|
bool operator==(const twa_graph& aut) const
|
|
{
|
|
auto& dests1 = g_.dests_vector();
|
|
auto& dests2 = aut.get_graph().dests_vector();
|
|
if (num_states() != aut.num_states() ||
|
|
num_edges() != aut.num_edges() ||
|
|
num_sets() != aut.num_sets() ||
|
|
dests1.size() != dests2.size())
|
|
return false;
|
|
auto& trans1 = edge_vector();
|
|
auto& trans2 = aut.edge_vector();
|
|
if (!std::equal(trans1.begin() + 1, trans1.end(),
|
|
trans2.begin() + 1))
|
|
return false;
|
|
return std::equal(dests1.begin(), dests1.end(),
|
|
dests2.begin());
|
|
}
|
|
|
|
void defrag_states(std::vector<unsigned>&& newst, unsigned used_states);
|
|
};
|
|
|
|
inline twa_graph_ptr make_twa_graph(const bdd_dict_ptr& dict)
|
|
{
|
|
return std::make_shared<twa_graph>(dict);
|
|
}
|
|
|
|
inline twa_graph_ptr make_twa_graph(const twa_graph_ptr& aut,
|
|
twa::prop_set p)
|
|
{
|
|
return std::make_shared<twa_graph>(aut, p);
|
|
}
|
|
|
|
inline twa_graph_ptr make_twa_graph(const const_twa_graph_ptr& aut,
|
|
twa::prop_set p)
|
|
{
|
|
return std::make_shared<twa_graph>(aut, p);
|
|
}
|
|
|
|
inline twa_graph_ptr make_twa_graph(const const_twa_ptr& aut,
|
|
twa::prop_set p)
|
|
{
|
|
auto a = std::dynamic_pointer_cast<const twa_graph>(aut);
|
|
if (a)
|
|
return std::make_shared<twa_graph>(a, p);
|
|
else
|
|
return copy(aut, p);
|
|
}
|
|
}
|