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.r161-tall-167838845600769.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 GPPP-PT-C0001N0000000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845600769
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0001N0000000001-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679882987660

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=GPPP-PT-C0001N0000000001
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: GPPP_PT_C0001N0000000001
(NrP: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 2.849sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

checking: EG [AX [EF [AG [[Pyr<=1 & NADPplus<=4]]]]]
normalized: EG [~ [EX [~ [E [true U ~ [E [true U ~ [[Pyr<=1 & NADPplus<=4]]]]]]]]]

abstracting: (NADPplus<=4)
states: 10,380 (4)
abstracting: (Pyr<=1)
states: 9,888 (3)
..
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: [~ [AG [DHAP<=4]] | EX [7<=a2]]
normalized: [EX [7<=a2] | E [true U ~ [DHAP<=4]]]

abstracting: (DHAP<=4)
states: 10,326 (4)
abstracting: (7<=a2)
states: 0
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [~ [[AX [G6P<=0] & G6P<=0]]]
normalized: ~ [EX [[~ [EX [~ [G6P<=0]]] & G6P<=0]]]

abstracting: (G6P<=0)
states: 9,144 (3)
abstracting: (G6P<=0)
states: 9,144 (3)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[b2<=NADPH | ~ [AG [[[~ [6<=S7P] & EG [3<=start]] & ~ [AX [1<=_2PG]]]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [[EX [~ [1<=_2PG]] & [EG [3<=start] & ~ [6<=S7P]]]]] | b2<=NADPH]]]]

abstracting: (b2<=NADPH)
states: 9,370 (3)
abstracting: (6<=S7P)
states: 0
abstracting: (3<=start)
states: 0
.
EG iterations: 1
abstracting: (1<=_2PG)
states: 2,670 (3)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [E [EF [EF [Lac<=FBP]] U AG [~ [[~ [a2<=0] & [Ru5P<=a2 & Pi<=7]]]]]]
normalized: E [true U E [E [true U E [true U Lac<=FBP]] U ~ [E [true U [[Ru5P<=a2 & Pi<=7] & ~ [a2<=0]]]]]]

abstracting: (a2<=0)
states: 6,804 (3)
abstracting: (Pi<=7)
states: 10,380 (4)
abstracting: (Ru5P<=a2)
states: 10,272 (4)
abstracting: (Lac<=FBP)
states: 4,368 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AF [~ [AG [[EX [[GSH<=4 | 6<=start]] & [[AF [b1<=4] | [3<=_3PG & 7<=a2]] | ATP<=5]]]]]
normalized: ~ [EG [~ [E [true U ~ [[[[[3<=_3PG & 7<=a2] | ~ [EG [~ [b1<=4]]]] | ATP<=5] & EX [[GSH<=4 | 6<=start]]]]]]]]

abstracting: (6<=start)
states: 0
abstracting: (GSH<=4)
states: 10,380 (4)
.abstracting: (ATP<=5)
states: 9,552 (3)
abstracting: (b1<=4)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (7<=a2)
states: 0
abstracting: (3<=_3PG)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [EF [[~ [AX [Ru5P<=6]] & ~ [[AG [start<=c2] & ~ [EG [ADP<=NADH]]]]]] U 1<=F6P]
normalized: E [E [true U [~ [[~ [EG [ADP<=NADH]] & ~ [E [true U ~ [start<=c2]]]]] & EX [~ [Ru5P<=6]]]] U 1<=F6P]

abstracting: (1<=F6P)
states: 3,090 (3)
abstracting: (Ru5P<=6)
states: 10,380 (4)
.abstracting: (start<=c2)
states: 10,374 (4)
abstracting: (ADP<=NADH)
states: 114
................
EG iterations: 16
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [~ [EX [[A [[[7<=a1 | E4P<=5] | [GAP<=4 | 1<=S7P]] U EX [Xu5P<=Lac]] | AF [[EX [c1<=3] | 4<=NADPplus]]]]] | AG [c2<=7]]
normalized: [~ [E [true U ~ [c2<=7]]] | ~ [EX [[~ [EG [~ [[EX [c1<=3] | 4<=NADPplus]]]] | [~ [EG [~ [EX [Xu5P<=Lac]]]] & ~ [E [~ [EX [Xu5P<=Lac]] U [~ [[[GAP<=4 | 1<=S7P] | [7<=a1 | E4P<=5]]] & ~ [EX [Xu5P<=Lac]]]]]]]]]]

abstracting: (Xu5P<=Lac)
states: 9,882 (3)
.abstracting: (E4P<=5)
states: 10,380 (4)
abstracting: (7<=a1)
states: 0
abstracting: (1<=S7P)
states: 84
abstracting: (GAP<=4)
states: 10,326 (4)
abstracting: (Xu5P<=Lac)
states: 9,882 (3)
.abstracting: (Xu5P<=Lac)
states: 9,882 (3)
...
EG iterations: 2
abstracting: (4<=NADPplus)
states: 0
abstracting: (c1<=3)
states: 7,380 (3)
...........................
EG iterations: 26
.abstracting: (c2<=7)
states: 10,380 (4)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [AG [A [EG [~ [Lac<=1]] U F6P<=F6P]] & EF [[[AX [~ [E [NADPH<=Pyr U 3<=GSH]]] & AG [EF [3<=Ru5P]]] & ~ [[EF [PEP<=6] & EX [EX [b2<=S7P]]]]]]]
normalized: [E [true U [~ [[EX [EX [b2<=S7P]] & E [true U PEP<=6]]] & [~ [E [true U ~ [E [true U 3<=Ru5P]]]] & ~ [EX [E [NADPH<=Pyr U 3<=GSH]]]]]] & ~ [E [true U ~ [[~ [EG [~ [F6P<=F6P]]] & ~ [E [~ [F6P<=F6P] U [~ [EG [~ [Lac<=1]]] & ~ [F6P<=F6P]]]]]]]]]

abstracting: (F6P<=F6P)
states: 10,380 (4)
abstracting: (Lac<=1)
states: 6,828 (3)
.................
EG iterations: 17
abstracting: (F6P<=F6P)
states: 10,380 (4)
abstracting: (F6P<=F6P)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (3<=GSH)
states: 0
abstracting: (NADPH<=Pyr)
states: 4,676 (3)
.abstracting: (3<=Ru5P)
states: 6
abstracting: (PEP<=6)
states: 10,380 (4)
abstracting: (b2<=S7P)
states: 7,734 (3)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [[EG [[3<=_2PG & E [~ [NADplus<=_1_3_BPG] U EX [NADH<=b2]]]] & E [EX [[6<=GSSG & [DHAP<=GSH & 7<=ATP]]] U EX [AF [GSH<=a2]]]]]
normalized: E [true U [E [EX [[[DHAP<=GSH & 7<=ATP] & 6<=GSSG]] U EX [~ [EG [~ [GSH<=a2]]]]] & EG [[E [~ [NADplus<=_1_3_BPG] U EX [NADH<=b2]] & 3<=_2PG]]]]

abstracting: (3<=_2PG)
states: 0
abstracting: (NADH<=b2)
states: 2,076 (3)
.abstracting: (NADplus<=_1_3_BPG)
states: 6,486 (3)
.
EG iterations: 1
abstracting: (GSH<=a2)
states: 5,244 (3)
.............
EG iterations: 13
.abstracting: (6<=GSSG)
states: 0
abstracting: (7<=ATP)
states: 474
abstracting: (DHAP<=GSH)
states: 7,461 (3)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AF [E [~ [[[EG [6<=Lac] | 2<=R5P] | 2<=NADplus]] U [E [[ATP<=GSH & AG [Pi<=NADH]] U EG [6<=Ru5P]] | [[4<=FBP | AG [Ru5P<=b2]] | ~ [E [_1_3_BPG<=2 U 7<=NADH]]]]]]
normalized: ~ [EG [~ [E [~ [[2<=NADplus | [2<=R5P | EG [6<=Lac]]]] U [[~ [E [_1_3_BPG<=2 U 7<=NADH]] | [~ [E [true U ~ [Ru5P<=b2]]] | 4<=FBP]] | E [[ATP<=GSH & ~ [E [true U ~ [Pi<=NADH]]]] U EG [6<=Ru5P]]]]]]]

abstracting: (6<=Ru5P)
states: 0
.
EG iterations: 1
abstracting: (Pi<=NADH)
states: 822
abstracting: (ATP<=GSH)
states: 4,719 (3)
abstracting: (4<=FBP)
states: 0
abstracting: (Ru5P<=b2)
states: 9,270 (3)
abstracting: (7<=NADH)
states: 0
abstracting: (_1_3_BPG<=2)
states: 10,380 (4)
abstracting: (6<=Lac)
states: 48
............
EG iterations: 12
abstracting: (2<=R5P)
states: 0
abstracting: (2<=NADplus)
states: 1,308 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [[EG [EF [NADPH<=NADPH]] & E [[[[[1<=Lac | R5P<=0] | A [Pi<=Pi U Xu5P<=R5P]] & EX [6<=Xu5P]] | ~ [b1<=_1_3_BPG]] U AG [A [_1_3_BPG<=7 U NADplus<=3]]]]]
normalized: ~ [EX [~ [[E [[~ [b1<=_1_3_BPG] | [EX [6<=Xu5P] & [[~ [EG [~ [Xu5P<=R5P]]] & ~ [E [~ [Xu5P<=R5P] U [~ [Pi<=Pi] & ~ [Xu5P<=R5P]]]]] | [1<=Lac | R5P<=0]]]] U ~ [E [true U ~ [[~ [EG [~ [NADplus<=3]]] & ~ [E [~ [NADplus<=3] U [~ [_1_3_BPG<=7] & ~ [NADplus<=3]]]]]]]]] & EG [E [true U NADPH<=NADPH]]]]]]

abstracting: (NADPH<=NADPH)
states: 10,380 (4)

EG iterations: 0
abstracting: (NADplus<=3)
states: 10,380 (4)
abstracting: (_1_3_BPG<=7)
states: 10,380 (4)
abstracting: (NADplus<=3)
states: 10,380 (4)
abstracting: (NADplus<=3)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (R5P<=0)
states: 10,224 (4)
abstracting: (1<=Lac)
states: 6,882 (3)
abstracting: (Xu5P<=R5P)
states: 9,318 (3)
abstracting: (Pi<=Pi)
states: 10,380 (4)
abstracting: (Xu5P<=R5P)
states: 9,318 (3)
abstracting: (Xu5P<=R5P)
states: 9,318 (3)
.................
EG iterations: 17
abstracting: (6<=Xu5P)
states: 0
.abstracting: (b1<=_1_3_BPG)
states: 138
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AX [~ [EF [[AX [5<=b2] | GSSG<=2]]]] | [A [~ [EX [[E [c2<=start U FBP<=DHAP] | ~ [ADP<=Gluc]]]] U ~ [AG [~ [[3<=Gluc & NADPH<=NADH]]]]] & ~ [AG [[[A [7<=Lac U _3PG<=5] | EF [Pi<=6]] | 5<=_1_3_BPG]]]]]
normalized: [[E [true U ~ [[5<=_1_3_BPG | [E [true U Pi<=6] | [~ [EG [~ [_3PG<=5]]] & ~ [E [~ [_3PG<=5] U [~ [7<=Lac] & ~ [_3PG<=5]]]]]]]]] & [~ [EG [~ [E [true U [3<=Gluc & NADPH<=NADH]]]]] & ~ [E [~ [E [true U [3<=Gluc & NADPH<=NADH]]] U [EX [[~ [ADP<=Gluc] | E [c2<=start U FBP<=DHAP]]] & ~ [E [true U [3<=Gluc & NADPH<=NADH]]]]]]]] | ~ [EX [E [true U [GSSG<=2 | ~ [EX [~ [5<=b2]]]]]]]]

abstracting: (5<=b2)
states: 0
.abstracting: (GSSG<=2)
states: 10,380 (4)
.abstracting: (NADPH<=NADH)
states: 8,500 (3)
abstracting: (3<=Gluc)
states: 42
abstracting: (FBP<=DHAP)
states: 8,880 (3)
abstracting: (c2<=start)
states: 606
abstracting: (ADP<=Gluc)
states: 24
.abstracting: (NADPH<=NADH)
states: 8,500 (3)
abstracting: (3<=Gluc)
states: 42
abstracting: (NADPH<=NADH)
states: 8,500 (3)
abstracting: (3<=Gluc)
states: 42
.
EG iterations: 1
abstracting: (_3PG<=5)
states: 10,380 (4)
abstracting: (7<=Lac)
states: 6
abstracting: (_3PG<=5)
states: 10,380 (4)
abstracting: (_3PG<=5)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (Pi<=6)
states: 9,846 (3)
abstracting: (5<=_1_3_BPG)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [[AG [EX [E [EF [b2<=R5P] U EG [start<=DHAP]]]] | ~ [EG [~ [A [Lac<=NADplus U 2<=Ru5P]]]]] & A [[AG [EX [A [b2<=4 U a2<=start]]] | ~ [[2<=start | EG [GAP<=c2]]]] U EG [[b2<=2 | ~ [[[NADPplus<=GSSG & Pyr<=Ru5P] | AF [2<=GSH]]]]]]]
normalized: [[~ [EG [~ [EG [[b2<=2 | ~ [[~ [EG [~ [2<=GSH]]] | [NADPplus<=GSSG & Pyr<=Ru5P]]]]]]]] & ~ [E [~ [EG [[b2<=2 | ~ [[~ [EG [~ [2<=GSH]]] | [NADPplus<=GSSG & Pyr<=Ru5P]]]]]] U [~ [[~ [[2<=start | EG [GAP<=c2]]] | ~ [E [true U ~ [EX [[~ [EG [~ [a2<=start]]] & ~ [E [~ [a2<=start] U [~ [b2<=4] & ~ [a2<=start]]]]]]]]]]] & ~ [EG [[b2<=2 | ~ [[~ [EG [~ [2<=GSH]]] | [NADPplus<=GSSG & Pyr<=Ru5P]]]]]]]]]] & [~ [EG [~ [[~ [EG [~ [2<=Ru5P]]] & ~ [E [~ [2<=Ru5P] U [~ [Lac<=NADplus] & ~ [2<=Ru5P]]]]]]]] | ~ [E [true U ~ [EX [E [E [true U b2<=R5P] U EG [start<=DHAP]]]]]]]]

abstracting: (start<=DHAP)
states: 10,374 (4)
.................
EG iterations: 17
abstracting: (b2<=R5P)
states: 7,746 (3)
.abstracting: (2<=Ru5P)
states: 48
abstracting: (Lac<=NADplus)
states: 5,142 (3)
abstracting: (2<=Ru5P)
states: 48
abstracting: (2<=Ru5P)
states: 48
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Pyr<=Ru5P)
states: 7,512 (3)
abstracting: (NADPplus<=GSSG)
states: 5,190 (3)
abstracting: (2<=GSH)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (b2<=2)
states: 10,284 (4)
.......
EG iterations: 7
abstracting: (a2<=start)
states: 6,804 (3)
abstracting: (b2<=4)
states: 10,380 (4)
abstracting: (a2<=start)
states: 6,804 (3)
abstracting: (a2<=start)
states: 6,804 (3)
.......................
EG iterations: 23
.abstracting: (GAP<=c2)
states: 10,212 (4)
..........................................
EG iterations: 42
abstracting: (2<=start)
states: 0
abstracting: (Pyr<=Ru5P)
states: 7,512 (3)
abstracting: (NADPplus<=GSSG)
states: 5,190 (3)
abstracting: (2<=GSH)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (b2<=2)
states: 10,284 (4)
.......
EG iterations: 7
abstracting: (Pyr<=Ru5P)
states: 7,512 (3)
abstracting: (NADPplus<=GSSG)
states: 5,190 (3)
abstracting: (2<=GSH)
states: 5,190 (3)
.............
EG iterations: 13
abstracting: (b2<=2)
states: 10,284 (4)
.......
EG iterations: 7
........
EG iterations: 8
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: E [~ [E [EX [[4<=b2 & 6<=NADPplus]] U [[E [E4P<=7 U R5P<=FBP] | [Lac<=2 | Pi<=4]] | [Gluc<=FBP | AX [c2<=ATP]]]]] U ~ [[A [5<=DHAP U ~ [[5<=b1 | _2PG<=5]]] & [[~ [EF [2<=_2PG]] & ~ [PEP<=3]] | ~ [[AG [a1<=7] & [S7P<=6 & 2<=Gluc]]]]]]]
normalized: E [~ [E [EX [[4<=b2 & 6<=NADPplus]] U [[Gluc<=FBP | ~ [EX [~ [c2<=ATP]]]] | [[Lac<=2 | Pi<=4] | E [E4P<=7 U R5P<=FBP]]]]] U ~ [[[~ [[[S7P<=6 & 2<=Gluc] & ~ [E [true U ~ [a1<=7]]]]] | [~ [PEP<=3] & ~ [E [true U 2<=_2PG]]]] & [~ [EG [[5<=b1 | _2PG<=5]]] & ~ [E [[5<=b1 | _2PG<=5] U [~ [5<=DHAP] & [5<=b1 | _2PG<=5]]]]]]]]

abstracting: (_2PG<=5)
states: 10,380 (4)
abstracting: (5<=b1)
states: 0
abstracting: (5<=DHAP)
states: 54
abstracting: (_2PG<=5)
states: 10,380 (4)
abstracting: (5<=b1)
states: 0
abstracting: (_2PG<=5)
states: 10,380 (4)
abstracting: (5<=b1)
states: 0

EG iterations: 0
abstracting: (2<=_2PG)
states: 420
abstracting: (PEP<=3)
states: 10,380 (4)
abstracting: (a1<=7)
states: 10,380 (4)
abstracting: (2<=Gluc)
states: 138
abstracting: (S7P<=6)
states: 10,380 (4)
abstracting: (R5P<=FBP)
states: 10,248 (4)
abstracting: (E4P<=7)
states: 10,380 (4)
abstracting: (Pi<=4)
states: 5,244 (3)
abstracting: (Lac<=2)
states: 8,808 (3)
abstracting: (c2<=ATP)
states: 3,168 (3)
.abstracting: (Gluc<=FBP)
states: 8,976 (3)
abstracting: (6<=NADPplus)
states: 0
abstracting: (4<=b2)
states: 0
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [AG [EF [[~ [Pi<=5] & [[AF [4<=NADplus] | c1<=ADP] | [AF [5<=Gluc] | [_1_3_BPG<=NADPplus | 7<=E4P]]]]]] & EF [[A [AX [~ [a2<=0]] U [A [5<=Xu5P U GAP<=ADP] & E [6<=start U 5<=a2]]] & [Lac<=7 & [ATP<=Xu5P & [~ [E [1<=FBP U c1<=6]] & EX [DHAP<=7]]]]]]]
normalized: [E [true U [[Lac<=7 & [ATP<=Xu5P & [EX [DHAP<=7] & ~ [E [1<=FBP U c1<=6]]]]] & [~ [EG [~ [[E [6<=start U 5<=a2] & [~ [EG [~ [GAP<=ADP]]] & ~ [E [~ [GAP<=ADP] U [~ [5<=Xu5P] & ~ [GAP<=ADP]]]]]]]]] & ~ [E [~ [[E [6<=start U 5<=a2] & [~ [EG [~ [GAP<=ADP]]] & ~ [E [~ [GAP<=ADP] U [~ [5<=Xu5P] & ~ [GAP<=ADP]]]]]]] U [EX [a2<=0] & ~ [[E [6<=start U 5<=a2] & [~ [EG [~ [GAP<=ADP]]] & ~ [E [~ [GAP<=ADP] U [~ [5<=Xu5P] & ~ [GAP<=ADP]]]]]]]]]]]]] & ~ [E [true U ~ [E [true U [[[[_1_3_BPG<=NADPplus | 7<=E4P] | ~ [EG [~ [5<=Gluc]]]] | [c1<=ADP | ~ [EG [~ [4<=NADplus]]]]] & ~ [Pi<=5]]]]]]]

abstracting: (Pi<=5)
states: 8,934 (3)
abstracting: (4<=NADplus)
states: 0

EG iterations: 0
abstracting: (c1<=ADP)
states: 9,882 (3)
abstracting: (5<=Gluc)
states: 0

EG iterations: 0
abstracting: (7<=E4P)
states: 0
abstracting: (_1_3_BPG<=NADPplus)
states: 9,646 (3)
abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (5<=Xu5P)
states: 0
abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (GAP<=ADP)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (5<=a2)
states: 0
abstracting: (6<=start)
states: 0
abstracting: (a2<=0)
states: 6,804 (3)
.abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (5<=Xu5P)
states: 0
abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (GAP<=ADP)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (5<=a2)
states: 0
abstracting: (6<=start)
states: 0
abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (5<=Xu5P)
states: 0
abstracting: (GAP<=ADP)
states: 10,380 (4)
abstracting: (GAP<=ADP)
states: 10,380 (4)
.
EG iterations: 1
abstracting: (5<=a2)
states: 0
abstracting: (6<=start)
states: 0

EG iterations: 0
abstracting: (c1<=6)
states: 9,774 (3)
abstracting: (1<=FBP)
states: 2,226 (3)
abstracting: (DHAP<=7)
states: 10,380 (4)
.abstracting: (ATP<=Xu5P)
states: 2,910 (3)
abstracting: (Lac<=7)
states: 10,380 (4)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 70696 (7.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 128057 204977 333034
used/not used/entry size/cache size: 270120 66838744 16 1024MB
basic ops cache: hits/miss/sum: 35419 81085 116504
used/not used/entry size/cache size: 135056 16642160 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: 3163 6425 9588
used/not used/entry size/cache size: 6425 8382183 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 67046346
1 59401
2 2362
3 347
4 125
5 51
6 42
7 14
8 24
9 11
>= 10 141

Total processing time: 0m 4.702sec


BK_STOP 1679882992409

--------------------
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.001sec


iterations count:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:287 (13), effective:61 (2)

iterations count:479 (21), effective:114 (5)

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

iterations count:298 (13), effective:72 (3)

iterations count:226 (10), effective:55 (2)

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

iterations count:399 (18), effective:97 (4)

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

iterations count:478 (21), effective:115 (5)

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

iterations count:608 (27), effective:157 (7)

iterations count:29 (1), effective:3 (0)

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

iterations count:78 (3), effective:22 (1)

iterations count:365 (16), effective:88 (4)

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

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

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

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

iterations count:401 (18), effective:100 (4)

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

iterations count:401 (18), effective:100 (4)

iterations count:401 (18), effective:100 (4)

iterations count:183 (8), effective:33 (1)

iterations count:111 (5), effective:22 (1)

iterations count:54 (2), effective:12 (0)

iterations count:268 (12), effective:55 (2)

iterations count:338 (15), effective:81 (3)

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

iterations count:299 (13), effective:66 (3)

iterations count:64 (2), effective:9 (0)

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

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

iterations count:234 (10), effective:60 (2)

iterations count:124 (5), effective:25 (1)

iterations count:94 (4), effective:17 (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="GPPP-PT-C0001N0000000001"
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 GPPP-PT-C0001N0000000001, 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 r161-tall-167838845600769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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