fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r417-tajo-167905972200353
Last Updated
May 14, 2023

About the Execution of Marcie for SieveSingleMsgMbox-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5446.424 5762.00 5089.00 0.00 TTFTFTTFTTFTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r417-tajo-167905972200353.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is SieveSingleMsgMbox-PT-d0m04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905972200353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m04-CTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679071038152

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=SieveSingleMsgMbox-PT-d0m04
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: SieveSingleMsgMbox_PT_d0m04
(NrP: 262 NrTr: 73 NrArc: 292)

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

net check time: 0m 0.000sec

init dd package: 0m 3.462sec


RS generation: 0m 0.028sec


-> reachability set: #nodes 1558 (1.6e+03) #states 702



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

checking: EG [l26<=4]
normalized: EG [l26<=4]

abstracting: (l26<=4)
states: 702

EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [l117<=4]
normalized: EG [l117<=4]

abstracting: (l117<=4)
states: 702

EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [l192<=l200]
normalized: EG [l192<=l200]

abstracting: (l192<=l200)
states: 702

EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EX [~ [[l151<=1 & [1<=l7 | ~ [EG [l95<=4]]]]]]]
normalized: ~ [EX [~ [[l151<=1 & [1<=l7 | ~ [EG [l95<=4]]]]]]]

abstracting: (l95<=4)
states: 702

EG iterations: 0
abstracting: (1<=l7)
states: 0
abstracting: (l151<=1)
states: 702
.-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AX [AF [~ [[EF [~ [l160<=l121]] | AF [~ [3<=l207]]]]]]
normalized: ~ [EX [EG [[~ [EG [3<=l207]] | E [true U ~ [l160<=l121]]]]]]

abstracting: (l160<=l121)
states: 702
abstracting: (3<=l207)
states: 0
.
EG iterations: 1

EG iterations: 0
.-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [A [1<=l225 U EG [[EF [AX [l52<=0]] | EG [[p11<=l223 & l228<=2]]]]]]
normalized: ~ [[~ [EG [~ [EG [[EG [[p11<=l223 & l228<=2]] | E [true U ~ [EX [~ [l52<=0]]]]]]]]] & ~ [E [~ [EG [[EG [[p11<=l223 & l228<=2]] | E [true U ~ [EX [~ [l52<=0]]]]]]] U [~ [1<=l225] & ~ [EG [[EG [[p11<=l223 & l228<=2]] | E [true U ~ [EX [~ [l52<=0]]]]]]]]]]]]

abstracting: (l52<=0)
states: 702
.abstracting: (l228<=2)
states: 702
abstracting: (p11<=l223)
states: 678
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=l225)
states: 0
abstracting: (l52<=0)
states: 702
.abstracting: (l228<=2)
states: 702
abstracting: (p11<=l223)
states: 678
.
EG iterations: 1

EG iterations: 0
abstracting: (l52<=0)
states: 702
.abstracting: (l228<=2)
states: 702
abstracting: (p11<=l223)
states: 678
.
EG iterations: 1

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AX [A [~ [[l185<=l55 | EX [AX [3<=l91]]]] U ~ [AF [~ [[1<=l0 | l221<=4]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [EG [[1<=l0 | l221<=4]]]]] & ~ [E [~ [EG [[1<=l0 | l221<=4]]] U [[l185<=l55 | EX [~ [EX [~ [3<=l91]]]]] & ~ [EG [[1<=l0 | l221<=4]]]]]]]]]]

abstracting: (l221<=4)
states: 702
abstracting: (1<=l0)
states: 522

EG iterations: 0
abstracting: (3<=l91)
states: 0
..abstracting: (l185<=l55)
states: 702
abstracting: (l221<=4)
states: 702
abstracting: (1<=l0)
states: 522

EG iterations: 0
abstracting: (l221<=4)
states: 702
abstracting: (1<=l0)
states: 522

EG iterations: 0
.
EG iterations: 1
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EG [AX [[~ [AF [[l10<=l8 | l71<=l150]]] | A [AF [l189<=l106] U [l144<=3 & EG [1<=l76]]]]]]
normalized: EG [~ [EX [~ [[[~ [EG [~ [[l144<=3 & EG [1<=l76]]]]] & ~ [E [~ [[l144<=3 & EG [1<=l76]]] U [EG [~ [l189<=l106]] & ~ [[l144<=3 & EG [1<=l76]]]]]]] | EG [~ [[l10<=l8 | l71<=l150]]]]]]]]

abstracting: (l71<=l150)
states: 702
abstracting: (l10<=l8)
states: 702
.
EG iterations: 1
abstracting: (1<=l76)
states: 0
.
EG iterations: 1
abstracting: (l144<=3)
states: 702
abstracting: (l189<=l106)
states: 702
.
EG iterations: 1
abstracting: (1<=l76)
states: 0
.
EG iterations: 1
abstracting: (l144<=3)
states: 702
abstracting: (1<=l76)
states: 0
.
EG iterations: 1
abstracting: (l144<=3)
states: 702

EG iterations: 0
..
EG iterations: 1
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [~ [AF [~ [[[[l178<=1 | 1<=l128] & 3<=l23] | [[l87<=4 & l225<=1] & A [l54<=0 U l181<=l2]]]]]]]
normalized: EG [EG [[[[~ [EG [~ [l181<=l2]]] & ~ [E [~ [l181<=l2] U [~ [l54<=0] & ~ [l181<=l2]]]]] & [l87<=4 & l225<=1]] | [3<=l23 & [l178<=1 | 1<=l128]]]]]

abstracting: (1<=l128)
states: 0
abstracting: (l178<=1)
states: 702
abstracting: (3<=l23)
states: 0
abstracting: (l225<=1)
states: 702
abstracting: (l87<=4)
states: 702
abstracting: (l181<=l2)
states: 702
abstracting: (l54<=0)
states: 702
abstracting: (l181<=l2)
states: 702
abstracting: (l181<=l2)
states: 702
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AF [[EF [l88<=l85] & ~ [A [~ [E [l92<=0 U 4<=l35]] U [[AF [l110<=1] | [l23<=l99 | l159<=0]] & ~ [AX [3<=l231]]]]]]]
normalized: ~ [EG [~ [[~ [[~ [EG [~ [[EX [~ [3<=l231]] & [[l23<=l99 | l159<=0] | ~ [EG [~ [l110<=1]]]]]]]] & ~ [E [~ [[EX [~ [3<=l231]] & [[l23<=l99 | l159<=0] | ~ [EG [~ [l110<=1]]]]]] U [E [l92<=0 U 4<=l35] & ~ [[EX [~ [3<=l231]] & [[l23<=l99 | l159<=0] | ~ [EG [~ [l110<=1]]]]]]]]]]] & E [true U l88<=l85]]]]]

abstracting: (l88<=l85)
states: 702
abstracting: (l110<=1)
states: 702
.
EG iterations: 1
abstracting: (l159<=0)
states: 702
abstracting: (l23<=l99)
states: 702
abstracting: (3<=l231)
states: 0
.abstracting: (4<=l35)
states: 0
abstracting: (l92<=0)
states: 702
abstracting: (l110<=1)
states: 702
.
EG iterations: 1
abstracting: (l159<=0)
states: 702
abstracting: (l23<=l99)
states: 702
abstracting: (3<=l231)
states: 0
.abstracting: (l110<=1)
states: 702
.
EG iterations: 1
abstracting: (l159<=0)
states: 702
abstracting: (l23<=l99)
states: 702
abstracting: (3<=l231)
states: 0
..
EG iterations: 1
.......................................
EG iterations: 39
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: A [~ [1<=l218] U A [[[3<=l22 & ~ [[~ [l90<=l52] | [2<=l65 | l172<=l218]]]] | [[1<=l145 & l223<=2] | EF [1<=l228]]] U 3<=l187]]
normalized: [~ [EG [~ [[~ [EG [~ [3<=l187]]] & ~ [E [~ [3<=l187] U [~ [[[E [true U 1<=l228] | [1<=l145 & l223<=2]] | [3<=l22 & ~ [[[2<=l65 | l172<=l218] | ~ [l90<=l52]]]]]] & ~ [3<=l187]]]]]]]] & ~ [E [~ [[~ [EG [~ [3<=l187]]] & ~ [E [~ [3<=l187] U [~ [[[E [true U 1<=l228] | [1<=l145 & l223<=2]] | [3<=l22 & ~ [[[2<=l65 | l172<=l218] | ~ [l90<=l52]]]]]] & ~ [3<=l187]]]]]] U [1<=l218 & ~ [[~ [EG [~ [3<=l187]]] & ~ [E [~ [3<=l187] U [~ [[[E [true U 1<=l228] | [1<=l145 & l223<=2]] | [3<=l22 & ~ [[[2<=l65 | l172<=l218] | ~ [l90<=l52]]]]]] & ~ [3<=l187]]]]]]]]]]

abstracting: (3<=l187)
states: 0
abstracting: (l90<=l52)
states: 632
abstracting: (l172<=l218)
states: 702
abstracting: (2<=l65)
states: 0
abstracting: (3<=l22)
states: 0
abstracting: (l223<=2)
states: 702
abstracting: (1<=l145)
states: 0
abstracting: (1<=l228)
states: 0
abstracting: (3<=l187)
states: 0
abstracting: (3<=l187)
states: 0

EG iterations: 0
abstracting: (1<=l218)
states: 0
abstracting: (3<=l187)
states: 0
abstracting: (l90<=l52)
states: 632
abstracting: (l172<=l218)
states: 702
abstracting: (2<=l65)
states: 0
abstracting: (3<=l22)
states: 0
abstracting: (l223<=2)
states: 702
abstracting: (1<=l145)
states: 0
abstracting: (1<=l228)
states: 0
abstracting: (3<=l187)
states: 0
abstracting: (3<=l187)
states: 0

EG iterations: 0
abstracting: (3<=l187)
states: 0
abstracting: (l90<=l52)
states: 632
abstracting: (l172<=l218)
states: 702
abstracting: (2<=l65)
states: 0
abstracting: (3<=l22)
states: 0
abstracting: (l223<=2)
states: 702
abstracting: (1<=l145)
states: 0
abstracting: (1<=l228)
states: 0
abstracting: (3<=l187)
states: 0
abstracting: (3<=l187)
states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [[~ [l235<=l113] | [[~ [EG [l142<=0]] | 3<=p10] | ~ [[~ [l199<=2] & 4<=l165]]]] U [[EF [AG [EF [l38<=l137]]] & [4<=l19 & AX [l201<=l124]]] | 1<=l45]]
normalized: E [[[~ [[4<=l165 & ~ [l199<=2]]] | [3<=p10 | ~ [EG [l142<=0]]]] | ~ [l235<=l113]] U [1<=l45 | [[4<=l19 & ~ [EX [~ [l201<=l124]]]] & E [true U ~ [E [true U ~ [E [true U l38<=l137]]]]]]]]

abstracting: (l38<=l137)
states: 702
abstracting: (l201<=l124)
states: 702
.abstracting: (4<=l19)
states: 0
abstracting: (1<=l45)
states: 0
abstracting: (l235<=l113)
states: 638
abstracting: (l142<=0)
states: 702

EG iterations: 0
abstracting: (3<=p10)
states: 0
abstracting: (l199<=2)
states: 702
abstracting: (4<=l165)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [EG [A [~ [[EF [4<=l48] & ~ [1<=l223]]] U [[3<=l64 | A [l3<=l113 U l51<=l69]] & [E [l23<=l174 U l74<=0] | [l26<=l158 & l167<=l121]]]]]]
normalized: ~ [EX [~ [EG [[~ [EG [~ [[[[l26<=l158 & l167<=l121] | E [l23<=l174 U l74<=0]] & [3<=l64 | [~ [EG [~ [l51<=l69]]] & ~ [E [~ [l51<=l69] U [~ [l3<=l113] & ~ [l51<=l69]]]]]]]]]] & ~ [E [~ [[[[l26<=l158 & l167<=l121] | E [l23<=l174 U l74<=0]] & [3<=l64 | [~ [EG [~ [l51<=l69]]] & ~ [E [~ [l51<=l69] U [~ [l3<=l113] & ~ [l51<=l69]]]]]]]] U [[~ [1<=l223] & E [true U 4<=l48]] & ~ [[[[l26<=l158 & l167<=l121] | E [l23<=l174 U l74<=0]] & [3<=l64 | [~ [EG [~ [l51<=l69]]] & ~ [E [~ [l51<=l69] U [~ [l3<=l113] & ~ [l51<=l69]]]]]]]]]]]]]]]]

abstracting: (l51<=l69)
states: 702
abstracting: (l3<=l113)
states: 700
abstracting: (l51<=l69)
states: 702
abstracting: (l51<=l69)
states: 702
.
EG iterations: 1
abstracting: (3<=l64)
states: 0
abstracting: (l74<=0)
states: 702
abstracting: (l23<=l174)
states: 702
abstracting: (l167<=l121)
states: 702
abstracting: (l26<=l158)
states: 702
abstracting: (4<=l48)
states: 0
abstracting: (1<=l223)
states: 0
abstracting: (l51<=l69)
states: 702
abstracting: (l3<=l113)
states: 700
abstracting: (l51<=l69)
states: 702
abstracting: (l51<=l69)
states: 702
.
EG iterations: 1
abstracting: (3<=l64)
states: 0
abstracting: (l74<=0)
states: 702
abstracting: (l23<=l174)
states: 702
abstracting: (l167<=l121)
states: 702
abstracting: (l26<=l158)
states: 702
abstracting: (l51<=l69)
states: 702
abstracting: (l3<=l113)
states: 700
abstracting: (l51<=l69)
states: 702
abstracting: (l51<=l69)
states: 702
.
EG iterations: 1
abstracting: (3<=l64)
states: 0
abstracting: (l74<=0)
states: 702
abstracting: (l23<=l174)
states: 702
abstracting: (l167<=l121)
states: 702
abstracting: (l26<=l158)
states: 702
.
EG iterations: 1

EG iterations: 0
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: ~ [A [A [[l76<=l181 | [AX [l152<=l199] & 4<=l30]] U EG [AG [l72<=1]]] U [[~ [[A [2<=l22 U l100<=3] & [EX [l188<=2] & [l116<=0 & l124<=l111]]]] & EG [[EG [4<=l108] | [3<=l169 & l64<=0]]]] & ~ [EX [[3<=l193 | l142<=4]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EX [[3<=l193 | l142<=4]]] & [EG [[[3<=l169 & l64<=0] | EG [4<=l108]]] & ~ [[[[l116<=0 & l124<=l111] & EX [l188<=2]] & [~ [EG [~ [l100<=3]]] & ~ [E [~ [l100<=3] U [~ [2<=l22] & ~ [l100<=3]]]]]]]]]]]] & ~ [E [~ [[~ [EX [[3<=l193 | l142<=4]]] & [EG [[[3<=l169 & l64<=0] | EG [4<=l108]]] & ~ [[[[l116<=0 & l124<=l111] & EX [l188<=2]] & [~ [EG [~ [l100<=3]]] & ~ [E [~ [l100<=3] U [~ [2<=l22] & ~ [l100<=3]]]]]]]]]] U [~ [[~ [EG [~ [EG [~ [E [true U ~ [l72<=1]]]]]]] & ~ [E [~ [EG [~ [E [true U ~ [l72<=1]]]]] U [~ [[l76<=l181 | [4<=l30 & ~ [EX [~ [l152<=l199]]]]]] & ~ [EG [~ [E [true U ~ [l72<=1]]]]]]]]]] & ~ [[~ [EX [[3<=l193 | l142<=4]]] & [EG [[[3<=l169 & l64<=0] | EG [4<=l108]]] & ~ [[[[l116<=0 & l124<=l111] & EX [l188<=2]] & [~ [EG [~ [l100<=3]]] & ~ [E [~ [l100<=3] U [~ [2<=l22] & ~ [l100<=3]]]]]]]]]]]]]]]

abstracting: (l100<=3)
states: 702
abstracting: (2<=l22)
states: 0
abstracting: (l100<=3)
states: 702
abstracting: (l100<=3)
states: 702
.
EG iterations: 1
abstracting: (l188<=2)
states: 702
.abstracting: (l124<=l111)
states: 702
abstracting: (l116<=0)
states: 702
abstracting: (4<=l108)
states: 0
.
EG iterations: 1
abstracting: (l64<=0)
states: 632
abstracting: (3<=l169)
states: 0
.
EG iterations: 1
abstracting: (l142<=4)
states: 702
abstracting: (3<=l193)
states: 0
.abstracting: (l72<=1)
states: 702

EG iterations: 0
abstracting: (l152<=l199)
states: 702
.abstracting: (4<=l30)
states: 0
abstracting: (l76<=l181)
states: 702
abstracting: (l72<=1)
states: 702

EG iterations: 0
abstracting: (l72<=1)
states: 702

EG iterations: 0
.
EG iterations: 1
abstracting: (l100<=3)
states: 702
abstracting: (2<=l22)
states: 0
abstracting: (l100<=3)
states: 702
abstracting: (l100<=3)
states: 702
.
EG iterations: 1
abstracting: (l188<=2)
states: 702
.abstracting: (l124<=l111)
states: 702
abstracting: (l116<=0)
states: 702
abstracting: (4<=l108)
states: 0
.
EG iterations: 1
abstracting: (l64<=0)
states: 632
abstracting: (3<=l169)
states: 0
.
EG iterations: 1
abstracting: (l142<=4)
states: 702
abstracting: (3<=l193)
states: 0
.abstracting: (l100<=3)
states: 702
abstracting: (2<=l22)
states: 0
abstracting: (l100<=3)
states: 702
abstracting: (l100<=3)
states: 702
.
EG iterations: 1
abstracting: (l188<=2)
states: 702
.abstracting: (l124<=l111)
states: 702
abstracting: (l116<=0)
states: 702
abstracting: (4<=l108)
states: 0
.
EG iterations: 1
abstracting: (l64<=0)
states: 632
abstracting: (3<=l169)
states: 0
.
EG iterations: 1
abstracting: (l142<=4)
states: 702
abstracting: (3<=l193)
states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AX [[~ [E [[p20<=l151 | [[l102<=0 | 3<=l23] | l231<=l72]] U 4<=l141]] & [EG [AF [E [l76<=3 U s6<=2]]] | ~ [[[[EX [2<=l237] & [l160<=4 | l231<=4]] & 2<=l234] | ~ [[[l140<=l108 & 1<=p17] & ~ [l237<=2]]]]]]]]
normalized: ~ [EX [~ [[[~ [[~ [[~ [l237<=2] & [l140<=l108 & 1<=p17]]] | [2<=l234 & [[l160<=4 | l231<=4] & EX [2<=l237]]]]] | EG [~ [EG [~ [E [l76<=3 U s6<=2]]]]]] & ~ [E [[p20<=l151 | [l231<=l72 | [l102<=0 | 3<=l23]]] U 4<=l141]]]]]]

abstracting: (4<=l141)
states: 0
abstracting: (3<=l23)
states: 0
abstracting: (l102<=0)
states: 702
abstracting: (l231<=l72)
states: 702
abstracting: (p20<=l151)
states: 702
abstracting: (s6<=2)
states: 702
abstracting: (l76<=3)
states: 702
.
EG iterations: 1

EG iterations: 0
abstracting: (2<=l237)
states: 0
.abstracting: (l231<=4)
states: 702
abstracting: (l160<=4)
states: 702
abstracting: (2<=l234)
states: 0
abstracting: (1<=p17)
states: 0
abstracting: (l140<=l108)
states: 702
abstracting: (l237<=2)
states: 702
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EG [[[1<=l156 | [[[~ [E [4<=p18 U l228<=2]] & 1<=l128] & [EF [l215<=l193] & [~ [l103<=0] | [l40<=l203 | l169<=1]]]] | [[EG [l192<=l205] | A [4<=l8 U l57<=l157]] | 3<=l161]]] & [[[~ [AX [l103<=l125]] | [E [l166<=l64 U l127<=l20] | s6<=1]] | ~ [EX [AF [l69<=l88]]]] | AX [4<=s3]]]]
normalized: EG [[[~ [EX [~ [4<=s3]]] | [~ [EX [~ [EG [~ [l69<=l88]]]]] | [[s6<=1 | E [l166<=l64 U l127<=l20]] | EX [~ [l103<=l125]]]]] & [1<=l156 | [[3<=l161 | [[~ [EG [~ [l57<=l157]]] & ~ [E [~ [l57<=l157] U [~ [4<=l8] & ~ [l57<=l157]]]]] | EG [l192<=l205]]] | [[[[l40<=l203 | l169<=1] | ~ [l103<=0]] & E [true U l215<=l193]] & [1<=l128 & ~ [E [4<=p18 U l228<=2]]]]]]]]

abstracting: (l228<=2)
states: 702
abstracting: (4<=p18)
states: 0
abstracting: (1<=l128)
states: 0
abstracting: (l215<=l193)
states: 702
abstracting: (l103<=0)
states: 702
abstracting: (l169<=1)
states: 702
abstracting: (l40<=l203)
states: 702
abstracting: (l192<=l205)
states: 702

EG iterations: 0
abstracting: (l57<=l157)
states: 702
abstracting: (4<=l8)
states: 0
abstracting: (l57<=l157)
states: 702
abstracting: (l57<=l157)
states: 702
.
EG iterations: 1
abstracting: (3<=l161)
states: 0
abstracting: (1<=l156)
states: 0
abstracting: (l103<=l125)
states: 702
.abstracting: (l127<=l20)
states: 532
abstracting: (l166<=l64)
states: 702
abstracting: (s6<=1)
states: 702
abstracting: (l69<=l88)
states: 702
.
EG iterations: 1
.abstracting: (4<=s3)
states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

totally nodes used: 82141 (8.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 61729 356519 418248
used/not used/entry size/cache size: 400549 66708315 16 1024MB
basic ops cache: hits/miss/sum: 28136 191554 219690
used/not used/entry size/cache size: 276525 16500691 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: 886 3065 3951
used/not used/entry size/cache size: 3065 8385543 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 67028707
1 78225
2 1880
3 52
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.691sec


BK_STOP 1679071043914

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
l153
l154
l155
l218
l219
l220
l222
l223
l224
l225
l226
l227
l228
l229
l230
l231
l232
l233
l178
l179
l180
l181
l182
l183
l184
l185
l186
l187
l188
l189
l190
l191
l192
l193
l106
l133
l134
l135
l136
l10
l194
l195
l196
l197
l198
l199
l200
l201
l203
l212
l213
l214
l215
l216
l217
l237
l159
l160
l161
l162
l163
l164
l137
l138
l139
l140
l141
l165
l166
l167
l168
l169
l170
l171
l172
l173
l174
l175
l176
l177
l142
l143
l144
l147
l148
l149
l107
l9
l145
l146
l6
l8
l7
l130
l131
l132
l4
l125
l2
l121
l122
l123
l124
l117
l118
l119
l120
l111
l115
l116
l108
l109
l32
l150
l151
l152
l12
l13
l14
l15
l16
l17
l18
l19
l22
l23
l26
l27
l28
l31
l156
l157
l158
l34
l35
l46
l56
l76
l87
l98
l102
l103
l36
l37
l38
l39
l40
l43
l44
l45
l47
l48
l49
l11
l50
l51
l52
l53
l54
l57
l58
l59
l60
l61
l69
l71
l72
l73
l104
l105
l74
l75
l77
l80
l81
l82
l83
l84
l85
l88
l91
l92
l93
l94
l95
l96
l97
l99
l100
l101

The net has transition(s) that can never fire:


check for constant places
l2
l4
l6
l7
l8
l9
l10
l11
l12
l13
l14
l15
l16
l17
l18
l19
l22
l23
l26
l27
l28
l31
l32
l34
l35
l36
l37
l38
l39
l40
l43
l44
l45
l46
l47
l48
l49
l50
l51
l52
l53
l54
l56
l57
l58
l59
l60
l61
l69
l71
l72
l73
l74
l75
l76
l77
l80
l81
l82
l83
l84
l85
l87
l88
l91
l92
l93
l94
l95
l96
l97
l98
l99
l100
l101
l102
l103
l104
l105
l106
l107
l108
l109
l111
l115
l116
l117
l118
l119
l120
l121
l122
l123
l124
l125
l130
l131
l132
l133
l134
l135
l136
l137
l138
l139
l140
l141
l142
l143
l144
l145
l146
l147
l148
l149
l150
l151
l152
l153
l154
l155
l156
l157
l158
l159
l160
l161
l162
l163
l164
l165
l166
l167
l168
l169
l170
l171
l172
l173
l174
l175
l176
l177
l178
l179
l180
l181
l182
l183
l184
l185
l186
l187
l188
l189
l190
l191
l192
l193
l194
l195
l196
l197
l198
l199
l200
l201
l203
l212
l213
l214
l215
l216
l217
l218
l219
l220
l222
l223
l224
l225
l226
l227
l228
l229
l230
l231
l232
l233
l237
found 190 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:2719 (37), effective:143 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:299 (4), effective:9 (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="SieveSingleMsgMbox-PT-d0m04"
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 SieveSingleMsgMbox-PT-d0m04, 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 r417-tajo-167905972200353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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