About the Execution of Marcie+red for GPPP-PT-C0010N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5704.756 | 30003.00 | 25686.00 | 3081.30 | TTFTTFTFFTFFTTFT | 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.r170-tall-167838857800822.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 marciexred
Input is GPPP-PT-C0010N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800822
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678642172531
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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:29:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:29:34] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-12 17:29:34] [INFO ] Transformed 33 places.
[2023-03-12 17:29:34] [INFO ] Transformed 22 transitions.
[2023-03-12 17:29:34] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 23 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 15) seen :4
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:29:36] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:29:36] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 17:29:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 17:29:36] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 17:29:39] [INFO ] After 1577ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :1
[2023-03-12 17:29:39] [INFO ] After 1590ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 17:29:39] [INFO ] After 2775ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :1
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=195 )
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 5363 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.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.741sec
RS generation: 0m 0.140sec
-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)
starting MCC model checker
--------------------------
checking: EF [9<=GAP]
normalized: E [true U 9<=GAP]
abstracting: (9<=GAP)
states: 506,583 (5)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.138sec
checking: EF [3<=_1_3_BPG]
normalized: E [true U 3<=_1_3_BPG]
abstracting: (3<=_1_3_BPG)
states: 2,184,177,360 (9)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.760sec
checking: AG [Pyr<=38]
normalized: ~ [E [true U ~ [Pyr<=38]]]
abstracting: (Pyr<=38)
states: 23,537,012,497 (10)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EF [~ [NADPH<=54]]
normalized: E [true U ~ [NADPH<=54]]
abstracting: (NADPH<=54)
states: 23,537,012,497 (10)
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [9<=NADH]
normalized: E [true U 9<=NADH]
abstracting: (9<=NADH)
states: 603,858,948 (8)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.281sec
checking: EF [[51<=Gluc & 16<=_2PG]]
normalized: E [true U [51<=Gluc & 16<=_2PG]]
abstracting: (16<=_2PG)
states: 0
abstracting: (51<=Gluc)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EF [[~ [F6P<=40] & [DHAP<=70 & 16<=GSH]]]
normalized: E [true U [[DHAP<=70 & 16<=GSH] & ~ [F6P<=40]]]
abstracting: (F6P<=40)
states: 23,537,012,497 (10)
abstracting: (16<=GSH)
states: 6,291,165,941 (9)
abstracting: (DHAP<=70)
states: 23,537,012,497 (10)
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [[[GAP<=17 & [FBP<=_2PG & ~ [20<=b1]]] & ~ [4<=GSSG]]]
normalized: E [true U [~ [4<=GSSG] & [GAP<=17 & [FBP<=_2PG & ~ [20<=b1]]]]]
abstracting: (20<=b1)
states: 6,486,539,871 (9)
abstracting: (FBP<=_2PG)
states: 20,419,514,059 (10)
abstracting: (GAP<=17)
states: 23,537,012,497 (10)
abstracting: (4<=GSSG)
states: 15,124,093,729 (10)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.247sec
checking: EF [~ [[~ [[~ [ATP<=46] & ~ [[NADH<=47 | [[[F6P<=10 | 6<=NADH] | GSH<=b1] & ~ [[GAP<=17 & 34<=GSSG]]]]]]] | 60<=G6P]]]
normalized: E [true U ~ [[60<=G6P | ~ [[~ [[NADH<=47 | [~ [[GAP<=17 & 34<=GSSG]] & [GSH<=b1 | [F6P<=10 | 6<=NADH]]]]] & ~ [ATP<=46]]]]]]
abstracting: (ATP<=46)
states: 23,537,012,273 (10)
abstracting: (6<=NADH)
states: 6,980,931,069 (9)
abstracting: (F6P<=10)
states: 23,537,012,497 (10)
abstracting: (GSH<=b1)
states: 12,379,203,721 (10)
abstracting: (34<=GSSG)
states: 0
abstracting: (GAP<=17)
states: 23,537,012,497 (10)
abstracting: (NADH<=47)
states: 23,537,012,497 (10)
abstracting: (60<=G6P)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.065sec
checking: AG [~ [[66<=GAP & [[Ru5P<=Pyr | [~ [a1<=70] & [~ [[F6P<=6 | NADPH<=NADH]] | [a1<=F6P & [[59<=b1 & DHAP<=R5P] | [4<=G6P & NADH<=GAP]]]]]] & ~ [69<=b1]]]]]
normalized: ~ [E [true U [66<=GAP & [~ [69<=b1] & [Ru5P<=Pyr | [[[a1<=F6P & [[4<=G6P & NADH<=GAP] | [59<=b1 & DHAP<=R5P]]] | ~ [[F6P<=6 | NADPH<=NADH]]] & ~ [a1<=70]]]]]]]
abstracting: (a1<=70)
states: 23,537,012,497 (10)
abstracting: (NADPH<=NADH)
states: 6,218,550,119 (9)
abstracting: (F6P<=6)
states: 23,537,012,497 (10)
abstracting: (DHAP<=R5P)
states: 13,066,500,991 (10)
abstracting: (59<=b1)
states: 0
abstracting: (NADH<=GAP)
states: 2,786,032,822 (9)
abstracting: (4<=G6P)
states: 12,241,243,914 (10)
abstracting: (a1<=F6P)
states: 1,567,410,313 (9)
abstracting: (Ru5P<=Pyr)
states: 3,105,188,357 (9)
abstracting: (69<=b1)
states: 0
abstracting: (66<=GAP)
states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.595sec
checking: AG [[[22<=a2 | DHAP<=25] | [_3PG<=18 & [[[[[[[Xu5P<=28 | F6P<=21] | ~ [NADPH<=16]] & 23<=Pyr] & [~ [[33<=FBP | 68<=Gluc]] | ~ [59<=ATP]]] | [32<=Pyr | [~ [[NADplus<=48 & b2<=70]] & [[Ru5P<=12 | a1<=a2] & ~ [66<=FBP]]]]] | [~ [G6P<=NADplus] & a1<=DHAP]] | ~ [[40<=start | 1<=c2]]]]]]
normalized: ~ [E [true U ~ [[[_3PG<=18 & [~ [[40<=start | 1<=c2]] | [[a1<=DHAP & ~ [G6P<=NADplus]] | [[32<=Pyr | [[~ [66<=FBP] & [Ru5P<=12 | a1<=a2]] & ~ [[NADplus<=48 & b2<=70]]]] | [[~ [59<=ATP] | ~ [[33<=FBP | 68<=Gluc]]] & [23<=Pyr & [~ [NADPH<=16] | [Xu5P<=28 | F6P<=21]]]]]]]] | [22<=a2 | DHAP<=25]]]]]
abstracting: (DHAP<=25)
states: 23,537,012,497 (10)
abstracting: (22<=a2)
states: 0
abstracting: (F6P<=21)
states: 23,537,012,497 (10)
abstracting: (Xu5P<=28)
states: 22,872,147,142 (10)
abstracting: (NADPH<=16)
states: 19,265,541,324 (10)
abstracting: (23<=Pyr)
states: 0
abstracting: (68<=Gluc)
states: 0
abstracting: (33<=FBP)
states: 0
abstracting: (59<=ATP)
states: 0
abstracting: (b2<=70)
states: 23,537,012,497 (10)
abstracting: (NADplus<=48)
states: 23,537,012,497 (10)
abstracting: (a1<=a2)
states: 17,059,153,322 (10)
abstracting: (Ru5P<=12)
states: 16,785,093,849 (10)
abstracting: (66<=FBP)
states: 0
abstracting: (32<=Pyr)
states: 0
abstracting: (G6P<=NADplus)
states: 21,917,494,813 (10)
abstracting: (a1<=DHAP)
states: 2,490,042,957 (9)
abstracting: (1<=c2)
states: 23,502,536,445 (10)
abstracting: (40<=start)
states: 0
abstracting: (_3PG<=18)
states: 23,537,012,497 (10)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.213sec
checking: EF [[[GAP<=67 & ~ [[[[~ [GAP<=52] | ~ [[[E4P<=19 | NADPplus<=36] | [c1<=E4P | Xu5P<=S7P]]]] & [52<=a2 & Gluc<=R5P]] | PEP<=PEP]]] & [45<=Gluc | [a2<=63 | ~ [[[~ [[33<=F6P | c2<=NADPplus]] & ~ [[FBP<=55 & ATP<=a2]]] | [69<=NADPplus | [~ [b1<=c2] | ~ [_2PG<=28]]]]]]]]]
normalized: E [true U [[45<=Gluc | [a2<=63 | ~ [[[69<=NADPplus | [~ [_2PG<=28] | ~ [b1<=c2]]] | [~ [[FBP<=55 & ATP<=a2]] & ~ [[33<=F6P | c2<=NADPplus]]]]]]] & [GAP<=67 & ~ [[PEP<=PEP | [[52<=a2 & Gluc<=R5P] & [~ [[[c1<=E4P | Xu5P<=S7P] | [E4P<=19 | NADPplus<=36]]] | ~ [GAP<=52]]]]]]]]
abstracting: (GAP<=52)
states: 23,537,012,497 (10)
abstracting: (NADPplus<=36)
states: 23,537,012,497 (10)
abstracting: (E4P<=19)
states: 23,537,012,497 (10)
abstracting: (Xu5P<=S7P)
states: 896,819,344 (8)
abstracting: (c1<=E4P)
states: 247,569,744 (8)
abstracting: (Gluc<=R5P)
states: 3,613,043,412 (9)
abstracting: (52<=a2)
states: 0
abstracting: (PEP<=PEP)
states: 23,537,012,497 (10)
abstracting: (GAP<=67)
states: 23,537,012,497 (10)
abstracting: (c2<=NADPplus)
states: 34,476,052 (7)
abstracting: (33<=F6P)
states: 0
abstracting: (ATP<=a2)
states: 16,949,961,321 (10)
abstracting: (FBP<=55)
states: 23,537,012,497 (10)
abstracting: (b1<=c2)
states: 23,504,693,719 (10)
abstracting: (_2PG<=28)
states: 23,537,012,497 (10)
abstracting: (69<=NADPplus)
states: 0
abstracting: (a2<=63)
states: 23,537,012,497 (10)
abstracting: (45<=Gluc)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.643sec
checking: EF [[[~ [11<=NADH] | [11<=F6P & ~ [[[[~ [Gluc<=65] & [DHAP<=a2 & c1<=GAP]] | DHAP<=68] | [[[Pyr<=NADH & start<=c2] & [6<=b2 & NADPplus<=43]] & ~ [S7P<=28]]]]]] & [[[b2<=FBP | b1<=9] | ~ [64<=Xu5P]] & [GSSG<=E4P & [~ [[23<=a1 | ~ [a1<=DHAP]]] & [~ [[[~ [Gluc<=30] & [Xu5P<=GSSG & NADPH<=37]] & [~ [S7P<=46] & [9<=Xu5P & _2PG<=25]]]] | [26<=_2PG | c1<=E4P]]]]]]]
normalized: E [true U [[[GSSG<=E4P & [[[26<=_2PG | c1<=E4P] | ~ [[[[9<=Xu5P & _2PG<=25] & ~ [S7P<=46]] & [[Xu5P<=GSSG & NADPH<=37] & ~ [Gluc<=30]]]]] & ~ [[23<=a1 | ~ [a1<=DHAP]]]]] & [~ [64<=Xu5P] | [b2<=FBP | b1<=9]]] & [[11<=F6P & ~ [[[~ [S7P<=28] & [[6<=b2 & NADPplus<=43] & [Pyr<=NADH & start<=c2]]] | [DHAP<=68 | [[DHAP<=a2 & c1<=GAP] & ~ [Gluc<=65]]]]]] | ~ [11<=NADH]]]]
abstracting: (11<=NADH)
states: 0
abstracting: (Gluc<=65)
states: 23,537,012,497 (10)
abstracting: (c1<=GAP)
states: 1,667,096,772 (9)
abstracting: (DHAP<=a2)
states: 23,170,276,525 (10)
abstracting: (DHAP<=68)
states: 23,537,012,497 (10)
abstracting: (start<=c2)
states: 23,537,012,496 (10)
abstracting: (Pyr<=NADH)
states: 23,537,012,497 (10)
abstracting: (NADPplus<=43)
states: 23,537,012,497 (10)
abstracting: (6<=b2)
states: 19,720,396,498 (10)
abstracting: (S7P<=28)
states: 23,537,012,497 (10)
abstracting: (11<=F6P)
states: 0
abstracting: (b1<=9)
states: 13,066,428,863 (10)
abstracting: (b2<=FBP)
states: 761,157,054 (8)
abstracting: (64<=Xu5P)
states: 0
abstracting: (a1<=DHAP)
states: 2,490,042,957 (9)
abstracting: (23<=a1)
states: 0
abstracting: (Gluc<=30)
states: 23,511,032,470 (10)
abstracting: (NADPH<=37)
states: 23,537,012,497 (10)
abstracting: (Xu5P<=GSSG)
states: 5,181,670,900 (9)
abstracting: (S7P<=46)
states: 23,537,012,497 (10)
abstracting: (_2PG<=25)
states: 23,537,012,497 (10)
abstracting: (9<=Xu5P)
states: 15,995,401,882 (10)
abstracting: (c1<=E4P)
states: 247,569,744 (8)
abstracting: (26<=_2PG)
states: 0
abstracting: (GSSG<=E4P)
states: 2,284,777,558 (9)
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.892sec
checking: AG [~ [[[[b2<=38 | [[[start<=5 | Pi<=ADP] & [[start<=E4P & [69<=NADplus & Gluc<=Lac]] | [a1<=F6P & [_2PG<=52 & DHAP<=21]]]] | ~ [Xu5P<=G6P]]] | ~ [[~ [[[NADPH<=25 & Gluc<=21] | NADPplus<=26]] & [[[GSSG<=31 | 14<=Ru5P] | 62<=G6P] & ~ [Lac<=60]]]]] & [67<=a2 & [~ [NADH<=52] | [~ [[[~ [60<=G6P] | [b2<=55 | 46<=_2PG]] | [NADPH<=b1 & [a2<=31 & NADPH<=NADPH]]]] & [[[[PEP<=17 & DHAP<=NADPH] & [DHAP<=46 | ATP<=58]] | [b1<=R5P & ~ [NADH<=c2]]] | ~ [[[37<=Lac | _1_3_BPG<=ATP] & b1<=DHAP]]]]]]]]]
normalized: ~ [E [true U [[67<=a2 & [[[~ [[b1<=DHAP & [37<=Lac | _1_3_BPG<=ATP]]] | [[b1<=R5P & ~ [NADH<=c2]] | [[DHAP<=46 | ATP<=58] & [PEP<=17 & DHAP<=NADPH]]]] & ~ [[[NADPH<=b1 & [a2<=31 & NADPH<=NADPH]] | [[b2<=55 | 46<=_2PG] | ~ [60<=G6P]]]]] | ~ [NADH<=52]]] & [~ [[[~ [Lac<=60] & [62<=G6P | [GSSG<=31 | 14<=Ru5P]]] & ~ [[NADPplus<=26 | [NADPH<=25 & Gluc<=21]]]]] | [b2<=38 | [~ [Xu5P<=G6P] | [[[a1<=F6P & [_2PG<=52 & DHAP<=21]] | [start<=E4P & [69<=NADplus & Gluc<=Lac]]] & [start<=5 | Pi<=ADP]]]]]]]]
abstracting: (Pi<=ADP)
states: 23,537,012,497 (10)
abstracting: (start<=5)
states: 23,537,012,497 (10)
abstracting: (Gluc<=Lac)
states: 5,604,628,860 (9)
abstracting: (69<=NADplus)
states: 0
abstracting: (start<=E4P)
states: 23,537,012,496 (10)
abstracting: (DHAP<=21)
states: 23,537,012,497 (10)
abstracting: (_2PG<=52)
states: 23,537,012,497 (10)
abstracting: (a1<=F6P)
states: 1,567,410,313 (9)
abstracting: (Xu5P<=G6P)
states: 6,188,768,779 (9)
abstracting: (b2<=38)
states: 23,537,012,497 (10)
abstracting: (Gluc<=21)
states: 22,887,940,560 (10)
abstracting: (NADPH<=25)
states: 23,537,012,497 (10)
abstracting: (NADPplus<=26)
states: 23,537,012,497 (10)
abstracting: (14<=Ru5P)
states: 6,076,463,631 (9)
abstracting: (GSSG<=31)
states: 23,537,012,497 (10)
abstracting: (62<=G6P)
states: 0
abstracting: (Lac<=60)
states: 23,537,012,497 (10)
abstracting: (NADH<=52)
states: 23,537,012,497 (10)
abstracting: (60<=G6P)
states: 0
abstracting: (46<=_2PG)
states: 0
abstracting: (b2<=55)
states: 23,537,012,497 (10)
abstracting: (NADPH<=NADPH)
states: 23,537,012,497 (10)
abstracting: (a2<=31)
states: 23,537,012,497 (10)
abstracting: (NADPH<=b1)
states: 12,376,875,497 (10)
abstracting: (DHAP<=NADPH)
states: 22,555,721,394 (10)
abstracting: (PEP<=17)
states: 23,537,012,497 (10)
abstracting: (ATP<=58)
states: 23,537,012,497 (10)
abstracting: (DHAP<=46)
states: 23,537,012,497 (10)
abstracting: (NADH<=c2)
states: 23,537,012,497 (10)
abstracting: (b1<=R5P)
states: 2,595,963,403 (9)
abstracting: (_1_3_BPG<=ATP)
states: 22,417,335,358 (10)
abstracting: (37<=Lac)
states: 0
abstracting: (b1<=DHAP)
states: 3,979,685,907 (9)
abstracting: (67<=a2)
states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.662sec
checking: EF [[[[~ [[[9<=DHAP | [[~ [51<=_1_3_BPG] & Xu5P<=GAP] & GSH<=_2PG]] | [[[~ [55<=NADPplus] | ~ [b2<=_3PG]] | [G6P<=64 & [G6P<=24 & Lac<=GAP]]] & NADplus<=G6P]]] & [[[[[[46<=F6P & c1<=69] | S7P<=F6P] | [[55<=GAP & ADP<=62] & [66<=NADplus | Lac<=NADPH]]] | [[~ [Pyr<=GSSG] | ~ [Lac<=GSH]] | [~ [R5P<=43] & ~ [_2PG<=40]]]] & ~ [Xu5P<=2]] & [[[[[ADP<=67 & b1<=c2] | [27<=Xu5P & Gluc<=28]] | [[62<=FBP | Pyr<=R5P] & ~ [61<=R5P]]] | [~ [c2<=ATP] & Lac<=ATP]] | 63<=S7P]]] | _2PG<=start] & ~ [[~ [[[NADplus<=Ru5P & ~ [[[4<=a2 & NADPplus<=13] | 24<=R5P]]] | [32<=S7P | DHAP<=58]]] | [~ [[~ [[b2<=70 & 39<=b2]] & ~ [c1<=13]]] | Lac<=40]]]]]
normalized: E [true U [~ [[[Lac<=40 | ~ [[~ [c1<=13] & ~ [[b2<=70 & 39<=b2]]]]] | ~ [[[32<=S7P | DHAP<=58] | [NADplus<=Ru5P & ~ [[24<=R5P | [4<=a2 & NADPplus<=13]]]]]]]] & [_2PG<=start | [[[63<=S7P | [[Lac<=ATP & ~ [c2<=ATP]] | [[~ [61<=R5P] & [62<=FBP | Pyr<=R5P]] | [[27<=Xu5P & Gluc<=28] | [ADP<=67 & b1<=c2]]]]] & [~ [Xu5P<=2] & [[[~ [_2PG<=40] & ~ [R5P<=43]] | [~ [Lac<=GSH] | ~ [Pyr<=GSSG]]] | [[[66<=NADplus | Lac<=NADPH] & [55<=GAP & ADP<=62]] | [S7P<=F6P | [46<=F6P & c1<=69]]]]]] & ~ [[[NADplus<=G6P & [[G6P<=64 & [G6P<=24 & Lac<=GAP]] | [~ [b2<=_3PG] | ~ [55<=NADPplus]]]] | [9<=DHAP | [GSH<=_2PG & [Xu5P<=GAP & ~ [51<=_1_3_BPG]]]]]]]]]]
abstracting: (51<=_1_3_BPG)
states: 0
abstracting: (Xu5P<=GAP)
states: 1,584,552,090 (9)
abstracting: (GSH<=_2PG)
states: 2,781,521,236 (9)
abstracting: (9<=DHAP)
states: 506,583 (5)
abstracting: (55<=NADPplus)
states: 0
abstracting: (b2<=_3PG)
states: 1,118,869,332 (9)
abstracting: (Lac<=GAP)
states: 15,533,268,814 (10)
abstracting: (G6P<=24)
states: 23,250,700,326 (10)
abstracting: (G6P<=64)
states: 23,537,012,497 (10)
abstracting: (NADplus<=G6P)
states: 1,908,896,067 (9)
abstracting: (c1<=69)
states: 23,502,536,445 (10)
abstracting: (46<=F6P)
states: 0
abstracting: (S7P<=F6P)
states: 18,508,713,685 (10)
abstracting: (ADP<=62)
states: 1
abstracting: (55<=GAP)
states: 0
abstracting: (Lac<=NADPH)
states: 22,507,862,619 (10)
abstracting: (66<=NADplus)
states: 0
abstracting: (Pyr<=GSSG)
states: 21,662,213,838 (10)
abstracting: (Lac<=GSH)
states: 22,196,885,968 (10)
abstracting: (R5P<=43)
states: 23,537,012,497 (10)
abstracting: (_2PG<=40)
states: 23,537,012,497 (10)
abstracting: (Xu5P<=2)
states: 2,665,297,449 (9)
abstracting: (b1<=c2)
states: 23,504,693,719 (10)
abstracting: (ADP<=67)
states: 90,780 (4)
abstracting: (Gluc<=28)
states: 23,466,226,498 (10)
abstracting: (27<=Xu5P)
states: 1,511,212,395 (9)
abstracting: (Pyr<=R5P)
states: 12,733,758,595 (10)
abstracting: (62<=FBP)
states: 0
abstracting: (61<=R5P)
states: 0
abstracting: (c2<=ATP)
states: 34,476,052 (7)
abstracting: (Lac<=ATP)
states: 23,379,164,959 (10)
abstracting: (63<=S7P)
states: 0
abstracting: (_2PG<=start)
states: 11,908,791,763 (10)
abstracting: (NADPplus<=13)
states: 15,454,809,783 (10)
abstracting: (4<=a2)
states: 21,653,984,706 (10)
abstracting: (24<=R5P)
states: 0
abstracting: (NADplus<=Ru5P)
states: 5,190,197,397 (9)
abstracting: (DHAP<=58)
states: 23,537,012,497 (10)
abstracting: (32<=S7P)
states: 0
abstracting: (39<=b2)
states: 0
abstracting: (b2<=70)
states: 23,537,012,497 (10)
abstracting: (c1<=13)
states: 23,502,536,445 (10)
abstracting: (Lac<=40)
states: 23,537,012,497 (10)
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.054sec
checking: EF [[[[41<=b1 | [[[[[ATP<=GSH & GSH<=_3PG] | ~ [[ATP<=17 | _3PG<=11]]] & NADplus<=57] | a2<=_3PG] & [~ [[[GAP<=68 | NADPplus<=45] & F6P<=65]] | [GAP<=Ru5P & E4P<=a2]]]] & [~ [[~ [[[a2<=35 | S7P<=NADPH] | DHAP<=28]] | [~ [[[ADP<=41 & 41<=PEP] & [45<=PEP | c2<=61]]] | [[[Ru5P<=NADH & 20<=FBP] | [Pyr<=PEP & G6P<=4]] | F6P<=c1]]]] & [~ [44<=Ru5P] | ~ [[[[~ [b2<=c2] | Pi<=Xu5P] | [F6P<=NADPH | [50<=_3PG & 29<=E4P]]] | [7<=DHAP | ~ [23<=Gluc]]]]]]] | [~ [[[67<=NADPplus | Ru5P<=c1] & ~ [PEP<=Pyr]]] & [~ [[~ [NADH<=32] & ~ [[[~ [50<=start] | ~ [45<=FBP]] | [[54<=Gluc & 17<=PEP] | [Gluc<=Gluc & NADplus<=64]]]]]] & [[[[~ [[b1<=Gluc & Gluc<=23]] & [[a2<=Pi & E4P<=_1_3_BPG] | _2PG<=DHAP]] | ~ [Pi<=29]] & [[GSSG<=63 | ~ [b1<=32]] | [[[55<=GAP | 1<=Ru5P] | [NADPplus<=69 & 69<=FBP]] | [[S7P<=ATP & 65<=a1] & [16<=Pi | DHAP<=b1]]]]] & 31<=_1_3_BPG]]]]]
normalized: E [true U [[[[31<=_1_3_BPG & [[[[[16<=Pi | DHAP<=b1] & [S7P<=ATP & 65<=a1]] | [[NADPplus<=69 & 69<=FBP] | [55<=GAP | 1<=Ru5P]]] | [GSSG<=63 | ~ [b1<=32]]] & [~ [Pi<=29] | [[_2PG<=DHAP | [a2<=Pi & E4P<=_1_3_BPG]] & ~ [[b1<=Gluc & Gluc<=23]]]]]] & ~ [[~ [[[[Gluc<=Gluc & NADplus<=64] | [54<=Gluc & 17<=PEP]] | [~ [45<=FBP] | ~ [50<=start]]]] & ~ [NADH<=32]]]] & ~ [[~ [PEP<=Pyr] & [67<=NADPplus | Ru5P<=c1]]]] | [[[~ [[[7<=DHAP | ~ [23<=Gluc]] | [[F6P<=NADPH | [50<=_3PG & 29<=E4P]] | [Pi<=Xu5P | ~ [b2<=c2]]]]] | ~ [44<=Ru5P]] & ~ [[[[F6P<=c1 | [[Pyr<=PEP & G6P<=4] | [Ru5P<=NADH & 20<=FBP]]] | ~ [[[45<=PEP | c2<=61] & [ADP<=41 & 41<=PEP]]]] | ~ [[DHAP<=28 | [a2<=35 | S7P<=NADPH]]]]]] & [41<=b1 | [[[GAP<=Ru5P & E4P<=a2] | ~ [[F6P<=65 & [GAP<=68 | NADPplus<=45]]]] & [a2<=_3PG | [NADplus<=57 & [~ [[ATP<=17 | _3PG<=11]] | [ATP<=GSH & GSH<=_3PG]]]]]]]]]
abstracting: (GSH<=_3PG)
states: 2,781,521,236 (9)
abstracting: (ATP<=GSH)
states: 13,743,402,093 (10)
abstracting: (_3PG<=11)
states: 23,537,012,497 (10)
abstracting: (ATP<=17)
states: 21,213,196,563 (10)
abstracting: (NADplus<=57)
states: 23,537,012,497 (10)
abstracting: (a2<=_3PG)
states: 836,317,510 (8)
abstracting: (NADPplus<=45)
states: 23,537,012,497 (10)
abstracting: (GAP<=68)
states: 23,537,012,497 (10)
abstracting: (F6P<=65)
states: 23,537,012,497 (10)
abstracting: (E4P<=a2)
states: 23,499,067,744 (10)
abstracting: (GAP<=Ru5P)
states: 22,130,052,272 (10)
abstracting: (41<=b1)
states: 0
abstracting: (S7P<=NADPH)
states: 23,212,941,247 (10)
abstracting: (a2<=35)
states: 23,537,012,497 (10)
abstracting: (DHAP<=28)
states: 23,537,012,497 (10)
abstracting: (41<=PEP)
states: 0
abstracting: (ADP<=41)
states: 1
abstracting: (c2<=61)
states: 1,516,260,895 (9)
abstracting: (45<=PEP)
states: 0
abstracting: (20<=FBP)
states: 0
abstracting: (Ru5P<=NADH)
states: 8,363,903,530 (9)
abstracting: (G6P<=4)
states: 13,274,880,781 (10)
abstracting: (Pyr<=PEP)
states: 15,564,790,072 (10)
abstracting: (F6P<=c1)
states: 23,350,775,278 (10)
abstracting: (44<=Ru5P)
states: 0
abstracting: (b2<=c2)
states: 23,503,573,677 (10)
abstracting: (Pi<=Xu5P)
states: 1
abstracting: (29<=E4P)
states: 0
abstracting: (50<=_3PG)
states: 0
abstracting: (F6P<=NADPH)
states: 23,224,280,266 (10)
abstracting: (23<=Gluc)
states: 512,781,643 (8)
abstracting: (7<=DHAP)
states: 20,393,958 (7)
abstracting: (Ru5P<=c1)
states: 9,641,474,456 (9)
abstracting: (67<=NADPplus)
states: 0
abstracting: (PEP<=Pyr)
states: 15,685,898,062 (10)
abstracting: (NADH<=32)
states: 23,537,012,497 (10)
abstracting: (50<=start)
states: 0
abstracting: (45<=FBP)
states: 0
abstracting: (17<=PEP)
states: 0
abstracting: (54<=Gluc)
states: 0
abstracting: (NADplus<=64)
states: 23,537,012,497 (10)
abstracting: (Gluc<=Gluc)
states: 23,537,012,497 (10)
abstracting: (Gluc<=23)
states: 23,140,235,190 (10)
abstracting: (b1<=Gluc)
states: 8,529,099,669 (9)
abstracting: (E4P<=_1_3_BPG)
states: 22,182,861,412 (10)
abstracting: (a2<=Pi)
states: 23,537,012,497 (10)
abstracting: (_2PG<=DHAP)
states: 15,581,610,601 (10)
abstracting: (Pi<=29)
states: 1
abstracting: (b1<=32)
states: 23,537,012,497 (10)
abstracting: (GSSG<=63)
states: 23,537,012,497 (10)
abstracting: (1<=Ru5P)
states: 21,845,981,592 (10)
abstracting: (55<=GAP)
states: 0
abstracting: (69<=FBP)
states: 0
abstracting: (NADPplus<=69)
states: 23,537,012,497 (10)
abstracting: (65<=a1)
states: 0
abstracting: (S7P<=ATP)
states: 23,336,153,164 (10)
abstracting: (DHAP<=b1)
states: 21,582,601,536 (10)
abstracting: (16<=Pi)
states: 23,537,012,496 (10)
abstracting: (31<=_1_3_BPG)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.096sec
totally nodes used: 2052121 (2.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6333639 3867451 10201090
used/not used/entry size/cache size: 4309137 62799727 16 1024MB
basic ops cache: hits/miss/sum: 13859453 9334612 23194065
used/not used/entry size/cache size: 8756544 8020672 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: 1601911 852803 2454714
used/not used/entry size/cache size: 811919 7576689 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 65257174
1 1752488
2 79009
3 8616
4 3662
5 2247
6 1804
7 1206
8 296
9 560
>= 10 1802
Total processing time: 0m13.540sec
BK_STOP 1678642202534
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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:967 (43), effective:192 (8)
iterations count:962 (43), effective:197 (8)
iterations count:1083 (49), effective:213 (9)
iterations count:894 (40), effective:175 (7)
iterations count:1469 (66), effective:294 (13)
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="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is GPPP-PT-C0010N0000000010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857800822"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;