Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is S_Philosophers-PT-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r121-smll-149441672200205
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-0
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-1
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-10
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-11
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-12
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-13
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-14
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-15
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-2
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-3
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-4
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-5
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-6
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-7
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-8
FORMULA_NAME Philosophers-COL-000005-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494850976836

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: Philosophers_PT_000005
(NrP: 25 NrTr: 25 NrArc: 80)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.216sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 43 (4.3e+01) #states 243



starting MCC model checker
--------------------------

checking: AG [1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]
normalized: ~ [E [true U ~ [1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]

abstracting: (1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 161
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]
normalized: E [true U 3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]

abstracting: (3<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 86
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]
normalized: ~ [E [true U ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]

abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]
normalized: E [true U sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]

abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 123
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]
normalized: E [true U sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]

abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 87
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]
normalized: ~ [E [true U sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]

abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
-> the formula is FALSE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]
normalized: E [true U sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]

abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 147
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [~ [~ [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]
normalized: E [true U [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]

abstracting: (2<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 196
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 32
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [~ [~ [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]
normalized: E [true U [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]

abstracting: (1<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 241
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 127
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [~ [[1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]
normalized: E [true U ~ [[[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] & 1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]

abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 120
abstracting: (1<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 161
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 147
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]
normalized: E [true U [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]

abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 188
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[~ [[3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]
normalized: E [true U [~ [[3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | 3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]

abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
abstracting: (3<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 51
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: AG [~ [[~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]]
normalized: ~ [E [true U [[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] & ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]

abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (3<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 51
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 147
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EF [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | ~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]
normalized: E [true U [~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]

abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 76
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [[[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & [2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | 1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] | [[1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] & ~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]
normalized: E [true U [[[1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] & ~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | [[2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | 1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]

abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (1<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 161
abstracting: (2<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 76
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 147
abstracting: (2<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 76
abstracting: (1<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 120
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | [[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]
normalized: E [true U [[[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & 3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]

abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 243
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (3<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 26
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 127
-> the formula is TRUE

FORMULA Philosophers-COL-000005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

totally nodes used: 17226(1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12473 15899 28372
used/not used/entry size/cache size: 15292 67093572 16 1024MB
basic ops cache: hits/miss/sum: 20845 28845 49690
used/not used/entry size/cache size: 66087 16711129 12 192MB
unary ops cache: hits/miss/sum: 0 45 45
used/not used/entry size/cache size: 45 8388563 8 64MB
abstract ops cache: hits/miss/sum: 0 35496 35496
used/not used/entry size/cache size: 3 8388605 12 96MB
state nr cache: hits/miss/sum: 464 641 1105
used/not used/entry size/cache size: 641 2096511 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67091641
1 17220
2 3
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.430sec


BK_STOP 1494850979304

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:108 (4), effective:15 (0)

initing FirstDep: 0m 0.000sec


iterations count:146 (5), effective:19 (0)

iterations count:199 (7), effective:25 (1)

iterations count:175 (7), effective:27 (1)

iterations count:69 (2), effective:5 (0)

iterations count:130 (5), effective:22 (0)

iterations count:25 (1), effective:0 (0)

iterations count:209 (8), effective:30 (1)

iterations count:370 (14), effective:57 (2)

iterations count:156 (6), effective:22 (0)

iterations count:116 (4), effective:15 (0)

iterations count:100 (4), effective:11 (0)

iterations count:34 (1), effective:3 (0)

iterations count:87 (3), effective:10 (0)

iterations count:145 (5), effective:18 (0)

iterations count:25 (1), effective:0 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Philosophers-PT-000005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_Philosophers-PT-000005.tgz
mv S_Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_Philosophers-PT-000005, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r121-smll-149441672200205"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;