tgbagraph.test 2.75 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
#!/bin/sh
# -*- 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/>.

# While running some benchmark, Tomáš Babiak found that Spot took too
# much time (i.e. >1h) to translate those six formulae.  It turns out
# that the WDBA minimization was performed after the degeneralization
# algorithm, while this is not necessary (WDBA will produce a BA, so
# we may as well skip degeneralization).  Translating these formulae
# in the test-suite ensure that they don't take too much time (the
# buildfarm will timeout if it does).

. ./defs

set -e

run 0 ../tgbagraph | tee stdout

cat >expected <<EOF
digraph G {
  0 [label="", style=invis, height=0]
  0 -> 1
  1 [label="0"]
40
  1 -> 1 [label="0\n"]
41
42
43
44
45
46
47
48
49
  1 -> 2 [label="p1\n"]
  1 -> 3 [label="p2\n{Acc[p2]}"]
  2 [label="1"]
  2 -> 3 [label="p1 & p2\n{Acc[p1]}"]
  3 [label="2"]
  3 -> 1 [label="p1 | p2\n{Acc[p2], Acc[p1]}"]
  3 -> 2 [label="!p1 | p2\n"]
  3 -> 3 [label="1\n{Acc[p2], Acc[p1]}"]
}
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
digraph G {
  0 [label="", style=invis, height=0]
  0 -> 1
  1 [label="0"]
  1 -> 1 [label="0\n"]
  1 -> 2 [label="p1\n"]
  1 -> 3 [label="p2\n{Acc[p2]}"]
  2 [label="1"]
  2 -> 3 [label="p1 & p2\n{Acc[p1]}"]
  3 [label="2"]
  3 -> 1 [label="p1 | p2\n{Acc[p2], Acc[p1]}"]
}
digraph G {
  0 [label="", style=invis, height=0]
  0 -> 1
  1 [label="0"]
  1 -> 1 [label="0\n"]
  1 -> 2 [label="p1\n"]
  1 -> 3 [label="p2\n{Acc[p2]}"]
  2 [label="1"]
  2 -> 3 [label="p1 & p2\n{Acc[p1]}"]
  3 [label="2"]
}
digraph G {
  0 [label="", style=invis, height=0]
  0 -> 1
  1 [label="0"]
  1 -> 1 [label="0\n"]
  1 -> 2 [label="p1\n"]
  1 -> 3 [label="p2\n{Acc[p2]}"]
  2 [label="1"]
  2 -> 3 [label="p1 & p2\n{Acc[p1]}"]
  3 [label="2"]
  3 -> 1 [label="p1 | p2\n{Acc[p2], Acc[p1]}"]
  3 -> 2 [label="!p1 | p2\n"]
  3 -> 1 [label="1\n{Acc[p2], Acc[p1]}"]
}
digraph G {
  0 [label="", style=invis, height=0]
  0 -> 1
  1 [label="0"]
  1 -> 2 [label="p1\n"]
  1 -> 3 [label="p2\n{Acc[p2]}"]
  2 [label="1"]
  2 -> 3 [label="p1 & p2\n{Acc[p1]}"]
  3 [label="2"]
  3 -> 1 [label="1\n{Acc[p2], Acc[p1]}"]
  3 -> 2 [label="!p1 | p2\n"]
}
99
100
101
102
EOF

diff stdout expected