fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r041-smll-149440525600232
Last Updated
June 27, 2017

About the Execution of MARCIE for PhilosophersDyn-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7529.290 9220.00 9000.00 39.60 TTTFFTTFFTTTTFFT normal

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 PhilosophersDyn-COL-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041-smll-149440525600232
=====================================================================


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

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

Unfolding complete |P|=30|T|=84|A|=591
Time for unfolding: 0m 0.853sec

Net: PhilosophersDyn_COL_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.090sec

parse successfull
net created successfully

Unfolding complete |P|=30|T|=84|A|=591
Time for unfolding: 0m 0.572sec

Net: PhilosophersDyn_COL_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.618sec


RS generation: 0m 0.014sec


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



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

checking: EF [1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)]
normalized: E [true U 1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)]

abstracting: (1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
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.050sec

checking: EF [3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)]
normalized: E [true U 3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)]

abstracting: (3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
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.033sec

checking: EF [sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]
normalized: E [true U sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]

abstracting: (sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
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.041sec

checking: AG [sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]
normalized: ~ [E [true U ~ [sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]]]

abstracting: (sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
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.042sec

checking: AG [sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]
normalized: ~ [E [true U ~ [sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]]]

abstracting: (sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1))
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.052sec

checking: EF [sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]
normalized: E [true U sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]

abstracting: (sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1))
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_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)]]
normalized: ~ [E [true U 2<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)]]

abstracting: (2<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1))
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.035sec

checking: EF [sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)]
normalized: E [true U sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)]

abstracting: (sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1))
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.044sec

checking: AG [[3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & [~ [sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)] & ~ [sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]]]]
normalized: ~ [E [true U ~ [[3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & [~ [sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)] & ~ [sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]]]]]]

abstracting: (sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
states: 232
abstracting: (sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1))
states: 178
abstracting: (3<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
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.067sec

checking: AG [[~ [[sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1) & sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]] | ~ [1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)]]]
normalized: ~ [E [true U ~ [[~ [[sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1) & sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]] | ~ [1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)]]]]]

abstracting: (1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1))
states: 255
abstracting: (sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
states: 243
abstracting: (sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
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.076sec

checking: AG [[sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1) | sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]]
normalized: ~ [E [true U ~ [[sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1) | sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]]]]

abstracting: (sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
states: 325
abstracting: (sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
states: 7
-> the formula is TRUE

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

MC time: 0m 0.035sec

checking: EF [[~ [sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)] & [2<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) | [1<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1) & sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)]]]]
normalized: E [true U [~ [sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)] & [2<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) | [1<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1) & sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)]]]]

abstracting: (sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1))
states: 130
abstracting: (1<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
states: 255
abstracting: (2<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
states: 19
abstracting: (sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1))
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.116sec

checking: EF [[[[3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1) | 3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)] | ~ [2<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]] & 1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)]]
normalized: E [true U [1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & [[3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1) | 3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)] | ~ [2<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]]]]

abstracting: (2<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
states: 120
abstracting: (3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1))
states: 204
abstracting: (3<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1))
states: 204
abstracting: (1<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
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.084sec

checking: EF [[[~ [1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)] & [3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1) | 3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)]] & [[sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) | sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)] & 3<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1)]]]
normalized: E [true U [[3<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1) & [sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) | sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)]] & [~ [1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)] & [3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1) | 3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)]]]]

abstracting: (3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1))
states: 0
abstracting: (3<=sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1))
states: 0
abstracting: (1<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1))
states: 255
abstracting: (sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1))
states: 265
abstracting: (sum(HasLeft_Philosopher3, HasLeft_Philosopher2, HasLeft_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
states: 226
abstracting: (3<=sum(WaitLeft_Philosopher3, WaitLeft_Philosopher2, WaitLeft_Philosopher1))
states: 24
-> the formula is FALSE

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

MC time: 0m 0.132sec

checking: EF [[[~ [sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)] & [sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]] | 2<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1)]]
normalized: E [true U [2<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1) | [[sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)] & ~ [sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)]]]]

abstracting: (sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
states: 136
abstracting: (sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)<=sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1))
states: 7
abstracting: (sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
states: 325
abstracting: (2<=sum(Forks_Philosopher3, Forks_Philosopher2, Forks_Philosopher1))
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.073sec

checking: EF [[[[sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & 2<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)] | [3<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1) & sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)]] | 1<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1)]]
normalized: E [true U [1<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1) | [[3<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1) & sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1)] | [sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1) & 2<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1)]]]]

abstracting: (2<=sum(Neighbourhood_Philosopher3_Philosopher3, Neighbourhood_Philosopher3_Philosopher2, Neighbourhood_Philosopher3_Philosopher1, Neighbourhood_Philosopher2_Philosopher3, Neighbourhood_Philosopher2_Philosopher2, Neighbourhood_Philosopher2_Philosopher1, Neighbourhood_Philosopher1_Philosopher3, Neighbourhood_Philosopher1_Philosopher2, Neighbourhood_Philosopher1_Philosopher1))
states: 306
abstracting: (sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(Outside_Philosopher3, Outside_Philosopher2, Outside_Philosopher1))
states: 226
abstracting: (sum(HasRight_Philosopher3, HasRight_Philosopher2, HasRight_Philosopher1)<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1))
states: 271
abstracting: (3<=sum(WaitRight_Philosopher3, WaitRight_Philosopher2, WaitRight_Philosopher1))
states: 24
abstracting: (1<=sum(Think_Philosopher3, Think_Philosopher2, Think_Philosopher1))
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.136sec

totally nodes used: 19369 (1.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 80316 231883 312199
used/not used/entry size/cache size: 239009 66869855 16 1024MB
basic ops cache: hits/miss/sum: 17927 36625 54552
used/not used/entry size/cache size: 60863 16716353 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 67089816
1 18849
2 199
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.108sec


BK_STOP 1494620205717

--------------------
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:1660 (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:1514 (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="PhilosophersDyn-COL-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/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-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 PhilosophersDyn-COL-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 r041-smll-149440525600232"
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 ;