About the Execution of Marcie for GPPP-PT-C0010N0000000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7242.951 | 45737.00 | 45862.00 | 207.90 | FTTTTFFFTTTFFTFT | normal |
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-167838845700825.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-C0010N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845700825
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:43 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.9K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 10:45 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-C0010N0000000100-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679884097664
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-C0010N0000000100
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_C0010N0000000100
(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.858sec
RS generation: 0m 0.190sec
-> reachability set: #nodes 22693 (2.3e+04) #states 176,894,515,156 (11)
starting MCC model checker
--------------------------
checking: EX [AG [a1<=27]]
normalized: EX [~ [E [true U ~ [a1<=27]]]]
abstracting: (a1<=27)
states: 176,894,515,156 (11)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.221sec
checking: E [81<=c1 U ~ [AG [AX [EF [235<=c1]]]]]
normalized: E [81<=c1 U E [true U EX [~ [E [true U 235<=c1]]]]]
abstracting: (235<=c1)
states: 0
.abstracting: (81<=c1)
states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.159sec
checking: EX [c2<=Lac]
normalized: EX [c2<=Lac]
abstracting: (c2<=Lac)
states: 246,728,912 (8)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: EF [AX [EF [~ [[PEP<=190 | ~ [Gluc<=_3PG]]]]]]
normalized: E [true U ~ [EX [~ [E [true U ~ [[PEP<=190 | ~ [Gluc<=_3PG]]]]]]]]
abstracting: (Gluc<=_3PG)
states: 56,837,208,372 (10)
abstracting: (PEP<=190)
states: 176,894,515,156 (11)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.211sec
checking: AG [EG [[EF [EG [b2<=234]] | ~ [EF [~ [NADplus<=Pi]]]]]]
normalized: ~ [E [true U ~ [EG [[~ [E [true U ~ [NADplus<=Pi]]] | E [true U EG [b2<=234]]]]]]]
abstracting: (b2<=234)
states: 176,894,515,156 (11)
EG iterations: 0
abstracting: (NADplus<=Pi)
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [~ [[AG [~ [[318<=F6P & ATP<=b1]]] | 153<=S7P]]]
normalized: ~ [E [true U [153<=S7P | ~ [E [true U [318<=F6P & ATP<=b1]]]]]]
abstracting: (ATP<=b1)
states: 0
abstracting: (318<=F6P)
states: 0
abstracting: (153<=S7P)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
checking: EF [~ [[A [[[~ [42<=PEP] | start<=252] & DHAP<=57] U ~ [AF [ADP<=_1_3_BPG]]] | 106<=a1]]]
normalized: E [true U ~ [[106<=a1 | [~ [EG [~ [EG [~ [ADP<=_1_3_BPG]]]]] & ~ [E [~ [EG [~ [ADP<=_1_3_BPG]]] U [~ [[DHAP<=57 & [start<=252 | ~ [42<=PEP]]]] & ~ [EG [~ [ADP<=_1_3_BPG]]]]]]]]]]
abstracting: (ADP<=_1_3_BPG)
states: 1
.
EG iterations: 1
abstracting: (42<=PEP)
states: 0
abstracting: (start<=252)
states: 176,894,515,156 (11)
abstracting: (DHAP<=57)
states: 176,894,515,156 (11)
abstracting: (ADP<=_1_3_BPG)
states: 1
.
EG iterations: 1
abstracting: (ADP<=_1_3_BPG)
states: 1
.
EG iterations: 1
..
EG iterations: 2
abstracting: (106<=a1)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.077sec
checking: ~ [E [EG [E [~ [[90<=start & 211<=c1]] U [Xu5P<=c1 | AG [92<=_1_3_BPG]]]] U b1<=a1]]
normalized: ~ [E [EG [E [~ [[90<=start & 211<=c1]] U [Xu5P<=c1 | ~ [E [true U ~ [92<=_1_3_BPG]]]]]] U b1<=a1]]
abstracting: (b1<=a1)
states: 103,965,211,910 (11)
abstracting: (92<=_1_3_BPG)
states: 0
abstracting: (Xu5P<=c1)
states: 27,054,560,666 (10)
abstracting: (211<=c1)
states: 0
abstracting: (90<=start)
states: 0
................................................................................................................................................................................................................................
EG iterations: 224
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.665sec
checking: EF [[~ [EF [[AG [263<=a1] & a1<=14]]] | EX [[[AG [212<=GSH] & [251<=GSH | EX [Gluc<=NADPplus]]] & EX [AX [ATP<=start]]]]]]
normalized: E [true U [EX [[EX [~ [EX [~ [ATP<=start]]]] & [[251<=GSH | EX [Gluc<=NADPplus]] & ~ [E [true U ~ [212<=GSH]]]]]] | ~ [E [true U [a1<=14 & ~ [E [true U ~ [263<=a1]]]]]]]]
abstracting: (263<=a1)
states: 0
abstracting: (a1<=14)
states: 153,561,308,820 (11)
abstracting: (212<=GSH)
states: 0
abstracting: (Gluc<=NADPplus)
states: 176,894,515,156 (11)
.abstracting: (251<=GSH)
states: 0
abstracting: (ATP<=start)
states: 0
...-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.848sec
checking: ~ [E [[[[84<=_3PG & EG [350<=GAP]] & EX [~ [NADPplus<=154]]] | [EX [EG [_3PG<=Pyr]] & PEP<=NADPH]] U EX [~ [Pi<=377]]]]
normalized: ~ [E [[[PEP<=NADPH & EX [EG [_3PG<=Pyr]]] | [EX [~ [NADPplus<=154]] & [84<=_3PG & EG [350<=GAP]]]] U EX [~ [Pi<=377]]]]
abstracting: (Pi<=377)
states: 176,894,515,156 (11)
.abstracting: (350<=GAP)
states: 0
.
EG iterations: 1
abstracting: (84<=_3PG)
states: 0
abstracting: (NADPplus<=154)
states: 14,426,484,840 (10)
.abstracting: (_3PG<=Pyr)
states: 117,153,484,818 (11)
..........................................................................................................................................................................................
EG iterations: 186
.abstracting: (PEP<=NADPH)
states: 171,704,162,760 (11)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.314sec
checking: AG [~ [[[~ [AF [AF [65<=ADP]]] | [EX [[GSH<=228 & 97<=NADPplus]] | Ru5P<=_2PG]] & [AG [[[Lac<=85 & 18<=GAP] & [NADPH<=S7P & 236<=NADplus]]] & AF [E [157<=_3PG U GSSG<=ATP]]]]]]
normalized: ~ [E [true U [[~ [EG [~ [E [157<=_3PG U GSSG<=ATP]]]] & ~ [E [true U ~ [[[NADPH<=S7P & 236<=NADplus] & [Lac<=85 & 18<=GAP]]]]]] & [[Ru5P<=_2PG | EX [[GSH<=228 & 97<=NADPplus]]] | EG [EG [~ [65<=ADP]]]]]]]
abstracting: (65<=ADP)
states: 176,894,513,399 (11)
...............................
EG iterations: 31
.
EG iterations: 1
abstracting: (97<=NADPplus)
states: 176,894,515,156 (11)
abstracting: (GSH<=228)
states: 176,894,515,156 (11)
.abstracting: (Ru5P<=_2PG)
states: 20,875,524,145 (10)
abstracting: (18<=GAP)
states: 0
abstracting: (Lac<=85)
states: 176,894,515,156 (11)
abstracting: (236<=NADplus)
states: 0
abstracting: (NADPH<=S7P)
states: 7,779,365,158 (9)
abstracting: (GSSG<=ATP)
states: 176,894,515,156 (11)
abstracting: (157<=_3PG)
states: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.652sec
checking: [A [EX [[A [[a2<=Pyr | 183<=ATP] U AG [275<=Lac]] & AX [[ADP<=c1 | 225<=S7P]]]] U AX [[NADH<=DHAP | ~ [369<=c1]]]] & EX [[AX [[GAP<=290 | ~ [[320<=Lac & 148<=FBP]]]] & AG [~ [EG [NADPplus<=DHAP]]]]]]
normalized: [EX [[~ [E [true U EG [NADPplus<=DHAP]]] & ~ [EX [~ [[GAP<=290 | ~ [[320<=Lac & 148<=FBP]]]]]]]] & [~ [EG [EX [~ [[NADH<=DHAP | ~ [369<=c1]]]]]] & ~ [E [EX [~ [[NADH<=DHAP | ~ [369<=c1]]]] U [~ [EX [[~ [EX [~ [[ADP<=c1 | 225<=S7P]]]] & [~ [EG [E [true U ~ [275<=Lac]]]] & ~ [E [E [true U ~ [275<=Lac]] U [~ [[a2<=Pyr | 183<=ATP]] & E [true U ~ [275<=Lac]]]]]]]]] & EX [~ [[NADH<=DHAP | ~ [369<=c1]]]]]]]]]
abstracting: (369<=c1)
states: 0
abstracting: (NADH<=DHAP)
states: 21,367,017,911 (10)
.abstracting: (275<=Lac)
states: 0
abstracting: (183<=ATP)
states: 176,894,515,156 (11)
abstracting: (a2<=Pyr)
states: 6,755,244,452 (9)
abstracting: (275<=Lac)
states: 0
abstracting: (275<=Lac)
states: 0
EG iterations: 0
abstracting: (225<=S7P)
states: 0
abstracting: (ADP<=c1)
states: 2
..abstracting: (369<=c1)
states: 0
abstracting: (NADH<=DHAP)
states: 21,367,017,911 (10)
.abstracting: (369<=c1)
states: 0
abstracting: (NADH<=DHAP)
states: 21,367,017,911 (10)
..
EG iterations: 1
abstracting: (148<=FBP)
states: 0
abstracting: (320<=Lac)
states: 0
abstracting: (GAP<=290)
states: 176,894,515,156 (11)
.abstracting: (NADPplus<=DHAP)
states: 0
.
EG iterations: 1
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.497sec
checking: ~ [E [[[E [[Pyr<=c1 | Pyr<=87] U [G6P<=52 & 286<=F6P]] & EG [Gluc<=NADPH]] | _2PG<=80] U [AG [A [c2<=83 U _3PG<=Pyr]] & EX [[36<=NADPH | E [R5P<=17 U Ru5P<=_3PG]]]]]]
normalized: ~ [E [[_2PG<=80 | [EG [Gluc<=NADPH] & E [[Pyr<=c1 | Pyr<=87] U [G6P<=52 & 286<=F6P]]]] U [EX [[36<=NADPH | E [R5P<=17 U Ru5P<=_3PG]]] & ~ [E [true U ~ [[~ [EG [~ [_3PG<=Pyr]]] & ~ [E [~ [_3PG<=Pyr] U [~ [c2<=83] & ~ [_3PG<=Pyr]]]]]]]]]]]
abstracting: (_3PG<=Pyr)
states: 117,153,484,818 (11)
abstracting: (c2<=83)
states: 176,894,515,156 (11)
abstracting: (_3PG<=Pyr)
states: 117,153,484,818 (11)
abstracting: (_3PG<=Pyr)
states: 117,153,484,818 (11)
.....................................................................................................................................................................................................................................
EG iterations: 229
abstracting: (Ru5P<=_3PG)
states: 20,875,524,145 (10)
abstracting: (R5P<=17)
states: 176,894,515,156 (11)
abstracting: (36<=NADPH)
states: 32,424,835,282 (10)
.abstracting: (286<=F6P)
states: 0
abstracting: (G6P<=52)
states: 176,894,515,156 (11)
abstracting: (Pyr<=87)
states: 176,894,515,156 (11)
abstracting: (Pyr<=c1)
states: 176,894,515,156 (11)
abstracting: (Gluc<=NADPH)
states: 153,573,732,669 (11)
..
EG iterations: 2
abstracting: (_2PG<=80)
states: 176,894,515,156 (11)
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.701sec
checking: [EX [AG [[~ [[~ [Pi<=75] & [a2<=374 & 257<=_2PG]]] | [[[ATP<=305 & F6P<=342] & S7P<=174] & A [NADPH<=6 U NADPplus<=G6P]]]]] & E [AX [A [E [Ru5P<=start U 267<=_3PG] U E [R5P<=ATP U 348<=R5P]]] U ~ [GAP<=290]]]
normalized: [E [~ [EX [~ [[~ [EG [~ [E [R5P<=ATP U 348<=R5P]]]] & ~ [E [~ [E [R5P<=ATP U 348<=R5P]] U [~ [E [R5P<=ATP U 348<=R5P]] & ~ [E [Ru5P<=start U 267<=_3PG]]]]]]]]] U ~ [GAP<=290]] & EX [~ [E [true U ~ [[[[~ [EG [~ [NADPplus<=G6P]]] & ~ [E [~ [NADPplus<=G6P] U [~ [NADPH<=6] & ~ [NADPplus<=G6P]]]]] & [S7P<=174 & [ATP<=305 & F6P<=342]]] | ~ [[[a2<=374 & 257<=_2PG] & ~ [Pi<=75]]]]]]]]]
abstracting: (Pi<=75)
states: 176,894,515,156 (11)
abstracting: (257<=_2PG)
states: 0
abstracting: (a2<=374)
states: 176,894,515,156 (11)
abstracting: (F6P<=342)
states: 176,894,515,156 (11)
abstracting: (ATP<=305)
states: 0
abstracting: (S7P<=174)
states: 176,894,515,156 (11)
abstracting: (NADPplus<=G6P)
states: 0
abstracting: (NADPH<=6)
states: 38,750,639,146 (10)
abstracting: (NADPplus<=G6P)
states: 0
abstracting: (NADPplus<=G6P)
states: 0
EG iterations: 0
.abstracting: (GAP<=290)
states: 176,894,515,156 (11)
abstracting: (267<=_3PG)
states: 0
abstracting: (Ru5P<=start)
states: 11,041,631,246 (10)
abstracting: (348<=R5P)
states: 0
abstracting: (R5P<=ATP)
states: 176,894,515,156 (11)
abstracting: (348<=R5P)
states: 0
abstracting: (R5P<=ATP)
states: 176,894,515,156 (11)
abstracting: (348<=R5P)
states: 0
abstracting: (R5P<=ATP)
states: 176,894,515,156 (11)
EG iterations: 0
.-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.983sec
checking: [EF [[EX [[113<=Lac & ~ [A [ADP<=96 U a1<=99]]]] & A [[[[NADH<=R5P | _2PG<=NADPH] | AG [186<=_1_3_BPG]] & [A [start<=62 U 184<=Lac] & [Xu5P<=73 | _1_3_BPG<=268]]] U ~ [[[54<=DHAP | Ru5P<=136] & [367<=b2 | _1_3_BPG<=193]]]]]] & EF [G6P<=42]]
normalized: [E [true U G6P<=42] & E [true U [[~ [EG [[[367<=b2 | _1_3_BPG<=193] & [54<=DHAP | Ru5P<=136]]]] & ~ [E [[[367<=b2 | _1_3_BPG<=193] & [54<=DHAP | Ru5P<=136]] U [~ [[[[Xu5P<=73 | _1_3_BPG<=268] & [~ [EG [~ [184<=Lac]]] & ~ [E [~ [184<=Lac] U [~ [start<=62] & ~ [184<=Lac]]]]]] & [~ [E [true U ~ [186<=_1_3_BPG]]] | [NADH<=R5P | _2PG<=NADPH]]]] & [[367<=b2 | _1_3_BPG<=193] & [54<=DHAP | Ru5P<=136]]]]]] & EX [[113<=Lac & ~ [[~ [EG [~ [a1<=99]]] & ~ [E [~ [a1<=99] U [~ [ADP<=96] & ~ [a1<=99]]]]]]]]]]]
abstracting: (a1<=99)
states: 176,894,515,156 (11)
abstracting: (ADP<=96)
states: 16,616,178,837 (10)
abstracting: (a1<=99)
states: 176,894,515,156 (11)
abstracting: (a1<=99)
states: 176,894,515,156 (11)
.
EG iterations: 1
abstracting: (113<=Lac)
states: 0
.abstracting: (Ru5P<=136)
states: 176,894,515,156 (11)
abstracting: (54<=DHAP)
states: 0
abstracting: (_1_3_BPG<=193)
states: 176,894,515,156 (11)
abstracting: (367<=b2)
states: 0
abstracting: (_2PG<=NADPH)
states: 171,704,162,760 (11)
abstracting: (NADH<=R5P)
states: 4,780,421,717 (9)
abstracting: (186<=_1_3_BPG)
states: 0
abstracting: (184<=Lac)
states: 0
abstracting: (start<=62)
states: 176,894,515,156 (11)
abstracting: (184<=Lac)
states: 0
abstracting: (184<=Lac)
states: 0
EG iterations: 0
abstracting: (_1_3_BPG<=268)
states: 176,894,515,156 (11)
abstracting: (Xu5P<=73)
states: 176,894,515,156 (11)
abstracting: (Ru5P<=136)
states: 176,894,515,156 (11)
abstracting: (54<=DHAP)
states: 0
abstracting: (_1_3_BPG<=193)
states: 176,894,515,156 (11)
abstracting: (367<=b2)
states: 0
abstracting: (Ru5P<=136)
states: 176,894,515,156 (11)
abstracting: (54<=DHAP)
states: 0
abstracting: (_1_3_BPG<=193)
states: 176,894,515,156 (11)
abstracting: (367<=b2)
states: 0
EG iterations: 0
abstracting: (G6P<=42)
states: 176,894,515,156 (11)
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.437sec
checking: E [[[[~ [[GAP<=c2 | ~ [[166<=c1 & Xu5P<=Ru5P]]]] | E [AF [370<=Xu5P] U [E [b1<=a2 U 175<=start] | A [300<=a2 U 235<=_1_3_BPG]]]] & [AG [A [c1<=Pyr U FBP<=FBP]] | 287<=ATP]] | 188<=_2PG] U [AX [[EX [~ [G6P<=222]] | A [[NADPH<=Gluc | G6P<=F6P] U ~ [_2PG<=233]]]] | EF [362<=Lac]]]
normalized: E [[188<=_2PG | [[287<=ATP | ~ [E [true U ~ [[~ [EG [~ [FBP<=FBP]]] & ~ [E [~ [FBP<=FBP] U [~ [c1<=Pyr] & ~ [FBP<=FBP]]]]]]]]] & [E [~ [EG [~ [370<=Xu5P]]] U [[~ [EG [~ [235<=_1_3_BPG]]] & ~ [E [~ [235<=_1_3_BPG] U [~ [300<=a2] & ~ [235<=_1_3_BPG]]]]] | E [b1<=a2 U 175<=start]]] | ~ [[GAP<=c2 | ~ [[166<=c1 & Xu5P<=Ru5P]]]]]]] U [E [true U 362<=Lac] | ~ [EX [~ [[[~ [EG [_2PG<=233]] & ~ [E [_2PG<=233 U [_2PG<=233 & ~ [[NADPH<=Gluc | G6P<=F6P]]]]]] | EX [~ [G6P<=222]]]]]]]]
abstracting: (G6P<=222)
states: 176,894,515,156 (11)
.abstracting: (G6P<=F6P)
states: 41,495,943,880 (10)
abstracting: (NADPH<=Gluc)
states: 28,566,876,556 (10)
abstracting: (_2PG<=233)
states: 176,894,515,156 (11)
abstracting: (_2PG<=233)
states: 176,894,515,156 (11)
abstracting: (_2PG<=233)
states: 176,894,515,156 (11)
EG iterations: 0
.abstracting: (362<=Lac)
states: 0
abstracting: (Xu5P<=Ru5P)
states: 57,383,811,682 (10)
abstracting: (166<=c1)
states: 0
abstracting: (GAP<=c2)
states: 176,741,069,462 (11)
abstracting: (175<=start)
states: 0
abstracting: (b1<=a2)
states: 122,579,205,674 (11)
abstracting: (235<=_1_3_BPG)
states: 0
abstracting: (300<=a2)
states: 0
abstracting: (235<=_1_3_BPG)
states: 0
abstracting: (235<=_1_3_BPG)
states: 0
EG iterations: 0
abstracting: (370<=Xu5P)
states: 0
EG iterations: 0
abstracting: (FBP<=FBP)
states: 176,894,515,156 (11)
abstracting: (c1<=Pyr)
states: 2,752,603,110 (9)
abstracting: (FBP<=FBP)
states: 176,894,515,156 (11)
abstracting: (FBP<=FBP)
states: 176,894,515,156 (11)
.
EG iterations: 1
abstracting: (287<=ATP)
states: 176,894,515,156 (11)
abstracting: (188<=_2PG)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.658sec
totally nodes used: 12736816 (1.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 58808949 21074913 79883862
used/not used/entry size/cache size: 25025608 42083256 16 1024MB
basic ops cache: hits/miss/sum: 26563591 15541578 42105169
used/not used/entry size/cache size: 11906868 4870348 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: 1405227 710594 2115821
used/not used/entry size/cache size: 682906 7705702 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 56310277
1 9789184
2 901328
3 77363
4 10971
5 2173
6 837
7 711
8 481
9 2493
>= 10 13046
Total processing time: 0m45.679sec
BK_STOP 1679884143401
--------------------
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:1481 (67), effective:355 (16)
initing FirstDep: 0m 0.000sec
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:1480 (67), effective:356 (16)
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:576 (26), effective:75 (3)
iterations count:589 (26), effective:69 (3)
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:22 (1), effective:0 (0)
iterations count:526 (23), effective:82 (3)
iterations count:435 (19), effective:98 (4)
iterations count:843 (38), effective:120 (5)
iterations count:166 (7), effective:17 (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:275 (12), effective:47 (2)
iterations count:22 (1), effective:0 (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-C0010N0000000100"
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-C0010N0000000100, 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-167838845700825"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 '
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 ;