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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:35 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.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:37 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-C0001N0000000010-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679883047578

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-C0001N0000000010
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_C0001N0000000010
(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.916sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)



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

checking: ~ [AG [Gluc<=12]]
normalized: E [true U ~ [Gluc<=12]]

abstracting: (Gluc<=12)
states: 1,655,346 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [AF [EG [EF [[NADplus<=21 & 32<=NADPH]]]]]
normalized: ~ [E [true U EG [~ [EG [E [true U [NADplus<=21 & 32<=NADPH]]]]]]]

abstracting: (32<=NADPH)
states: 0
abstracting: (NADplus<=21)
states: 1,655,346 (6)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: E [EG [Gluc<=8] U ~ [EG [EX [EG [Pi<=Pi]]]]]
normalized: E [EG [Gluc<=8] U ~ [EG [EX [EG [Pi<=Pi]]]]]

abstracting: (Pi<=Pi)
states: 1,655,346 (6)

EG iterations: 0
.
EG iterations: 0
abstracting: (Gluc<=8)
states: 1,655,346 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EX [E [~ [AG [EX [_1_3_BPG<=12]]] U [EF [A [36<=Pi U G6P<=6]] & 12<=NADH]]]]
normalized: ~ [EX [E [E [true U ~ [EX [_1_3_BPG<=12]]] U [E [true U [~ [EG [~ [G6P<=6]]] & ~ [E [~ [G6P<=6] U [~ [36<=Pi] & ~ [G6P<=6]]]]]] & 12<=NADH]]]]

abstracting: (12<=NADH)
states: 0
abstracting: (G6P<=6)
states: 1,655,346 (6)
abstracting: (36<=Pi)
states: 0
abstracting: (G6P<=6)
states: 1,655,346 (6)
abstracting: (G6P<=6)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (_1_3_BPG<=12)
states: 1,655,346 (6)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [AX [E [[[34<=GSSG & 27<=Pi] & EX [PEP<=start]] U [A [40<=a2 U ATP<=5] | EF [39<=DHAP]]]]]]
normalized: ~ [E [true U ~ [EX [~ [E [[EX [PEP<=start] & [34<=GSSG & 27<=Pi]] U [E [true U 39<=DHAP] | [~ [EG [~ [ATP<=5]]] & ~ [E [~ [ATP<=5] U [~ [40<=a2] & ~ [ATP<=5]]]]]]]]]]]]

abstracting: (ATP<=5)
states: 0
abstracting: (40<=a2)
states: 0
abstracting: (ATP<=5)
states: 0
abstracting: (ATP<=5)
states: 0

EG iterations: 0
abstracting: (39<=DHAP)
states: 0
abstracting: (27<=Pi)
states: 0
abstracting: (34<=GSSG)
states: 0
abstracting: (PEP<=start)
states: 954,954 (5)
..-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EF [[EG [[[[[c2<=PEP | 31<=FBP] | [NADPplus<=7 | F6P<=34]] | EG [26<=Gluc]] & ~ [[c2<=17 & GAP<=6]]]] & 27<=NADPplus]]
normalized: E [true U [EG [[~ [[c2<=17 & GAP<=6]] & [EG [26<=Gluc] | [[NADPplus<=7 | F6P<=34] | [c2<=PEP | 31<=FBP]]]]] & 27<=NADPplus]]

abstracting: (27<=NADPplus)
states: 0
abstracting: (31<=FBP)
states: 0
abstracting: (c2<=PEP)
states: 412,566 (5)
abstracting: (F6P<=34)
states: 1,655,346 (6)
abstracting: (NADPplus<=7)
states: 630,608 (5)
abstracting: (26<=Gluc)
states: 0
.
EG iterations: 1
abstracting: (GAP<=6)
states: 1,655,115 (6)
abstracting: (c2<=17)
states: 1,655,346 (6)
....................................................
EG iterations: 52
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: E [Gluc<=9 U [EG [38<=c1] | EX [[AG [AF [10<=F6P]] | [[E [Pyr<=R5P U 31<=GSSG] & GAP<=_3PG] & 24<=E4P]]]]]
normalized: E [Gluc<=9 U [EX [[[[E [Pyr<=R5P U 31<=GSSG] & GAP<=_3PG] & 24<=E4P] | ~ [E [true U EG [~ [10<=F6P]]]]]] | EG [38<=c1]]]

abstracting: (38<=c1)
states: 0
.
EG iterations: 1
abstracting: (10<=F6P)
states: 0

EG iterations: 0
abstracting: (24<=E4P)
states: 0
abstracting: (GAP<=_3PG)
states: 1,144,374 (6)
abstracting: (31<=GSSG)
states: 0
abstracting: (Pyr<=R5P)
states: 954,954 (5)
.abstracting: (Gluc<=9)
states: 1,655,346 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: A [EX [[[EG [[NADH<=GSH | F6P<=NADPplus]] | ~ [37<=c2]] & [~ [AX [NADH<=start]] & ~ [E [40<=a1 U 25<=NADPplus]]]]] U EG [AG [a2<=21]]]
normalized: [~ [E [~ [EG [~ [E [true U ~ [a2<=21]]]]] U [~ [EX [[[~ [E [40<=a1 U 25<=NADPplus]] & EX [~ [NADH<=start]]] & [~ [37<=c2] | EG [[NADH<=GSH | F6P<=NADPplus]]]]]] & ~ [EG [~ [E [true U ~ [a2<=21]]]]]]]] & ~ [EG [~ [EG [~ [E [true U ~ [a2<=21]]]]]]]]

abstracting: (a2<=21)
states: 1,655,346 (6)

EG iterations: 0
.
EG iterations: 1
abstracting: (a2<=21)
states: 1,655,346 (6)

EG iterations: 0
abstracting: (F6P<=NADPplus)
states: 1,640,122 (6)
abstracting: (NADH<=GSH)
states: 1,362,942 (6)
.
EG iterations: 1
abstracting: (37<=c2)
states: 0
abstracting: (NADH<=start)
states: 87,318 (4)
.abstracting: (25<=NADPplus)
states: 0
abstracting: (40<=a1)
states: 0
.abstracting: (a2<=21)
states: 1,655,346 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AX [[NADH<=GSSG & [E [[E [35<=Lac U b1<=13] & ~ [[28<=Lac | Lac<=_3PG]]] U _1_3_BPG<=24] & EF [~ [[16<=_3PG | start<=33]]]]]]
normalized: ~ [EX [~ [[[E [true U ~ [[16<=_3PG | start<=33]]] & E [[~ [[28<=Lac | Lac<=_3PG]] & E [35<=Lac U b1<=13]] U _1_3_BPG<=24]] & NADH<=GSSG]]]]

abstracting: (NADH<=GSSG)
states: 1,144,626 (6)
abstracting: (_1_3_BPG<=24)
states: 1,655,346 (6)
abstracting: (b1<=13)
states: 1,655,346 (6)
abstracting: (35<=Lac)
states: 0
abstracting: (Lac<=_3PG)
states: 1,158,234 (6)
abstracting: (28<=Lac)
states: 0
abstracting: (start<=33)
states: 1,655,346 (6)
abstracting: (16<=_3PG)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: ~ [[AX [~ [[[[AG [b2<=5] & 32<=R5P] & A [b2<=29 U NADPplus<=36]] | EF [EG [7<=GAP]]]]] & [~ [EF [~ [EF [b1<=Xu5P]]]] | EG [[~ [AG [E4P<=25]] & A [[Xu5P<=5 & 16<=Ru5P] U EF [12<=Lac]]]]]]]
normalized: ~ [[[EG [[[~ [EG [~ [E [true U 12<=Lac]]]] & ~ [E [~ [E [true U 12<=Lac]] U [~ [[Xu5P<=5 & 16<=Ru5P]] & ~ [E [true U 12<=Lac]]]]]] & E [true U ~ [E4P<=25]]]] | ~ [E [true U ~ [E [true U b1<=Xu5P]]]]] & ~ [EX [[E [true U EG [7<=GAP]] | [[~ [EG [~ [NADPplus<=36]]] & ~ [E [~ [NADPplus<=36] U [~ [b2<=29] & ~ [NADPplus<=36]]]]] & [32<=R5P & ~ [E [true U ~ [b2<=5]]]]]]]]]]

abstracting: (b2<=5)
states: 1,655,346 (6)
abstracting: (32<=R5P)
states: 0
abstracting: (NADPplus<=36)
states: 1,655,346 (6)
abstracting: (b2<=29)
states: 1,655,346 (6)
abstracting: (NADPplus<=36)
states: 1,655,346 (6)
abstracting: (NADPplus<=36)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (7<=GAP)
states: 231
....................................................
EG iterations: 52
.abstracting: (b1<=Xu5P)
states: 4,620 (3)
abstracting: (E4P<=25)
states: 1,655,346 (6)
abstracting: (12<=Lac)
states: 0
abstracting: (16<=Ru5P)
states: 0
abstracting: (Xu5P<=5)
states: 1,655,346 (6)
abstracting: (12<=Lac)
states: 0
abstracting: (12<=Lac)
states: 0

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

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [A [18<=c1 U [[[[20<=R5P & ~ [GSSG<=_3PG]] & [[1<=GSSG | NADH<=33] & 30<=Pyr]] & [AX [S7P<=R5P] & 39<=FBP]] | [~ [AG [DHAP<=DHAP]] & ~ [27<=_3PG]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[~ [27<=_3PG] & E [true U ~ [DHAP<=DHAP]]] | [[39<=FBP & ~ [EX [~ [S7P<=R5P]]]] & [[30<=Pyr & [1<=GSSG | NADH<=33]] & [20<=R5P & ~ [GSSG<=_3PG]]]]]]]] & ~ [E [~ [[[~ [27<=_3PG] & E [true U ~ [DHAP<=DHAP]]] | [[39<=FBP & ~ [EX [~ [S7P<=R5P]]]] & [[30<=Pyr & [1<=GSSG | NADH<=33]] & [20<=R5P & ~ [GSSG<=_3PG]]]]]] U [~ [18<=c1] & ~ [[[~ [27<=_3PG] & E [true U ~ [DHAP<=DHAP]]] | [[39<=FBP & ~ [EX [~ [S7P<=R5P]]]] & [[30<=Pyr & [1<=GSSG | NADH<=33]] & [20<=R5P & ~ [GSSG<=_3PG]]]]]]]]]]]]]

abstracting: (GSSG<=_3PG)
states: 252,630 (5)
abstracting: (20<=R5P)
states: 0
abstracting: (NADH<=33)
states: 1,655,346 (6)
abstracting: (1<=GSSG)
states: 1,504,860 (6)
abstracting: (30<=Pyr)
states: 0
abstracting: (S7P<=R5P)
states: 1,647,954 (6)
.abstracting: (39<=FBP)
states: 0
abstracting: (DHAP<=DHAP)
states: 1,655,346 (6)
abstracting: (27<=_3PG)
states: 0
abstracting: (18<=c1)
states: 0
abstracting: (GSSG<=_3PG)
states: 252,630 (5)
abstracting: (20<=R5P)
states: 0
abstracting: (NADH<=33)
states: 1,655,346 (6)
abstracting: (1<=GSSG)
states: 1,504,860 (6)
abstracting: (30<=Pyr)
states: 0
abstracting: (S7P<=R5P)
states: 1,647,954 (6)
.abstracting: (39<=FBP)
states: 0
abstracting: (DHAP<=DHAP)
states: 1,655,346 (6)
abstracting: (27<=_3PG)
states: 0
abstracting: (GSSG<=_3PG)
states: 252,630 (5)
abstracting: (20<=R5P)
states: 0
abstracting: (NADH<=33)
states: 1,655,346 (6)
abstracting: (1<=GSSG)
states: 1,504,860 (6)
abstracting: (30<=Pyr)
states: 0
abstracting: (S7P<=R5P)
states: 1,647,954 (6)
.abstracting: (39<=FBP)
states: 0
abstracting: (DHAP<=DHAP)
states: 1,655,346 (6)
abstracting: (27<=_3PG)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: ~ [EG [[E [[AF [8<=GSH] | 30<=Pyr] U EF [[Pi<=DHAP | ATP<=PEP]]] | AX [[[~ [23<=NADPH] | A [FBP<=NADH U Xu5P<=4]] & [~ [38<=ATP] | E [16<=NADPH U 31<=b1]]]]]]]
normalized: ~ [EG [[~ [EX [~ [[[E [16<=NADPH U 31<=b1] | ~ [38<=ATP]] & [[~ [EG [~ [Xu5P<=4]]] & ~ [E [~ [Xu5P<=4] U [~ [FBP<=NADH] & ~ [Xu5P<=4]]]]] | ~ [23<=NADPH]]]]]] | E [[30<=Pyr | ~ [EG [~ [8<=GSH]]]] U E [true U [Pi<=DHAP | ATP<=PEP]]]]]]

abstracting: (ATP<=PEP)
states: 0
abstracting: (Pi<=DHAP)
states: 396,627 (5)
abstracting: (8<=GSH)
states: 1,053,402 (6)
.
EG iterations: 1
abstracting: (30<=Pyr)
states: 0
abstracting: (23<=NADPH)
states: 0
abstracting: (Xu5P<=4)
states: 1,655,346 (6)
abstracting: (FBP<=NADH)
states: 1,620,696 (6)
abstracting: (Xu5P<=4)
states: 1,655,346 (6)
abstracting: (Xu5P<=4)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (38<=ATP)
states: 982,443 (5)
abstracting: (31<=b1)
states: 0
abstracting: (16<=NADPH)
states: 394,130 (5)
.
EG iterations: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: ~ [A [~ [[~ [[G6P<=20 & NADplus<=18]] & [[[a2<=_3PG & _3PG<=14] | [R5P<=Pi | ATP<=NADplus]] & EG [1<=FBP]]]] U E [[[[NADPH<=FBP & [8<=S7P | Pi<=21]] | Pyr<=4] | Ru5P<=28] U ~ [AG [E [start<=12 U 26<=FBP]]]]]]
normalized: ~ [[~ [EG [~ [E [[Ru5P<=28 | [Pyr<=4 | [NADPH<=FBP & [8<=S7P | Pi<=21]]]] U E [true U ~ [E [start<=12 U 26<=FBP]]]]]]] & ~ [E [~ [E [[Ru5P<=28 | [Pyr<=4 | [NADPH<=FBP & [8<=S7P | Pi<=21]]]] U E [true U ~ [E [start<=12 U 26<=FBP]]]]] U [[[EG [1<=FBP] & [[R5P<=Pi | ATP<=NADplus] | [a2<=_3PG & _3PG<=14]]] & ~ [[G6P<=20 & NADplus<=18]]] & ~ [E [[Ru5P<=28 | [Pyr<=4 | [NADPH<=FBP & [8<=S7P | Pi<=21]]]] U E [true U ~ [E [start<=12 U 26<=FBP]]]]]]]]]]

abstracting: (26<=FBP)
states: 0
abstracting: (start<=12)
states: 1,655,346 (6)
abstracting: (Pi<=21)
states: 1,655,346 (6)
abstracting: (8<=S7P)
states: 0
abstracting: (NADPH<=FBP)
states: 94,050 (4)
abstracting: (Pyr<=4)
states: 1,646,568 (6)
abstracting: (Ru5P<=28)
states: 1,655,346 (6)
abstracting: (NADplus<=18)
states: 1,401,708 (6)
abstracting: (G6P<=20)
states: 1,655,346 (6)
abstracting: (_3PG<=14)
states: 1,655,346 (6)
abstracting: (a2<=_3PG)
states: 1,452,990 (6)
abstracting: (ATP<=NADplus)
states: 0
abstracting: (R5P<=Pi)
states: 1,655,346 (6)
abstracting: (1<=FBP)
states: 285,516 (5)
.............................................................................
EG iterations: 77
abstracting: (26<=FBP)
states: 0
abstracting: (start<=12)
states: 1,655,346 (6)
abstracting: (Pi<=21)
states: 1,655,346 (6)
abstracting: (8<=S7P)
states: 0
abstracting: (NADPH<=FBP)
states: 94,050 (4)
abstracting: (Pyr<=4)
states: 1,646,568 (6)
abstracting: (Ru5P<=28)
states: 1,655,346 (6)
abstracting: (26<=FBP)
states: 0
abstracting: (start<=12)
states: 1,655,346 (6)
abstracting: (Pi<=21)
states: 1,655,346 (6)
abstracting: (8<=S7P)
states: 0
abstracting: (NADPH<=FBP)
states: 94,050 (4)
abstracting: (Pyr<=4)
states: 1,646,568 (6)
abstracting: (Ru5P<=28)
states: 1,655,346 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: [AG [E [A [[EG [_1_3_BPG<=GSSG] & A [PEP<=Xu5P U G6P<=Ru5P]] U [[13<=ATP | Pyr<=NADPplus] | 19<=_2PG]] U [EX [E [b2<=1 U start<=PEP]] & E [~ [23<=ATP] U [2<=GSSG | 9<=S7P]]]]] & AF [A [EG [~ [AF [11<=b2]]] U [EG [[2<=_2PG | PEP<=GSSG]] | [16<=FBP & [~ [21<=Ru5P] | 38<=_2PG]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[16<=FBP & [38<=_2PG | ~ [21<=Ru5P]]] | EG [[2<=_2PG | PEP<=GSSG]]]]]] & ~ [E [~ [[[16<=FBP & [38<=_2PG | ~ [21<=Ru5P]]] | EG [[2<=_2PG | PEP<=GSSG]]]] U [~ [EG [EG [~ [11<=b2]]]] & ~ [[[16<=FBP & [38<=_2PG | ~ [21<=Ru5P]]] | EG [[2<=_2PG | PEP<=GSSG]]]]]]]]]]] & ~ [E [true U ~ [E [[~ [EG [~ [[19<=_2PG | [13<=ATP | Pyr<=NADPplus]]]]] & ~ [E [~ [[19<=_2PG | [13<=ATP | Pyr<=NADPplus]]] U [~ [[[~ [EG [~ [G6P<=Ru5P]]] & ~ [E [~ [G6P<=Ru5P] U [~ [PEP<=Xu5P] & ~ [G6P<=Ru5P]]]]] & EG [_1_3_BPG<=GSSG]]] & ~ [[19<=_2PG | [13<=ATP | Pyr<=NADPplus]]]]]]] U [E [~ [23<=ATP] U [2<=GSSG | 9<=S7P]] & EX [E [b2<=1 U start<=PEP]]]]]]]]

abstracting: (start<=PEP)
states: 1,655,115 (6)
abstracting: (b2<=1)
states: 1,643,796 (6)
.abstracting: (9<=S7P)
states: 0
abstracting: (2<=GSSG)
states: 1,354,374 (6)
abstracting: (23<=ATP)
states: 1,655,346 (6)
abstracting: (Pyr<=NADPplus)
states: 1,601,842 (6)
abstracting: (13<=ATP)
states: 1,655,346 (6)
abstracting: (19<=_2PG)
states: 0
abstracting: (_1_3_BPG<=GSSG)
states: 1,553,202 (6)
.
EG iterations: 1
abstracting: (G6P<=Ru5P)
states: 1,550,934 (6)
abstracting: (PEP<=Xu5P)
states: 977,592 (5)
abstracting: (G6P<=Ru5P)
states: 1,550,934 (6)
abstracting: (G6P<=Ru5P)
states: 1,550,934 (6)
........................................................................
EG iterations: 72
abstracting: (Pyr<=NADPplus)
states: 1,601,842 (6)
abstracting: (13<=ATP)
states: 1,655,346 (6)
abstracting: (19<=_2PG)
states: 0
abstracting: (Pyr<=NADPplus)
states: 1,601,842 (6)
abstracting: (13<=ATP)
states: 1,655,346 (6)
abstracting: (19<=_2PG)
states: 0
.
EG iterations: 1
abstracting: (PEP<=GSSG)
states: 1,553,202 (6)
abstracting: (2<=_2PG)
states: 279,048 (5)
.
EG iterations: 1
abstracting: (21<=Ru5P)
states: 0
abstracting: (38<=_2PG)
states: 0
abstracting: (16<=FBP)
states: 0
abstracting: (11<=b2)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (PEP<=GSSG)
states: 1,553,202 (6)
abstracting: (2<=_2PG)
states: 279,048 (5)
.
EG iterations: 1
abstracting: (21<=Ru5P)
states: 0
abstracting: (38<=_2PG)
states: 0
abstracting: (16<=FBP)
states: 0
abstracting: (PEP<=GSSG)
states: 1,553,202 (6)
abstracting: (2<=_2PG)
states: 279,048 (5)
.
EG iterations: 1
abstracting: (21<=Ru5P)
states: 0
abstracting: (38<=_2PG)
states: 0
abstracting: (16<=FBP)
states: 0
........................................................................
EG iterations: 72
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.177sec

checking: [[[E [E [~ [AF [ATP<=b2]] U [~ [start<=0] | [29<=Pi & GSSG<=4]]] U EF [17<=Ru5P]] & EX [AF [A [S7P<=ATP U Pi<=23]]]] | EF [[DHAP<=Gluc | [E [AX [23<=PEP] U 36<=FBP] | [~ [NADH<=3] & A [c2<=3 U Xu5P<=25]]]]]] & [EF [[[[~ [AG [4<=ADP]] | A [GAP<=c2 U 5<=PEP]] & EX [[29<=NADPplus & ADP<=c1]]] | [AF [[20<=c2 & Gluc<=0]] & Pi<=25]]] | AG [[[[EG [NADH<=12] & [[FBP<=35 | G6P<=_1_3_BPG] | [39<=GSSG | 21<=NADplus]]] & AX [[a1<=40 | Gluc<=F6P]]] & ~ [[EG [3<=GSSG] & [~ [29<=FBP] & GAP<=1]]]]]]]
normalized: [[~ [E [true U ~ [[~ [[[GAP<=1 & ~ [29<=FBP]] & EG [3<=GSSG]]] & [~ [EX [~ [[a1<=40 | Gluc<=F6P]]]] & [[[39<=GSSG | 21<=NADplus] | [FBP<=35 | G6P<=_1_3_BPG]] & EG [NADH<=12]]]]]]] | E [true U [[Pi<=25 & ~ [EG [~ [[20<=c2 & Gluc<=0]]]]] | [EX [[29<=NADPplus & ADP<=c1]] & [[~ [EG [~ [5<=PEP]]] & ~ [E [~ [5<=PEP] U [~ [GAP<=c2] & ~ [5<=PEP]]]]] | E [true U ~ [4<=ADP]]]]]]] & [E [true U [DHAP<=Gluc | [[[~ [EG [~ [Xu5P<=25]]] & ~ [E [~ [Xu5P<=25] U [~ [c2<=3] & ~ [Xu5P<=25]]]]] & ~ [NADH<=3]] | E [~ [EX [~ [23<=PEP]]] U 36<=FBP]]]] | [EX [~ [EG [~ [[~ [EG [~ [Pi<=23]]] & ~ [E [~ [Pi<=23] U [~ [S7P<=ATP] & ~ [Pi<=23]]]]]]]]] & E [E [EG [~ [ATP<=b2]] U [[29<=Pi & GSSG<=4] | ~ [start<=0]]] U E [true U 17<=Ru5P]]]]]

abstracting: (17<=Ru5P)
states: 0
abstracting: (start<=0)
states: 1,655,115 (6)
abstracting: (GSSG<=4)
states: 752,430 (5)
abstracting: (29<=Pi)
states: 0
abstracting: (ATP<=b2)
states: 0

EG iterations: 0
abstracting: (Pi<=23)
states: 1,655,346 (6)
abstracting: (S7P<=ATP)
states: 1,655,346 (6)
abstracting: (Pi<=23)
states: 1,655,346 (6)
abstracting: (Pi<=23)
states: 1,655,346 (6)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (36<=FBP)
states: 0
abstracting: (23<=PEP)
states: 0
.abstracting: (NADH<=3)
states: 877,338 (5)
abstracting: (Xu5P<=25)
states: 1,655,346 (6)
abstracting: (c2<=3)
states: 1,068,606 (6)
abstracting: (Xu5P<=25)
states: 1,655,346 (6)
abstracting: (Xu5P<=25)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (DHAP<=Gluc)
states: 967,659 (5)
abstracting: (4<=ADP)
states: 1,609,839 (6)
abstracting: (5<=PEP)
states: 8,778 (3)
abstracting: (GAP<=c2)
states: 1,641,486 (6)
abstracting: (5<=PEP)
states: 8,778 (3)
abstracting: (5<=PEP)
states: 8,778 (3)
.
EG iterations: 1
abstracting: (ADP<=c1)
states: 259,875 (5)
abstracting: (29<=NADPplus)
states: 0
.abstracting: (Gluc<=0)
states: 1,547,469 (6)
abstracting: (20<=c2)
states: 0

EG iterations: 0
abstracting: (Pi<=25)
states: 1,655,346 (6)
abstracting: (NADH<=12)
states: 1,655,346 (6)

EG iterations: 0
abstracting: (G6P<=_1_3_BPG)
states: 1,578,885 (6)
abstracting: (FBP<=35)
states: 1,655,346 (6)
abstracting: (21<=NADplus)
states: 0
abstracting: (39<=GSSG)
states: 0
abstracting: (Gluc<=F6P)
states: 1,558,095 (6)
abstracting: (a1<=40)
states: 1,655,346 (6)
.abstracting: (3<=GSSG)
states: 1,203,888 (6)
.
EG iterations: 1
abstracting: (29<=FBP)
states: 0
abstracting: (GAP<=1)
states: 1,369,830 (6)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: [[EX [~ [[~ [[34<=b1 | [S7P<=5 & b1<=E4P]]] & EF [E [b2<=c1 U c2<=5]]]]] | [EX [Xu5P<=NADPH] & EG [AG [[[G6P<=Lac & PEP<=S7P] | [32<=ADP | _1_3_BPG<=ATP]]]]]] & EF [[[EG [~ [Lac<=27]] & ~ [[[[31<=_3PG | 20<=Ru5P] | ~ [24<=FBP]] | [[c1<=NADPplus | PEP<=9] | ~ [Gluc<=G6P]]]]] | [[[[A [Pi<=16 U PEP<=34] & [Lac<=_3PG | Pi<=NADplus]] | [_1_3_BPG<=a1 & [26<=GSSG & Xu5P<=a2]]] | AF [[Pi<=30 & S7P<=20]]] | E [16<=NADPplus U 10<=DHAP]]]]]
normalized: [E [true U [[E [16<=NADPplus U 10<=DHAP] | [~ [EG [~ [[Pi<=30 & S7P<=20]]]] | [[_1_3_BPG<=a1 & [26<=GSSG & Xu5P<=a2]] | [[Lac<=_3PG | Pi<=NADplus] & [~ [EG [~ [PEP<=34]]] & ~ [E [~ [PEP<=34] U [~ [Pi<=16] & ~ [PEP<=34]]]]]]]]] | [~ [[[~ [Gluc<=G6P] | [c1<=NADPplus | PEP<=9]] | [~ [24<=FBP] | [31<=_3PG | 20<=Ru5P]]]] & EG [~ [Lac<=27]]]]] & [[EG [~ [E [true U ~ [[[32<=ADP | _1_3_BPG<=ATP] | [G6P<=Lac & PEP<=S7P]]]]]] & EX [Xu5P<=NADPH]] | EX [~ [[E [true U E [b2<=c1 U c2<=5]] & ~ [[34<=b1 | [S7P<=5 & b1<=E4P]]]]]]]]

abstracting: (b1<=E4P)
states: 4,620 (3)
abstracting: (S7P<=5)
states: 1,655,346 (6)
abstracting: (34<=b1)
states: 0
abstracting: (c2<=5)
states: 1,547,238 (6)
abstracting: (b2<=c1)
states: 1,648,878 (6)
.abstracting: (Xu5P<=NADPH)
states: 1,650,528 (6)
.abstracting: (PEP<=S7P)
states: 954,954 (5)
abstracting: (G6P<=Lac)
states: 1,578,885 (6)
abstracting: (_1_3_BPG<=ATP)
states: 1,655,346 (6)
abstracting: (32<=ADP)
states: 0

EG iterations: 0
abstracting: (Lac<=27)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (20<=Ru5P)
states: 0
abstracting: (31<=_3PG)
states: 0
abstracting: (24<=FBP)
states: 0
abstracting: (PEP<=9)
states: 1,655,346 (6)
abstracting: (c1<=NADPplus)
states: 1,323,696 (6)
abstracting: (Gluc<=G6P)
states: 1,551,396 (6)
abstracting: (PEP<=34)
states: 1,655,346 (6)
abstracting: (Pi<=16)
states: 1,655,346 (6)
abstracting: (PEP<=34)
states: 1,655,346 (6)
abstracting: (PEP<=34)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (Pi<=NADplus)
states: 1,655,346 (6)
abstracting: (Lac<=_3PG)
states: 1,158,234 (6)
abstracting: (Xu5P<=a2)
states: 1,558,788 (6)
abstracting: (26<=GSSG)
states: 0
abstracting: (_1_3_BPG<=a1)
states: 1,533,609 (6)
abstracting: (S7P<=20)
states: 1,655,346 (6)
abstracting: (Pi<=30)
states: 1,655,346 (6)
.
EG iterations: 1
abstracting: (10<=DHAP)
states: 0
abstracting: (16<=NADPplus)
states: 394,130 (5)
-> the formula is TRUE

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

MC time: 0m 0.014sec

totally nodes used: 227149 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 473095 402068 875163
used/not used/entry size/cache size: 574917 66533947 16 1024MB
basic ops cache: hits/miss/sum: 170449 281144 451593
used/not used/entry size/cache size: 430598 16346618 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: 10704 14408 25112
used/not used/entry size/cache size: 14408 8374200 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 66904108
1 199735
2 3769
3 478
4 122
5 57
6 42
7 17
8 24
9 25
>= 10 487

Total processing time: 0m 5.048sec


BK_STOP 1679883052673

--------------------
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:1795 (81), effective:420 (19)

initing FirstDep: 0m 0.000sec


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:22 (1), effective:0 (0)

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

iterations count:337 (15), effective:80 (3)

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

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

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

iterations count:243 (11), effective:42 (1)

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:22 (1), effective:0 (0)

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

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

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

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

iterations count:74 (3), effective:12 (0)

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

iterations count:359 (16), effective:85 (3)

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

iterations count:320 (14), effective:69 (3)

iterations count:295 (13), effective:70 (3)

iterations count:84 (3), effective:11 (0)

iterations count:66 (3), effective:8 (0)

iterations count:44 (2), effective:4 (0)

iterations count:22 (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="GPPP-PT-C0001N0000000010"
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-C0001N0000000010, 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-167838845600777"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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