About the Execution of Marcie for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5514.647 | 11113.00 | 11060.00 | 0.00 | TFFTTFTTFFFTTFFT | 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.r353-smll-167891800800257.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 SafeBus-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800800257
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 222K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 158K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:49 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 95K 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 SafeBus-PT-03-CTLCardinality-00
FORMULA_NAME SafeBus-PT-03-CTLCardinality-01
FORMULA_NAME SafeBus-PT-03-CTLCardinality-02
FORMULA_NAME SafeBus-PT-03-CTLCardinality-03
FORMULA_NAME SafeBus-PT-03-CTLCardinality-04
FORMULA_NAME SafeBus-PT-03-CTLCardinality-05
FORMULA_NAME SafeBus-PT-03-CTLCardinality-06
FORMULA_NAME SafeBus-PT-03-CTLCardinality-07
FORMULA_NAME SafeBus-PT-03-CTLCardinality-08
FORMULA_NAME SafeBus-PT-03-CTLCardinality-09
FORMULA_NAME SafeBus-PT-03-CTLCardinality-10
FORMULA_NAME SafeBus-PT-03-CTLCardinality-11
FORMULA_NAME SafeBus-PT-03-CTLCardinality-12
FORMULA_NAME SafeBus-PT-03-CTLCardinality-13
FORMULA_NAME SafeBus-PT-03-CTLCardinality-14
FORMULA_NAME SafeBus-PT-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679905265101
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=SafeBus-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: SafeBus_PT_03
(NrP: 57 NrTr: 91 NrArc: 541)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.492sec
RS generation: 0m 0.243sec
-> reachability set: #nodes 3245 (3.2e+03) #states 4,650 (3)
starting MCC model checker
--------------------------
checking: EF [52<=R_tout]
normalized: E [true U 52<=R_tout]
abstracting: (52<=R_tout)
states: 0
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [EG [~ [AG [T_out<=0]]]]
normalized: ~ [EG [E [true U ~ [T_out<=0]]]]
abstracting: (T_out<=0)
states: 4,182 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.273sec
checking: AF [EF [~ [EX [loop_em_3<=1]]]]
normalized: ~ [EG [~ [E [true U ~ [EX [loop_em_3<=1]]]]]]
abstracting: (loop_em_3<=1)
states: 4,650 (3)
.
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: A [FMCb<=1 U EG [EF [FMCb<=0]]]
normalized: [~ [EG [~ [EG [E [true U FMCb<=0]]]]] & ~ [E [~ [EG [E [true U FMCb<=0]]] U [~ [FMCb<=1] & ~ [EG [E [true U FMCb<=0]]]]]]]
abstracting: (FMCb<=0)
states: 1,152 (3)
EG iterations: 0
abstracting: (FMCb<=1)
states: 4,650 (3)
abstracting: (FMCb<=0)
states: 1,152 (3)
EG iterations: 0
abstracting: (FMCb<=0)
states: 1,152 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.121sec
checking: EX [EG [~ [[EG [AX [AMC_3_2<=0]] | ~ [E [Cpt1_2<=1 U listen_2<=1]]]]]]
normalized: EX [EG [~ [[~ [E [Cpt1_2<=1 U listen_2<=1]] | EG [~ [EX [~ [AMC_3_2<=0]]]]]]]]
abstracting: (AMC_3_2<=0)
states: 4,274 (3)
..........
EG iterations: 9
abstracting: (listen_2<=1)
states: 4,650 (3)
abstracting: (Cpt1_2<=1)
states: 4,650 (3)
.........................
EG iterations: 25
.-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.190sec
checking: ~ [AF [EX [EG [[[1<=listen_3 & PMC_1<=AMC_2_1] | ~ [1<=listen_3]]]]]]
normalized: EG [~ [EX [EG [[~ [1<=listen_3] | [1<=listen_3 & PMC_1<=AMC_2_1]]]]]]
abstracting: (PMC_1<=AMC_2_1)
states: 4,506 (3)
abstracting: (1<=listen_3)
states: 804
abstracting: (1<=listen_3)
states: 804
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [AG [AX [[AF [PMC_1<=1] & [~ [AMC_2_3<=AMC_3_2] | [wait_ack_2_3<=1 | Cpt1_2<=1]]]]]]
normalized: ~ [E [true U E [true U EX [~ [[[[wait_ack_2_3<=1 | Cpt1_2<=1] | ~ [AMC_2_3<=AMC_3_2]] & ~ [EG [~ [PMC_1<=1]]]]]]]]]
abstracting: (PMC_1<=1)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (AMC_2_3<=AMC_3_2)
states: 4,336 (3)
abstracting: (Cpt1_2<=1)
states: 4,650 (3)
abstracting: (wait_ack_2_3<=1)
states: 4,650 (3)
.-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [E [EG [[AX [~ [FMCb<=FMC_1]] | [EG [1<=AMC_3_1] | EX [wait_cable_1<=0]]]] U [[~ [EF [AF [listen_2<=0]]] | Cpt1_3<=1] & [~ [E [AF [1<=ACK] U Cpt1_3<=listen_3]] & ~ [AF [~ [listen_1<=0]]]]]]]
normalized: ~ [E [EG [[[EX [wait_cable_1<=0] | EG [1<=AMC_3_1]] | ~ [EX [FMCb<=FMC_1]]]] U [[EG [listen_1<=0] & ~ [E [~ [EG [~ [1<=ACK]]] U Cpt1_3<=listen_3]]] & [Cpt1_3<=1 | ~ [E [true U ~ [EG [~ [listen_2<=0]]]]]]]]]
abstracting: (listen_2<=0)
states: 3,846 (3)
......
EG iterations: 6
abstracting: (Cpt1_3<=1)
states: 4,650 (3)
abstracting: (Cpt1_3<=listen_3)
states: 3,368 (3)
abstracting: (1<=ACK)
states: 936
...............
EG iterations: 15
abstracting: (listen_1<=0)
states: 3,846 (3)
......................
EG iterations: 22
abstracting: (FMCb<=FMC_1)
states: 1,152 (3)
.abstracting: (1<=AMC_3_1)
states: 376
................
EG iterations: 16
abstracting: (wait_cable_1<=0)
states: 2,772 (3)
..
EG iterations: 1
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.661sec
checking: A [[[A [AF [wait_msg_1<=AMC_1_2] U ~ [EF [wait_msg_1<=Cpt1_1]]] & AMC_2_2<=1] & EF [[E [loop_em_2<=0 U AF [1<=wait_msg_1]] | E [[wait_ack_3_1<=1 | listen_2<=1] U 1<=AMC_3_3]]]] U EX [~ [AX [AG [msgl_1<=1]]]]]
normalized: [~ [EG [~ [EX [EX [E [true U ~ [msgl_1<=1]]]]]]] & ~ [E [~ [EX [EX [E [true U ~ [msgl_1<=1]]]]] U [~ [[E [true U [E [[wait_ack_3_1<=1 | listen_2<=1] U 1<=AMC_3_3] | E [loop_em_2<=0 U ~ [EG [~ [1<=wait_msg_1]]]]]] & [AMC_2_2<=1 & [~ [EG [E [true U wait_msg_1<=Cpt1_1]]] & ~ [E [E [true U wait_msg_1<=Cpt1_1] U [EG [~ [wait_msg_1<=AMC_1_2]] & E [true U wait_msg_1<=Cpt1_1]]]]]]]] & ~ [EX [EX [E [true U ~ [msgl_1<=1]]]]]]]]]
abstracting: (msgl_1<=1)
states: 4,650 (3)
..abstracting: (wait_msg_1<=Cpt1_1)
states: 4,254 (3)
abstracting: (wait_msg_1<=AMC_1_2)
states: 4,056 (3)
.......
EG iterations: 7
abstracting: (wait_msg_1<=Cpt1_1)
states: 4,254 (3)
abstracting: (wait_msg_1<=Cpt1_1)
states: 4,254 (3)
EG iterations: 0
abstracting: (AMC_2_2<=1)
states: 4,650 (3)
abstracting: (1<=wait_msg_1)
states: 594
.........
EG iterations: 9
abstracting: (loop_em_2<=0)
states: 4,056 (3)
abstracting: (1<=AMC_3_3)
states: 376
abstracting: (listen_2<=1)
states: 4,650 (3)
abstracting: (wait_ack_3_1<=1)
states: 4,650 (3)
abstracting: (msgl_1<=1)
states: 4,650 (3)
..abstracting: (msgl_1<=1)
states: 4,650 (3)
..
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.664sec
checking: EF [[sum(RMC_3, RMC_2, RMC_1)<=64 & A [[AX [AG [sum(listen_3, listen_2, listen_1)<=1]] | [cable_free<=0 | ~ [[sum(FMC_3, FMC_2, FMC_1)<=48 | 95<=ACK]]]] U AX [AG [sum(PMC_3, PMC_2, PMC_1)<=41]]]]]
normalized: E [true U [sum(RMC_3, RMC_2, RMC_1)<=64 & [~ [EG [EX [E [true U ~ [sum(PMC_3, PMC_2, PMC_1)<=41]]]]] & ~ [E [EX [E [true U ~ [sum(PMC_3, PMC_2, PMC_1)<=41]]] U [~ [[[cable_free<=0 | ~ [[sum(FMC_3, FMC_2, FMC_1)<=48 | 95<=ACK]]] | ~ [EX [E [true U ~ [sum(listen_3, listen_2, listen_1)<=1]]]]]] & EX [E [true U ~ [sum(PMC_3, PMC_2, PMC_1)<=41]]]]]]]]]
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=41)
states: 4,650 (3)
.abstracting: (sum(listen_3, listen_2, listen_1)<=1)
states: 4,284 (3)
.abstracting: (95<=ACK)
states: 0
abstracting: (sum(FMC_3, FMC_2, FMC_1)<=48)
states: 4,650 (3)
abstracting: (cable_free<=0)
states: 3,960 (3)
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=41)
states: 4,650 (3)
.abstracting: (sum(PMC_3, PMC_2, PMC_1)<=41)
states: 4,650 (3)
..
EG iterations: 1
abstracting: (sum(RMC_3, RMC_2, RMC_1)<=64)
states: 4,650 (3)
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.357sec
checking: EG [[[EX [47<=sum(Cpt1_3, Cpt1_2, Cpt1_1)] | sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=67] | ~ [E [[AF [55<=sum(PMC_3, PMC_2, PMC_1)] & ~ [E [R_tout<=29 U sum(msgl_3, msgl_2, msgl_1)<=17]]] U AF [[R_tout<=51 | cable_free<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]]]]]
normalized: EG [[~ [E [[~ [E [R_tout<=29 U sum(msgl_3, msgl_2, msgl_1)<=17]] & ~ [EG [~ [55<=sum(PMC_3, PMC_2, PMC_1)]]]] U ~ [EG [~ [[R_tout<=51 | cable_free<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]]]]] | [sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=67 | EX [47<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]]]
abstracting: (47<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 0
.abstracting: (sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=67)
states: 4,650 (3)
abstracting: (cable_free<=sum(Cpt2_3, Cpt2_2, Cpt2_1))
states: 4,650 (3)
abstracting: (R_tout<=51)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (55<=sum(PMC_3, PMC_2, PMC_1))
states: 0
EG iterations: 0
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=17)
states: 4,650 (3)
abstracting: (R_tout<=29)
states: 4,650 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.181sec
checking: E [EG [[[AF [~ [sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(FMC_3, FMC_2, FMC_1)]] | AF [[sum(cable_used_3, cable_used_2, cable_used_1)<=sum(loop_em_3, loop_em_2, loop_em_1) | sum(RMC_3, RMC_2, RMC_1)<=sum(cable_used_3, cable_used_2, cable_used_1)]]] | [~ [[A [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=34 U ACK<=35] | EX [48<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]]] & ~ [[[45<=FMCb | 86<=T_out] | ~ [54<=sum(cable_used_3, cable_used_2, cable_used_1)]]]]]] U EX [~ [E [EG [sum(wait_cable_3, wait_cable_2, wait_cable_1)<=5] U ~ [sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)]]]]]
normalized: E [EG [[[~ [[~ [54<=sum(cable_used_3, cable_used_2, cable_used_1)] | [45<=FMCb | 86<=T_out]]] & ~ [[EX [48<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] | [~ [EG [~ [ACK<=35]]] & ~ [E [~ [ACK<=35] U [~ [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=34] & ~ [ACK<=35]]]]]]]] | [~ [EG [~ [[sum(cable_used_3, cable_used_2, cable_used_1)<=sum(loop_em_3, loop_em_2, loop_em_1) | sum(RMC_3, RMC_2, RMC_1)<=sum(cable_used_3, cable_used_2, cable_used_1)]]]] | ~ [EG [sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(FMC_3, FMC_2, FMC_1)]]]]] U EX [~ [E [EG [sum(wait_cable_3, wait_cable_2, wait_cable_1)<=5] U ~ [sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)]]]]]
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1))
states: 4,650 (3)
abstracting: (sum(wait_cable_3, wait_cable_2, wait_cable_1)<=5)
states: 4,650 (3)
EG iterations: 0
.abstracting: (sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(FMC_3, FMC_2, FMC_1))
states: 2,310 (3)
............
EG iterations: 12
abstracting: (sum(RMC_3, RMC_2, RMC_1)<=sum(cable_used_3, cable_used_2, cable_used_1))
states: 4,236 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(loop_em_3, loop_em_2, loop_em_1))
states: 2,022 (3)
.....
EG iterations: 5
abstracting: (ACK<=35)
states: 4,650 (3)
abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=34)
states: 4,650 (3)
abstracting: (ACK<=35)
states: 4,650 (3)
abstracting: (ACK<=35)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (48<=sum(wait_cable_3, wait_cable_2, wait_cable_1))
states: 0
.abstracting: (86<=T_out)
states: 0
abstracting: (45<=FMCb)
states: 0
abstracting: (54<=sum(cable_used_3, cable_used_2, cable_used_1))
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.344sec
checking: [EG [AX [EG [AX [R_tout<=53]]]] & [A [E [[[[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(msgl_3, msgl_2, msgl_1) | sum(listen_3, listen_2, listen_1)<=47] & [cable_free<=T_out | 7<=FMCb]] & ~ [EF [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]] U EG [[FMCb<=16 & 81<=cable_free]]] U [90<=sum(RMC_3, RMC_2, RMC_1) | ~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49 | [[sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33 | sum(cable_used_3, cable_used_2, cable_used_1)<=74] & AG [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1)]]]]]] | EG [sum(MSG_3, MSG_2, MSG_1)<=R_tout]]]
normalized: [[EG [sum(MSG_3, MSG_2, MSG_1)<=R_tout] | [~ [EG [~ [[90<=sum(RMC_3, RMC_2, RMC_1) | ~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49 | [~ [E [true U ~ [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1)]]] & [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33 | sum(cable_used_3, cable_used_2, cable_used_1)<=74]]]]]]]] & ~ [E [~ [[90<=sum(RMC_3, RMC_2, RMC_1) | ~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49 | [~ [E [true U ~ [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1)]]] & [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33 | sum(cable_used_3, cable_used_2, cable_used_1)<=74]]]]]] U [~ [E [[~ [E [true U sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] & [[cable_free<=T_out | 7<=FMCb] & [sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(msgl_3, msgl_2, msgl_1) | sum(listen_3, listen_2, listen_1)<=47]]] U EG [[FMCb<=16 & 81<=cable_free]]]] & ~ [[90<=sum(RMC_3, RMC_2, RMC_1) | ~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49 | [~ [E [true U ~ [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1)]]] & [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33 | sum(cable_used_3, cable_used_2, cable_used_1)<=74]]]]]]]]]]] & EG [~ [EX [~ [EG [~ [EX [~ [R_tout<=53]]]]]]]]]
abstracting: (R_tout<=53)
states: 4,650 (3)
.
EG iterations: 0
.
EG iterations: 0
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=74)
states: 4,650 (3)
abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33)
states: 4,650 (3)
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1))
states: 3,570 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49)
states: 4,650 (3)
abstracting: (90<=sum(RMC_3, RMC_2, RMC_1))
states: 0
abstracting: (81<=cable_free)
states: 0
abstracting: (FMCb<=16)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (sum(listen_3, listen_2, listen_1)<=47)
states: 4,650 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(msgl_3, msgl_2, msgl_1))
states: 4,650 (3)
abstracting: (7<=FMCb)
states: 0
abstracting: (cable_free<=T_out)
states: 3,960 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 4,650 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=74)
states: 4,650 (3)
abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33)
states: 4,650 (3)
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1))
states: 3,570 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49)
states: 4,650 (3)
abstracting: (90<=sum(RMC_3, RMC_2, RMC_1))
states: 0
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=74)
states: 4,650 (3)
abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=33)
states: 4,650 (3)
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(listen_3, listen_2, listen_1))
states: 3,570 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=49)
states: 4,650 (3)
abstracting: (90<=sum(RMC_3, RMC_2, RMC_1))
states: 0
EG iterations: 0
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=R_tout)
states: 4,182 (3)
..........
EG iterations: 10
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.579sec
checking: [~ [[EF [~ [[S_tout<=71 | sum(FMC_3, FMC_2, FMC_1)<=sum(MSG_3, MSG_2, MSG_1)]]] & ~ [AG [90<=R_tout]]]] | E [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=99] U [~ [[~ [E [69<=sum(wait_msg_3, wait_msg_2, wait_msg_1) U 19<=sum(listen_3, listen_2, listen_1)]] & EX [A [sum(cable_used_3, cable_used_2, cable_used_1)<=R_tout U 2<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]] & [[[[[sum(listen_3, listen_2, listen_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1) | sum(cable_used_3, cable_used_2, cable_used_1)<=sum(listen_3, listen_2, listen_1)] | [sum(cable_used_3, cable_used_2, cable_used_1)<=95 | 54<=S_tout]] | AX [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(msgl_3, msgl_2, msgl_1)]] & ~ [E [T_out<=41 U sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=69]]] & 85<=sum(PMC_3, PMC_2, PMC_1)]]]]
normalized: [E [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=99] U [~ [[~ [E [69<=sum(wait_msg_3, wait_msg_2, wait_msg_1) U 19<=sum(listen_3, listen_2, listen_1)]] & EX [[~ [EG [~ [2<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]] & ~ [E [~ [2<=sum(wait_msg_3, wait_msg_2, wait_msg_1)] U [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=R_tout] & ~ [2<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]]]]]] & [85<=sum(PMC_3, PMC_2, PMC_1) & [[[[sum(cable_used_3, cable_used_2, cable_used_1)<=95 | 54<=S_tout] | [sum(listen_3, listen_2, listen_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1) | sum(cable_used_3, cable_used_2, cable_used_1)<=sum(listen_3, listen_2, listen_1)]] | ~ [EX [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(msgl_3, msgl_2, msgl_1)]]]] & ~ [E [T_out<=41 U sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=69]]]]]] | ~ [[E [true U ~ [90<=R_tout]] & E [true U ~ [[S_tout<=71 | sum(FMC_3, FMC_2, FMC_1)<=sum(MSG_3, MSG_2, MSG_1)]]]]]]
abstracting: (sum(FMC_3, FMC_2, FMC_1)<=sum(MSG_3, MSG_2, MSG_1))
states: 3,498 (3)
abstracting: (S_tout<=71)
states: 4,650 (3)
abstracting: (90<=R_tout)
states: 0
abstracting: (sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=69)
states: 4,650 (3)
abstracting: (T_out<=41)
states: 4,650 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(msgl_3, msgl_2, msgl_1))
states: 4,650 (3)
.abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(listen_3, listen_2, listen_1))
states: 2,328 (3)
abstracting: (sum(listen_3, listen_2, listen_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1))
states: 4,284 (3)
abstracting: (54<=S_tout)
states: 0
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=95)
states: 4,650 (3)
abstracting: (85<=sum(PMC_3, PMC_2, PMC_1))
states: 0
abstracting: (2<=sum(wait_msg_3, wait_msg_2, wait_msg_1))
states: 180
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=R_tout)
states: 2,436 (3)
abstracting: (2<=sum(wait_msg_3, wait_msg_2, wait_msg_1))
states: 180
abstracting: (2<=sum(wait_msg_3, wait_msg_2, wait_msg_1))
states: 180
......
EG iterations: 6
.abstracting: (19<=sum(listen_3, listen_2, listen_1))
states: 0
abstracting: (69<=sum(wait_msg_3, wait_msg_2, wait_msg_1))
states: 0
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=99)
states: 4,650 (3)
-> the formula is TRUE
FORMULA SafeBus-PT-03-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.572sec
checking: AG [E [[[[[E [79<=sum(wait_cable_3, wait_cable_2, wait_cable_1) U sum(MSG_3, MSG_2, MSG_1)<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] & AG [sum(listen_3, listen_2, listen_1)<=72]] | A [sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1) U R_tout<=100]] & [~ [R_tout<=S_tout] | [EF [95<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] & [sum(Cpt1_3, Cpt1_2, Cpt1_1)<=41 | 2<=sum(cable_used_3, cable_used_2, cable_used_1)]]]] | ~ [[[EG [76<=sum(loop_em_3, loop_em_2, loop_em_1)] | [sum(MSG_3, MSG_2, MSG_1)<=40 & sum(PMC_3, PMC_2, PMC_1)<=44]] & S_tout<=63]]] U [[EX [45<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)] & EG [~ [sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=30]]] & AX [sum(loop_em_3, loop_em_2, loop_em_1)<=37]]]]
normalized: ~ [E [true U ~ [E [[~ [[S_tout<=63 & [[sum(MSG_3, MSG_2, MSG_1)<=40 & sum(PMC_3, PMC_2, PMC_1)<=44] | EG [76<=sum(loop_em_3, loop_em_2, loop_em_1)]]]] | [[[[sum(Cpt1_3, Cpt1_2, Cpt1_1)<=41 | 2<=sum(cable_used_3, cable_used_2, cable_used_1)] & E [true U 95<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]] | ~ [R_tout<=S_tout]] & [[~ [EG [~ [R_tout<=100]]] & ~ [E [~ [R_tout<=100] U [~ [sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)] & ~ [R_tout<=100]]]]] | [~ [E [true U ~ [sum(listen_3, listen_2, listen_1)<=72]]] & E [79<=sum(wait_cable_3, wait_cable_2, wait_cable_1) U sum(MSG_3, MSG_2, MSG_1)<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]]]]] U [~ [EX [~ [sum(loop_em_3, loop_em_2, loop_em_1)<=37]]] & [EG [~ [sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=30]] & EX [45<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]]]]]]]
abstracting: (45<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1))
states: 0
.abstracting: (sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=30)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (sum(loop_em_3, loop_em_2, loop_em_1)<=37)
states: 4,650 (3)
.abstracting: (sum(MSG_3, MSG_2, MSG_1)<=sum(wait_cable_3, wait_cable_2, wait_cable_1))
states: 4,326 (3)
abstracting: (79<=sum(wait_cable_3, wait_cable_2, wait_cable_1))
states: 0
abstracting: (sum(listen_3, listen_2, listen_1)<=72)
states: 4,650 (3)
abstracting: (R_tout<=100)
states: 4,650 (3)
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1))
states: 0
abstracting: (R_tout<=100)
states: 4,650 (3)
abstracting: (R_tout<=100)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (R_tout<=S_tout)
states: 2,559 (3)
abstracting: (95<=sum(wait_cable_3, wait_cable_2, wait_cable_1))
states: 0
abstracting: (2<=sum(cable_used_3, cable_used_2, cable_used_1))
states: 0
abstracting: (sum(Cpt1_3, Cpt1_2, Cpt1_1)<=41)
states: 4,650 (3)
abstracting: (76<=sum(loop_em_3, loop_em_2, loop_em_1))
states: 0
.
EG iterations: 1
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=44)
states: 4,650 (3)
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=40)
states: 4,650 (3)
abstracting: (S_tout<=63)
states: 4,650 (3)
-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.472sec
checking: E [[[~ [98<=ACK] & sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(PMC_3, PMC_2, PMC_1)] & [[E [EX [FMCb<=S_tout] U [~ [87<=cable_free] | 6<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] & [EG [~ [sum(PMC_3, PMC_2, PMC_1)<=60]] & sum(RMC_3, RMC_2, RMC_1)<=45]] | [AF [~ [E [sum(Cpt2_3, Cpt2_2, Cpt2_1)<=6 U sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=68]]] | AX [~ [EG [S_tout<=100]]]]]] U [~ [EF [sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(FMC_3, FMC_2, FMC_1)]] & [~ [A [S_tout<=sum(wait_cable_3, wait_cable_2, wait_cable_1) U sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1)]] & [[A [A [sum(loop_em_3, loop_em_2, loop_em_1)<=ACK U 79<=FMCb] U [sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1) & T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] | ~ [EG [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]] & ~ [EG [~ [cable_free<=90]]]]]]]
normalized: E [[[[~ [EX [EG [S_tout<=100]]] | ~ [EG [E [sum(Cpt2_3, Cpt2_2, Cpt2_1)<=6 U sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=68]]]] | [[sum(RMC_3, RMC_2, RMC_1)<=45 & EG [~ [sum(PMC_3, PMC_2, PMC_1)<=60]]] & E [EX [FMCb<=S_tout] U [6<=sum(Cpt1_3, Cpt1_2, Cpt1_1) | ~ [87<=cable_free]]]]] & [sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(PMC_3, PMC_2, PMC_1) & ~ [98<=ACK]]] U [[[~ [EG [~ [cable_free<=90]]] & [~ [EG [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] | [~ [EG [~ [[sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1) & T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]]] & ~ [E [~ [[sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1) & T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]] U [~ [[~ [EG [~ [79<=FMCb]]] & ~ [E [~ [79<=FMCb] U [~ [sum(loop_em_3, loop_em_2, loop_em_1)<=ACK] & ~ [79<=FMCb]]]]]] & ~ [[sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1) & T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1)]]]]]]]] & ~ [[~ [EG [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1)]]] & ~ [E [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1)] U [~ [S_tout<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] & ~ [sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1)]]]]]]] & ~ [E [true U sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(FMC_3, FMC_2, FMC_1)]]]]
abstracting: (sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)<=sum(FMC_3, FMC_2, FMC_1))
states: 2,670 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1))
states: 1,158 (3)
abstracting: (S_tout<=sum(wait_cable_3, wait_cable_2, wait_cable_1))
states: 4,026 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1))
states: 1,158 (3)
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(PMC_3, PMC_2, PMC_1))
states: 1,158 (3)
.....................
EG iterations: 21
abstracting: (T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 4,650 (3)
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1))
states: 4,650 (3)
abstracting: (79<=FMCb)
states: 0
abstracting: (sum(loop_em_3, loop_em_2, loop_em_1)<=ACK)
states: 3,336 (3)
abstracting: (79<=FMCb)
states: 0
abstracting: (79<=FMCb)
states: 0
EG iterations: 0
abstracting: (T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 4,650 (3)
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1))
states: 4,650 (3)
abstracting: (T_out<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 4,650 (3)
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=sum(MSG_3, MSG_2, MSG_1))
states: 4,650 (3)
.
EG iterations: 1
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 4,650 (3)
EG iterations: 0
abstracting: (cable_free<=90)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (98<=ACK)
states: 0
abstracting: (sum(wait_msg_3, wait_msg_2, wait_msg_1)<=sum(PMC_3, PMC_2, PMC_1))
states: 3,192 (3)
abstracting: (87<=cable_free)
states: 0
abstracting: (6<=sum(Cpt1_3, Cpt1_2, Cpt1_1))
states: 0
abstracting: (FMCb<=S_tout)
states: 3,135 (3)
.abstracting: (sum(PMC_3, PMC_2, PMC_1)<=60)
states: 4,650 (3)
.
EG iterations: 1
abstracting: (sum(RMC_3, RMC_2, RMC_1)<=45)
states: 4,650 (3)
abstracting: (sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=68)
states: 4,650 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=6)
states: 4,650 (3)
EG iterations: 0
abstracting: (S_tout<=100)
states: 4,650 (3)
EG iterations: 0
.-> the formula is FALSE
FORMULA SafeBus-PT-03-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.977sec
totally nodes used: 1254184 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2055081 7208296 9263377
used/not used/entry size/cache size: 7855934 59252930 16 1024MB
basic ops cache: hits/miss/sum: 404522 1004726 1409248
used/not used/entry size/cache size: 1755817 15021399 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 7419 7419
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 7278 30413 37691
used/not used/entry size/cache size: 30362 8358246 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 65992556
1 998166
2 100735
3 15326
4 1851
5 215
6 14
7 1
8 0
9 0
>= 10 0
Total processing time: 0m11.044sec
BK_STOP 1679905276214
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
msgl_1
msgl_2
msgl_3
found 3 constant places
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:15222 (167), effective:631 (6)
initing FirstDep: 0m 0.000sec
iterations count:6450 (70), effective:216 (2)
iterations count:3987 (43), effective:136 (1)
iterations count:3987 (43), effective:136 (1)
iterations count:3987 (43), effective:136 (1)
iterations count:91 (1), effective:0 (0)
iterations count:259 (2), effective:9 (0)
iterations count:3326 (36), effective:85 (0)
iterations count:1748 (19), effective:57 (0)
iterations count:1748 (19), effective:57 (0)
iterations count:8229 (90), effective:259 (2)
iterations count:1748 (19), effective:57 (0)
iterations count:6379 (70), effective:213 (2)
iterations count:8121 (89), effective:282 (3)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:10194 (112), effective:303 (3)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:6305 (69), effective:175 (1)
iterations count:91 (1), effective:0 (0)
iterations count:6305 (69), effective:175 (1)
iterations count:91 (1), effective:0 (0)
iterations count:6305 (69), effective:175 (1)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:1548 (17), effective:45 (0)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (0)
iterations count:5984 (65), effective:151 (1)
iterations count:1404 (15), effective:35 (0)
iterations count:8337 (91), effective:232 (2)
iterations count:91 (1), effective:0 (0)
iterations count:91 (1), effective:0 (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="SafeBus-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 SafeBus-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 r353-smll-167891800800257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-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 '
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 ;