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.r513-tall-167987240400001.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 Anderson-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240400001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 92K Mar 26 22:42 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 Anderson-PT-04-CTLCardinality-00
FORMULA_NAME Anderson-PT-04-CTLCardinality-01
FORMULA_NAME Anderson-PT-04-CTLCardinality-02
FORMULA_NAME Anderson-PT-04-CTLCardinality-03
FORMULA_NAME Anderson-PT-04-CTLCardinality-04
FORMULA_NAME Anderson-PT-04-CTLCardinality-05
FORMULA_NAME Anderson-PT-04-CTLCardinality-06
FORMULA_NAME Anderson-PT-04-CTLCardinality-07
FORMULA_NAME Anderson-PT-04-CTLCardinality-08
FORMULA_NAME Anderson-PT-04-CTLCardinality-09
FORMULA_NAME Anderson-PT-04-CTLCardinality-10
FORMULA_NAME Anderson-PT-04-CTLCardinality-11
FORMULA_NAME Anderson-PT-04-CTLCardinality-12
FORMULA_NAME Anderson-PT-04-CTLCardinality-13
FORMULA_NAME Anderson-PT-04-CTLCardinality-14
FORMULA_NAME Anderson-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679873469593

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=Anderson-PT-04
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: anderson_04
(NrP: 105 NrTr: 200 NrArc: 752)

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

net check time: 0m 0.000sec

init dd package: 0m 2.885sec


RS generation: 0m 1.683sec


-> reachability set: #nodes 15960 (1.6e+04) #states 29,641 (4)



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

checking: EG [p2_3_0<=1]
normalized: EG [p2_3_0<=1]

abstracting: (p2_3_0<=1)
states: 29,641 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [AF [EF [1<=p3_0_2]]]
normalized: EX [~ [EG [~ [E [true U 1<=p3_0_2]]]]]

abstracting: (1<=p3_0_2)
states: 352
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.688sec

checking: EG [ncs_1_3<=cs_0_0]
normalized: EG [ncs_1_3<=cs_0_0]

abstracting: (ncs_1_3<=cs_0_0)
states: 26,897 (4)
.......................
EG iterations: 23
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.086sec

checking: [~ [EG [AG [AX [ncs_0_3<=0]]]] | AG [AX [[~ [EF [p1_1_2<=0]] | 1<=ncs_2_3]]]]
normalized: [~ [EG [~ [E [true U EX [~ [ncs_0_3<=0]]]]]] | ~ [E [true U EX [~ [[1<=ncs_2_3 | ~ [E [true U p1_1_2<=0]]]]]]]]

abstracting: (p1_1_2<=0)
states: 28,023 (4)
abstracting: (1<=ncs_2_3)
states: 2,800 (3)
.abstracting: (ncs_0_3<=0)
states: 26,841 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.193sec

checking: AG [[EF [1<=p2_2_3] | ncs_2_1<=p3_2_1]]
normalized: ~ [E [true U ~ [[ncs_2_1<=p3_2_1 | E [true U 1<=p2_2_3]]]]]

abstracting: (1<=p2_2_3)
states: 2,068 (3)
abstracting: (ncs_2_1<=p3_2_1)
states: 27,099 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.063sec

checking: EG [[p1_0_1<=p1_1_3 | 1<=p1_0_5]]
normalized: EG [[p1_0_1<=p1_1_3 | 1<=p1_0_5]]

abstracting: (1<=p1_0_5)
states: 1,194 (3)
abstracting: (p1_0_1<=p1_1_3)
states: 28,355 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: [AF [EG [EX [cs_2_1<=1]]] | ~ [EG [[~ [[~ [1<=cs_3_0] & 1<=p2_3_1]] | AX [1<=slot_T_F_F_F]]]]]
normalized: [~ [EG [[~ [EX [~ [1<=slot_T_F_F_F]]] | ~ [[1<=p2_3_1 & ~ [1<=cs_3_0]]]]]] | ~ [EG [~ [EG [EX [cs_2_1<=1]]]]]]

abstracting: (cs_2_1<=1)
states: 29,641 (4)
.
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=cs_3_0)
states: 433
abstracting: (1<=p2_3_1)
states: 1,630 (3)
abstracting: (1<=slot_T_F_F_F)
states: 6,480 (3)
.....................
EG iterations: 20
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.860sec

checking: EF [EG [[p2_3_2<=0 & E [EF [ncs_1_2<=1] U [AF [1<=cs_0_2] & AF [p3_0_2<=p2_3_3]]]]]]
normalized: E [true U EG [[p2_3_2<=0 & E [E [true U ncs_1_2<=1] U [~ [EG [~ [p3_0_2<=p2_3_3]]] & ~ [EG [~ [1<=cs_0_2]]]]]]]]

abstracting: (1<=cs_0_2)
states: 352
......................
EG iterations: 22
abstracting: (p3_0_2<=p2_3_3)
states: 29,345 (4)
........
EG iterations: 8
abstracting: (ncs_1_2<=1)
states: 29,641 (4)
abstracting: (p2_3_2<=0)
states: 27,999 (4)
....................
EG iterations: 20
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.364sec

checking: AG [~ [EF [[[p1_3_1<=p2_2_2 & ncs_3_2<=0] & A [EX [ncs_0_2<=0] U AG [1<=p2_2_1]]]]]]
normalized: ~ [E [true U E [true U [[~ [EG [E [true U ~ [1<=p2_2_1]]]] & ~ [E [E [true U ~ [1<=p2_2_1]] U [~ [EX [ncs_0_2<=0]] & E [true U ~ [1<=p2_2_1]]]]]] & [p1_3_1<=p2_2_2 & ncs_3_2<=0]]]]]

abstracting: (ncs_3_2<=0)
states: 27,159 (4)
abstracting: (p1_3_1<=p2_2_2)
states: 28,437 (4)
abstracting: (1<=p2_2_1)
states: 1,630 (3)
abstracting: (ncs_0_2<=0)
states: 27,159 (4)
.abstracting: (1<=p2_2_1)
states: 1,630 (3)
abstracting: (1<=p2_2_1)
states: 1,630 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.142sec

checking: EX [AX [~ [EG [[[p1_0_3<=ncs_1_0 & p1_0_5<=slot_F_F_T_F] & [p1_0_4<=p2_1_0 | p1_3_1<=1]]]]]]
normalized: EX [~ [EX [EG [[[p1_0_4<=p2_1_0 | p1_3_1<=1] & [p1_0_3<=ncs_1_0 & p1_0_5<=slot_F_F_T_F]]]]]]

abstracting: (p1_0_5<=slot_F_F_T_F)
states: 28,543 (4)
abstracting: (p1_0_3<=ncs_1_0)
states: 28,231 (4)
abstracting: (p1_3_1<=1)
states: 29,641 (4)
abstracting: (p1_0_4<=p2_1_0)
states: 28,065 (4)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA Anderson-PT-04-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.261sec

checking: [EX [p2_0_0<=next_5] & ~ [AG [AF [~ [[[1<=p2_3_2 | 1<=ncs_2_0] | [ncs_0_3<=p2_3_1 | p1_0_5<=1]]]]]]]
normalized: [E [true U EG [[[ncs_0_3<=p2_3_1 | p1_0_5<=1] | [1<=p2_3_2 | 1<=ncs_2_0]]]] & EX [p2_0_0<=next_5]]

abstracting: (p2_0_0<=next_5)
states: 28,284 (4)
.abstracting: (1<=ncs_2_0)
states: 2,654 (3)
abstracting: (1<=p2_3_2)
states: 1,642 (3)
abstracting: (p1_0_5<=1)
states: 29,641 (4)
abstracting: (ncs_0_3<=p2_3_1)
states: 26,977 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.229sec

checking: AG [AF [[EF [[A [1<=p1_3_2 U 1<=cs_1_0] & [1<=ncs_1_2 | p3_0_3<=p3_1_1]]] | [EX [AF [p2_1_1<=0]] & A [~ [1<=p2_1_2] U A [p1_1_6<=p1_3_2 U 1<=ncs_0_0]]]]]]
normalized: ~ [E [true U EG [~ [[[[~ [EG [~ [[~ [EG [~ [1<=ncs_0_0]]] & ~ [E [~ [1<=ncs_0_0] U [~ [p1_1_6<=p1_3_2] & ~ [1<=ncs_0_0]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=ncs_0_0]]] & ~ [E [~ [1<=ncs_0_0] U [~ [p1_1_6<=p1_3_2] & ~ [1<=ncs_0_0]]]]]] U [1<=p2_1_2 & ~ [[~ [EG [~ [1<=ncs_0_0]]] & ~ [E [~ [1<=ncs_0_0] U [~ [p1_1_6<=p1_3_2] & ~ [1<=ncs_0_0]]]]]]]]]] & EX [~ [EG [~ [p2_1_1<=0]]]]] | E [true U [[1<=ncs_1_2 | p3_0_3<=p3_1_1] & [~ [EG [~ [1<=cs_1_0]]] & ~ [E [~ [1<=cs_1_0] U [~ [1<=p1_3_2] & ~ [1<=cs_1_0]]]]]]]]]]]]

abstracting: (1<=cs_1_0)
states: 433
abstracting: (1<=p1_3_2)
states: 1,618 (3)
abstracting: (1<=cs_1_0)
states: 433
abstracting: (1<=cs_1_0)
states: 433
......................
EG iterations: 22
abstracting: (p3_0_3<=p3_1_1)
states: 29,121 (4)
abstracting: (1<=ncs_1_2)
states: 2,482 (3)
abstracting: (p2_1_1<=0)
states: 28,011 (4)
....................
EG iterations: 20
.abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (p1_1_6<=p1_3_2)
states: 28,957 (4)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
.......................
EG iterations: 23
abstracting: (1<=p2_1_2)
states: 1,642 (3)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (p1_1_6<=p1_3_2)
states: 28,957 (4)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
.......................
EG iterations: 23
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (p1_1_6<=p1_3_2)
states: 28,957 (4)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
.......................
EG iterations: 23
......................
EG iterations: 22
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.425sec

checking: ~ [[EG [~ [[AF [1<=p3_3_1] | ~ [EG [ncs_3_2<=0]]]]] & [[AX [1<=p2_0_1] | EF [[[1<=p2_3_3 | 1<=cs_2_2] & AG [p1_2_2<=ncs_2_0]]]] | [~ [E [~ [p1_0_2<=1] U EX [1<=cs_0_3]]] & ~ [[[AX [1<=p1_2_5] & E [1<=p3_1_3 U p3_0_2<=0]] | AF [1<=cs_1_2]]]]]]]
normalized: ~ [[[[~ [[~ [EG [~ [1<=cs_1_2]]] | [E [1<=p3_1_3 U p3_0_2<=0] & ~ [EX [~ [1<=p1_2_5]]]]]] & ~ [E [~ [p1_0_2<=1] U EX [1<=cs_0_3]]]] | [E [true U [~ [E [true U ~ [p1_2_2<=ncs_2_0]]] & [1<=p2_3_3 | 1<=cs_2_2]]] | ~ [EX [~ [1<=p2_0_1]]]]] & EG [~ [[~ [EG [ncs_3_2<=0]] | ~ [EG [~ [1<=p3_3_1]]]]]]]]

abstracting: (1<=p3_3_1)
states: 376
.....................
EG iterations: 21
abstracting: (ncs_3_2<=0)
states: 27,159 (4)
.......................
EG iterations: 23
.
EG iterations: 1
abstracting: (1<=p2_0_1)
states: 1,630 (3)
.abstracting: (1<=cs_2_2)
states: 352
abstracting: (1<=p2_3_3)
states: 2,068 (3)
abstracting: (p1_2_2<=ncs_2_0)
states: 28,023 (4)
abstracting: (1<=cs_0_3)
states: 520
.abstracting: (p1_0_2<=1)
states: 29,641 (4)
abstracting: (1<=p1_2_5)
states: 1,194 (3)
.abstracting: (p3_0_2<=0)
states: 29,289 (4)
abstracting: (1<=p3_1_3)
states: 520
abstracting: (1<=cs_1_2)
states: 352
......................
EG iterations: 22
-> the formula is FALSE

FORMULA Anderson-PT-04-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.040sec

checking: [~ [AF [~ [ncs_3_0<=cs_2_1]]] | [[AF [[EF [EX [p3_2_0<=1]] & E [~ [p2_0_2<=1] U [p1_1_2<=p1_1_6 & cs_0_0<=p2_2_0]]]] & AX [AX [[~ [ncs_3_3<=slot_F_F_F_T] | [p1_0_5<=0 | 1<=ncs_0_0]]]]] & AF [1<=p1_3_5]]]
normalized: [[~ [EG [~ [1<=p1_3_5]]] & [~ [EX [EX [~ [[[p1_0_5<=0 | 1<=ncs_0_0] | ~ [ncs_3_3<=slot_F_F_F_T]]]]]] & ~ [EG [~ [[E [~ [p2_0_2<=1] U [p1_1_2<=p1_1_6 & cs_0_0<=p2_2_0]] & E [true U EX [p3_2_0<=1]]]]]]]] | EG [ncs_3_0<=cs_2_1]]

abstracting: (ncs_3_0<=cs_2_1)
states: 27,033 (4)
.......................
EG iterations: 23
abstracting: (p3_2_0<=1)
states: 29,641 (4)
.abstracting: (cs_0_0<=p2_2_0)
states: 29,208 (4)
abstracting: (p1_1_2<=p1_1_6)
states: 28,023 (4)
abstracting: (p2_0_2<=1)
states: 29,641 (4)
...................
EG iterations: 19
abstracting: (ncs_3_3<=slot_F_F_F_T)
states: 27,334 (4)
abstracting: (1<=ncs_0_0)
states: 2,654 (3)
abstracting: (p1_0_5<=0)
states: 28,447 (4)
..abstracting: (1<=p1_3_5)
states: 1,194 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.424sec

checking: [[EG [[A [[~ [1<=p1_2_6] | cs_2_3<=1] U ~ [EX [1<=p2_1_2]]] & ~ [[A [1<=ncs_3_2 U cs_0_1<=0] & ncs_3_3<=1]]]] & ~ [EG [AX [AF [cs_1_2<=next_0]]]]] | AG [[AF [[[AF [p3_1_1<=p3_0_2] & 1<=cs_1_3] | E [p1_3_0<=p1_2_4 U ncs_3_2<=0]]] | EX [p3_2_3<=next_3]]]]
normalized: [[EG [[[~ [E [EX [1<=p2_1_2] U [~ [[cs_2_3<=1 | ~ [1<=p1_2_6]]] & EX [1<=p2_1_2]]]] & ~ [EG [EX [1<=p2_1_2]]]] & ~ [[ncs_3_3<=1 & [~ [EG [~ [cs_0_1<=0]]] & ~ [E [~ [cs_0_1<=0] U [~ [1<=ncs_3_2] & ~ [cs_0_1<=0]]]]]]]]] & ~ [EG [~ [EX [EG [~ [cs_1_2<=next_0]]]]]]] | ~ [E [true U ~ [[EX [p3_2_3<=next_3] | ~ [EG [~ [[E [p1_3_0<=p1_2_4 U ncs_3_2<=0] | [1<=cs_1_3 & ~ [EG [~ [p3_1_1<=p3_0_2]]]]]]]]]]]]]

abstracting: (p3_1_1<=p3_0_2)
states: 29,265 (4)
........
EG iterations: 8
abstracting: (1<=cs_1_3)
states: 520
abstracting: (ncs_3_2<=0)
states: 27,159 (4)
abstracting: (p1_3_0<=p1_2_4)
states: 28,719 (4)
.
EG iterations: 1
abstracting: (p3_2_3<=next_3)
states: 29,241 (4)
.abstracting: (cs_1_2<=next_0)
states: 29,337 (4)
........
EG iterations: 8
.
EG iterations: 0
abstracting: (cs_0_1<=0)
states: 29,265 (4)
abstracting: (1<=ncs_3_2)
states: 2,482 (3)
abstracting: (cs_0_1<=0)
states: 29,265 (4)
abstracting: (cs_0_1<=0)
states: 29,265 (4)
........
EG iterations: 8
abstracting: (ncs_3_3<=1)
states: 29,641 (4)
abstracting: (1<=p2_1_2)
states: 1,642 (3)
.....................
EG iterations: 20
abstracting: (1<=p2_1_2)
states: 1,642 (3)
.abstracting: (1<=p1_2_6)
states: 684
abstracting: (cs_2_3<=1)
states: 29,641 (4)
abstracting: (1<=p2_1_2)
states: 1,642 (3)
.........
EG iterations: 8
-> the formula is TRUE

FORMULA Anderson-PT-04-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.850sec

checking: A [[~ [[[[[p1_1_6<=1 & ~ [p3_3_0<=p3_0_0]] | [[1<=p2_3_0 & next_6<=0] | p1_3_3<=1]] & next_3<=0] & [[[A [1<=p2_1_1 U p3_3_1<=p3_0_0] & E [1<=cs_1_1 U p1_0_1<=1]] | EF [1<=p1_3_6]] | E [1<=cs_2_1 U AG [cs_1_3<=0]]]]] | [EG [cs_1_0<=0] | [[[~ [[p2_0_0<=p1_2_3 | cs_0_3<=0]] & [EF [1<=ncs_2_3] | ncs_3_2<=p1_2_0]] | ~ [[[p3_1_0<=1 & cs_3_0<=cs_0_1] | cs_3_1<=p1_3_1]]] | AF [[~ [1<=p2_3_3] & 1<=p2_0_2]]]]] U [~ [EF [EX [~ [cs_3_3<=cs_2_1]]]] | ~ [AX [[[~ [ncs_0_2<=p2_2_3] | p3_0_0<=slot_T_F_F_F] | E [1<=cs_1_3 U p1_0_4<=1]]]]]]
normalized: [~ [EG [~ [[EX [~ [[E [1<=cs_1_3 U p1_0_4<=1] | [p3_0_0<=slot_T_F_F_F | ~ [ncs_0_2<=p2_2_3]]]]] | ~ [E [true U EX [~ [cs_3_3<=cs_2_1]]]]]]]] & ~ [E [~ [[EX [~ [[E [1<=cs_1_3 U p1_0_4<=1] | [p3_0_0<=slot_T_F_F_F | ~ [ncs_0_2<=p2_2_3]]]]] | ~ [E [true U EX [~ [cs_3_3<=cs_2_1]]]]]] U [~ [[[[~ [EG [~ [[1<=p2_0_2 & ~ [1<=p2_3_3]]]]] | [~ [[cs_3_1<=p1_3_1 | [p3_1_0<=1 & cs_3_0<=cs_0_1]]] | [[ncs_3_2<=p1_2_0 | E [true U 1<=ncs_2_3]] & ~ [[p2_0_0<=p1_2_3 | cs_0_3<=0]]]]] | EG [cs_1_0<=0]] | ~ [[[E [1<=cs_2_1 U ~ [E [true U ~ [cs_1_3<=0]]]] | [E [true U 1<=p1_3_6] | [E [1<=cs_1_1 U p1_0_1<=1] & [~ [EG [~ [p3_3_1<=p3_0_0]]] & ~ [E [~ [p3_3_1<=p3_0_0] U [~ [1<=p2_1_1] & ~ [p3_3_1<=p3_0_0]]]]]]]] & [next_3<=0 & [[p1_3_3<=1 | [1<=p2_3_0 & next_6<=0]] | [p1_1_6<=1 & ~ [p3_3_0<=p3_0_0]]]]]]]] & ~ [[EX [~ [[E [1<=cs_1_3 U p1_0_4<=1] | [p3_0_0<=slot_T_F_F_F | ~ [ncs_0_2<=p2_2_3]]]]] | ~ [E [true U EX [~ [cs_3_3<=cs_2_1]]]]]]]]]]

abstracting: (cs_3_3<=cs_2_1)
states: 29,121 (4)
.abstracting: (ncs_0_2<=p2_2_3)
states: 27,291 (4)
abstracting: (p3_0_0<=slot_T_F_F_F)
states: 29,641 (4)
abstracting: (p1_0_4<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_3)
states: 520
.abstracting: (p3_3_0<=p3_0_0)
states: 29,208 (4)
abstracting: (p1_1_6<=1)
states: 29,641 (4)
abstracting: (next_6<=0)
states: 28,777 (4)
abstracting: (1<=p2_3_0)
states: 1,603 (3)
abstracting: (p1_3_3<=1)
states: 29,641 (4)
abstracting: (next_3<=0)
states: 22,178 (4)
abstracting: (p3_3_1<=p3_0_0)
states: 29,265 (4)
abstracting: (1<=p2_1_1)
states: 1,630 (3)
abstracting: (p3_3_1<=p3_0_0)
states: 29,265 (4)
abstracting: (p3_3_1<=p3_0_0)
states: 29,265 (4)
........
EG iterations: 8
abstracting: (p1_0_1<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_1)
states: 376
abstracting: (1<=p1_3_6)
states: 684
abstracting: (cs_1_3<=0)
states: 29,121 (4)
abstracting: (1<=cs_2_1)
states: 376
abstracting: (cs_1_0<=0)
states: 29,208 (4)
......................
EG iterations: 22
abstracting: (cs_0_3<=0)
states: 29,121 (4)
abstracting: (p2_0_0<=p1_2_3)
states: 28,180 (4)
abstracting: (1<=ncs_2_3)
states: 2,800 (3)
abstracting: (ncs_3_2<=p1_2_0)
states: 27,243 (4)
abstracting: (cs_3_0<=cs_0_1)
states: 29,208 (4)
abstracting: (p3_1_0<=1)
states: 29,641 (4)
abstracting: (cs_3_1<=p1_3_1)
states: 29,265 (4)
abstracting: (1<=p2_3_3)
states: 2,068 (3)
abstracting: (1<=p2_0_2)
states: 1,642 (3)
...............
EG iterations: 15
abstracting: (cs_3_3<=cs_2_1)
states: 29,121 (4)
.abstracting: (ncs_0_2<=p2_2_3)
states: 27,291 (4)
abstracting: (p3_0_0<=slot_T_F_F_F)
states: 29,641 (4)
abstracting: (p1_0_4<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_3)
states: 520
.abstracting: (cs_3_3<=cs_2_1)
states: 29,121 (4)
.abstracting: (ncs_0_2<=p2_2_3)
states: 27,291 (4)
abstracting: (p3_0_0<=slot_T_F_F_F)
states: 29,641 (4)
abstracting: (p1_0_4<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_3)
states: 520
.
EG iterations: 0
-> the formula is FALSE

FORMULA Anderson-PT-04-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.835sec

totally nodes used: 9666559 (9.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24307903 68843000 93150903
used/not used/entry size/cache size: 46600460 20508404 16 1024MB
basic ops cache: hits/miss/sum: 3141673 6712831 9854504
used/not used/entry size/cache size: 8520059 8257157 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: 32881 137613 170494
used/not used/entry size/cache size: 136563 8252045 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 58772360
1 7200668
2 966232
3 147560
4 19689
5 2161
6 172
7 22
8 0
9 0
>= 10 0

Total processing time: 0m31.834sec


BK_STOP 1679873501479

--------------------
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:96665 (483), effective:2273 (11)

initing FirstDep: 0m 0.000sec


iterations count:12630 (63), effective:389 (1)

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

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

iterations count:16697 (83), effective:539 (2)

iterations count:27927 (139), effective:843 (4)

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

iterations count:12829 (64), effective:373 (1)

iterations count:2393 (11), effective:60 (0)

iterations count:2759 (13), effective:61 (0)

iterations count:2759 (13), effective:61 (0)

iterations count:25094 (125), effective:771 (3)

iterations count:2759 (13), effective:61 (0)

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

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

iterations count:16292 (81), effective:511 (2)

iterations count:32218 (161), effective:937 (4)

iterations count:32218 (161), effective:937 (4)

iterations count:11362 (56), effective:343 (1)

iterations count:32218 (161), effective:937 (4)

iterations count:15568 (77), effective:540 (2)

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

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

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

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

iterations count:2802 (14), effective:65 (0)

iterations count:906 (4), effective:12 (0)

iterations count:23229 (116), effective:782 (3)

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

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

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

iterations count:39937 (199), effective:1313 (6)

iterations count:17848 (89), effective:565 (2)

iterations count:18390 (91), effective:599 (2)

iterations count:23229 (116), effective:782 (3)

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

iterations count:21399 (106), effective:631 (3)

iterations count:23229 (116), effective:782 (3)

iterations count:200 (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="Anderson-PT-04"
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 Anderson-PT-04, 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 r513-tall-167987240400001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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