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.r481-tall-167912691800321.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 SwimmingPool-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691800321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 3.9K 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 SwimmingPool-PT-01-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679157340926

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=SwimmingPool-PT-01
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: SwimmingPool_PT_01
(NrP: 9 NrTr: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.878sec


RS generation: 0m 0.104sec


-> reachability set: #nodes 6529 (6.5e+03) #states 89,621 (4)



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

checking: AF [EG [[8<=Undress | Dress<=Dressed]]]
normalized: ~ [EG [~ [EG [[8<=Undress | Dress<=Dressed]]]]]

abstracting: (Dress<=Dressed)
states: 53,725 (4)
abstracting: (8<=Undress)
states: 895
........................................
EG iterations: 40
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.161sec

checking: E [AF [~ [EG [Entered<=10]]] U AX [AF [AG [AF [InBath<=Cabins]]]]]
normalized: E [~ [EG [EG [Entered<=10]]] U ~ [EX [EG [E [true U EG [~ [InBath<=Cabins]]]]]]]

abstracting: (InBath<=Cabins)
states: 38,038 (4)
.....................
EG iterations: 21

EG iterations: 0
.abstracting: (Entered<=10)
states: 84,616 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.113sec

checking: EX [~ [AG [AG [E [Dressed<=4 U Dress<=Entered]]]]]
normalized: EX [E [true U E [true U ~ [E [Dressed<=4 U Dress<=Entered]]]]]

abstracting: (Dress<=Entered)
states: 69,937 (4)
abstracting: (Dressed<=4)
states: 79,709 (4)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: E [Dress<=Entered U 10<=Undress]
normalized: E [Dress<=Entered U 10<=Undress]

abstracting: (10<=Undress)
states: 51
abstracting: (Dress<=Entered)
states: 69,937 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: E [AG [Undress<=18] U ~ [[EX [[EX [Entered<=18] | [Dressed<=20 | ~ [Bags<=5]]]] | Cabins<=2]]]
normalized: E [~ [E [true U ~ [Undress<=18]]] U ~ [[Cabins<=2 | EX [[[Dressed<=20 | ~ [Bags<=5]] | EX [Entered<=18]]]]]]

abstracting: (Entered<=18)
states: 89,614 (4)
.abstracting: (Bags<=5)
states: 27,559 (4)
abstracting: (Dressed<=20)
states: 89,621 (4)
.abstracting: (Cabins<=2)
states: 49,287 (4)
abstracting: (Undress<=18)
states: 89,621 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: ~ [[AG [EX [Entered<=Bags]] | AX [~ [[AG [[InBath<=3 | Undress<=Undress]] | ~ [Dress<=19]]]]]]
normalized: ~ [[~ [EX [[~ [Dress<=19] | ~ [E [true U ~ [[InBath<=3 | Undress<=Undress]]]]]]] | ~ [E [true U ~ [EX [Entered<=Bags]]]]]]

abstracting: (Entered<=Bags)
states: 72,877 (4)
.abstracting: (Undress<=Undress)
states: 89,621 (4)
abstracting: (InBath<=3)
states: 46,046 (4)
abstracting: (Dress<=19)
states: 89,621 (4)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[A [1<=Cabins U EX [[EG [Out<=11] & E [8<=WaitBag U Out<=7]]]] & EG [E [AG [Dress<=Undress] U ~ [E [WaitBag<=1 U Dressed<=Bags]]]]]]
normalized: E [true U [EG [E [~ [E [true U ~ [Dress<=Undress]]] U ~ [E [WaitBag<=1 U Dressed<=Bags]]]] & [~ [EG [~ [EX [[E [8<=WaitBag U Out<=7] & EG [Out<=11]]]]]] & ~ [E [~ [EX [[E [8<=WaitBag U Out<=7] & EG [Out<=11]]]] U [~ [1<=Cabins] & ~ [EX [[E [8<=WaitBag U Out<=7] & EG [Out<=11]]]]]]]]]]

abstracting: (Out<=11)
states: 86,618 (4)
.
EG iterations: 1
abstracting: (Out<=7)
states: 72,604 (4)
abstracting: (8<=WaitBag)
states: 1,063 (3)
.abstracting: (1<=Cabins)
states: 71,403 (4)
abstracting: (Out<=11)
states: 86,618 (4)
.
EG iterations: 1
abstracting: (Out<=7)
states: 72,604 (4)
abstracting: (8<=WaitBag)
states: 1,063 (3)
.abstracting: (Out<=11)
states: 86,618 (4)
.
EG iterations: 1
abstracting: (Out<=7)
states: 72,604 (4)
abstracting: (8<=WaitBag)
states: 1,063 (3)
..
EG iterations: 1
abstracting: (Dressed<=Bags)
states: 85,169 (4)
abstracting: (WaitBag<=1)
states: 47,093 (4)
abstracting: (Dress<=Undress)
states: 52,865 (4)
...........
EG iterations: 11
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.268sec

checking: EF [[A [20<=WaitBag U A [[[WaitBag<=InBath & Undress<=11] | [18<=Dressed & 6<=Cabins]] U [A [10<=Bags U 19<=Undress] & ~ [Out<=2]]]] & 2<=Cabins]]
normalized: E [true U [2<=Cabins & [~ [EG [~ [[~ [EG [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]] & ~ [E [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]] U [~ [[[18<=Dressed & 6<=Cabins] | [WaitBag<=InBath & Undress<=11]]] & ~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]] & ~ [E [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]] U [~ [[[18<=Dressed & 6<=Cabins] | [WaitBag<=InBath & Undress<=11]]] & ~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]]]]] U [~ [20<=WaitBag] & ~ [[~ [EG [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]] & ~ [E [~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]] U [~ [[[18<=Dressed & 6<=Cabins] | [WaitBag<=InBath & Undress<=11]]] & ~ [[~ [Out<=2] & [~ [EG [~ [19<=Undress]]] & ~ [E [~ [19<=Undress] U [~ [10<=Bags] & ~ [19<=Undress]]]]]]]]]]]]]]]]]]

abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (Undress<=11)
states: 89,621 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
abstracting: (6<=Cabins)
states: 11,172 (4)
abstracting: (18<=Dressed)
states: 0
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)

EG iterations: 0
abstracting: (20<=WaitBag)
states: 0
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (Undress<=11)
states: 89,621 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
abstracting: (6<=Cabins)
states: 11,172 (4)
abstracting: (18<=Dressed)
states: 0
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)

EG iterations: 0
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (Undress<=11)
states: 89,621 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
abstracting: (6<=Cabins)
states: 11,172 (4)
abstracting: (18<=Dressed)
states: 0
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (19<=Undress)
states: 0
abstracting: (19<=Undress)
states: 0

EG iterations: 0
abstracting: (Out<=2)
states: 32,872 (4)

EG iterations: 0

EG iterations: 0
abstracting: (2<=Cabins)
states: 54,831 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

checking: [~ [EX [~ [AF [Entered<=Bags]]]] | AF [E [~ [19<=InBath] U [[19<=Bags | A [17<=Bags U InBath<=11]] | [~ [[Dress<=17 & InBath<=Entered]] | ~ [EX [Bags<=11]]]]]]]
normalized: [~ [EX [EG [~ [Entered<=Bags]]]] | ~ [EG [~ [E [~ [19<=InBath] U [[~ [EX [Bags<=11]] | ~ [[Dress<=17 & InBath<=Entered]]] | [19<=Bags | [~ [EG [~ [InBath<=11]]] & ~ [E [~ [InBath<=11] U [~ [17<=Bags] & ~ [InBath<=11]]]]]]]]]]]]

abstracting: (InBath<=11)
states: 88,032 (4)
abstracting: (17<=Bags)
states: 0
abstracting: (InBath<=11)
states: 88,032 (4)
abstracting: (InBath<=11)
states: 88,032 (4)
.
EG iterations: 1
abstracting: (19<=Bags)
states: 0
abstracting: (InBath<=Entered)
states: 49,945 (4)
abstracting: (Dress<=17)
states: 89,621 (4)
abstracting: (Bags<=11)
states: 76,468 (4)
.abstracting: (19<=InBath)
states: 0
.
EG iterations: 1
abstracting: (Entered<=Bags)
states: 72,877 (4)
..............
EG iterations: 14
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: ~ [EG [[[Entered<=6 | [[EF [InBath<=Dressed] | A [4<=Bags U 1<=Out]] & AF [EG [Cabins<=3]]]] & ~ [[~ [Entered<=Undress] | A [~ [3<=Entered] U [1<=Bags & 2<=Entered]]]]]]]
normalized: ~ [EG [[~ [[[~ [EG [~ [[1<=Bags & 2<=Entered]]]] & ~ [E [~ [[1<=Bags & 2<=Entered]] U [3<=Entered & ~ [[1<=Bags & 2<=Entered]]]]]] | ~ [Entered<=Undress]]] & [Entered<=6 | [~ [EG [~ [EG [Cabins<=3]]]] & [[~ [EG [~ [1<=Out]]] & ~ [E [~ [1<=Out] U [~ [4<=Bags] & ~ [1<=Out]]]]] | E [true U InBath<=Dressed]]]]]]]

abstracting: (InBath<=Dressed)
states: 33,033 (4)
abstracting: (1<=Out)
states: 78,211 (4)
abstracting: (4<=Bags)
states: 75,075 (4)
abstracting: (1<=Out)
states: 78,211 (4)
abstracting: (1<=Out)
states: 78,211 (4)
..................................................................................
EG iterations: 82
abstracting: (Cabins<=3)
states: 61,439 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Entered<=6)
states: 66,598 (4)
abstracting: (Entered<=Undress)
states: 30,093 (4)
abstracting: (2<=Entered)
states: 67,207 (4)
abstracting: (1<=Bags)
states: 87,297 (4)
abstracting: (3<=Entered)
states: 56,749 (4)
abstracting: (2<=Entered)
states: 67,207 (4)
abstracting: (1<=Bags)
states: 87,297 (4)
abstracting: (2<=Entered)
states: 67,207 (4)
abstracting: (1<=Bags)
states: 87,297 (4)
........
EG iterations: 8
....................................................
EG iterations: 52
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.299sec

checking: A [[[[AG [E [7<=Entered U Out<=Out]] | ~ [[AX [InBath<=Bags] | EF [Dressed<=WaitBag]]]] | EX [14<=InBath]] | Undress<=InBath] U [9<=Bags & AG [EF [~ [9<=Out]]]]]
normalized: [~ [EG [~ [[9<=Bags & ~ [E [true U ~ [E [true U ~ [9<=Out]]]]]]]]] & ~ [E [~ [[9<=Bags & ~ [E [true U ~ [E [true U ~ [9<=Out]]]]]]] U [~ [[Undress<=InBath | [EX [14<=InBath] | [~ [[E [true U Dressed<=WaitBag] | ~ [EX [~ [InBath<=Bags]]]]] | ~ [E [true U ~ [E [7<=Entered U Out<=Out]]]]]]]] & ~ [[9<=Bags & ~ [E [true U ~ [E [true U ~ [9<=Out]]]]]]]]]]]

abstracting: (9<=Out)
states: 12,012 (4)
abstracting: (9<=Bags)
states: 36,918 (4)
abstracting: (Out<=Out)
states: 89,621 (4)
abstracting: (7<=Entered)
states: 23,023 (4)
abstracting: (InBath<=Bags)
states: 65,093 (4)
.abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
abstracting: (14<=InBath)
states: 252
.abstracting: (Undress<=InBath)
states: 67,675 (4)
abstracting: (9<=Out)
states: 12,012 (4)
abstracting: (9<=Bags)
states: 36,918 (4)
abstracting: (9<=Out)
states: 12,012 (4)
abstracting: (9<=Bags)
states: 36,918 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

checking: [EX [~ [A [~ [[Cabins<=Undress & Out<=2]] U [~ [Dress<=13] & [EF [WaitBag<=Bags] & [InBath<=Dress | 2<=Dressed]]]]]] | [EF [[~ [AF [~ [20<=Entered]]] & Entered<=12]] & AF [AX [EX [~ [Undress<=4]]]]]]
normalized: [[~ [EG [EX [~ [EX [~ [Undress<=4]]]]]] & E [true U [Entered<=12 & EG [20<=Entered]]]] | EX [~ [[~ [EG [~ [[[[InBath<=Dress | 2<=Dressed] & E [true U WaitBag<=Bags]] & ~ [Dress<=13]]]]] & ~ [E [~ [[[[InBath<=Dress | 2<=Dressed] & E [true U WaitBag<=Bags]] & ~ [Dress<=13]]] U [[Cabins<=Undress & Out<=2] & ~ [[[[InBath<=Dress | 2<=Dressed] & E [true U WaitBag<=Bags]] & ~ [Dress<=13]]]]]]]]]]

abstracting: (Dress<=13)
states: 89,621 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (2<=Dressed)
states: 42,528 (4)
abstracting: (InBath<=Dress)
states: 32,890 (4)
abstracting: (Out<=2)
states: 32,872 (4)
abstracting: (Cabins<=Undress)
states: 42,491 (4)
abstracting: (Dress<=13)
states: 89,621 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (2<=Dressed)
states: 42,528 (4)
abstracting: (InBath<=Dress)
states: 32,890 (4)
abstracting: (Dress<=13)
states: 89,621 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (2<=Dressed)
states: 42,528 (4)
abstracting: (InBath<=Dress)
states: 32,890 (4)

EG iterations: 0
.abstracting: (20<=Entered)
states: 1
..
EG iterations: 2
abstracting: (Entered<=12)
states: 87,905 (4)
abstracting: (Undress<=4)
states: 80,591 (4)
...
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: [AX [[AF [E [9<=Out U AF [Entered<=17]]] & EX [~ [[[2<=Bags | 2<=InBath] & [Entered<=Dressed & 7<=Dress]]]]]] & ~ [E [AF [E [9<=Cabins U A [4<=Undress U Entered<=Bags]]] U [[EG [EF [Bags<=Dress]] & ~ [Dress<=10]] & AX [[6<=Cabins | E [Bags<=5 U Bags<=20]]]]]]]
normalized: [~ [E [~ [EG [~ [E [9<=Cabins U [~ [EG [~ [Entered<=Bags]]] & ~ [E [~ [Entered<=Bags] U [~ [4<=Undress] & ~ [Entered<=Bags]]]]]]]]] U [~ [EX [~ [[6<=Cabins | E [Bags<=5 U Bags<=20]]]]] & [~ [Dress<=10] & EG [E [true U Bags<=Dress]]]]]] & ~ [EX [~ [[EX [~ [[[Entered<=Dressed & 7<=Dress] & [2<=Bags | 2<=InBath]]]] & ~ [EG [~ [E [9<=Out U ~ [EG [~ [Entered<=17]]]]]]]]]]]]

abstracting: (Entered<=17)
states: 89,593 (4)
.
EG iterations: 1
abstracting: (9<=Out)
states: 12,012 (4)
.
EG iterations: 1
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (2<=Bags)
states: 84,147 (4)
abstracting: (7<=Dress)
states: 2,233 (3)
abstracting: (Entered<=Dressed)
states: 30,932 (4)
..abstracting: (Bags<=Dress)
states: 12,872 (4)

EG iterations: 0
abstracting: (Dress<=10)
states: 89,621 (4)
abstracting: (Bags<=20)
states: 89,621 (4)
abstracting: (Bags<=5)
states: 27,559 (4)
abstracting: (6<=Cabins)
states: 11,172 (4)
.abstracting: (Entered<=Bags)
states: 72,877 (4)
abstracting: (4<=Undress)
states: 15,834 (4)
abstracting: (Entered<=Bags)
states: 72,877 (4)
abstracting: (Entered<=Bags)
states: 72,877 (4)
..............
EG iterations: 14
abstracting: (9<=Cabins)
states: 1,006 (3)
..............
EG iterations: 14
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: A [[AF [AG [~ [[4<=Undress & 9<=Dress]]]] | AG [[11<=Dress | AX [~ [16<=Bags]]]]] U [AG [[~ [AX [13<=Dress]] & [~ [14<=Undress] | A [Dress<=Dress U WaitBag<=Out]]]] | [10<=Dress | [Out<=Dress & [Dress<=Bags | [AX [8<=Entered] | ~ [Out<=Dress]]]]]]]
normalized: [~ [EG [~ [[[10<=Dress | [Out<=Dress & [Dress<=Bags | [~ [Out<=Dress] | ~ [EX [~ [8<=Entered]]]]]]] | ~ [E [true U ~ [[[[~ [EG [~ [WaitBag<=Out]]] & ~ [E [~ [WaitBag<=Out] U [~ [Dress<=Dress] & ~ [WaitBag<=Out]]]]] | ~ [14<=Undress]] & EX [~ [13<=Dress]]]]]]]]]] & ~ [E [~ [[[10<=Dress | [Out<=Dress & [Dress<=Bags | [~ [Out<=Dress] | ~ [EX [~ [8<=Entered]]]]]]] | ~ [E [true U ~ [[[[~ [EG [~ [WaitBag<=Out]]] & ~ [E [~ [WaitBag<=Out] U [~ [Dress<=Dress] & ~ [WaitBag<=Out]]]]] | ~ [14<=Undress]] & EX [~ [13<=Dress]]]]]]]] U [~ [[~ [E [true U ~ [[11<=Dress | ~ [EX [16<=Bags]]]]]] | ~ [EG [E [true U [4<=Undress & 9<=Dress]]]]]] & ~ [[[10<=Dress | [Out<=Dress & [Dress<=Bags | [~ [Out<=Dress] | ~ [EX [~ [8<=Entered]]]]]]] | ~ [E [true U ~ [[[[~ [EG [~ [WaitBag<=Out]]] & ~ [E [~ [WaitBag<=Out] U [~ [Dress<=Dress] & ~ [WaitBag<=Out]]]]] | ~ [14<=Undress]] & EX [~ [13<=Dress]]]]]]]]]]]]

abstracting: (13<=Dress)
states: 0
.abstracting: (14<=Undress)
states: 0
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
.................
EG iterations: 17
abstracting: (8<=Entered)
states: 17,017 (4)
.abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (Dress<=Bags)
states: 80,715 (4)
abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (10<=Dress)
states: 51
abstracting: (9<=Dress)
states: 277
abstracting: (4<=Undress)
states: 15,834 (4)
.
EG iterations: 1
abstracting: (16<=Bags)
states: 0
.abstracting: (11<=Dress)
states: 0
abstracting: (13<=Dress)
states: 0
.abstracting: (14<=Undress)
states: 0
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
.................
EG iterations: 17
abstracting: (8<=Entered)
states: 17,017 (4)
.abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (Dress<=Bags)
states: 80,715 (4)
abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (10<=Dress)
states: 51
abstracting: (13<=Dress)
states: 0
.abstracting: (14<=Undress)
states: 0
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
.................
EG iterations: 17
abstracting: (8<=Entered)
states: 17,017 (4)
.abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (Dress<=Bags)
states: 80,715 (4)
abstracting: (Out<=Dress)
states: 30,093 (4)
abstracting: (10<=Dress)
states: 51
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: A [EX [[~ [Undress<=Undress] | [[[[Out<=19 | Dressed<=WaitBag] | [Entered<=Out & WaitBag<=8]] & ~ [[Out<=9 | 2<=Dress]]] | [AX [Cabins<=Out] | [EG [Dress<=16] | [5<=Entered | 9<=Dress]]]]]] U EF [[~ [WaitBag<=4] & [[~ [EG [WaitBag<=Entered]] | InBath<=4] & AG [Bags<=Entered]]]]]
normalized: [~ [EG [~ [E [true U [[~ [E [true U ~ [Bags<=Entered]]] & [InBath<=4 | ~ [EG [WaitBag<=Entered]]]] & ~ [WaitBag<=4]]]]]] & ~ [E [~ [E [true U [[~ [E [true U ~ [Bags<=Entered]]] & [InBath<=4 | ~ [EG [WaitBag<=Entered]]]] & ~ [WaitBag<=4]]]] U [~ [EX [[[[[[5<=Entered | 9<=Dress] | EG [Dress<=16]] | ~ [EX [~ [Cabins<=Out]]]] | [~ [[Out<=9 | 2<=Dress]] & [[Entered<=Out & WaitBag<=8] | [Out<=19 | Dressed<=WaitBag]]]] | ~ [Undress<=Undress]]]] & ~ [E [true U [[~ [E [true U ~ [Bags<=Entered]]] & [InBath<=4 | ~ [EG [WaitBag<=Entered]]]] & ~ [WaitBag<=4]]]]]]]]

abstracting: (WaitBag<=4)
states: 79,709 (4)
abstracting: (WaitBag<=Entered)
states: 68,579 (4)
.
EG iterations: 1
abstracting: (InBath<=4)
states: 55,055 (4)
abstracting: (Bags<=Entered)
states: 24,808 (4)
abstracting: (Undress<=Undress)
states: 89,621 (4)
abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
abstracting: (Out<=19)
states: 89,620 (4)
abstracting: (WaitBag<=8)
states: 89,279 (4)
abstracting: (Entered<=Out)
states: 47,723 (4)
abstracting: (2<=Dress)
states: 40,872 (4)
abstracting: (Out<=9)
states: 81,613 (4)
abstracting: (Cabins<=Out)
states: 64,932 (4)
.abstracting: (Dress<=16)
states: 89,621 (4)

EG iterations: 0
abstracting: (9<=Dress)
states: 277
abstracting: (5<=Entered)
states: 38,038 (4)
.abstracting: (WaitBag<=4)
states: 79,709 (4)
abstracting: (WaitBag<=Entered)
states: 68,579 (4)
.
EG iterations: 1
abstracting: (InBath<=4)
states: 55,055 (4)
abstracting: (Bags<=Entered)
states: 24,808 (4)
abstracting: (WaitBag<=4)
states: 79,709 (4)
abstracting: (WaitBag<=Entered)
states: 68,579 (4)
.
EG iterations: 1
abstracting: (InBath<=4)
states: 55,055 (4)
abstracting: (Bags<=Entered)
states: 24,808 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: [E [~ [[AF [Bags<=Bags] | ~ [[[EG [InBath<=Bags] & EF [InBath<=18]] & E [7<=Bags U WaitBag<=Out]]]]] U EX [[E [[InBath<=18 & Dressed<=8] U EG [WaitBag<=4]] | [A [Entered<=Dressed U Undress<=Entered] & EX [Entered<=18]]]]] | EG [[EG [E [~ [Entered<=Cabins] U A [9<=Dressed U WaitBag<=InBath]]] & EX [InBath<=13]]]]
normalized: [EG [[EG [E [~ [Entered<=Cabins] U [~ [EG [~ [WaitBag<=InBath]]] & ~ [E [~ [WaitBag<=InBath] U [~ [WaitBag<=InBath] & ~ [9<=Dressed]]]]]]] & EX [InBath<=13]]] | E [~ [[~ [[E [7<=Bags U WaitBag<=Out] & [E [true U InBath<=18] & EG [InBath<=Bags]]]] | ~ [EG [~ [Bags<=Bags]]]]] U EX [[[EX [Entered<=18] & [~ [EG [~ [Undress<=Entered]]] & ~ [E [~ [Undress<=Entered] U [~ [Entered<=Dressed] & ~ [Undress<=Entered]]]]]] | E [[InBath<=18 & Dressed<=8] U EG [WaitBag<=4]]]]]]

abstracting: (WaitBag<=4)
states: 79,709 (4)
.
EG iterations: 1
abstracting: (Dressed<=8)
states: 89,279 (4)
abstracting: (InBath<=18)
states: 89,621 (4)
abstracting: (Undress<=Entered)
states: 69,937 (4)
abstracting: (Entered<=Dressed)
states: 30,932 (4)
abstracting: (Undress<=Entered)
states: 69,937 (4)
abstracting: (Undress<=Entered)
states: 69,937 (4)
.................................................
EG iterations: 49
abstracting: (Entered<=18)
states: 89,614 (4)
..abstracting: (Bags<=Bags)
states: 89,621 (4)
.
EG iterations: 1
abstracting: (InBath<=Bags)
states: 65,093 (4)
.........
EG iterations: 9
abstracting: (InBath<=18)
states: 89,621 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (7<=Bags)
states: 54,186 (4)
abstracting: (InBath<=13)
states: 89,369 (4)
.abstracting: (9<=Dressed)
states: 342
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
abstracting: (WaitBag<=InBath)
states: 67,599 (4)
............
EG iterations: 12
abstracting: (Entered<=Cabins)
states: 35,098 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.181sec

totally nodes used: 336215 (3.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3847016 1134610 4981626
used/not used/entry size/cache size: 1343267 65765597 16 1024MB
basic ops cache: hits/miss/sum: 1995770 868273 2864043
used/not used/entry size/cache size: 1228549 15548667 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 285468 74747 360215
used/not used/entry size/cache size: 74456 8314152 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 66830482
1 250154
2 19228
3 4028
4 1779
5 1065
6 514
7 398
8 234
9 146
>= 10 836

Total processing time: 0m 6.612sec


BK_STOP 1679157347586

--------------------
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:507 (72), effective:120 (17)

initing FirstDep: 0m 0.001sec


iterations count:166 (23), effective:28 (4)

iterations count:52 (7), effective:15 (2)

iterations count:335 (47), effective:89 (12)

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

iterations count:282 (40), effective:83 (11)

iterations count:188 (26), effective:48 (6)

iterations count:37 (5), effective:5 (0)

iterations count:37 (5), effective:5 (0)

iterations count:178 (25), effective:38 (5)

iterations count:37 (5), effective:5 (0)

iterations count:12 (1), effective:5 (0)

iterations count:57 (8), effective:20 (2)

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

iterations count:381 (54), effective:88 (12)

iterations count:109 (15), effective:24 (3)

iterations count:109 (15), effective:24 (3)

iterations count:119 (17), effective:49 (7)

iterations count:109 (15), effective:24 (3)

iterations count:109 (15), effective:24 (3)

iterations count:109 (15), effective:24 (3)

iterations count:119 (17), effective:49 (7)

iterations count:109 (15), effective:24 (3)

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

iterations count:109 (15), effective:24 (3)

iterations count:109 (15), effective:24 (3)

iterations count:119 (17), effective:49 (7)

iterations count:109 (15), effective:24 (3)

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

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

iterations count:129 (18), effective:50 (7)

iterations count:181 (25), effective:42 (6)

iterations count:354 (50), effective:92 (13)

iterations count:79 (11), effective:12 (1)

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

iterations count:17 (2), effective:10 (1)

iterations count:79 (11), effective:12 (1)

iterations count:79 (11), effective:12 (1)

iterations count:59 (8), effective:20 (2)

iterations count:59 (8), effective:20 (2)

iterations count:185 (26), effective:38 (5)

iterations count:59 (8), effective:20 (2)

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

iterations count:185 (26), effective:53 (7)

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

iterations count:28 (4), effective:7 (1)

iterations count:138 (19), effective:41 (5)

iterations count:108 (15), effective:29 (4)

iterations count:108 (15), effective:29 (4)

iterations count:108 (15), effective:29 (4)

iterations count:34 (4), effective:9 (1)

iterations count:43 (6), effective:17 (2)

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

iterations count:116 (16), effective:45 (6)

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

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

iterations count:49 (7), effective:14 (2)

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="SwimmingPool-PT-01"
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 SwimmingPool-PT-01, 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 r481-tall-167912691800321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-01.tgz
mv SwimmingPool-PT-01 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 ;