// -*- coding: utf-8 -*-
// Copyright (C) 2015 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/>.

#include "tgbaalgos/cleanacc.hh"

namespace spot
{
  void cleanup_acceptance(tgba_digraph_ptr& aut)
  {
    auto& acc = aut->acc();
    if (acc.num_sets() == 0)
      return;

    auto& c = aut->get_acceptance();
    acc_cond::mark_t used_in_cond = c.used_sets();

    acc_cond::mark_t used_in_aut = 0U;
    for (auto& t: aut->transitions())
      used_in_aut |= t.acc;

    auto useful = used_in_aut & used_in_cond;

    auto useless = acc.comp(useful);

    if (!useless)
      return;

    // Remove useless marks from the automaton
    for (auto& t: aut->transitions())
      t.acc = t.acc.strip(useless);

    // Remove useless marks from the acceptance condition
    aut->set_acceptance(useful.count(), c.strip(useless, true));

    // This may in turn cause even more set to be unused, because of
    // some simplifications, so do it again.
    return cleanup_acceptance(aut);
  }

}