Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r289-tall-167873940200313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is PhilosophersDyn-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873940200313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:23 model.pnml

--------------------
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-PT-03-CTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678766593111

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

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.039sec


RS generation: 0m 0.007sec


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



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

checking: AX [AX [AF [EF [EF [1<=WaitRight_2]]]]]
normalized: ~ [EX [EX [EG [~ [E [true U E [true U 1<=WaitRight_2]]]]]]]

abstracting: (1<=WaitRight_2)
states: 133
.
EG iterations: 1
..-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: ~ [EG [EG [~ [sum(Forks_3, Forks_2, Forks_1)<=25]]]]
normalized: ~ [EG [EG [~ [sum(Forks_3, Forks_2, Forks_1)<=25]]]]

abstracting: (sum(Forks_3, Forks_2, Forks_1)<=25)
states: 325
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[~ [[AF [[EG [1<=WaitLeft_2] | EF [Neighbourhood_2_2<=0]]] & AG [AX [HasRight_1<=0]]]] & ~ [HasLeft_3<=Neighbourhood_3_1]]]
normalized: E [true U [~ [[~ [EG [~ [[E [true U Neighbourhood_2_2<=0] | EG [1<=WaitLeft_2]]]]] & ~ [E [true U EX [~ [HasRight_1<=0]]]]]] & ~ [HasLeft_3<=Neighbourhood_3_1]]]

abstracting: (HasLeft_3<=Neighbourhood_3_1)
states: 299
abstracting: (HasRight_1<=0)
states: 274
.abstracting: (1<=WaitLeft_2)
states: 133
.
EG iterations: 1
abstracting: (Neighbourhood_2_2<=0)
states: 319
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: AG [~ [[AG [[AF [1<=Neighbourhood_2_2] & EF [Neighbourhood_2_2<=HasRight_1]]] & Think_3<=WaitRight_3]]]
normalized: ~ [E [true U [~ [E [true U ~ [[E [true U Neighbourhood_2_2<=HasRight_1] & ~ [EG [~ [1<=Neighbourhood_2_2]]]]]]] & Think_3<=WaitRight_3]]]

abstracting: (Think_3<=WaitRight_3)
states: 231
abstracting: (1<=Neighbourhood_2_2)
states: 6
.
EG iterations: 1
abstracting: (Neighbourhood_2_2<=HasRight_1)
states: 319
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EG [AF [[E [Think_1<=0 U ~ [AF [Neighbourhood_2_2<=1]]] | ~ [A [[1<=Outside_2 | HasLeft_1<=0] U Neighbourhood_2_3<=Neighbourhood_1_1]]]]]
normalized: EG [~ [EG [~ [[~ [[~ [EG [~ [Neighbourhood_2_3<=Neighbourhood_1_1]]] & ~ [E [~ [Neighbourhood_2_3<=Neighbourhood_1_1] U [~ [[1<=Outside_2 | HasLeft_1<=0]] & ~ [Neighbourhood_2_3<=Neighbourhood_1_1]]]]]] | E [Think_1<=0 U EG [~ [Neighbourhood_2_2<=1]]]]]]]]

abstracting: (Neighbourhood_2_2<=1)
states: 325
.
EG iterations: 1
abstracting: (Think_1<=0)
states: 231
abstracting: (Neighbourhood_2_3<=Neighbourhood_1_1)
states: 189
abstracting: (HasLeft_1<=0)
states: 274
abstracting: (1<=Outside_2)
states: 47
abstracting: (Neighbourhood_2_3<=Neighbourhood_1_1)
states: 189
abstracting: (Neighbourhood_2_3<=Neighbourhood_1_1)
states: 189
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EX [EX [AF [[E [Neighbourhood_2_2<=Neighbourhood_3_1 U Neighbourhood_2_2<=Neighbourhood_1_2] & [A [1<=Neighbourhood_1_3 U HasLeft_2<=1] & EG [1<=HasLeft_3]]]]]]
normalized: EX [EX [~ [EG [~ [[[EG [1<=HasLeft_3] & [~ [EG [~ [HasLeft_2<=1]]] & ~ [E [~ [HasLeft_2<=1] U [~ [1<=Neighbourhood_1_3] & ~ [HasLeft_2<=1]]]]]] & E [Neighbourhood_2_2<=Neighbourhood_3_1 U Neighbourhood_2_2<=Neighbourhood_1_2]]]]]]]

abstracting: (Neighbourhood_2_2<=Neighbourhood_1_2)
states: 319
abstracting: (Neighbourhood_2_2<=Neighbourhood_3_1)
states: 319
abstracting: (HasLeft_2<=1)
states: 325
abstracting: (1<=Neighbourhood_1_3)
states: 136
abstracting: (HasLeft_2<=1)
states: 325
abstracting: (HasLeft_2<=1)
states: 325
.
EG iterations: 1
abstracting: (1<=HasLeft_3)
states: 51
....
EG iterations: 4
.
EG iterations: 1
..-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EG [~ [46<=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 [~ [46<=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: (46<=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: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: A [~ [1<=Neighbourhood_1_1] U ~ [[~ [[[[[WaitLeft_2<=0 & 1<=Outside_3] | Forks_3<=Neighbourhood_3_3] | AF [HasRight_1<=Neighbourhood_2_2]] & 1<=Neighbourhood_2_1]] & ~ [HasRight_3<=Neighbourhood_2_3]]]]
normalized: [~ [EG [[~ [HasRight_3<=Neighbourhood_2_3] & ~ [[[~ [EG [~ [HasRight_1<=Neighbourhood_2_2]]] | [[WaitLeft_2<=0 & 1<=Outside_3] | Forks_3<=Neighbourhood_3_3]] & 1<=Neighbourhood_2_1]]]]] & ~ [E [[~ [HasRight_3<=Neighbourhood_2_3] & ~ [[[~ [EG [~ [HasRight_1<=Neighbourhood_2_2]]] | [[WaitLeft_2<=0 & 1<=Outside_3] | Forks_3<=Neighbourhood_3_3]] & 1<=Neighbourhood_2_1]]] U [[~ [HasRight_3<=Neighbourhood_2_3] & ~ [[[~ [EG [~ [HasRight_1<=Neighbourhood_2_2]]] | [[WaitLeft_2<=0 & 1<=Outside_3] | Forks_3<=Neighbourhood_3_3]] & 1<=Neighbourhood_2_1]]] & 1<=Neighbourhood_1_1]]]]

abstracting: (1<=Neighbourhood_1_1)
states: 6
abstracting: (1<=Neighbourhood_2_1)
states: 136
abstracting: (Forks_3<=Neighbourhood_3_3)
states: 237
abstracting: (1<=Outside_3)
states: 47
abstracting: (WaitLeft_2<=0)
states: 192
abstracting: (HasRight_1<=Neighbourhood_2_2)
states: 274
....
EG iterations: 4
abstracting: (HasRight_3<=Neighbourhood_2_3)
states: 299
abstracting: (1<=Neighbourhood_2_1)
states: 136
abstracting: (Forks_3<=Neighbourhood_3_3)
states: 237
abstracting: (1<=Outside_3)
states: 47
abstracting: (WaitLeft_2<=0)
states: 192
abstracting: (HasRight_1<=Neighbourhood_2_2)
states: 274
....
EG iterations: 4
abstracting: (HasRight_3<=Neighbourhood_2_3)
states: 299
abstracting: (1<=Neighbourhood_2_1)
states: 136
abstracting: (Forks_3<=Neighbourhood_3_3)
states: 237
abstracting: (1<=Outside_3)
states: 47
abstracting: (WaitLeft_2<=0)
states: 192
abstracting: (HasRight_1<=Neighbourhood_2_2)
states: 274
....
EG iterations: 4
abstracting: (HasRight_3<=Neighbourhood_2_3)
states: 299
...
EG iterations: 3
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [~ [[AF [EF [~ [AF [Forks_3<=0]]]] & AG [~ [[[Think_2<=Neighbourhood_1_2 & [1<=Forks_2 & WaitLeft_2<=0]] & AX [1<=HasLeft_2]]]]]] & ~ [[EX [AF [~ [A [1<=Neighbourhood_3_2 U 1<=Forks_3]]]] & [[~ [EG [[Think_3<=Neighbourhood_3_3 & Think_1<=0]]] & AG [AG [1<=Neighbourhood_3_1]]] & AG [HasRight_3<=1]]]]]
normalized: [~ [[[~ [E [true U ~ [HasRight_3<=1]]] & [~ [E [true U E [true U ~ [1<=Neighbourhood_3_1]]]] & ~ [EG [[Think_3<=Neighbourhood_3_3 & Think_1<=0]]]]] & EX [~ [EG [[~ [EG [~ [1<=Forks_3]]] & ~ [E [~ [1<=Forks_3] U [~ [1<=Neighbourhood_3_2] & ~ [1<=Forks_3]]]]]]]]]] & ~ [[~ [E [true U [~ [EX [~ [1<=HasLeft_2]]] & [[1<=Forks_2 & WaitLeft_2<=0] & Think_2<=Neighbourhood_1_2]]]] & ~ [EG [~ [E [true U EG [~ [Forks_3<=0]]]]]]]]]

abstracting: (Forks_3<=0)
states: 235
.......
EG iterations: 7

EG iterations: 0
abstracting: (Think_2<=Neighbourhood_1_2)
states: 277
abstracting: (WaitLeft_2<=0)
states: 192
abstracting: (1<=Forks_2)
states: 90
abstracting: (1<=HasLeft_2)
states: 51
.abstracting: (1<=Forks_3)
states: 90
abstracting: (1<=Neighbourhood_3_2)
states: 136
abstracting: (1<=Forks_3)
states: 90
abstracting: (1<=Forks_3)
states: 90
....
EG iterations: 4
......
EG iterations: 6
.abstracting: (Think_1<=0)
states: 231
abstracting: (Think_3<=Neighbourhood_3_3)
states: 233
...
EG iterations: 3
abstracting: (1<=Neighbourhood_3_1)
states: 136
abstracting: (HasRight_3<=1)
states: 325
-> the formula is TRUE

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

MC time: 0m 0.037sec

checking: ~ [A [[A [EF [[HasRight_3<=HasLeft_1 | Think_1<=Think_3]] U [~ [EG [1<=Outside_3]] & [1<=WaitLeft_3 & ~ [Outside_1<=HasRight_1]]]] | 1<=WaitRight_1] U [~ [[~ [[1<=Neighbourhood_3_3 & 1<=HasRight_1]] | AX [1<=Neighbourhood_3_2]]] | 1<=HasLeft_2]]]
normalized: ~ [[~ [EG [~ [[~ [[~ [EX [~ [1<=Neighbourhood_3_2]]] | ~ [[1<=Neighbourhood_3_3 & 1<=HasRight_1]]]] | 1<=HasLeft_2]]]] & ~ [E [~ [[~ [[~ [EX [~ [1<=Neighbourhood_3_2]]] | ~ [[1<=Neighbourhood_3_3 & 1<=HasRight_1]]]] | 1<=HasLeft_2]] U [~ [[[~ [EG [~ [[[~ [Outside_1<=HasRight_1] & 1<=WaitLeft_3] & ~ [EG [1<=Outside_3]]]]]] & ~ [E [~ [[[~ [Outside_1<=HasRight_1] & 1<=WaitLeft_3] & ~ [EG [1<=Outside_3]]]] U [~ [E [true U [HasRight_3<=HasLeft_1 | Think_1<=Think_3]]] & ~ [[[~ [Outside_1<=HasRight_1] & 1<=WaitLeft_3] & ~ [EG [1<=Outside_3]]]]]]]] | 1<=WaitRight_1]] & ~ [[~ [[~ [EX [~ [1<=Neighbourhood_3_2]]] | ~ [[1<=Neighbourhood_3_3 & 1<=HasRight_1]]]] | 1<=HasLeft_2]]]]]]]

abstracting: (1<=HasLeft_2)
states: 51
abstracting: (1<=HasRight_1)
states: 51
abstracting: (1<=Neighbourhood_3_3)
states: 6
abstracting: (1<=Neighbourhood_3_2)
states: 136
.abstracting: (1<=WaitRight_1)
states: 133
abstracting: (1<=Outside_3)
states: 47
.
EG iterations: 1
abstracting: (1<=WaitLeft_3)
states: 133
abstracting: (Outside_1<=HasRight_1)
states: 278
abstracting: (Think_1<=Think_3)
states: 256
abstracting: (HasRight_3<=HasLeft_1)
states: 276
abstracting: (1<=Outside_3)
states: 47
.
EG iterations: 1
abstracting: (1<=WaitLeft_3)
states: 133
abstracting: (Outside_1<=HasRight_1)
states: 278
abstracting: (1<=Outside_3)
states: 47
.
EG iterations: 1
abstracting: (1<=WaitLeft_3)
states: 133
abstracting: (Outside_1<=HasRight_1)
states: 278
....
EG iterations: 4
abstracting: (1<=HasLeft_2)
states: 51
abstracting: (1<=HasRight_1)
states: 51
abstracting: (1<=Neighbourhood_3_3)
states: 6
abstracting: (1<=Neighbourhood_3_2)
states: 136
.abstracting: (1<=HasLeft_2)
states: 51
abstracting: (1<=HasRight_1)
states: 51
abstracting: (1<=Neighbourhood_3_3)
states: 6
abstracting: (1<=Neighbourhood_3_2)
states: 136
..
EG iterations: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AF [AX [A [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2) U EG [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22 & sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]
normalized: ~ [EG [EX [~ [[~ [E [~ [EG [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22 & sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] U [~ [EG [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22 & sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] & ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]] & ~ [EG [~ [EG [[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22 & 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(HasLeft_1, HasLeft_3, HasLeft_2)<=22)
states: 325
.
EG iterations: 1
..
EG iterations: 2
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 276
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22)
states: 325
.
EG iterations: 1
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 276
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=22)
states: 325
.
EG iterations: 1
.....
EG iterations: 4
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: [AF [sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & EF [~ [[AG [A [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) U 20<=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)]] | AG [sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3)]]]]]
normalized: [E [true U ~ [[~ [E [true U ~ [[~ [EG [~ [20<=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)]]] & ~ [E [~ [20<=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 [~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & ~ [20<=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)]]]]]]]] | ~ [E [true U ~ [sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3)]]]]]] & ~ [EG [~ [sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]

abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 243
.
EG iterations: 1
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3))
states: 325
abstracting: (20<=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: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 130
abstracting: (20<=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: 0
abstracting: (20<=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: 0

EG iterations: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: E [AF [~ [EX [[[sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3) | sum(Think_1, Think_2, Think_3)<=80] | E [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U 27<=sum(Think_1, Think_2, Think_3)]]]]] U [~ [AX [~ [A [sum(HasRight_3, HasRight_1, HasRight_2)<=47 U sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]] | [~ [[AG [~ [sum(Outside_1, Outside_2, Outside_3)<=21]] & 86<=sum(Think_1, Think_2, Think_3)]] & 9<=sum(Outside_1, Outside_2, Outside_3)]]]
normalized: E [~ [EG [EX [[E [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U 27<=sum(Think_1, Think_2, Think_3)] | [sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3) | sum(Think_1, Think_2, Think_3)<=80]]]]] U [[9<=sum(Outside_1, Outside_2, Outside_3) & ~ [[86<=sum(Think_1, Think_2, Think_3) & ~ [E [true U sum(Outside_1, Outside_2, Outside_3)<=21]]]]] | EX [[~ [EG [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]] & ~ [E [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] U [~ [sum(HasRight_3, HasRight_1, HasRight_2)<=47] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]]]]]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=47)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 325
.
EG iterations: 1
.abstracting: (sum(Outside_1, Outside_2, Outside_3)<=21)
states: 325
abstracting: (86<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (9<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (sum(Think_1, Think_2, Think_3)<=80)
states: 325
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3))
states: 169
abstracting: (27<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 313
.....
EG iterations: 4
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.192sec

checking: AF [[[AG [35<=sum(Think_1, Think_2, Think_3)] | [[EF [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=14]] & EG [~ [sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)]]] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=41]] & [[[EX [E [73<=sum(Think_1, Think_2, Think_3) U sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] & EF [~ [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)]]] | 75<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] & AF [sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3)]]] & [75<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | [E [true U ~ [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)]] & EX [E [73<=sum(Think_1, Think_2, Think_3) U sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]] & [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=41 & [EG [~ [sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)]] & E [true U ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=14]]]] | ~ [E [true U ~ [35<=sum(Think_1, Think_2, Think_3)]]]]]]]]

abstracting: (35<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=14)
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3))
states: 325
.
EG iterations: 1
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=41)
states: 325
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 235
abstracting: (73<=sum(Think_1, Think_2, Think_3))
states: 0
.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: (75<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Outside_1, Outside_2, Outside_3))
states: 166
....
EG iterations: 4

EG iterations: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

checking: E [EG [E [[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1)]] U [[A [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=3 U sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36] & 92<=sum(Think_1, Think_2, Think_3)] & ~ [A [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=71 U sum(Outside_1, Outside_2, Outside_3)<=6]]]]] U EX [EX [[[[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(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(Forks_3, Forks_2, Forks_1)<=14 | 14<=sum(Outside_1, Outside_2, Outside_3)]] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]
normalized: E [EG [E [[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1)]] U [~ [[~ [EG [~ [sum(Outside_1, Outside_2, Outside_3)<=6]]] & ~ [E [~ [sum(Outside_1, Outside_2, Outside_3)<=6] U [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=71] & ~ [sum(Outside_1, Outside_2, Outside_3)<=6]]]]]] & [92<=sum(Think_1, Think_2, Think_3) & [~ [EG [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36]]] & ~ [E [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36] U [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=3] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36]]]]]]]]] U EX [EX [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=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(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(Forks_3, Forks_2, Forks_1)<=14 | 14<=sum(Outside_1, Outside_2, Outside_3)]]]]]]

abstracting: (14<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=14)
states: 325
abstracting: (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))
states: 325
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: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 130
..abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=3)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=36)
states: 325
.
EG iterations: 1
abstracting: (92<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=6)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=71)
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=6)
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=6)
states: 325
.
EG iterations: 1
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 247
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 235
.
EG iterations: 1
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.282sec

checking: ~ [[EF [~ [[47<=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) & 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)<=86]]]] | [AX [[E [EF [sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3)] U [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=57 | 63<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] | EG [EF [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]] | [AG [EX [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]]] & [AG [A [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) U 16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] & A [EX [sum(Think_1, Think_2, Think_3)<=59] U EG [38<=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 [~ [EG [38<=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)]]]] & ~ [E [~ [EG [38<=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 [~ [EX [sum(Think_1, Think_2, Think_3)<=59]] & ~ [EG [38<=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)]]]]]] & ~ [E [true U ~ [[~ [EG [~ [16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] & ~ [E [~ [16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] U [~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] & ~ [16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]]]]]] & ~ [E [true U ~ [EX [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]]]]]] | ~ [EX [~ [[EG [E [true U sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] | E [E [true U sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3)] U [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=57 | 63<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]]]] | E [true U ~ [[47<=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) & 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)<=86]]]]]]

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)<=86)
states: 325
abstracting: (47<=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: 0
abstracting: (63<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=57)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3))
states: 325
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 325

EG iterations: 0
.abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 226
.abstracting: (16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 0
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 235
abstracting: (16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 0
abstracting: (16<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 0

EG iterations: 0
abstracting: (38<=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: 0
.
EG iterations: 1
abstracting: (sum(Think_1, Think_2, Think_3)<=59)
states: 325
.abstracting: (38<=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: 0
.
EG iterations: 1
abstracting: (38<=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: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

totally nodes used: 46283 (4.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 123863 434522 558385
used/not used/entry size/cache size: 455229 66653635 16 1024MB
basic ops cache: hits/miss/sum: 21569 61685 83254
used/not used/entry size/cache size: 100875 16676341 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 15701 15701
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1205 3760 4965
used/not used/entry size/cache size: 3760 8384848 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 67063932
1 43635
2 1243
3 54
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.970sec


BK_STOP 1678766599131

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

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


initing FirstDep: 0m 0.000sec


iterations count:1658 (19), effective:60 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:653 (7), effective:19 (0)

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

iterations count:187 (2), effective:6 (0)

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

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

iterations count:219 (2), effective:4 (0)

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

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

iterations count:713 (8), effective:15 (0)

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

iterations count:259 (3), effective:6 (0)

iterations count:470 (5), effective:11 (0)

iterations count:521 (6), effective:16 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:783 (9), effective:33 (0)

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

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

iterations count:1364 (16), effective:51 (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-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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is 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 r289-tall-167873940200313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;