About the Execution of Marcie for SwimmingPool-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5486.523 | 5991.00 | 6070.00 | 0.00 | FFFFFFTFFFTFTTFT | normal |
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-167912691800326.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691800326
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-01
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-02
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-03
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-04
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-05
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-06
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-07
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-08
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-09
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679157414727
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-01
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.807sec
RS generation: 0m 0.103sec
-> reachability set: #nodes 6529 (6.5e+03) #states 89,621 (4)
starting MCC model checker
--------------------------
checking: AG [~ [9<=InBath]]
normalized: ~ [E [true U 9<=InBath]]
abstracting: (9<=InBath)
states: 9,100 (3)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.135sec
checking: AG [Dress<=Out]
normalized: ~ [E [true U ~ [Dress<=Out]]]
abstracting: (Dress<=Out)
states: 69,937 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
checking: EF [~ [[~ [10<=Out] | ~ [14<=Undress]]]]
normalized: E [true U ~ [[~ [14<=Undress] | ~ [10<=Out]]]]
abstracting: (10<=Out)
states: 8,008 (3)
abstracting: (14<=Undress)
states: 0
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AG [Dressed<=Cabins]
normalized: ~ [E [true U ~ [Dressed<=Cabins]]]
abstracting: (Dressed<=Cabins)
states: 58,513 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.096sec
checking: AG [Cabins<=Cabins]
normalized: ~ [E [true U ~ [Cabins<=Cabins]]]
abstracting: (Cabins<=Cabins)
states: 89,621 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[~ [Bags<=8] | Dressed<=WaitBag]]
normalized: ~ [E [true U ~ [[Dressed<=WaitBag | ~ [Bags<=8]]]]]
abstracting: (Bags<=8)
states: 52,703 (4)
abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.049sec
checking: EF [~ [[[~ [Bags<=12] | Bags<=15] & WaitBag<=Bags]]]
normalized: E [true U ~ [[WaitBag<=Bags & [Bags<=15 | ~ [Bags<=12]]]]]
abstracting: (Bags<=12)
states: 82,166 (4)
abstracting: (Bags<=15)
states: 89,621 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: AG [~ [[InBath<=Out & [~ [Cabins<=Bags] & 9<=Dress]]]]
normalized: ~ [E [true U [InBath<=Out & [9<=Dress & ~ [Cabins<=Bags]]]]]
abstracting: (Cabins<=Bags)
states: 80,471 (4)
abstracting: (9<=Dress)
states: 277
abstracting: (InBath<=Out)
states: 49,945 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: AG [[~ [[InBath<=InBath & ~ [[~ [[12<=Cabins | InBath<=20]] | [Dressed<=12 & ~ [16<=Undress]]]]]] & [Undress<=InBath | Dress<=Dress]]]
normalized: ~ [E [true U ~ [[[Undress<=InBath | Dress<=Dress] & ~ [[InBath<=InBath & ~ [[[Dressed<=12 & ~ [16<=Undress]] | ~ [[12<=Cabins | InBath<=20]]]]]]]]]]
abstracting: (InBath<=20)
states: 89,621 (4)
abstracting: (12<=Cabins)
states: 0
abstracting: (16<=Undress)
states: 0
abstracting: (Dressed<=12)
states: 89,621 (4)
abstracting: (InBath<=InBath)
states: 89,621 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (Undress<=InBath)
states: 67,675 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: EF [~ [[Bags<=17 | [[[~ [[~ [Dress<=20] & [Entered<=Out & Out<=Entered]]] | [[[2<=Cabins | 3<=Dress] & Cabins<=Bags] | InBath<=19]] & [~ [[InBath<=Dressed & WaitBag<=Dress]] & ~ [Bags<=14]]] & [Cabins<=4 & Dress<=12]]]]]
normalized: E [true U ~ [[Bags<=17 | [[Cabins<=4 & Dress<=12] & [[~ [Bags<=14] & ~ [[InBath<=Dressed & WaitBag<=Dress]]] & [[InBath<=19 | [Cabins<=Bags & [2<=Cabins | 3<=Dress]]] | ~ [[[Entered<=Out & Out<=Entered] & ~ [Dress<=20]]]]]]]]]
abstracting: (Dress<=20)
states: 89,621 (4)
abstracting: (Out<=Entered)
states: 47,723 (4)
abstracting: (Entered<=Out)
states: 47,723 (4)
abstracting: (3<=Dress)
states: 26,078 (4)
abstracting: (2<=Cabins)
states: 54,831 (4)
abstracting: (Cabins<=Bags)
states: 80,471 (4)
abstracting: (InBath<=19)
states: 89,621 (4)
abstracting: (WaitBag<=Dress)
states: 51,751 (4)
abstracting: (InBath<=Dressed)
states: 33,033 (4)
abstracting: (Bags<=14)
states: 88,675 (4)
abstracting: (Dress<=12)
states: 89,621 (4)
abstracting: (Cabins<=4)
states: 71,141 (4)
abstracting: (Bags<=17)
states: 89,621 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.113sec
checking: EF [[[2<=InBath & Dress<=4] | [[[[[~ [[10<=Dressed & Dress<=18]] & [InBath<=15 | ~ [[16<=Bags | Dress<=Dressed]]]] | 2<=Cabins] & [[[[~ [Dressed<=4] | Undress<=WaitBag] & ~ [19<=Dressed]] & ~ [[17<=Dress | Out<=11]]] | [Bags<=Dress | Out<=11]]] | WaitBag<=Entered] & ~ [[~ [WaitBag<=Cabins] & 10<=InBath]]]]]
normalized: E [true U [[~ [[10<=InBath & ~ [WaitBag<=Cabins]]] & [WaitBag<=Entered | [[[Bags<=Dress | Out<=11] | [~ [[17<=Dress | Out<=11]] & [~ [19<=Dressed] & [Undress<=WaitBag | ~ [Dressed<=4]]]]] & [2<=Cabins | [[InBath<=15 | ~ [[16<=Bags | Dress<=Dressed]]] & ~ [[10<=Dressed & Dress<=18]]]]]]] | [2<=InBath & Dress<=4]]]
abstracting: (Dress<=4)
states: 80,591 (4)
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (Dress<=18)
states: 89,621 (4)
abstracting: (10<=Dressed)
states: 66
abstracting: (Dress<=Dressed)
states: 53,725 (4)
abstracting: (16<=Bags)
states: 0
abstracting: (InBath<=15)
states: 89,621 (4)
abstracting: (2<=Cabins)
states: 54,831 (4)
abstracting: (Dressed<=4)
states: 79,709 (4)
abstracting: (Undress<=WaitBag)
states: 53,725 (4)
abstracting: (19<=Dressed)
states: 0
abstracting: (Out<=11)
states: 86,618 (4)
abstracting: (17<=Dress)
states: 0
abstracting: (Out<=11)
states: 86,618 (4)
abstracting: (Bags<=Dress)
states: 12,872 (4)
abstracting: (WaitBag<=Entered)
states: 68,579 (4)
abstracting: (WaitBag<=Cabins)
states: 58,513 (4)
abstracting: (10<=InBath)
states: 5,572 (3)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.122sec
checking: EF [~ [[[[[[[~ [Cabins<=Undress] & WaitBag<=Dressed] | 8<=Bags] | Bags<=9] | ~ [[5<=Bags & ~ [Cabins<=1]]]] & [Entered<=Entered | [[Cabins<=Dressed | [9<=Dressed | [[Bags<=10 & 7<=Out] & ~ [Out<=17]]]] | [Undress<=5 & [~ [[4<=WaitBag & 11<=Dressed]] & [[4<=Entered | WaitBag<=WaitBag] & [Cabins<=Dressed | 12<=Dressed]]]]]]] | ~ [Undress<=18]]]]
normalized: E [true U ~ [[~ [Undress<=18] | [[Entered<=Entered | [[Undress<=5 & [[[Cabins<=Dressed | 12<=Dressed] & [4<=Entered | WaitBag<=WaitBag]] & ~ [[4<=WaitBag & 11<=Dressed]]]] | [Cabins<=Dressed | [9<=Dressed | [~ [Out<=17] & [Bags<=10 & 7<=Out]]]]]] & [~ [[5<=Bags & ~ [Cabins<=1]]] | [Bags<=9 | [8<=Bags | [WaitBag<=Dressed & ~ [Cabins<=Undress]]]]]]]]]
abstracting: (Cabins<=Undress)
states: 42,491 (4)
abstracting: (WaitBag<=Dressed)
states: 52,395 (4)
abstracting: (8<=Bags)
states: 45,690 (4)
abstracting: (Bags<=9)
states: 61,341 (4)
abstracting: (Cabins<=1)
states: 34,790 (4)
abstracting: (5<=Bags)
states: 69,069 (4)
abstracting: (7<=Out)
states: 23,023 (4)
abstracting: (Bags<=10)
states: 69,405 (4)
abstracting: (Out<=17)
states: 89,593 (4)
abstracting: (9<=Dressed)
states: 342
abstracting: (Cabins<=Dressed)
states: 43,351 (4)
abstracting: (11<=Dressed)
states: 0
abstracting: (4<=WaitBag)
states: 17,066 (4)
abstracting: (WaitBag<=WaitBag)
states: 89,621 (4)
abstracting: (4<=Entered)
states: 46,981 (4)
abstracting: (12<=Dressed)
states: 0
abstracting: (Cabins<=Dressed)
states: 43,351 (4)
abstracting: (Undress<=5)
states: 84,875 (4)
abstracting: (Entered<=Entered)
states: 89,621 (4)
abstracting: (Undress<=18)
states: 89,621 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.111sec
checking: AG [[[18<=Entered & ~ [Dressed<=InBath]] | [[[~ [[~ [[[WaitBag<=11 | 10<=Out] & [WaitBag<=Dressed | Entered<=3]]] & ~ [[Undress<=Dress & 5<=Undress]]]] | 13<=Entered] & WaitBag<=9] & ~ [[[WaitBag<=Undress & Out<=10] & [[Dress<=InBath & [InBath<=InBath & Dress<=8]] & [[Cabins<=Dressed | Entered<=20] | [InBath<=Dress & Entered<=Out]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[InBath<=Dress & Entered<=Out] | [Cabins<=Dressed | Entered<=20]] & [Dress<=InBath & [InBath<=InBath & Dress<=8]]] & [WaitBag<=Undress & Out<=10]]] & [WaitBag<=9 & [13<=Entered | ~ [[~ [[Undress<=Dress & 5<=Undress]] & ~ [[[WaitBag<=Dressed | Entered<=3] & [WaitBag<=11 | 10<=Out]]]]]]]] | [18<=Entered & ~ [Dressed<=InBath]]]]]]
abstracting: (Dressed<=InBath)
states: 67,599 (4)
abstracting: (18<=Entered)
states: 28
abstracting: (10<=Out)
states: 8,008 (3)
abstracting: (WaitBag<=11)
states: 89,621 (4)
abstracting: (Entered<=3)
states: 42,640 (4)
abstracting: (WaitBag<=Dressed)
states: 52,395 (4)
abstracting: (5<=Undress)
states: 9,030 (3)
abstracting: (Undress<=Dress)
states: 52,865 (4)
abstracting: (13<=Entered)
states: 1,716 (3)
abstracting: (WaitBag<=9)
states: 89,555 (4)
abstracting: (Out<=10)
states: 84,616 (4)
abstracting: (WaitBag<=Undress)
states: 51,751 (4)
abstracting: (Dress<=8)
states: 89,344 (4)
abstracting: (InBath<=InBath)
states: 89,621 (4)
abstracting: (Dress<=InBath)
states: 67,675 (4)
abstracting: (Entered<=20)
states: 89,621 (4)
abstracting: (Cabins<=Dressed)
states: 43,351 (4)
abstracting: (Entered<=Out)
states: 47,723 (4)
abstracting: (InBath<=Dress)
states: 32,890 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.113sec
checking: AG [~ [[10<=Dress | [[[[[~ [[Bags<=Undress | Cabins<=InBath]] | ~ [Dress<=4]] | ~ [[Dressed<=Dressed | 18<=Undress]]] & ~ [[WaitBag<=Bags | [[Dress<=9 | 18<=Dress] & [Cabins<=15 | InBath<=0]]]]] | 13<=Cabins] & [[[[[[Entered<=Undress & Cabins<=Cabins] | Out<=Entered] | [[7<=Undress | 6<=Bags] & Out<=Cabins]] & ~ [Entered<=9]] & [Out<=18 | ~ [[~ [Undress<=Entered] & [InBath<=Undress & Entered<=InBath]]]]] & ~ [[10<=Bags | ~ [[[4<=Cabins | InBath<=Bags] & [Cabins<=Cabins & Entered<=2]]]]]]]]]]
normalized: ~ [E [true U [10<=Dress | [[~ [[10<=Bags | ~ [[[Cabins<=Cabins & Entered<=2] & [4<=Cabins | InBath<=Bags]]]]] & [[Out<=18 | ~ [[[InBath<=Undress & Entered<=InBath] & ~ [Undress<=Entered]]]] & [~ [Entered<=9] & [[Out<=Cabins & [7<=Undress | 6<=Bags]] | [Out<=Entered | [Entered<=Undress & Cabins<=Cabins]]]]]] & [13<=Cabins | [~ [[WaitBag<=Bags | [[Cabins<=15 | InBath<=0] & [Dress<=9 | 18<=Dress]]]] & [~ [[Dressed<=Dressed | 18<=Undress]] | [~ [Dress<=4] | ~ [[Bags<=Undress | Cabins<=InBath]]]]]]]]]]
abstracting: (Cabins<=InBath)
states: 62,594 (4)
abstracting: (Bags<=Undress)
states: 12,872 (4)
abstracting: (Dress<=4)
states: 80,591 (4)
abstracting: (18<=Undress)
states: 0
abstracting: (Dressed<=Dressed)
states: 89,621 (4)
abstracting: (18<=Dress)
states: 0
abstracting: (Dress<=9)
states: 89,570 (4)
abstracting: (InBath<=0)
states: 13,013 (4)
abstracting: (Cabins<=15)
states: 89,621 (4)
abstracting: (WaitBag<=Bags)
states: 85,169 (4)
abstracting: (13<=Cabins)
states: 0
abstracting: (Cabins<=Cabins)
states: 89,621 (4)
abstracting: (Entered<=Undress)
states: 30,093 (4)
abstracting: (Out<=Entered)
states: 47,723 (4)
abstracting: (6<=Bags)
states: 62,062 (4)
abstracting: (7<=Undress)
states: 2,233 (3)
abstracting: (Out<=Cabins)
states: 35,098 (4)
abstracting: (Entered<=9)
states: 81,613 (4)
abstracting: (Undress<=Entered)
states: 69,937 (4)
abstracting: (Entered<=InBath)
states: 46,473 (4)
abstracting: (InBath<=Undress)
states: 32,890 (4)
abstracting: (Out<=18)
states: 89,614 (4)
abstracting: (InBath<=Bags)
states: 65,093 (4)
abstracting: (4<=Cabins)
states: 28,182 (4)
abstracting: (Entered<=2)
states: 32,872 (4)
abstracting: (Cabins<=Cabins)
states: 89,621 (4)
abstracting: (10<=Bags)
states: 28,280 (4)
abstracting: (10<=Dress)
states: 51
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.139sec
checking: EF [[~ [[[[[18<=WaitBag | ~ [WaitBag<=Cabins]] & ~ [InBath<=5]] & [~ [[[[Cabins<=6 & 15<=Out] & [Out<=6 & Dress<=WaitBag]] | ~ [[InBath<=Entered | Undress<=Out]]]] | [Dress<=19 & [Entered<=14 | [~ [Out<=9] | Out<=Dressed]]]]] & [~ [[[Bags<=Bags & ~ [[9<=Bags & Out<=9]]] | [Bags<=12 | [[Dressed<=InBath & Dress<=11] & [InBath<=12 | Entered<=Dressed]]]]] & [Cabins<=Undress | InBath<=WaitBag]]]] & [~ [[~ [Undress<=WaitBag] & [WaitBag<=Out & Out<=Bags]]] & [~ [Bags<=16] & [17<=Bags | ~ [[[~ [[12<=Entered & Entered<=0]] & [[16<=Dress & WaitBag<=Dressed] | ~ [8<=Dressed]]] & 18<=Bags]]]]]]]
normalized: E [true U [[[[17<=Bags | ~ [[18<=Bags & [[~ [8<=Dressed] | [16<=Dress & WaitBag<=Dressed]] & ~ [[12<=Entered & Entered<=0]]]]]] & ~ [Bags<=16]] & ~ [[[WaitBag<=Out & Out<=Bags] & ~ [Undress<=WaitBag]]]] & ~ [[[~ [[[Bags<=Bags & ~ [[9<=Bags & Out<=9]]] | [Bags<=12 | [[InBath<=12 | Entered<=Dressed] & [Dressed<=InBath & Dress<=11]]]]] & [Cabins<=Undress | InBath<=WaitBag]] & [[[Dress<=19 & [Entered<=14 | [Out<=Dressed | ~ [Out<=9]]]] | ~ [[~ [[InBath<=Entered | Undress<=Out]] | [[Out<=6 & Dress<=WaitBag] & [Cabins<=6 & 15<=Out]]]]] & [~ [InBath<=5] & [18<=WaitBag | ~ [WaitBag<=Cabins]]]]]]]]
abstracting: (WaitBag<=Cabins)
states: 58,513 (4)
abstracting: (18<=WaitBag)
states: 0
abstracting: (InBath<=5)
states: 63,063 (4)
abstracting: (15<=Out)
states: 462
abstracting: (Cabins<=6)
states: 83,566 (4)
abstracting: (Dress<=WaitBag)
states: 53,725 (4)
abstracting: (Out<=6)
states: 66,598 (4)
abstracting: (Undress<=Out)
states: 69,937 (4)
abstracting: (InBath<=Entered)
states: 49,945 (4)
abstracting: (Out<=9)
states: 81,613 (4)
abstracting: (Out<=Dressed)
states: 30,932 (4)
abstracting: (Entered<=14)
states: 89,159 (4)
abstracting: (Dress<=19)
states: 89,621 (4)
abstracting: (InBath<=WaitBag)
states: 33,033 (4)
abstracting: (Cabins<=Undress)
states: 42,491 (4)
abstracting: (Dress<=11)
states: 89,621 (4)
abstracting: (Dressed<=InBath)
states: 67,599 (4)
abstracting: (Entered<=Dressed)
states: 30,932 (4)
abstracting: (InBath<=12)
states: 88,913 (4)
abstracting: (Bags<=12)
states: 82,166 (4)
abstracting: (Out<=9)
states: 81,613 (4)
abstracting: (9<=Bags)
states: 36,918 (4)
abstracting: (Bags<=Bags)
states: 89,621 (4)
abstracting: (Undress<=WaitBag)
states: 53,725 (4)
abstracting: (Out<=Bags)
states: 72,877 (4)
abstracting: (WaitBag<=Out)
states: 68,579 (4)
abstracting: (Bags<=16)
states: 89,621 (4)
abstracting: (Entered<=0)
states: 11,410 (4)
abstracting: (12<=Entered)
states: 3,003 (3)
abstracting: (WaitBag<=Dressed)
states: 52,395 (4)
abstracting: (16<=Dress)
states: 0
abstracting: (8<=Dressed)
states: 1,063 (3)
abstracting: (18<=Bags)
states: 0
abstracting: (17<=Bags)
states: 0
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.179sec
checking: EF [~ [[[~ [[[~ [[[20<=InBath & Dressed<=Dressed] & ~ [InBath<=Dressed]]] | [[~ [WaitBag<=7] & [Out<=13 & Dressed<=WaitBag]] & ~ [17<=Dressed]]] & [[[[2<=Entered & Dress<=6] | Dress<=Dress] | ~ [[Bags<=WaitBag & Cabins<=17]]] | ~ [[Entered<=17 & Cabins<=Dress]]]]] | [Entered<=Entered | Dressed<=WaitBag]] & [~ [[[[[[Entered<=Undress & Entered<=Entered] & [Cabins<=Out | Bags<=Dress]] & [[6<=Cabins | Entered<=14] | [16<=InBath & InBath<=9]]] | [[[WaitBag<=Cabins | 9<=Entered] | ~ [Bags<=Entered]] & ~ [[Bags<=18 | Cabins<=Dress]]]] & [[[[4<=InBath & Cabins<=1] | Dress<=Entered] & [Entered<=11 | Entered<=Cabins]] | ~ [[~ [2<=InBath] | ~ [11<=Entered]]]]]] | ~ [[[[~ [Dressed<=12] | [11<=Dressed & Cabins<=4]] & ~ [[Entered<=WaitBag & 17<=Bags]]] & ~ [10<=Dress]]]]]]]
normalized: E [true U ~ [[[~ [[~ [10<=Dress] & [~ [[Entered<=WaitBag & 17<=Bags]] & [[11<=Dressed & Cabins<=4] | ~ [Dressed<=12]]]]] | ~ [[[~ [[~ [11<=Entered] | ~ [2<=InBath]]] | [[Entered<=11 | Entered<=Cabins] & [Dress<=Entered | [4<=InBath & Cabins<=1]]]] & [[~ [[Bags<=18 | Cabins<=Dress]] & [~ [Bags<=Entered] | [WaitBag<=Cabins | 9<=Entered]]] | [[[16<=InBath & InBath<=9] | [6<=Cabins | Entered<=14]] & [[Cabins<=Out | Bags<=Dress] & [Entered<=Undress & Entered<=Entered]]]]]]] & [[Entered<=Entered | Dressed<=WaitBag] | ~ [[[~ [[Entered<=17 & Cabins<=Dress]] | [~ [[Bags<=WaitBag & Cabins<=17]] | [Dress<=Dress | [2<=Entered & Dress<=6]]]] & [[~ [17<=Dressed] & [[Out<=13 & Dressed<=WaitBag] & ~ [WaitBag<=7]]] | ~ [[~ [InBath<=Dressed] & [20<=InBath & Dressed<=Dressed]]]]]]]]]]
abstracting: (Dressed<=Dressed)
states: 89,621 (4)
abstracting: (20<=InBath)
states: 0
abstracting: (InBath<=Dressed)
states: 33,033 (4)
abstracting: (WaitBag<=7)
states: 88,558 (4)
abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
abstracting: (Out<=13)
states: 88,697 (4)
abstracting: (17<=Dressed)
states: 0
abstracting: (Dress<=6)
states: 87,388 (4)
abstracting: (2<=Entered)
states: 67,207 (4)
abstracting: (Dress<=Dress)
states: 89,621 (4)
abstracting: (Cabins<=17)
states: 89,621 (4)
abstracting: (Bags<=WaitBag)
states: 8,512 (3)
abstracting: (Cabins<=Dress)
states: 42,491 (4)
abstracting: (Entered<=17)
states: 89,593 (4)
abstracting: (Dressed<=WaitBag)
states: 52,395 (4)
abstracting: (Entered<=Entered)
states: 89,621 (4)
abstracting: (Entered<=Entered)
states: 89,621 (4)
abstracting: (Entered<=Undress)
states: 30,093 (4)
abstracting: (Bags<=Dress)
states: 12,872 (4)
abstracting: (Cabins<=Out)
states: 64,932 (4)
abstracting: (Entered<=14)
states: 89,159 (4)
abstracting: (6<=Cabins)
states: 11,172 (4)
abstracting: (InBath<=9)
states: 84,049 (4)
abstracting: (16<=InBath)
states: 0
abstracting: (9<=Entered)
states: 12,012 (4)
abstracting: (WaitBag<=Cabins)
states: 58,513 (4)
abstracting: (Bags<=Entered)
states: 24,808 (4)
abstracting: (Cabins<=Dress)
states: 42,491 (4)
abstracting: (Bags<=18)
states: 89,621 (4)
abstracting: (Cabins<=1)
states: 34,790 (4)
abstracting: (4<=InBath)
states: 43,575 (4)
abstracting: (Dress<=Entered)
states: 69,937 (4)
abstracting: (Entered<=Cabins)
states: 35,098 (4)
abstracting: (Entered<=11)
states: 86,618 (4)
abstracting: (2<=InBath)
states: 64,596 (4)
abstracting: (11<=Entered)
states: 5,005 (3)
abstracting: (Dressed<=12)
states: 89,621 (4)
abstracting: (Cabins<=4)
states: 71,141 (4)
abstracting: (11<=Dressed)
states: 0
abstracting: (17<=Bags)
states: 0
abstracting: (Entered<=WaitBag)
states: 30,932 (4)
abstracting: (10<=Dress)
states: 51
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
totally nodes used: 201213 (2.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1840484 529951 2370435
used/not used/entry size/cache size: 598535 66510329 16 1024MB
basic ops cache: hits/miss/sum: 2216712 986391 3203103
used/not used/entry size/cache size: 1305101 15472115 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: 392055 97778 489833
used/not used/entry size/cache size: 97338 8291270 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 66938512
1 153953
2 11836
3 2289
4 993
5 409
6 245
7 135
8 79
9 76
>= 10 337
Total processing time: 0m 5.945sec
BK_STOP 1679157420718
--------------------
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.000sec
iterations count:255 (36), effective:64 (9)
iterations count:216 (30), effective:53 (7)
iterations count:163 (23), effective:41 (5)
iterations count:199 (28), effective:50 (7)
iterations count:297 (42), effective:72 (10)
iterations count:22 (3), effective:7 (1)
iterations count:164 (23), effective:45 (6)
iterations count:286 (40), effective:89 (12)
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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912691800326"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;