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_PhilosophersDyn-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r121-smll-149441672300268
=====================================================================

--------------------
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 PhilosophersDyn-COL-03-ReachabilityCardinality-0
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-1
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-15
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-2
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-3
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-4
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-5
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-6
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-7
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-8
FORMULA_NAME PhilosophersDyn-COL-03-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494893845173

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: PhilosophersDyn_PT_03
(NrP: 30 NrTr: 84 NrArc: 564)

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

net check time: 0m 0.000sec

init dd package: 0m 1.144sec

parse successfull
net created successfully

Net: PhilosophersDyn_PT_03
(NrP: 30 NrTr: 84 NrArc: 564)

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

net check time: 0m 0.000sec

init dd package: 0m 3.743sec


RS generation: 0m 0.015sec


-> reachability set: #nodes 448 (4.5e+02) #states 325



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

checking: EF [1<=sum(Outside_1, Outside_2, Outside_3)]
normalized: E [true U 1<=sum(Outside_1, Outside_2, Outside_3)]

abstracting: (1<=sum(Outside_1, Outside_2, Outside_3))
states: 121
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [3<=sum(Outside_1, Outside_2, Outside_3)]
normalized: E [true U 3<=sum(Outside_1, Outside_2, Outside_3)]

abstracting: (3<=sum(Outside_1, Outside_2, Outside_3))
states: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]
normalized: E [true U sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 271
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]
normalized: ~ [E [true U ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 235
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AG [sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]
normalized: ~ [E [true U ~ [sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]]]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1))
states: 232
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]
normalized: E [true U sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1))
states: 232
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [~ [2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]
normalized: ~ [E [true U 2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]

abstracting: (2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 306
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Think_1, Think_2, Think_3)]
normalized: E [true U sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Think_1, Think_2, Think_3)]

abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Think_1, Think_2, Think_3))
states: 22
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AG [[3<=sum(Outside_1, Outside_2, Outside_3) & [~ [sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1)]]]]
normalized: ~ [E [true U ~ [[3<=sum(Outside_1, Outside_2, Outside_3) & [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1)] & ~ [sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 232
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
abstracting: (3<=sum(Outside_1, Outside_2, Outside_3))
states: 1
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: AG [[~ [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) & sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]] | ~ [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]
normalized: ~ [E [true U ~ [[~ [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) & sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]] | ~ [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]]

abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 255
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 243
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 235
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

checking: AG [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]
normalized: ~ [E [true U ~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]

abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 7
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 325
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1)] & [2<=sum(Outside_1, Outside_2, Outside_3) | [1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]
normalized: E [true U [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1)] & [[1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] | 2<=sum(Outside_1, Outside_2, Outside_3)]]]

abstracting: (2<=sum(Outside_1, Outside_2, Outside_3))
states: 19
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 130
abstracting: (1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 255
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: EF [[[[3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | 3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] | ~ [2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] & 1<=sum(Outside_1, Outside_2, Outside_3)]]
normalized: E [true U [1<=sum(Outside_1, Outside_2, Outside_3) & [~ [2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | [3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) | 3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]

abstracting: (3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 204
abstracting: (3<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 204
abstracting: (2<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 120
abstracting: (1<=sum(Outside_1, Outside_2, Outside_3))
states: 121
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: EF [[[~ [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] & [3<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | 3<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] & [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3) | sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] & 3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]
normalized: E [true U [[[3<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | 3<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & ~ [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3) | sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]

abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 265
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 226
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 24
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 255
abstracting: (3<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 0
abstracting: (3<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: EF [[[~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2)] & [sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]] | 2<=sum(Forks_3, Forks_2, Forks_1)]]
normalized: E [true U [2<=sum(Forks_3, Forks_2, Forks_1) | [~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2)] & [sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]

abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 7
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3))
states: 325
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 136
abstracting: (2<=sum(Forks_3, Forks_2, Forks_1))
states: 60
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

checking: EF [[[[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & 3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)]] | 1<=sum(Think_1, Think_2, Think_3)]]
normalized: E [true U [1<=sum(Think_1, Think_2, Think_3) | [[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & 3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)]]]]

abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 226
abstracting: (2<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 306
abstracting: (3<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 24
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 271
abstracting: (1<=sum(Think_1, Think_2, Think_3))
states: 213
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

totally nodes used: 19307 (1.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 80308 231796 312104
used/not used/entry size/cache size: 238930 66869934 16 1024MB
basic ops cache: hits/miss/sum: 17925 36682 54607
used/not used/entry size/cache size: 61035 16716181 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 10045 10045
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 985 3455 4440
used/not used/entry size/cache size: 3455 8385153 32 256MB
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 67089743
1 18935
2 186
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.983sec


BK_STOP 1494893853261

--------------------
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

ptnet_zbdd.cc:66: Boundedness exception: net maybe not 1-bounded!

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:1658 (19), effective:60 (0)

initing FirstDep: 0m 0.000sec


iterations count:958 (11), effective:27 (0)

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

iterations count:286 (3), effective:9 (0)

iterations count:538 (6), effective:17 (0)

iterations count:1326 (15), effective:44 (0)

iterations count:262 (3), effective:9 (0)

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

iterations count:812 (9), effective:26 (0)

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

iterations count:659 (7), effective:23 (0)

iterations count:1512 (18), effective:53 (0)

iterations count:1107 (13), effective:35 (0)

iterations count:695 (8), effective:18 (0)

iterations count:462 (5), effective:12 (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_PhilosophersDyn-PT-03"
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_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 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_PhilosophersDyn-PT-03, 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-149441672300268"
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 ;