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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 23 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 PGCD-PT-D02N006-CTLCardinality-00
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-01
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-02
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-03
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-04
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-05
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-06
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-07
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-08
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-09
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-10
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-11
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-12
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-13
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-14
FORMULA_NAME PGCD-PT-D02N006-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679896359803

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=PGCD-PT-D02N006
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: PGCD_COL_D2_N6
(NrP: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.779sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 422 (4.2e+02) #states 15,670 (4)



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

checking: AG [~ [EG [~ [EF [3<=p0_3]]]]]
normalized: ~ [E [true U EG [~ [E [true U 3<=p0_3]]]]]

abstracting: (3<=p0_3)
states: 8,305 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [AG [4<=p1_3]]
normalized: ~ [EG [E [true U ~ [4<=p1_3]]]]

abstracting: (4<=p1_3)
states: 6,128 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [3<=p2_1]
normalized: EG [3<=p2_1]

abstracting: (3<=p2_1)
states: 8,305 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [AF [AG [EF [EF [p0_3<=p0_2]]]]]
normalized: EG [~ [EG [E [true U ~ [E [true U E [true U p0_3<=p0_2]]]]]]]

abstracting: (p0_3<=p0_2)
states: 8,600 (3)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [AX [AF [EX [AF [p2_2<=p2_3]]]]]
normalized: EX [EG [~ [EX [~ [EG [~ [p2_2<=p2_3]]]]]]]

abstracting: (p2_2<=p2_3)
states: 8,600 (3)
.
EG iterations: 1
..
EG iterations: 1
.-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[EG [~ [p2_1<=p2_1]] | 4<=p2_2]]
normalized: ~ [E [true U ~ [[EG [~ [p2_1<=p2_1]] | 4<=p2_2]]]]

abstracting: (4<=p2_2)
states: 6,336 (3)
abstracting: (p2_1<=p2_1)
states: 15,670 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [[~ [E [p1_2<=p1_1 U EF [AG [p0_3<=1]]]] | ~ [AF [EG [p2_1<=6]]]]]
normalized: EX [[EG [~ [EG [p2_1<=6]]] | ~ [E [p1_2<=p1_1 U E [true U ~ [E [true U ~ [p0_3<=1]]]]]]]]

abstracting: (p0_3<=1)
states: 5,396 (3)
abstracting: (p1_2<=p1_1)
states: 8,666 (3)
abstracting: (p2_1<=6)
states: 12,814 (4)
.
EG iterations: 1
..
EG iterations: 2
.-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [EX [[p2_1<=5 | ~ [AX [p2_3<=5]]]] | AG [~ [EX [A [EX [p2_3<=1] U ~ [2<=p2_1]]]]]]
normalized: [~ [E [true U EX [[~ [EG [2<=p2_1]] & ~ [E [2<=p2_1 U [~ [EX [p2_3<=1]] & 2<=p2_1]]]]]]] | EX [[EX [~ [p2_3<=5]] | p2_1<=5]]]

abstracting: (p2_1<=5)
states: 11,974 (4)
abstracting: (p2_3<=5)
states: 11,974 (4)
..abstracting: (2<=p2_1)
states: 10,274 (4)
abstracting: (p2_3<=1)
states: 5,396 (3)
.abstracting: (2<=p2_1)
states: 10,274 (4)
abstracting: (2<=p2_1)
states: 10,274 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EG [~ [A [~ [EF [[p2_1<=3 | 4<=p0_1]]] U [~ [AX [p2_1<=p1_1]] | ~ [6<=p2_2]]]]]
normalized: EG [~ [[~ [EG [~ [[~ [6<=p2_2] | EX [~ [p2_1<=p1_1]]]]]] & ~ [E [~ [[~ [6<=p2_2] | EX [~ [p2_1<=p1_1]]]] U [E [true U [p2_1<=3 | 4<=p0_1]] & ~ [[~ [6<=p2_2] | EX [~ [p2_1<=p1_1]]]]]]]]]]

abstracting: (p2_1<=p1_1)
states: 7,720 (3)
.abstracting: (6<=p2_2)
states: 3,696 (3)
abstracting: (4<=p0_1)
states: 6,336 (3)
abstracting: (p2_1<=3)
states: 9,334 (3)
abstracting: (p2_1<=p1_1)
states: 7,720 (3)
.abstracting: (6<=p2_2)
states: 3,696 (3)
abstracting: (p2_1<=p1_1)
states: 7,720 (3)
.abstracting: (6<=p2_2)
states: 3,696 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [E [AG [[p2_1<=p2_1 | A [[p0_2<=2 | 5<=p1_1] U [6<=p1_2 & p2_2<=0]]]] U EG [p1_3<=p1_3]]]
normalized: ~ [E [~ [E [true U ~ [[[~ [EG [~ [[6<=p1_2 & p2_2<=0]]]] & ~ [E [~ [[6<=p1_2 & p2_2<=0]] U [~ [[p0_2<=2 | 5<=p1_1]] & ~ [[6<=p1_2 & p2_2<=0]]]]]] | p2_1<=p2_1]]]] U EG [p1_3<=p1_3]]]

abstracting: (p1_3<=p1_3)
states: 15,670 (4)

EG iterations: 0
abstracting: (p2_1<=p2_1)
states: 15,670 (4)
abstracting: (p2_2<=0)
states: 2,636 (3)
abstracting: (6<=p1_2)
states: 3,528 (3)
abstracting: (5<=p1_1)
states: 4,818 (3)
abstracting: (p0_2<=2)
states: 7,365 (3)
abstracting: (p2_2<=0)
states: 2,636 (3)
abstracting: (6<=p1_2)
states: 3,528 (3)
abstracting: (p2_2<=0)
states: 2,636 (3)
abstracting: (6<=p1_2)
states: 3,528 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AX [3<=p0_2] & EF [A [[[~ [[p1_1<=p1_3 & 4<=p2_1]] | p0_3<=p2_3] & AF [~ [3<=p1_2]]] U ~ [E [p1_2<=4 U 2<=p2_2]]]]]
normalized: [E [true U [~ [EG [E [p1_2<=4 U 2<=p2_2]]] & ~ [E [E [p1_2<=4 U 2<=p2_2] U [~ [[~ [EG [3<=p1_2]] & [p0_3<=p2_3 | ~ [[p1_1<=p1_3 & 4<=p2_1]]]]] & E [p1_2<=4 U 2<=p2_2]]]]]] & ~ [EX [~ [3<=p0_2]]]]

abstracting: (3<=p0_2)
states: 8,305 (3)
.abstracting: (2<=p2_2)
states: 10,274 (4)
abstracting: (p1_2<=4)
states: 10,852 (4)
abstracting: (4<=p2_1)
states: 6,336 (3)
abstracting: (p1_1<=p1_3)
states: 8,666 (3)
abstracting: (p0_3<=p2_3)
states: 15,670 (4)
abstracting: (3<=p1_2)
states: 8,075 (3)
..
EG iterations: 2
abstracting: (2<=p2_2)
states: 10,274 (4)
abstracting: (p1_2<=4)
states: 10,852 (4)
abstracting: (2<=p2_2)
states: 10,274 (4)
abstracting: (p1_2<=4)
states: 10,852 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [EX [~ [[4<=p2_1 | AG [[AG [p1_1<=p1_1] & 5<=p1_2]]]]] | [AX [EX [~ [EF [5<=p2_3]]]] | EF [~ [[p1_3<=5 & [p1_1<=4 & [[p0_2<=p0_1 | p2_2<=0] & AF [p1_3<=0]]]]]]]]
normalized: [[E [true U ~ [[p1_3<=5 & [p1_1<=4 & [~ [EG [~ [p1_3<=0]]] & [p0_2<=p0_1 | p2_2<=0]]]]]] | ~ [EX [~ [EX [~ [E [true U 5<=p2_3]]]]]]] | EX [~ [[4<=p2_1 | ~ [E [true U ~ [[5<=p1_2 & ~ [E [true U ~ [p1_1<=p1_1]]]]]]]]]]]

abstracting: (p1_1<=p1_1)
states: 15,670 (4)
abstracting: (5<=p1_2)
states: 4,818 (3)
abstracting: (4<=p2_1)
states: 6,336 (3)
.abstracting: (5<=p2_3)
states: 5,016 (3)
..abstracting: (p2_2<=0)
states: 2,636 (3)
abstracting: (p0_2<=p0_1)
states: 8,600 (3)
abstracting: (p1_3<=0)
states: 2,813 (3)
.
EG iterations: 1
abstracting: (p1_1<=4)
states: 10,852 (4)
abstracting: (p1_3<=5)
states: 12,142 (4)
-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EX [[EX [~ [[[[5<=p2_3 | 6<=p2_1] | E [5<=p0_1 U 5<=p1_1]] & AX [p0_3<=p1_2]]]] | [~ [[p0_2<=4 & [AF [4<=p0_2] & p1_3<=p0_3]]] | p1_3<=0]]]
normalized: EX [[[p1_3<=0 | ~ [[p0_2<=4 & [p1_3<=p0_3 & ~ [EG [~ [4<=p0_2]]]]]]] | EX [~ [[~ [EX [~ [p0_3<=p1_2]]] & [E [5<=p0_1 U 5<=p1_1] | [5<=p2_3 | 6<=p2_1]]]]]]]

abstracting: (6<=p2_1)
states: 3,696 (3)
abstracting: (5<=p2_3)
states: 5,016 (3)
abstracting: (5<=p1_1)
states: 4,818 (3)
abstracting: (5<=p0_1)
states: 5,016 (3)
abstracting: (p0_3<=p1_2)
states: 8,519 (3)
..abstracting: (4<=p0_2)
states: 6,336 (3)
.
EG iterations: 1
abstracting: (p1_3<=p0_3)
states: 7,950 (3)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (p1_3<=0)
states: 2,813 (3)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [AX [E [AX [4<=p2_3] U [EX [~ [p1_3<=p1_1]] & [AG [p2_3<=p1_1] & AF [p2_2<=5]]]]] | AX [[AG [~ [p0_1<=p1_1]] & [AG [~ [[p0_3<=p1_3 & 4<=p2_1]]] | 4<=p0_1]]]]
normalized: [~ [EX [~ [[[4<=p0_1 | ~ [E [true U [p0_3<=p1_3 & 4<=p2_1]]]] & ~ [E [true U p0_1<=p1_1]]]]]] | ~ [EX [~ [E [~ [EX [~ [4<=p2_3]]] U [[~ [EG [~ [p2_2<=5]]] & ~ [E [true U ~ [p2_3<=p1_1]]]] & EX [~ [p1_3<=p1_1]]]]]]]]

abstracting: (p1_3<=p1_1)
states: 8,666 (3)
.abstracting: (p2_3<=p1_1)
states: 8,519 (3)
abstracting: (p2_2<=5)
states: 11,974 (4)
.
EG iterations: 1
abstracting: (4<=p2_3)
states: 6,336 (3)
..abstracting: (p0_1<=p1_1)
states: 7,720 (3)
abstracting: (4<=p2_1)
states: 6,336 (3)
abstracting: (p0_3<=p1_3)
states: 7,720 (3)
abstracting: (4<=p0_1)
states: 6,336 (3)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: [E [[[4<=p1_3 | ~ [[EF [p2_3<=2] & [p2_2<=4 & p2_2<=1]]]] & E [p1_2<=6 U AG [E [p0_3<=4 U 5<=p2_1]]]] U [AG [[[p2_3<=p0_3 & ~ [p0_1<=p2_3]] | [~ [p1_1<=2] & [3<=p1_2 | 3<=p2_1]]]] | ~ [[EX [EF [4<=p0_2]] | ~ [AF [p0_1<=p1_3]]]]]] & A [EX [AF [~ [AF [1<=p0_1]]]] U EF [E [AX [1<=p1_2] U ~ [AG [p2_3<=p0_3]]]]]]
normalized: [[~ [EG [~ [E [true U E [~ [EX [~ [1<=p1_2]]] U E [true U ~ [p2_3<=p0_3]]]]]]] & ~ [E [~ [E [true U E [~ [EX [~ [1<=p1_2]]] U E [true U ~ [p2_3<=p0_3]]]]] U [~ [EX [~ [EG [~ [EG [~ [1<=p0_1]]]]]]] & ~ [E [true U E [~ [EX [~ [1<=p1_2]]] U E [true U ~ [p2_3<=p0_3]]]]]]]]] & E [[E [p1_2<=6 U ~ [E [true U ~ [E [p0_3<=4 U 5<=p2_1]]]]] & [4<=p1_3 | ~ [[[p2_2<=4 & p2_2<=1] & E [true U p2_3<=2]]]]] U [~ [[EG [~ [p0_1<=p1_3]] | EX [E [true U 4<=p0_2]]]] | ~ [E [true U ~ [[[[3<=p1_2 | 3<=p2_1] & ~ [p1_1<=2]] | [p2_3<=p0_3 & ~ [p0_1<=p2_3]]]]]]]]]

abstracting: (p0_1<=p2_3)
states: 8,600 (3)
abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (p1_1<=2)
states: 7,595 (3)
abstracting: (3<=p2_1)
states: 8,305 (3)
abstracting: (3<=p1_2)
states: 8,075 (3)
abstracting: (4<=p0_2)
states: 6,336 (3)
.abstracting: (p0_1<=p1_3)
states: 8,519 (3)
..
EG iterations: 2
abstracting: (p2_3<=2)
states: 7,365 (3)
abstracting: (p2_2<=1)
states: 5,396 (3)
abstracting: (p2_2<=4)
states: 10,654 (4)
abstracting: (4<=p1_3)
states: 6,128 (3)
abstracting: (5<=p2_1)
states: 5,016 (3)
abstracting: (p0_3<=4)
states: 10,654 (4)
abstracting: (p1_2<=6)
states: 12,973 (4)
abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (1<=p1_2)
states: 12,857 (4)
.abstracting: (1<=p0_1)
states: 13,034 (4)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (1<=p1_2)
states: 12,857 (4)
.abstracting: (p2_3<=p0_3)
states: 15,670 (4)
abstracting: (1<=p1_2)
states: 12,857 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA PGCD-PT-D02N006-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [A [[AG [2<=p0_3] | [~ [EG [[1<=p1_3 & p2_3<=p0_2]]] | ~ [1<=p1_3]]] U 1<=p0_1] & [EG [[[[[EX [p2_2<=p0_1] & [p2_1<=p1_1 | 2<=p0_3]] | ~ [EF [p0_3<=1]]] & [~ [p1_3<=0] & [[p0_1<=5 | p0_2<=4] | p0_1<=2]]] | [p0_1<=5 | EF [~ [p0_3<=p2_1]]]]] | EX [~ [p1_2<=p1_1]]]]
normalized: [[EX [~ [p1_2<=p1_1]] | EG [[[p0_1<=5 | E [true U ~ [p0_3<=p2_1]]] | [[[p0_1<=2 | [p0_1<=5 | p0_2<=4]] & ~ [p1_3<=0]] & [~ [E [true U p0_3<=1]] | [[p2_1<=p1_1 | 2<=p0_3] & EX [p2_2<=p0_1]]]]]]] & [~ [EG [~ [1<=p0_1]]] & ~ [E [~ [1<=p0_1] U [~ [[[~ [1<=p1_3] | ~ [EG [[1<=p1_3 & p2_3<=p0_2]]]] | ~ [E [true U ~ [2<=p0_3]]]]] & ~ [1<=p0_1]]]]]]

abstracting: (1<=p0_1)
states: 13,034 (4)
abstracting: (2<=p0_3)
states: 10,274 (4)
abstracting: (p2_3<=p0_2)
states: 8,600 (3)
abstracting: (1<=p1_3)
states: 12,857 (4)
.
EG iterations: 1
abstracting: (1<=p1_3)
states: 12,857 (4)
abstracting: (1<=p0_1)
states: 13,034 (4)
abstracting: (1<=p0_1)
states: 13,034 (4)
.
EG iterations: 1
abstracting: (p2_2<=p0_1)
states: 8,600 (3)
.abstracting: (2<=p0_3)
states: 10,274 (4)
abstracting: (p2_1<=p1_1)
states: 7,720 (3)
abstracting: (p0_3<=1)
states: 5,396 (3)
abstracting: (p1_3<=0)
states: 2,813 (3)
abstracting: (p0_2<=4)
states: 10,654 (4)
abstracting: (p0_1<=5)
states: 11,974 (4)
abstracting: (p0_1<=2)
states: 7,365 (3)
abstracting: (p0_3<=p2_1)
states: 8,600 (3)
abstracting: (p0_1<=5)
states: 11,974 (4)

EG iterations: 0
abstracting: (p1_2<=p1_1)
states: 8,666 (3)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N006-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

totally nodes used: 48806 (4.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 312597 115257 427854
used/not used/entry size/cache size: 148821 66960043 16 1024MB
basic ops cache: hits/miss/sum: 139380 76053 215433
used/not used/entry size/cache size: 131959 16645257 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: 15017 6374 21391
used/not used/entry size/cache size: 6374 8382234 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 67067618
1 38048
2 1878
3 622
4 259
5 121
6 112
7 42
8 29
9 14
>= 10 121

Total processing time: 0m 4.530sec


BK_STOP 1679896364378

--------------------
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:509 (56), effective:169 (18)

initing FirstDep: 0m 0.000sec


iterations count:30 (3), effective:6 (0)

iterations count:62 (6), effective:18 (2)

iterations count:74 (8), effective:21 (2)

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

iterations count:81 (9), effective:16 (1)

iterations count:28 (3), effective:5 (0)

iterations count:31 (3), effective:7 (0)

iterations count:43 (4), effective:17 (1)

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

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

iterations count:93 (10), effective:34 (3)

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

iterations count:37 (4), effective:8 (0)

iterations count:37 (4), effective:8 (0)

iterations count:85 (9), effective:24 (2)

iterations count:37 (4), effective:8 (0)

iterations count:231 (25), effective:60 (6)

iterations count:146 (16), effective:37 (4)

iterations count:63 (7), effective:16 (1)

iterations count:42 (4), effective:12 (1)

iterations count:78 (8), effective:23 (2)

iterations count:51 (5), effective:24 (2)

iterations count:69 (7), effective:21 (2)

iterations count:96 (10), effective:28 (3)

iterations count:274 (30), effective:110 (12)

iterations count:118 (13), effective:33 (3)

iterations count:60 (6), effective:17 (1)

iterations count:50 (5), effective:14 (1)

iterations count:85 (9), effective:27 (3)

iterations count:25 (2), effective:5 (0)

iterations count:63 (7), effective:18 (2)

iterations count:66 (7), effective:18 (2)

iterations count:63 (7), effective:18 (2)

iterations count:106 (11), effective:40 (4)

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="PGCD-PT-D02N006"
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 PGCD-PT-D02N006, 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-167987241100441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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