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.r321-tall-167889192300542.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 RefineWMG-PT-002003, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192300542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.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 RefineWMG-PT-002003-ReachabilityCardinality-00
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-01
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-02
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-03
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-04
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-05
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-06
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-07
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-08
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-09
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-10
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-11
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-12
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-13
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-14
FORMULA_NAME RefineWMG-PT-002003-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678938839746

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=RefineWMG-PT-002003
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: RefineWMG_PT_002003
(NrP: 14 NrTr: 11 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.834sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 122 (1.2e+02) #states 184,320 (5)



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

checking: EF [~ [p6<=5]]
normalized: E [true U ~ [p6<=5]]

abstracting: (p6<=5)
states: 178,176 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [psecond<=4]
normalized: ~ [E [true U ~ [psecond<=4]]]

abstracting: (psecond<=4)
states: 153,600 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[p7<=0 & 6<=p3]]
normalized: E [true U [p7<=0 & 6<=p3]]

abstracting: (6<=p3)
states: 0
abstracting: (p7<=0)
states: 46,080 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[4<=p4 | [p6<=6 & p2<=p2]]]
normalized: ~ [E [true U ~ [[[p6<=6 & p2<=p2] | 4<=p4]]]]

abstracting: (4<=p4)
states: 0
abstracting: (p2<=p2)
states: 184,320 (5)
abstracting: (p6<=6)
states: 182,784 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[p<=p4 & 6<=p9] | pterce<=p6] | p6<=4]]
normalized: ~ [E [true U ~ [[[[p<=p4 & 6<=p9] | pterce<=p6] | p6<=4]]]]

abstracting: (p6<=4)
states: 168,960 (5)
abstracting: (pterce<=p6)
states: 83,200 (4)
abstracting: (6<=p9)
states: 0
abstracting: (p<=p4)
states: 109,440 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[~ [[[psecond<=7 & p1<=4] | [5<=p6 & [p3<=psecond | [5<=p8 | 3<=p]]]]] & pterce<=p4]]]
normalized: ~ [E [true U [~ [[[psecond<=7 & p1<=4] | [[[5<=p8 | 3<=p] | p3<=psecond] & 5<=p6]]] & pterce<=p4]]]

abstracting: (pterce<=p4)
states: 76,800 (4)
abstracting: (5<=p6)
states: 15,360 (4)
abstracting: (p3<=psecond)
states: 138,240 (5)
abstracting: (3<=p)
states: 53,760 (4)
abstracting: (5<=p8)
states: 0
abstracting: (p1<=4)
states: 168,960 (5)
abstracting: (psecond<=7)
states: 184,320 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[p7<=5 | ~ [[[[6<=p10 | ~ [p10<=p1]] & 1<=p8] | [~ [[p6<=p4 | [p10<=p4 | p9<=3]]] | psecond<=p10]]]]]]
normalized: E [true U ~ [[~ [[[~ [[[p10<=p4 | p9<=3] | p6<=p4]] | psecond<=p10] | [[~ [p10<=p1] | 6<=p10] & 1<=p8]]] | p7<=5]]]

abstracting: (p7<=5)
states: 184,320 (5)
abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (6<=p10)
states: 0
abstracting: (p10<=p1)
states: 113,280 (5)
abstracting: (psecond<=p10)
states: 76,800 (4)
abstracting: (p6<=p4)
states: 109,440 (5)
abstracting: (p9<=3)
states: 184,320 (5)
abstracting: (p10<=p4)
states: 115,200 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [[pprime<=p1 & 6<=p3]] & ~ [[[~ [[[~ [3<=p7] | [p10<=4 & 6<=p2]] | [[p1<=7 & p6<=6] & [4<=p3 | pterce<=p9]]]] | [[[pterce<=0 & 6<=p10] | [~ [3<=p10] | [2<=p8 & p1<=0]]] & ~ [p10<=3]]] & 5<=p1]]] & ~ [p7<=6]]]
normalized: E [true U [~ [p7<=6] & [~ [[[[~ [p10<=3] & [[[2<=p8 & p1<=0] | ~ [3<=p10]] | [pterce<=0 & 6<=p10]]] | ~ [[[[4<=p3 | pterce<=p9] & [p1<=7 & p6<=6]] | [[p10<=4 & 6<=p2] | ~ [3<=p7]]]]] & 5<=p1]] & ~ [[pprime<=p1 & 6<=p3]]]]]

abstracting: (6<=p3)
states: 0
abstracting: (pprime<=p1)
states: 107,520 (5)
abstracting: (5<=p1)
states: 15,360 (4)
abstracting: (3<=p7)
states: 46,080 (4)
abstracting: (6<=p2)
states: 0
abstracting: (p10<=4)
states: 184,320 (5)
abstracting: (p6<=6)
states: 182,784 (5)
abstracting: (p1<=7)
states: 184,320 (5)
abstracting: (pterce<=p9)
states: 76,800 (4)
abstracting: (4<=p3)
states: 0
abstracting: (6<=p10)
states: 0
abstracting: (pterce<=0)
states: 30,720 (4)
abstracting: (3<=p10)
states: 46,080 (4)
abstracting: (p1<=0)
states: 55,296 (4)
abstracting: (2<=p8)
states: 92,160 (4)
abstracting: (p10<=3)
states: 184,320 (5)
abstracting: (p7<=6)
states: 184,320 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[p9<=p9 & [[~ [[[2<=p & [p8<=5 & p7<=3]] | p3<=6]] | [[~ [[p6<=p3 | 2<=p4]] & [[pprime<=p9 & 3<=p4] & [4<=pterce | p9<=5]]] | [p3<=4 | [~ [6<=p4] | [3<=p5 | p6<=3]]]]] & ~ [7<=p8]]]]]
normalized: E [true U ~ [[[~ [7<=p8] & [[[[[3<=p5 | p6<=3] | ~ [6<=p4]] | p3<=4] | [[[4<=pterce | p9<=5] & [pprime<=p9 & 3<=p4]] & ~ [[p6<=p3 | 2<=p4]]]] | ~ [[[[p8<=5 & p7<=3] & 2<=p] | p3<=6]]]] & p9<=p9]]]

abstracting: (p9<=p9)
states: 184,320 (5)
abstracting: (p3<=6)
states: 184,320 (5)
abstracting: (2<=p)
states: 86,016 (4)
abstracting: (p7<=3)
states: 184,320 (5)
abstracting: (p8<=5)
states: 184,320 (5)
abstracting: (2<=p4)
states: 92,160 (4)
abstracting: (p6<=p3)
states: 109,440 (5)
abstracting: (3<=p4)
states: 46,080 (4)
abstracting: (pprime<=p9)
states: 109,440 (5)
abstracting: (p9<=5)
states: 184,320 (5)
abstracting: (4<=pterce)
states: 61,440 (4)
abstracting: (p3<=4)
states: 184,320 (5)
abstracting: (6<=p4)
states: 0
abstracting: (p6<=3)
states: 153,600 (5)
abstracting: (3<=p5)
states: 46,080 (4)
abstracting: (7<=p8)
states: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[p6<=3 & [~ [[[[[p<=p10 & ~ [[pterce<=4 | pprime<=p3]]] & ~ [7<=pprime]] & [[~ [[7<=p10 | 1<=pterce]] | 4<=pterce] | ~ [[pprime<=p2 & ~ [psecond<=psecond]]]]] | [[[[~ [pterce<=4] | [p2<=p4 | pterce<=6]] | ~ [[p10<=7 & p2<=pprime]]] & ~ [1<=p8]] | p1<=1]]] & ~ [p9<=7]]]]
normalized: E [true U [[~ [p9<=7] & ~ [[[[~ [1<=p8] & [~ [[p10<=7 & p2<=pprime]] | [[p2<=p4 | pterce<=6] | ~ [pterce<=4]]]] | p1<=1] | [[~ [[~ [psecond<=psecond] & pprime<=p2]] | [~ [[7<=p10 | 1<=pterce]] | 4<=pterce]] & [~ [7<=pprime] & [p<=p10 & ~ [[pterce<=4 | pprime<=p3]]]]]]]] & p6<=3]]

abstracting: (p6<=3)
states: 153,600 (5)
abstracting: (pprime<=p3)
states: 109,440 (5)
abstracting: (pterce<=4)
states: 153,600 (5)
abstracting: (p<=p10)
states: 109,440 (5)
abstracting: (7<=pprime)
states: 1,536 (3)
abstracting: (4<=pterce)
states: 61,440 (4)
abstracting: (1<=pterce)
states: 153,600 (5)
abstracting: (7<=p10)
states: 0
abstracting: (pprime<=p2)
states: 109,440 (5)
abstracting: (psecond<=psecond)
states: 184,320 (5)
abstracting: (p1<=1)
states: 98,304 (4)
abstracting: (pterce<=4)
states: 153,600 (5)
abstracting: (pterce<=6)
states: 184,320 (5)
abstracting: (p2<=p4)
states: 115,200 (5)
abstracting: (p2<=pprime)
states: 113,280 (5)
abstracting: (p10<=7)
states: 184,320 (5)
abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (p9<=7)
states: 184,320 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[[[~ [[~ [p3<=p8] & [[p<=6 & 6<=p8] | 5<=p5]]] | p10<=7] & ~ [[[[[pprime<=p10 & 3<=p2] | p3<=p1] & ~ [6<=p]] | p7<=4]]] & ~ [[[[~ [7<=p6] & [~ [p10<=0] | pterce<=psecond]] | ~ [p3<=4]] & [~ [pprime<=p2] & [[[3<=p1 & p<=4] | p1<=p10] & ~ [[p9<=p3 | pprime<=p4]]]]]]] | 7<=pterce] & ~ [5<=p3]]]
normalized: E [true U [~ [5<=p3] & [[~ [[[[~ [[p9<=p3 | pprime<=p4]] & [[3<=p1 & p<=4] | p1<=p10]] & ~ [pprime<=p2]] & [~ [p3<=4] | [[~ [p10<=0] | pterce<=psecond] & ~ [7<=p6]]]]] & [~ [[[~ [6<=p] & [[pprime<=p10 & 3<=p2] | p3<=p1]] | p7<=4]] & [~ [[[[p<=6 & 6<=p8] | 5<=p5] & ~ [p3<=p8]]] | p10<=7]]] | 7<=pterce]]]

abstracting: (7<=pterce)
states: 0
abstracting: (p10<=7)
states: 184,320 (5)
abstracting: (p3<=p8)
states: 115,200 (5)
abstracting: (5<=p5)
states: 0
abstracting: (6<=p8)
states: 0
abstracting: (p<=6)
states: 182,784 (5)
abstracting: (p7<=4)
states: 184,320 (5)
abstracting: (p3<=p1)
states: 113,280 (5)
abstracting: (3<=p2)
states: 46,080 (4)
abstracting: (pprime<=p10)
states: 109,440 (5)
abstracting: (6<=p)
states: 6,144 (3)
abstracting: (7<=p6)
states: 1,536 (3)
abstracting: (pterce<=psecond)
states: 92,160 (4)
abstracting: (p10<=0)
states: 46,080 (4)
abstracting: (p3<=4)
states: 184,320 (5)
abstracting: (pprime<=p2)
states: 109,440 (5)
abstracting: (p1<=p10)
states: 109,440 (5)
abstracting: (p<=4)
states: 168,960 (5)
abstracting: (3<=p1)
states: 53,760 (4)
abstracting: (pprime<=p4)
states: 109,440 (5)
abstracting: (p9<=p3)
states: 115,200 (5)
abstracting: (5<=p3)
states: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[~ [[p10<=7 | [[[p6<=psecond | 4<=p6] & [psecond<=p10 & p9<=3]] | ~ [[pprime<=p1 | psecond<=p5]]]]] | [[pterce<=5 | [~ [pprime<=p10] | ~ [[1<=p9 | [p2<=7 | pterce<=p1]]]]] | [[[[~ [p8<=5] & [6<=p2 & 7<=p2]] & 2<=p10] | [~ [p6<=0] & [~ [pterce<=3] | ~ [6<=pprime]]]] | [~ [2<=p9] & [~ [p10<=p3] | [2<=p | ~ [psecond<=1]]]]]]] & pterce<=7]]]
normalized: E [true U ~ [[[[[[[[~ [psecond<=1] | 2<=p] | ~ [p10<=p3]] & ~ [2<=p9]] | [[[~ [6<=pprime] | ~ [pterce<=3]] & ~ [p6<=0]] | [[[6<=p2 & 7<=p2] & ~ [p8<=5]] & 2<=p10]]] | [[~ [[[p2<=7 | pterce<=p1] | 1<=p9]] | ~ [pprime<=p10]] | pterce<=5]] | ~ [[[~ [[pprime<=p1 | psecond<=p5]] | [[psecond<=p10 & p9<=3] & [p6<=psecond | 4<=p6]]] | p10<=7]]] & pterce<=7]]]

abstracting: (pterce<=7)
states: 184,320 (5)
abstracting: (p10<=7)
states: 184,320 (5)
abstracting: (4<=p6)
states: 30,720 (4)
abstracting: (p6<=psecond)
states: 130,816 (5)
abstracting: (p9<=3)
states: 184,320 (5)
abstracting: (psecond<=p10)
states: 76,800 (4)
abstracting: (psecond<=p5)
states: 76,800 (4)
abstracting: (pprime<=p1)
states: 107,520 (5)
abstracting: (pterce<=5)
states: 184,320 (5)
abstracting: (pprime<=p10)
states: 109,440 (5)
abstracting: (1<=p9)
states: 138,240 (5)
abstracting: (pterce<=p1)
states: 83,200 (4)
abstracting: (p2<=7)
states: 184,320 (5)
abstracting: (2<=p10)
states: 92,160 (4)
abstracting: (p8<=5)
states: 184,320 (5)
abstracting: (7<=p2)
states: 0
abstracting: (6<=p2)
states: 0
abstracting: (p6<=0)
states: 55,296 (4)
abstracting: (pterce<=3)
states: 122,880 (5)
abstracting: (6<=pprime)
states: 6,144 (3)
abstracting: (2<=p9)
states: 92,160 (4)
abstracting: (p10<=p3)
states: 115,200 (5)
abstracting: (2<=p)
states: 86,016 (4)
abstracting: (psecond<=1)
states: 61,440 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[~ [[[[~ [[p3<=p10 & 4<=pprime]] | p4<=0] & p5<=p5] | ~ [[[[p7<=1 & p7<=1] | [p4<=p8 | psecond<=7]] & ~ [1<=p9]]]]] | [[p6<=6 | p<=1] & 4<=pprime]]] & ~ [[[[~ [[[p10<=p5 & 2<=pprime] | ~ [7<=p]]] & ~ [p9<=0]] | [[[[p7<=4 & p<=4] & [p4<=p7 & p<=3]] | [[5<=p6 & p4<=1] | ~ [7<=p6]]] & [[7<=p1 & 6<=p5] & p6<=3]]] | 5<=psecond]]]]
normalized: ~ [E [true U ~ [[~ [[[[[[7<=p1 & 6<=p5] & p6<=3] & [[~ [7<=p6] | [5<=p6 & p4<=1]] | [[p4<=p7 & p<=3] & [p7<=4 & p<=4]]]] | [~ [p9<=0] & ~ [[~ [7<=p] | [p10<=p5 & 2<=pprime]]]]] | 5<=psecond]] & ~ [[[[p6<=6 | p<=1] & 4<=pprime] | ~ [[~ [[~ [1<=p9] & [[p4<=p8 | psecond<=7] | [p7<=1 & p7<=1]]]] | [[~ [[p3<=p10 & 4<=pprime]] | p4<=0] & p5<=p5]]]]]]]]]

abstracting: (p5<=p5)
states: 184,320 (5)
abstracting: (p4<=0)
states: 46,080 (4)
abstracting: (4<=pprime)
states: 30,720 (4)
abstracting: (p3<=p10)
states: 115,200 (5)
abstracting: (p7<=1)
states: 92,160 (4)
abstracting: (p7<=1)
states: 92,160 (4)
abstracting: (psecond<=7)
states: 184,320 (5)
abstracting: (p4<=p8)
states: 115,200 (5)
abstracting: (1<=p9)
states: 138,240 (5)
abstracting: (4<=pprime)
states: 30,720 (4)
abstracting: (p<=1)
states: 98,304 (4)
abstracting: (p6<=6)
states: 182,784 (5)
abstracting: (5<=psecond)
states: 30,720 (4)
abstracting: (2<=pprime)
states: 86,016 (4)
abstracting: (p10<=p5)
states: 115,200 (5)
abstracting: (7<=p)
states: 1,536 (3)
abstracting: (p9<=0)
states: 46,080 (4)
abstracting: (p<=4)
states: 168,960 (5)
abstracting: (p7<=4)
states: 184,320 (5)
abstracting: (p<=3)
states: 153,600 (5)
abstracting: (p4<=p7)
states: 115,200 (5)
abstracting: (p4<=1)
states: 92,160 (4)
abstracting: (5<=p6)
states: 15,360 (4)
abstracting: (7<=p6)
states: 1,536 (3)
abstracting: (p6<=3)
states: 153,600 (5)
abstracting: (6<=p5)
states: 0
abstracting: (7<=p1)
states: 1,536 (3)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [[[[[3<=p8 & [[pprime<=p8 | 1<=p6] & [3<=p | p<=p3]]] | 2<=p6] & ~ [[[[pprime<=2 | 5<=psecond] | ~ [p10<=pprime]] & [5<=p4 & ~ [2<=psecond]]]]] & [[~ [[p1<=0 | p8<=0]] & ~ [p<=4]] & [[[[1<=p6 | p7<=3] & [p7<=p8 & p6<=p1]] & ~ [pterce<=0]] & [[~ [p8<=p2] & [p7<=p8 & 6<=p9]] | p5<=p]]]]] | [[p5<=6 | p2<=p7] | [psecond<=p10 & ~ [p2<=p9]]]] & [[[[1<=p2 & ~ [[p7<=p2 | 7<=p6]]] | [p6<=5 | p1<=p10]] | ~ [[p3<=6 | [[p7<=2 | 4<=p6] | 6<=p6]]]] & ~ [[pterce<=p1 | [[[3<=p8 & ~ [pprime<=0]] & ~ [p10<=5]] | [p5<=7 | [[~ [6<=p3] & ~ [p2<=5]] & p3<=6]]]]]]]]
normalized: E [true U [[~ [[[[[[~ [p2<=5] & ~ [6<=p3]] & p3<=6] | p5<=7] | [~ [p10<=5] & [~ [pprime<=0] & 3<=p8]]] | pterce<=p1]] & [~ [[[[p7<=2 | 4<=p6] | 6<=p6] | p3<=6]] | [[p6<=5 | p1<=p10] | [~ [[p7<=p2 | 7<=p6]] & 1<=p2]]]] & [[[~ [p2<=p9] & psecond<=p10] | [p5<=6 | p2<=p7]] | ~ [[[[[[[p7<=p8 & 6<=p9] & ~ [p8<=p2]] | p5<=p] & [~ [pterce<=0] & [[p7<=p8 & p6<=p1] & [1<=p6 | p7<=3]]]] & [~ [p<=4] & ~ [[p1<=0 | p8<=0]]]] & [~ [[[~ [2<=psecond] & 5<=p4] & [~ [p10<=pprime] | [pprime<=2 | 5<=psecond]]]] & [[[[3<=p | p<=p3] & [pprime<=p8 | 1<=p6]] & 3<=p8] | 2<=p6]]]]]]]

abstracting: (2<=p6)
states: 86,016 (4)
abstracting: (3<=p8)
states: 46,080 (4)
abstracting: (1<=p6)
states: 129,024 (5)
abstracting: (pprime<=p8)
states: 109,440 (5)
abstracting: (p<=p3)
states: 109,440 (5)
abstracting: (3<=p)
states: 53,760 (4)
abstracting: (5<=psecond)
states: 30,720 (4)
abstracting: (pprime<=2)
states: 130,560 (5)
abstracting: (p10<=pprime)
states: 113,280 (5)
abstracting: (5<=p4)
states: 0
abstracting: (2<=psecond)
states: 122,880 (5)
abstracting: (p8<=0)
states: 46,080 (4)
abstracting: (p1<=0)
states: 55,296 (4)
abstracting: (p<=4)
states: 168,960 (5)
abstracting: (p7<=3)
states: 184,320 (5)
abstracting: (1<=p6)
states: 129,024 (5)
abstracting: (p6<=p1)
states: 107,520 (5)
abstracting: (p7<=p8)
states: 92,160 (4)
abstracting: (pterce<=0)
states: 30,720 (4)
abstracting: (p5<=p)
states: 113,280 (5)
abstracting: (p8<=p2)
states: 115,200 (5)
abstracting: (6<=p9)
states: 0
abstracting: (p7<=p8)
states: 92,160 (4)
abstracting: (p2<=p7)
states: 115,200 (5)
abstracting: (p5<=6)
states: 184,320 (5)
abstracting: (psecond<=p10)
states: 76,800 (4)
abstracting: (p2<=p9)
states: 115,200 (5)
abstracting: (1<=p2)
states: 138,240 (5)
abstracting: (7<=p6)
states: 1,536 (3)
abstracting: (p7<=p2)
states: 115,200 (5)
abstracting: (p1<=p10)
states: 109,440 (5)
abstracting: (p6<=5)
states: 178,176 (5)
abstracting: (p3<=6)
states: 184,320 (5)
abstracting: (6<=p6)
states: 6,144 (3)
abstracting: (4<=p6)
states: 30,720 (4)
abstracting: (p7<=2)
states: 138,240 (5)
abstracting: (pterce<=p1)
states: 83,200 (4)
abstracting: (3<=p8)
states: 46,080 (4)
abstracting: (pprime<=0)
states: 55,296 (4)
abstracting: (p10<=5)
states: 184,320 (5)
abstracting: (p5<=7)
states: 184,320 (5)
abstracting: (p3<=6)
states: 184,320 (5)
abstracting: (6<=p3)
states: 0
abstracting: (p2<=5)
states: 184,320 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[~ [[[[7<=p5 | 1<=p3] & p10<=pprime] | ~ [[[[5<=p9 | p5<=3] & [p10<=p2 & p10<=psecond]] & 6<=p2]]]] & ~ [[[[~ [[~ [3<=p5] & ~ [6<=p10]]] & [4<=p4 | [[p7<=p1 | 6<=p7] & [pprime<=2 | p5<=6]]]] | psecond<=p4] & 2<=p4]]] & [[[[[1<=p | ~ [p<=psecond]] & ~ [6<=p5]] | [~ [[~ [p2<=1] | [[1<=p8 & p2<=7] | [p5<=p4 & 1<=p6]]]] & [~ [p9<=p] | [[[4<=p6 | pterce<=5] | [7<=p | 6<=p10]] & [7<=pterce | [pprime<=p4 | p7<=4]]]]]] & [p5<=2 | 7<=p5]] | ~ [[[~ [[[p2<=0 & [p10<=psecond | psecond<=4]] | ~ [[7<=p10 | 3<=psecond]]]] & 4<=psecond] & [~ [[[~ [pterce<=psecond] | [p6<=5 & 1<=pterce]] | [~ [p2<=pprime] & ~ [p6<=p1]]]] | p1<=2]]]]]]
normalized: E [true U [[~ [[[~ [[[~ [p6<=p1] & ~ [p2<=pprime]] | [[p6<=5 & 1<=pterce] | ~ [pterce<=psecond]]]] | p1<=2] & [~ [[~ [[7<=p10 | 3<=psecond]] | [[p10<=psecond | psecond<=4] & p2<=0]]] & 4<=psecond]]] | [[p5<=2 | 7<=p5] & [[[[[[pprime<=p4 | p7<=4] | 7<=pterce] & [[7<=p | 6<=p10] | [4<=p6 | pterce<=5]]] | ~ [p9<=p]] & ~ [[[[p5<=p4 & 1<=p6] | [1<=p8 & p2<=7]] | ~ [p2<=1]]]] | [~ [6<=p5] & [~ [p<=psecond] | 1<=p]]]]] & [~ [[[[[[[pprime<=2 | p5<=6] & [p7<=p1 | 6<=p7]] | 4<=p4] & ~ [[~ [6<=p10] & ~ [3<=p5]]]] | psecond<=p4] & 2<=p4]] & ~ [[~ [[[[p10<=p2 & p10<=psecond] & [5<=p9 | p5<=3]] & 6<=p2]] | [[7<=p5 | 1<=p3] & p10<=pprime]]]]]]

abstracting: (p10<=pprime)
states: 113,280 (5)
abstracting: (1<=p3)
states: 138,240 (5)
abstracting: (7<=p5)
states: 0
abstracting: (6<=p2)
states: 0
abstracting: (p5<=3)
states: 184,320 (5)
abstracting: (5<=p9)
states: 0
abstracting: (p10<=psecond)
states: 138,240 (5)
abstracting: (p10<=p2)
states: 115,200 (5)
abstracting: (2<=p4)
states: 92,160 (4)
abstracting: (psecond<=p4)
states: 76,800 (4)
abstracting: (3<=p5)
states: 46,080 (4)
abstracting: (6<=p10)
states: 0
abstracting: (4<=p4)
states: 0
abstracting: (6<=p7)
states: 0
abstracting: (p7<=p1)
states: 113,280 (5)
abstracting: (p5<=6)
states: 184,320 (5)
abstracting: (pprime<=2)
states: 130,560 (5)
abstracting: (1<=p)
states: 129,024 (5)
abstracting: (p<=psecond)
states: 130,816 (5)
abstracting: (6<=p5)
states: 0
abstracting: (p2<=1)
states: 92,160 (4)
abstracting: (p2<=7)
states: 184,320 (5)
abstracting: (1<=p8)
states: 138,240 (5)
abstracting: (1<=p6)
states: 129,024 (5)
abstracting: (p5<=p4)
states: 92,160 (4)
abstracting: (p9<=p)
states: 113,280 (5)
abstracting: (pterce<=5)
states: 184,320 (5)
abstracting: (4<=p6)
states: 30,720 (4)
abstracting: (6<=p10)
states: 0
abstracting: (7<=p)
states: 1,536 (3)
abstracting: (7<=pterce)
states: 0
abstracting: (p7<=4)
states: 184,320 (5)
abstracting: (pprime<=p4)
states: 109,440 (5)
abstracting: (7<=p5)
states: 0
abstracting: (p5<=2)
states: 138,240 (5)
abstracting: (4<=psecond)
states: 61,440 (4)
abstracting: (p2<=0)
states: 46,080 (4)
abstracting: (psecond<=4)
states: 153,600 (5)
abstracting: (p10<=psecond)
states: 138,240 (5)
abstracting: (3<=psecond)
states: 92,160 (4)
abstracting: (7<=p10)
states: 0
abstracting: (p1<=2)
states: 130,560 (5)
abstracting: (pterce<=psecond)
states: 92,160 (4)
abstracting: (1<=pterce)
states: 153,600 (5)
abstracting: (p6<=5)
states: 178,176 (5)
abstracting: (p2<=pprime)
states: 113,280 (5)
abstracting: (p6<=p1)
states: 107,520 (5)
-> the formula is FALSE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[~ [p9<=5] | [~ [[[~ [[[p10<=2 & psecond<=5] | [p3<=6 | 6<=p6]]] & [[3<=p3 | ~ [6<=p2]] & p8<=p9]] & ~ [[p9<=7 & pprime<=1]]]] | psecond<=7]] | [[[[[p8<=p7 | [p6<=psecond & [[p2<=p9 & 7<=p8] & ~ [pprime<=pterce]]]] & [[~ [p4<=0] | [~ [p9<=psecond] & [1<=p2 | p2<=0]]] | [[~ [p9<=p10] | 5<=p] & [[p7<=p5 | 2<=psecond] & 5<=p4]]]] & [[[5<=p3 | 5<=p1] & [p10<=p & [~ [p6<=6] | ~ [p9<=4]]]] | [[p4<=p10 & ~ [[pterce<=2 & 4<=p8]]] | [~ [p6<=pprime] & [~ [pprime<=5] | [p1<=pterce & p8<=5]]]]]] & [[p9<=p10 | [[~ [[3<=psecond & p9<=p8]] | ~ [[p10<=4 & 7<=pprime]]] & 6<=p10]] & [[p9<=p8 | [~ [pterce<=pterce] | ~ [p5<=p1]]] | [p6<=7 | [[~ [p3<=5] | [p1<=p4 | p6<=6]] | ~ [pprime<=6]]]]]] | 5<=p1]]]
normalized: ~ [E [true U ~ [[[[[[[[~ [pprime<=6] | [[p1<=p4 | p6<=6] | ~ [p3<=5]]] | p6<=7] | [[~ [p5<=p1] | ~ [pterce<=pterce]] | p9<=p8]] & [[[~ [[p10<=4 & 7<=pprime]] | ~ [[3<=psecond & p9<=p8]]] & 6<=p10] | p9<=p10]] & [[[[[[p1<=pterce & p8<=5] | ~ [pprime<=5]] & ~ [p6<=pprime]] | [~ [[pterce<=2 & 4<=p8]] & p4<=p10]] | [[[~ [p9<=4] | ~ [p6<=6]] & p10<=p] & [5<=p3 | 5<=p1]]] & [[[[[p7<=p5 | 2<=psecond] & 5<=p4] & [~ [p9<=p10] | 5<=p]] | [[[1<=p2 | p2<=0] & ~ [p9<=psecond]] | ~ [p4<=0]]] & [[[~ [pprime<=pterce] & [p2<=p9 & 7<=p8]] & p6<=psecond] | p8<=p7]]]] | 5<=p1] | [[~ [[~ [[p9<=7 & pprime<=1]] & [[[~ [6<=p2] | 3<=p3] & p8<=p9] & ~ [[[p3<=6 | 6<=p6] | [p10<=2 & psecond<=5]]]]]] | psecond<=7] | ~ [p9<=5]]]]]]

abstracting: (p9<=5)
states: 184,320 (5)
abstracting: (psecond<=7)
states: 184,320 (5)
abstracting: (psecond<=5)
states: 184,320 (5)
abstracting: (p10<=2)
states: 138,240 (5)
abstracting: (6<=p6)
states: 6,144 (3)
abstracting: (p3<=6)
states: 184,320 (5)
abstracting: (p8<=p9)
states: 115,200 (5)
abstracting: (3<=p3)
states: 46,080 (4)
abstracting: (6<=p2)
states: 0
abstracting: (pprime<=1)
states: 98,304 (4)
abstracting: (p9<=7)
states: 184,320 (5)
abstracting: (5<=p1)
states: 15,360 (4)
abstracting: (p8<=p7)
states: 92,160 (4)
abstracting: (p6<=psecond)
states: 130,816 (5)
abstracting: (7<=p8)
states: 0
abstracting: (p2<=p9)
states: 115,200 (5)
abstracting: (pprime<=pterce)
states: 130,816 (5)
abstracting: (p4<=0)
states: 46,080 (4)
abstracting: (p9<=psecond)
states: 138,240 (5)
abstracting: (p2<=0)
states: 46,080 (4)
abstracting: (1<=p2)
states: 138,240 (5)
abstracting: (5<=p)
states: 15,360 (4)
abstracting: (p9<=p10)
states: 92,160 (4)
abstracting: (5<=p4)
states: 0
abstracting: (2<=psecond)
states: 122,880 (5)
abstracting: (p7<=p5)
states: 115,200 (5)
abstracting: (5<=p1)
states: 15,360 (4)
abstracting: (5<=p3)
states: 0
abstracting: (p10<=p)
states: 113,280 (5)
abstracting: (p6<=6)
states: 182,784 (5)
abstracting: (p9<=4)
states: 184,320 (5)
abstracting: (p4<=p10)
states: 115,200 (5)
abstracting: (4<=p8)
states: 0
abstracting: (pterce<=2)
states: 92,160 (4)
abstracting: (p6<=pprime)
states: 107,520 (5)
abstracting: (pprime<=5)
states: 178,176 (5)
abstracting: (p8<=5)
states: 184,320 (5)
abstracting: (p1<=pterce)
states: 130,816 (5)
abstracting: (p9<=p10)
states: 92,160 (4)
abstracting: (6<=p10)
states: 0
abstracting: (p9<=p8)
states: 115,200 (5)
abstracting: (3<=psecond)
states: 92,160 (4)
abstracting: (7<=pprime)
states: 1,536 (3)
abstracting: (p10<=4)
states: 184,320 (5)
abstracting: (p9<=p8)
states: 115,200 (5)
abstracting: (pterce<=pterce)
states: 184,320 (5)
abstracting: (p5<=p1)
states: 113,280 (5)
abstracting: (p6<=7)
states: 184,320 (5)
abstracting: (p3<=5)
states: 184,320 (5)
abstracting: (p6<=6)
states: 182,784 (5)
abstracting: (p1<=p4)
states: 109,440 (5)
abstracting: (pprime<=6)
states: 182,784 (5)
-> the formula is TRUE

FORMULA RefineWMG-PT-002003-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 19771 (2.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24657 15796 40453
used/not used/entry size/cache size: 20675 67088189 16 1024MB
basic ops cache: hits/miss/sum: 42178 43926 86104
used/not used/entry size/cache size: 80551 16696665 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: 6048 4474 10522
used/not used/entry size/cache size: 4474 8384134 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 67090810
1 17521
2 302
3 126
4 14
5 8
6 5
7 15
8 18
9 4
>= 10 41

Total processing time: 0m 4.497sec


BK_STOP 1678938844292

--------------------
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:581 (52), effective:246 (22)

initing FirstDep: 0m 0.000sec


iterations count:261 (23), effective:101 (9)

iterations count:165 (15), effective:67 (6)

iterations count:439 (39), effective:178 (16)

iterations count:97 (8), effective:40 (3)

iterations count:88 (8), effective:34 (3)

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="RefineWMG-PT-002003"
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 RefineWMG-PT-002003, 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 r321-tall-167889192300542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-002003.tgz
mv RefineWMG-PT-002003 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;