* src/twaalgos/dtgbasat.cc (sat_minimize): Use any arbitrary acceptance condition passed via the "acc" option. * src/twa/acc.hh (mark_t::max_set): New method. * src/tests/satmin2.test: Add two test cases with DRA as input and DSA as output.
113 lines
2.5 KiB
Bash
Executable file
113 lines
2.5 KiB
Bash
Executable file
#!/bin/sh
|
|
# -*- coding: utf-8 -*-
|
|
# Copyright (C) 2013, 2015 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/>.
|
|
|
|
. ./defs
|
|
set -e
|
|
|
|
# Skip if $SATSOLVE is not installed.
|
|
(${SATSOLVER-glucose} --help >/dev/null 2>&1) || exit 77
|
|
|
|
autfilt=../../bin/autfilt
|
|
ltlfilt=../../bin/ltlfilt
|
|
|
|
# This is a counterexample for one of the optimization idea we had for
|
|
# the SAT-based minimization.
|
|
cat >input.hoa <<EOF
|
|
HOA: v1
|
|
States: 3
|
|
Start: 0
|
|
AP: 1 "a"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: trans-labels explicit-labels trans-acc complete deterministic
|
|
--BODY--
|
|
State: 0
|
|
[0] 1 {0}
|
|
[!0] 2
|
|
State: 1
|
|
[!0] 0 {0}
|
|
[0] 2
|
|
State: 2
|
|
[0] 2 {0}
|
|
[!0] 2
|
|
--END--
|
|
EOF
|
|
|
|
cat >expected <<EOF
|
|
sub trans.: 2
|
|
transitions: 2
|
|
states: 1
|
|
nondeterministic states: 0
|
|
EOF
|
|
|
|
../ltl2tgba -RS1 -kt -XH input.hoa > output
|
|
diff output expected
|
|
|
|
# At some point, this formula was correctly minimized, but
|
|
# the output was not marked as state-based.
|
|
../../bin/ltl2tgba -BD -x sat-minimize "GF(a <-> XXb)" -H >out
|
|
grep 'properties:.*state-acc' out
|
|
grep 'properties:.*deterministic' out
|
|
|
|
|
|
# DRA produced by ltl2dstar for GFp0 -> GFp1
|
|
cat >test.hoa <<EOF
|
|
HOA: v1
|
|
States: 4
|
|
properties: implicit-labels trans-labels no-univ-branch deterministic complete
|
|
acc-name: Rabin 2
|
|
Acceptance: 4 (Fin(0)&Inf(1))|(Fin(2)&Inf(3))
|
|
Start: 0
|
|
AP: 2 "p0" "p1"
|
|
--BODY--
|
|
State: 0 {0}
|
|
1
|
|
0
|
|
3
|
|
2
|
|
State: 1 {1}
|
|
1
|
|
0
|
|
3
|
|
2
|
|
State: 2 {0 3}
|
|
1
|
|
0
|
|
3
|
|
2
|
|
State: 3 {1 3}
|
|
1
|
|
0
|
|
3
|
|
2
|
|
--END--
|
|
EOF
|
|
|
|
# Let's try to find a smaller transition-based Streett automaton We
|
|
# easily really check the expected automaton, because different SAT
|
|
# solver (even different versions of glucose) can return different
|
|
# automata.
|
|
$autfilt -H --sat-minimize='acc="Fin(0)|Inf(1)"' test.hoa --stats=%s >output
|
|
test `cat output` = 1
|
|
|
|
# How about a state-based DSA?
|
|
$autfilt -H --sat-minimize='state-based,acc="Fin(0)|Inf(1)"' test.hoa \
|
|
--stats=%s > output
|
|
test `cat output` = 3
|