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-2270
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 r204st-blw3-143341205100769
=====================================================================

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

Model: S_PhilosophersDyn-PT-03
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 30 NrTr: 84 NrArc: 564)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 442 (4.4e+02) #states 325



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

checking: [~ [[AF [sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & ~ [~ [sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]]]] & EF [~ [~ [3<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: [~ [[sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3) & ~ [EG [~ [sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]] & E [true U 3<=sum(Outside_1, Outside_2, Outside_3)]]

abstracting: (3<=sum(Outside_1, Outside_2, Outside_3)) states: 1
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 276
..
EG iterations: 2
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 166
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [AF [[[3<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) & sum(Forks_3, Forks_2, Forks_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 [~ [[[3<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) & sum(Forks_3, Forks_2, Forks_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(Forks_3, Forks_2, Forks_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: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 243
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 232
abstracting: (3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 24
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: EX [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1) & ~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]
normalized: EX [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1) & ~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]

abstracting: (1<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 255
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Forks_3, Forks_2, Forks_1)) states: 247
.-> the formula is FALSE

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

MC time: 0m0sec

checking: E [AX [1<=sum(Think_1, Think_2, Think_3)] U sum(HasLeft_1, HasLeft_3, HasLeft_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 [~ [EX [~ [1<=sum(Think_1, Think_2, Think_3)]]] U sum(HasLeft_1, HasLeft_3, HasLeft_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: (sum(HasLeft_1, HasLeft_3, HasLeft_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: 325
abstracting: (1<=sum(Think_1, Think_2, Think_3)) states: 213
.-> the formula is TRUE

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

MC time: 0m0sec

checking: EG [AG [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]
normalized: EG [~ [E [true U ~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]

abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 276
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 235
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]
normalized: EG [sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 166
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 166
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 265
.-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [AX [[2<=sum(HasLeft_1, HasLeft_3, HasLeft_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(Forks_3, Forks_2, Forks_1)]]]
normalized: ~ [E [true U EX [~ [[2<=sum(HasLeft_1, HasLeft_3, HasLeft_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(Forks_3, Forks_2, Forks_1)]]]]]

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(Forks_3, Forks_2, Forks_1)) states: 19
abstracting: (2<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 15
.-> the formula is FALSE

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

MC time: 0m0sec

checking: EX [3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]
normalized: EX [3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]

abstracting: (3<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 24
.-> the formula is FALSE

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

MC time: 0m0sec

checking: AX [[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)] | ~ [[3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_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)]]]]
normalized: ~ [EX [~ [[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)] | ~ [[3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_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)]]]]]]

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: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 24
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)) states: 226
.-> the formula is TRUE

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

MC time: 0m0sec

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

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(Forks_3, Forks_2, Forks_1)) states: 19
abstracting: (2<=sum(HasLeft_1, HasLeft_3, HasLeft_2)) states: 15
abstracting: (3<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)) states: 24
abstracting: (3<=sum(Think_1, Think_2, Think_3)) states: 6

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [E [2<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U 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 [~ [E [2<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U 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: (2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 120
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [[[2<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & 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(Outside_1, Outside_2, Outside_3) & 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(Forks_3, Forks_2, Forks_1) | ~ [1<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]
normalized: ~ [[[2<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & 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(Outside_1, Outside_2, Outside_3) & 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(Forks_3, Forks_2, Forks_1) | ~ [1<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]

abstracting: (1<=sum(HasRight_3, HasRight_1, HasRight_2)) states: 138
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1)) states: 0
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: (sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 325
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: (2<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 120
-> the formula is FALSE

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

MC time: 0m0sec

checking: [~ [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(Forks_3, Forks_2, Forks_1) | [2<=sum(Think_1, Think_2, Think_3) & [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(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]]]]]
normalized: [~ [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(Forks_3, Forks_2, Forks_1) | [2<=sum(Think_1, Think_2, Think_3) & [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(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]]]]]

abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)) states: 166
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(Think_1, Think_2, Think_3)) states: 63
abstracting: (3<=sum(Forks_3, Forks_2, Forks_1)) states: 0
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
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]
normalized: ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]

abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)) states: 235
-> the formula is FALSE

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

MC time: 0m0sec

checking: 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: 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
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433671189869

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

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: 0m0sec

293
iterations count:1652 (19), effective:60 (0)

initing FirstDep: 0m0sec


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

iterations count:84 (1), effective:0 (0)
239
iterations count:1206 (14), effective:38 (0)

iterations count:868 (10), effective:26 (0)

iterations count:436 (5), effective:10 (0)

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

iterations count:208 (2), effective:3 (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="/user/u8/hulinhub/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-2270"
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 r204st-blw3-143341205100769"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;