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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:40 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.7K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 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-C0010N0000000010-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679884017812

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-C0010N0000000010
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_C0010N0000000010
(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.771sec


RS generation: 0m 0.151sec


-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)



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

checking: EF [47<=NADH]
normalized: E [true U 47<=NADH]

abstracting: (47<=NADH)
states: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [EF [EG [~ [68<=b1]]]]
normalized: ~ [E [true U ~ [E [true U EG [~ [68<=b1]]]]]]

abstracting: (68<=b1)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: EF [Xu5P<=67]
normalized: E [true U Xu5P<=67]

abstracting: (Xu5P<=67)
states: 23,537,012,497 (10)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: ~ [AG [AF [EF [[AG [S7P<=65] | [49<=ADP & 57<=c1]]]]]]
normalized: E [true U EG [~ [E [true U [[49<=ADP & 57<=c1] | ~ [E [true U ~ [S7P<=65]]]]]]]]

abstracting: (S7P<=65)
states: 23,537,012,497 (10)
abstracting: (57<=c1)
states: 34,476,052 (7)
abstracting: (49<=ADP)
states: 23,537,012,496 (10)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.183sec

checking: ~ [EG [EX [[EG [c2<=42] | [[AX [G6P<=17] | ~ [8<=c1]] & ~ [b1<=GSH]]]]]]
normalized: ~ [EG [EX [[[~ [b1<=GSH] & [~ [8<=c1] | ~ [EX [~ [G6P<=17]]]]] | EG [c2<=42]]]]]

abstracting: (c2<=42)
states: 34,476,052 (7)
.
EG iterations: 1
abstracting: (G6P<=17)
states: 22,153,336,570 (10)
.abstracting: (8<=c1)
states: 3,275,933,425 (9)
abstracting: (b1<=GSH)
states: 12,024,338,044 (10)
.......................................................................................................................................................
EG iterations: 150
-> the formula is FALSE

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

MC time: 0m 5.849sec

checking: E [[_1_3_BPG<=2 | [AF [[_3PG<=18 | [_2PG<=40 | FBP<=20]]] | EF [~ [AF [44<=PEP]]]]] U AG [EF [18<=ATP]]]
normalized: E [[_1_3_BPG<=2 | [E [true U EG [~ [44<=PEP]]] | ~ [EG [~ [[_3PG<=18 | [_2PG<=40 | FBP<=20]]]]]]] U ~ [E [true U ~ [E [true U 18<=ATP]]]]]

abstracting: (18<=ATP)
states: 2,323,815,934 (9)
abstracting: (FBP<=20)
states: 23,537,012,497 (10)
abstracting: (_2PG<=40)
states: 23,537,012,497 (10)
abstracting: (_3PG<=18)
states: 23,537,012,497 (10)
.
EG iterations: 1
abstracting: (44<=PEP)
states: 0

EG iterations: 0
abstracting: (_1_3_BPG<=2)
states: 21,352,835,137 (10)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.075sec

checking: EX [EX [[[Pyr<=64 & EF [[51<=b2 & 44<=DHAP]]] & [EG [EF [5<=Ru5P]] | EX [~ [E4P<=a1]]]]]]
normalized: EX [EX [[[EX [~ [E4P<=a1]] | EG [E [true U 5<=Ru5P]]] & [Pyr<=64 & E [true U [51<=b2 & 44<=DHAP]]]]]]

abstracting: (44<=DHAP)
states: 0
abstracting: (51<=b2)
states: 0
abstracting: (Pyr<=64)
states: 23,537,012,497 (10)
abstracting: (5<=Ru5P)
states: 15,646,175,925 (10)
.................................................................................................................................................................
EG iterations: 161
abstracting: (E4P<=a1)
states: 23,416,084,921 (10)
...-> the formula is FALSE

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

MC time: 0m 0.756sec

checking: EX [E [E [[22<=F6P | [FBP<=NADH | [35<=b2 & c2<=DHAP]]] U ~ [EG [NADH<=DHAP]]] U [EX [49<=PEP] | a1<=9]]]
normalized: EX [E [E [[22<=F6P | [FBP<=NADH | [35<=b2 & c2<=DHAP]]] U ~ [EG [NADH<=DHAP]]] U [a1<=9 | EX [49<=PEP]]]]

abstracting: (49<=PEP)
states: 0
.abstracting: (a1<=9)
states: 15,891,637,194 (10)
abstracting: (NADH<=DHAP)
states: 2,786,032,822 (9)
.
EG iterations: 1
abstracting: (c2<=DHAP)
states: 34,476,052 (7)
abstracting: (35<=b2)
states: 0
abstracting: (FBP<=NADH)
states: 23,210,557,465 (10)
abstracting: (22<=F6P)
states: 0
.-> the formula is TRUE

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

MC time: 0m 1.112sec

checking: EX [[[~ [[~ [9<=_1_3_BPG] & AG [40<=c1]]] & ~ [[~ [EG [F6P<=GSH]] & A [~ [NADplus<=GSH] U AG [GAP<=b2]]]]] & ~ [AG [_3PG<=Xu5P]]]]
normalized: EX [[E [true U ~ [_3PG<=Xu5P]] & [~ [[[~ [EG [E [true U ~ [GAP<=b2]]]] & ~ [E [E [true U ~ [GAP<=b2]] U [NADplus<=GSH & E [true U ~ [GAP<=b2]]]]]] & ~ [EG [F6P<=GSH]]]] & ~ [[~ [E [true U ~ [40<=c1]]] & ~ [9<=_1_3_BPG]]]]]]

abstracting: (9<=_1_3_BPG)
states: 506,583 (5)
abstracting: (40<=c1)
states: 34,476,052 (7)
abstracting: (F6P<=GSH)
states: 23,032,493,055 (10)
...........................................................
EG iterations: 59
abstracting: (GAP<=b2)
states: 23,055,860,518 (10)
abstracting: (NADplus<=GSH)
states: 6,194,644,956 (9)
abstracting: (GAP<=b2)
states: 23,055,860,518 (10)
abstracting: (GAP<=b2)
states: 23,055,860,518 (10)
.
EG iterations: 1
abstracting: (_3PG<=Xu5P)
states: 22,823,004,374 (10)
.-> the formula is TRUE

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

MC time: 0m 3.680sec

checking: EX [~ [[EF [[EX [35<=GAP] & [E [55<=GSSG U NADPH<=70] | ~ [44<=a1]]]] & ~ [[[[~ [NADplus<=4] & [30<=ADP & 12<=PEP]] & EF [34<=_1_3_BPG]] | [~ [_3PG<=12] | ~ [[ADP<=NADH | GSSG<=44]]]]]]]]
normalized: EX [~ [[~ [[[~ [[ADP<=NADH | GSSG<=44]] | ~ [_3PG<=12]] | [E [true U 34<=_1_3_BPG] & [[30<=ADP & 12<=PEP] & ~ [NADplus<=4]]]]] & E [true U [[~ [44<=a1] | E [55<=GSSG U NADPH<=70]] & EX [35<=GAP]]]]]]

abstracting: (35<=GAP)
states: 0
.abstracting: (NADPH<=70)
states: 23,537,012,497 (10)
abstracting: (55<=GSSG)
states: 0
abstracting: (44<=a1)
states: 0
abstracting: (NADplus<=4)
states: 0
abstracting: (12<=PEP)
states: 0
abstracting: (30<=ADP)
states: 23,537,012,496 (10)
abstracting: (34<=_1_3_BPG)
states: 0
abstracting: (_3PG<=12)
states: 23,537,012,497 (10)
abstracting: (GSSG<=44)
states: 23,537,012,497 (10)
abstracting: (ADP<=NADH)
states: 1
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

checking: AF [EX [[[[AG [GSSG<=25] & E [22<=PEP U 39<=Gluc]] & [[NADH<=30 | [FBP<=38 & ADP<=57]] | ~ [[Pi<=E4P & 34<=NADplus]]]] | ~ [[~ [NADplus<=c2] & AF [GSH<=Pyr]]]]]]
normalized: ~ [EG [~ [EX [[~ [[~ [EG [~ [GSH<=Pyr]]] & ~ [NADplus<=c2]]] | [[~ [[Pi<=E4P & 34<=NADplus]] | [NADH<=30 | [FBP<=38 & ADP<=57]]] & [E [22<=PEP U 39<=Gluc] & ~ [E [true U ~ [GSSG<=25]]]]]]]]]]

abstracting: (GSSG<=25)
states: 23,537,012,497 (10)
abstracting: (39<=Gluc)
states: 7
abstracting: (22<=PEP)
states: 0
abstracting: (ADP<=57)
states: 1
abstracting: (FBP<=38)
states: 23,537,012,497 (10)
abstracting: (NADH<=30)
states: 23,537,012,497 (10)
abstracting: (34<=NADplus)
states: 0
abstracting: (Pi<=E4P)
states: 1
abstracting: (NADplus<=c2)
states: 23,502,536,445 (10)
abstracting: (GSH<=Pyr)
states: 2,785,050,553 (9)
.....................................................................................................................................................................
EG iterations: 165
.........................................
EG iterations: 40
-> the formula is TRUE

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

MC time: 0m 8.419sec

checking: [~ [EX [b2<=61]] | ~ [[AG [[[A [NADH<=4 U R5P<=NADH] | FBP<=27] & [c1<=9 & E [NADPplus<=F6P U G6P<=52]]]] | ~ [A [A [_2PG<=32 U ATP<=Gluc] U [AF [b1<=b2] & EF [1<=_2PG]]]]]]]
normalized: [~ [[~ [[~ [EG [~ [[E [true U 1<=_2PG] & ~ [EG [~ [b1<=b2]]]]]]] & ~ [E [~ [[E [true U 1<=_2PG] & ~ [EG [~ [b1<=b2]]]]] U [~ [[~ [EG [~ [ATP<=Gluc]]] & ~ [E [~ [ATP<=Gluc] U [~ [_2PG<=32] & ~ [ATP<=Gluc]]]]]] & ~ [[E [true U 1<=_2PG] & ~ [EG [~ [b1<=b2]]]]]]]]]] | ~ [E [true U ~ [[[c1<=9 & E [NADPplus<=F6P U G6P<=52]] & [FBP<=27 | [~ [EG [~ [R5P<=NADH]]] & ~ [E [~ [R5P<=NADH] U [~ [NADH<=4] & ~ [R5P<=NADH]]]]]]]]]]]] | ~ [EX [b2<=61]]]

abstracting: (b2<=61)
states: 23,537,012,497 (10)
.abstracting: (R5P<=NADH)
states: 23,472,720,052 (10)
abstracting: (NADH<=4)
states: 12,465,326,971 (10)
abstracting: (R5P<=NADH)
states: 23,472,720,052 (10)
abstracting: (R5P<=NADH)
states: 23,472,720,052 (10)
....................................................................................................................
EG iterations: 116
abstracting: (FBP<=27)
states: 23,537,012,497 (10)
abstracting: (G6P<=52)
states: 23,537,012,497 (10)
abstracting: (NADPplus<=F6P)
states: 1,347,718,040 (9)
abstracting: (c1<=9)
states: 23,139,475,131 (10)
abstracting: (b1<=b2)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
abstracting: (1<=_2PG)
states: 11,628,220,734 (10)
abstracting: (ATP<=Gluc)
states: 4,519,730,562 (9)
abstracting: (_2PG<=32)
states: 23,537,012,497 (10)
abstracting: (ATP<=Gluc)
states: 4,519,730,562 (9)
abstracting: (ATP<=Gluc)
states: 4,519,730,562 (9)
..
EG iterations: 2
abstracting: (b1<=b2)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
abstracting: (1<=_2PG)
states: 11,628,220,734 (10)
abstracting: (b1<=b2)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
abstracting: (1<=_2PG)
states: 11,628,220,734 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.290sec

checking: A [[~ [A [EF [Lac<=62] U [b1<=3 | [b1<=5 & 31<=NADPplus]]]] | EG [[E [[a2<=c2 | _3PG<=66] U ~ [S7P<=GSSG]] & b2<=E4P]]] U ~ [AX [E [EX [NADPH<=NADH] U ~ [[_3PG<=R5P | 69<=S7P]]]]]]
normalized: [~ [EG [~ [EX [~ [E [EX [NADPH<=NADH] U ~ [[_3PG<=R5P | 69<=S7P]]]]]]]] & ~ [E [~ [EX [~ [E [EX [NADPH<=NADH] U ~ [[_3PG<=R5P | 69<=S7P]]]]]] U [~ [[EG [[b2<=E4P & E [[a2<=c2 | _3PG<=66] U ~ [S7P<=GSSG]]]] | ~ [[~ [EG [~ [[b1<=3 | [b1<=5 & 31<=NADPplus]]]]] & ~ [E [~ [[b1<=3 | [b1<=5 & 31<=NADPplus]]] U [~ [E [true U Lac<=62]] & ~ [[b1<=3 | [b1<=5 & 31<=NADPplus]]]]]]]]]] & ~ [EX [~ [E [EX [NADPH<=NADH] U ~ [[_3PG<=R5P | 69<=S7P]]]]]]]]]]

abstracting: (69<=S7P)
states: 0
abstracting: (_3PG<=R5P)
states: 12,836,339,461 (10)
abstracting: (NADPH<=NADH)
states: 6,218,550,119 (9)
..abstracting: (31<=NADPplus)
states: 0
abstracting: (b1<=5)
states: 10,602,113,119 (10)
abstracting: (b1<=3)
states: 7,816,664,950 (9)
abstracting: (Lac<=62)
states: 23,537,012,497 (10)
abstracting: (31<=NADPplus)
states: 0
abstracting: (b1<=5)
states: 10,602,113,119 (10)
abstracting: (b1<=3)
states: 7,816,664,950 (9)
abstracting: (31<=NADPplus)
states: 0
abstracting: (b1<=5)
states: 10,602,113,119 (10)
abstracting: (b1<=3)
states: 7,816,664,950 (9)
.............................................................................................................................................................
EG iterations: 157
abstracting: (S7P<=GSSG)
states: 22,918,543,371 (10)
abstracting: (_3PG<=66)
states: 23,537,012,497 (10)
abstracting: (a2<=c2)
states: 23,503,853,482 (10)
abstracting: (b2<=E4P)
states: 668,092,236 (8)
.............................................................................................................
EG iterations: 109
abstracting: (69<=S7P)
states: 0
abstracting: (_3PG<=R5P)
states: 12,836,339,461 (10)
abstracting: (NADPH<=NADH)
states: 6,218,550,119 (9)
..abstracting: (69<=S7P)
states: 0
abstracting: (_3PG<=R5P)
states: 12,836,339,461 (10)
abstracting: (NADPH<=NADH)
states: 6,218,550,119 (9)
.................................................................................................................................................................
EG iterations: 159
-> the formula is TRUE

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

MC time: 0m47.973sec

checking: AG [[[_2PG<=30 | E [[[[_1_3_BPG<=ATP | _1_3_BPG<=Xu5P] & Xu5P<=b2] | [~ [ADP<=ADP] | ~ [NADH<=39]]] U E4P<=51]] | [GAP<=b1 | E [[[start<=_1_3_BPG & ~ [5<=NADH]] & 68<=Lac] U A [EX [18<=b1] U EF [E4P<=35]]]]]]
normalized: ~ [E [true U ~ [[[GAP<=b1 | E [[68<=Lac & [start<=_1_3_BPG & ~ [5<=NADH]]] U [~ [EG [~ [E [true U E4P<=35]]]] & ~ [E [~ [E [true U E4P<=35]] U [~ [EX [18<=b1]] & ~ [E [true U E4P<=35]]]]]]]] | [_2PG<=30 | E [[[~ [NADH<=39] | ~ [ADP<=ADP]] | [Xu5P<=b2 & [_1_3_BPG<=ATP | _1_3_BPG<=Xu5P]]] U E4P<=51]]]]]]

abstracting: (E4P<=51)
states: 23,537,012,497 (10)
abstracting: (_1_3_BPG<=Xu5P)
states: 22,843,902,122 (10)
abstracting: (_1_3_BPG<=ATP)
states: 22,417,335,358 (10)
abstracting: (Xu5P<=b2)
states: 16,753,750,858 (10)
abstracting: (ADP<=ADP)
states: 23,537,012,497 (10)
abstracting: (NADH<=39)
states: 23,537,012,497 (10)
abstracting: (_2PG<=30)
states: 23,537,012,497 (10)
abstracting: (E4P<=35)
states: 23,537,012,497 (10)
abstracting: (18<=b1)
states: 7,436,829,750 (9)
.abstracting: (E4P<=35)
states: 23,537,012,497 (10)
abstracting: (E4P<=35)
states: 23,537,012,497 (10)
.
EG iterations: 1
abstracting: (5<=NADH)
states: 11,071,685,526 (10)
abstracting: (start<=_1_3_BPG)
states: 23,537,012,496 (10)
abstracting: (68<=Lac)
states: 0
abstracting: (GAP<=b1)
states: 21,582,601,536 (10)
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.578sec

checking: A [AF [[E [AX [6<=GSH] U 47<=Ru5P] & A [[[GSH<=b1 & Lac<=_2PG] | [c2<=NADplus | S7P<=14]] U [EF [56<=R5P] & NADplus<=NADplus]]]] U [[~ [EG [E [c2<=G6P U Pyr<=24]]] & EX [~ [E [PEP<=NADPplus U c1<=PEP]]]] | EF [EF [AX [24<=FBP]]]]]
normalized: [~ [EG [~ [[E [true U E [true U ~ [EX [~ [24<=FBP]]]]] | [EX [~ [E [PEP<=NADPplus U c1<=PEP]]] & ~ [EG [E [c2<=G6P U Pyr<=24]]]]]]]] & ~ [E [~ [[E [true U E [true U ~ [EX [~ [24<=FBP]]]]] | [EX [~ [E [PEP<=NADPplus U c1<=PEP]]] & ~ [EG [E [c2<=G6P U Pyr<=24]]]]]] U [EG [~ [[[~ [EG [~ [[NADplus<=NADplus & E [true U 56<=R5P]]]]] & ~ [E [~ [[NADplus<=NADplus & E [true U 56<=R5P]]] U [~ [[[c2<=NADplus | S7P<=14] | [GSH<=b1 & Lac<=_2PG]]] & ~ [[NADplus<=NADplus & E [true U 56<=R5P]]]]]]] & E [~ [EX [~ [6<=GSH]]] U 47<=Ru5P]]]] & ~ [[E [true U E [true U ~ [EX [~ [24<=FBP]]]]] | [EX [~ [E [PEP<=NADPplus U c1<=PEP]]] & ~ [EG [E [c2<=G6P U Pyr<=24]]]]]]]]]]

abstracting: (Pyr<=24)
states: 23,537,012,497 (10)
abstracting: (c2<=G6P)
states: 34,476,052 (7)

EG iterations: 0
abstracting: (c1<=PEP)
states: 374,253,201 (8)
abstracting: (PEP<=NADPplus)
states: 22,589,052,604 (10)
.abstracting: (24<=FBP)
states: 0
.abstracting: (47<=Ru5P)
states: 0
abstracting: (6<=GSH)
states: 17,005,396,344 (10)
.abstracting: (56<=R5P)
states: 0
abstracting: (NADplus<=NADplus)
states: 23,537,012,497 (10)
abstracting: (Lac<=_2PG)
states: 15,564,790,072 (10)
abstracting: (GSH<=b1)
states: 12,379,203,721 (10)
abstracting: (S7P<=14)
states: 23,537,012,497 (10)
abstracting: (c2<=NADplus)
states: 34,476,052 (7)
abstracting: (56<=R5P)
states: 0
abstracting: (NADplus<=NADplus)
states: 23,537,012,497 (10)
abstracting: (56<=R5P)
states: 0
abstracting: (NADplus<=NADplus)
states: 23,537,012,497 (10)

EG iterations: 0

EG iterations: 0
abstracting: (Pyr<=24)
states: 23,537,012,497 (10)
abstracting: (c2<=G6P)
states: 34,476,052 (7)

EG iterations: 0
abstracting: (c1<=PEP)
states: 374,253,201 (8)
abstracting: (PEP<=NADPplus)
states: 22,589,052,604 (10)
.abstracting: (24<=FBP)
states: 0
.abstracting: (Pyr<=24)
states: 23,537,012,497 (10)
abstracting: (c2<=G6P)
states: 34,476,052 (7)

EG iterations: 0
abstracting: (c1<=PEP)
states: 374,253,201 (8)
abstracting: (PEP<=NADPplus)
states: 22,589,052,604 (10)
.abstracting: (24<=FBP)
states: 0
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 4.280sec

checking: [[[EX [[~ [AX [ATP<=64]] | [[[NADH<=33 & R5P<=S7P] | EX [b2<=a1]] | [EG [b1<=30] & b1<=37]]]] & EX [AF [[EX [_3PG<=GSH] & AX [PEP<=start]]]]] & [AX [18<=S7P] & AX [EX [EX [53<=GSSG]]]]] & ~ [AX [[~ [[EF [15<=G6P] & ~ [AX [33<=a2]]]] | [EG [E [S7P<=NADplus U NADPplus<=c2]] & ~ [EF [Xu5P<=Pyr]]]]]]]
normalized: [EX [~ [[[~ [E [true U Xu5P<=Pyr]] & EG [E [S7P<=NADplus U NADPplus<=c2]]] | ~ [[EX [~ [33<=a2]] & E [true U 15<=G6P]]]]]] & [[~ [EX [~ [EX [EX [53<=GSSG]]]]] & ~ [EX [~ [18<=S7P]]]] & [EX [~ [EG [~ [[~ [EX [~ [PEP<=start]]] & EX [_3PG<=GSH]]]]]] & EX [[[[b1<=37 & EG [b1<=30]] | [EX [b2<=a1] | [NADH<=33 & R5P<=S7P]]] | EX [~ [ATP<=64]]]]]]]

abstracting: (ATP<=64)
states: 23,537,012,497 (10)
.abstracting: (R5P<=S7P)
states: 20,024,297,536 (10)
abstracting: (NADH<=33)
states: 23,537,012,497 (10)
abstracting: (b2<=a1)
states: 5,026,280,669 (9)
.abstracting: (b1<=30)
states: 23,537,012,497 (10)

EG iterations: 0
abstracting: (b1<=37)
states: 23,537,012,497 (10)
.abstracting: (_3PG<=GSH)
states: 22,208,415,901 (10)
.abstracting: (PEP<=start)
states: 11,908,791,763 (10)
..................................................................................................................................................................
EG iterations: 161
.abstracting: (18<=S7P)
states: 0
.abstracting: (53<=GSSG)
states: 0
...abstracting: (15<=G6P)
states: 2,254,748,241 (9)
abstracting: (33<=a2)
states: 0
.abstracting: (NADPplus<=c2)
states: 23,503,998,131 (10)
abstracting: (S7P<=NADplus)
states: 23,537,012,497 (10)

EG iterations: 0
abstracting: (Xu5P<=Pyr)
states: 1,607,883,647 (9)
.-> the formula is FALSE

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

MC time: 0m13.854sec

totally nodes used: 32394837 (3.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 118556142 67507596 186063738
used/not used/entry size/cache size: 50653393 16455471 16 1024MB
basic ops cache: hits/miss/sum: 47332028 26785646 74117674
used/not used/entry size/cache size: 15585994 1191222 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: 869933 467637 1337570
used/not used/entry size/cache size: 455533 7933075 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 43146857
1 18515047
2 4400622
3 785840
4 133444
5 37210
6 22052
7 11021
8 6159
9 9012
>= 10 41600

Total processing time: 1m38.633sec


BK_STOP 1679884116511

--------------------
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:1541 (70), effective:367 (16)

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:1078 (49), effective:225 (10)

iterations count:297 (13), effective:58 (2)

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

iterations count:378 (17), effective:74 (3)

iterations count:612 (27), effective:116 (5)

iterations count:346 (15), effective:72 (3)

iterations count:109 (4), effective:14 (0)

iterations count:978 (44), effective:201 (9)

iterations count:978 (44), effective:201 (9)

iterations count:505 (22), effective:88 (4)

iterations count:978 (44), effective:201 (9)

iterations count:1111 (50), effective:217 (9)

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

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

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

iterations count:986 (44), effective:195 (8)

iterations count:629 (28), effective:121 (5)

iterations count:629 (28), effective:121 (5)

iterations count:156 (7), effective:33 (1)

iterations count:629 (28), effective:121 (5)

iterations count:1088 (49), effective:201 (9)

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

iterations count:1079 (49), effective:202 (9)

iterations count:1088 (49), effective:201 (9)

iterations count:3393 (154), effective:667 (30)

iterations count:1088 (49), effective:201 (9)

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:215 (9), effective:62 (2)

iterations count:1636 (74), effective:399 (18)

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

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

iterations count:215 (9), effective:62 (2)

iterations count:1636 (74), effective:399 (18)

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

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

iterations count:215 (9), effective:62 (2)

iterations count:1636 (74), effective:399 (18)

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

iterations count:177 (8), effective:34 (1)

iterations count:109 (4), effective:14 (0)

iterations count:1118 (50), effective:239 (10)

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-C0010N0000000010"
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-C0010N0000000010, 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-167838845700817"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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