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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r121-smll-149441672300264
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494893760798

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=CTLCardinality.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.001sec

net check time: 0m 0.000sec

init dd package: 0m 1.472sec

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


RS generation: 0m 0.016sec


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



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

checking: AF [EG [~ [1<=sum(HasRight_3, HasRight_1, HasRight_2)]]]
normalized: ~ [EG [~ [EG [~ [1<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]

abstracting: (1<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 138
.
EG iterations: 1
....
EG iterations: 4
-> the formula is TRUE

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

MC time: 0m 0.063sec

checking: 1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)
normalized: 1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)

abstracting: (1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 255
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

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

abstracting: (2<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 15
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: AG [[AF [2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | 3<=sum(Forks_3, Forks_2, Forks_1)]]
normalized: ~ [E [true U ~ [[3<=sum(Forks_3, Forks_2, Forks_1) | ~ [EG [~ [2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]]]]

abstracting: (2<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 120
......
EG iterations: 6
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1))
states: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: EX [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]
normalized: EX [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]

abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 127
.-> the formula is TRUE

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

MC time: 0m 0.043sec

checking: EX [~ [AF [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]
normalized: EX [EG [~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]

abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 325
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: A [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) U [~ [3<=sum(Think_1, Think_2, Think_3)] | ~ [3<=sum(HasRight_3, HasRight_1, HasRight_2)]]]
normalized: [~ [EG [~ [[~ [3<=sum(HasRight_3, HasRight_1, HasRight_2)] | ~ [3<=sum(Think_1, Think_2, Think_3)]]]]] & ~ [E [~ [[~ [3<=sum(HasRight_3, HasRight_1, HasRight_2)] | ~ [3<=sum(Think_1, Think_2, Think_3)]]] U [~ [[~ [3<=sum(HasRight_3, HasRight_1, HasRight_2)] | ~ [3<=sum(Think_1, Think_2, Think_3)]]] & ~ [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
abstracting: (3<=sum(Think_1, Think_2, Think_3))
states: 6
abstracting: (3<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (3<=sum(Think_1, Think_2, Think_3))
states: 6
abstracting: (3<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (3<=sum(Think_1, Think_2, Think_3))
states: 6
abstracting: (3<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.111sec

checking: A [AG [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] U EG [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)]]
normalized: [~ [EG [~ [EG [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)]]]] & ~ [E [~ [EG [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)]] U [E [true U ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & ~ [EG [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)]]]]]]

abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
.....
EG iterations: 5
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 235
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
.....
EG iterations: 5
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
.....
EG iterations: 5
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.127sec

checking: E [[[3<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | 3<=sum(Forks_3, Forks_2, Forks_1)] | 1<=sum(Forks_3, Forks_2, Forks_1)] U AF [2<=sum(HasRight_3, HasRight_1, HasRight_2)]]
normalized: E [[1<=sum(Forks_3, Forks_2, Forks_1) | [3<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | 3<=sum(Forks_3, Forks_2, Forks_1)]] U ~ [EG [~ [2<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]

abstracting: (2<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 15
.
EG iterations: 1
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (3<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 24
abstracting: (1<=sum(Forks_3, Forks_2, Forks_1))
states: 210
-> the formula is FALSE

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

MC time: 0m 0.123sec

checking: A [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=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) U EG [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]
normalized: [~ [EG [~ [EG [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]] & ~ [E [~ [EG [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] U [~ [EG [1<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & ~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=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: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=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: 325
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 255
.
EG iterations: 1
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 255
.
EG iterations: 1
abstracting: (1<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 255
.
EG iterations: 1
.......
EG iterations: 7
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: A [[~ [2<=sum(Think_1, Think_2, Think_3)] | [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 1<=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)]] U 1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]
normalized: [~ [EG [~ [1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]] & ~ [E [~ [1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U [~ [[~ [2<=sum(Think_1, Think_2, Think_3)] | [3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 1<=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)]]] & ~ [1<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]]

abstracting: (1<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 138
abstracting: (1<=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: 324
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 24
abstracting: (2<=sum(Think_1, Think_2, Think_3))
states: 63
abstracting: (1<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 138
abstracting: (1<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 138
.
EG iterations: 1
-> the formula is FALSE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: A [AX [2<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U [~ [2<=sum(Think_1, Think_2, Think_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)]]
normalized: [~ [EG [~ [[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) | ~ [2<=sum(Think_1, Think_2, Think_3)]]]]] & ~ [E [~ [[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) | ~ [2<=sum(Think_1, Think_2, Think_3)]]] U [EX [~ [2<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] & ~ [[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) | ~ [2<=sum(Think_1, Think_2, Think_3)]]]]]]]

abstracting: (2<=sum(Think_1, Think_2, Think_3))
states: 63
abstracting: (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))
states: 306
abstracting: (2<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 15
.abstracting: (2<=sum(Think_1, Think_2, Think_3))
states: 63
abstracting: (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))
states: 306
abstracting: (2<=sum(Think_1, Think_2, Think_3))
states: 63
abstracting: (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))
states: 306
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.040sec

checking: [[A [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) U 1<=sum(Think_1, Think_2, Think_3)] & [3<=sum(HasRight_3, HasRight_1, HasRight_2) | 2<=sum(Forks_3, Forks_2, Forks_1)]] | 1<=sum(Forks_3, Forks_2, Forks_1)]
normalized: [1<=sum(Forks_3, Forks_2, Forks_1) | [[3<=sum(HasRight_3, HasRight_1, HasRight_2) | 2<=sum(Forks_3, Forks_2, Forks_1)] & [~ [EG [~ [1<=sum(Think_1, Think_2, Think_3)]]] & ~ [E [~ [1<=sum(Think_1, Think_2, Think_3)] U [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & ~ [1<=sum(Think_1, Think_2, Think_3)]]]]]]]

abstracting: (1<=sum(Think_1, Think_2, Think_3))
states: 213
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 136
abstracting: (1<=sum(Think_1, Think_2, Think_3))
states: 213
abstracting: (1<=sum(Think_1, Think_2, Think_3))
states: 213
..
EG iterations: 2
abstracting: (2<=sum(Forks_3, Forks_2, Forks_1))
states: 60
abstracting: (3<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (1<=sum(Forks_3, Forks_2, Forks_1))
states: 210
-> the formula is FALSE

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

MC time: 0m 0.118sec

checking: [[~ [AF [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & 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(Outside_1, Outside_2, Outside_3)] | sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]
normalized: [sum(Think_1, Think_2, Think_3)<=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(Outside_1, Outside_2, Outside_3) & EG [~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]]

abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 271
...
EG iterations: 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(Outside_1, Outside_2, Outside_3))
states: 19
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 232
-> the formula is TRUE

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

MC time: 0m 0.115sec

checking: [[EG [[3<=sum(Forks_3, Forks_2, Forks_1) | 2<=sum(HasRight_3, HasRight_1, HasRight_2)]] & sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)] | E [sum(Outside_1, Outside_2, Outside_3)<=sum(Think_1, Think_2, Think_3) U [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]
normalized: [E [sum(Outside_1, Outside_2, Outside_3)<=sum(Think_1, Think_2, Think_3) U [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] | [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) & EG [[3<=sum(Forks_3, Forks_2, Forks_1) | 2<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]

abstracting: (2<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 15
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1))
states: 0
.
EG iterations: 1
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 243
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 130
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 313
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Think_1, Think_2, Think_3))
states: 261
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.163sec

checking: [EF [[[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)] | ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] | [[[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] | [1<=sum(HasRight_3, HasRight_1, HasRight_2) & 3<=sum(Forks_3, Forks_2, Forks_1)]] & ~ [~ [2<=sum(Forks_3, Forks_2, Forks_1)]]] | ~ [EG [1<=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: [[~ [EG [1<=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(Forks_3, Forks_2, Forks_1) & [[1<=sum(HasRight_3, HasRight_1, HasRight_2) & 3<=sum(Forks_3, Forks_2, Forks_1)] | [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) | sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]] | E [true U [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)]]]]

abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3))
states: 169
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 243
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 136
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (1<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 138
abstracting: (2<=sum(Forks_3, Forks_2, Forks_1))
states: 60
abstracting: (1<=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: 324
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

totally nodes used: 39497 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 89103 337996 427099
used/not used/entry size/cache size: 357998 66750866 16 1024MB
basic ops cache: hits/miss/sum: 16362 50900 67262
used/not used/entry size/cache size: 88762 16688454 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 13727 13727
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1062 3683 4745
used/not used/entry size/cache size: 3683 8384925 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 67070370
1 37510
2 965
3 19
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.136sec


BK_STOP 1494893770044

--------------------
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:588 (7), effective:18 (0)

iterations count:1049 (12), effective:27 (0)

iterations count:1059 (12), effective:30 (0)

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

iterations count:503 (5), effective:13 (0)

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

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

iterations count:84 (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_PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLCardinality"
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 CTLCardinality"
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-149441672300264"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;