About the Execution of Marcie+red for MAPK-PT-00008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.955 | 9003.00 | 14467.00 | 248.70 | FTTTTTTFTTFTTFFT | 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.r234-tall-167856420500550.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 MAPK-PT-00008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500550
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-00008-ReachabilityCardinality-00
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-01
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-02
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-03
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-04
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-05
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-06
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-07
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-08
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-09
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-10
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-11
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-12
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-13
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-14
FORMULA_NAME MAPK-PT-00008-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679532418109
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=MAPK-PT-00008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:46:59] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 00:46:59] [INFO ] Transformed 22 places.
[2023-03-23 00:46:59] [INFO ] Transformed 30 transitions.
[2023-03-23 00:46:59] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 16) seen :4
FORMULA MAPK-PT-00008-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-00008-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-00008-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-00008-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 00:47:01] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-23 00:47:01] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 00:47:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-23 00:47:01] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :1
[2023-03-23 00:47:01] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 00:47:01] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA MAPK-PT-00008-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MAPK-PT-00008-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
FORMULA MAPK-PT-00008-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
All properties solved without resorting to model-checking.
Total runtime 1855 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: MAPK_PT_00008
(NrP: 22 NrTr: 30 NrArc: 90)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.714sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 667 (6.7e+02) #states 6,110,643 (6)
starting MCC model checker
--------------------------
checking: AG [ERK_MEKPP<=5]
normalized: ~ [E [true U ~ [ERK_MEKPP<=5]]]
abstracting: (ERK_MEKPP<=5)
states: 6,110,643 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [ERK<=0]
normalized: E [true U ERK<=0]
abstracting: (ERK<=0)
states: 2,599,933 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [8<=MEKPP_Phase2]
normalized: E [true U 8<=MEKPP_Phase2]
abstracting: (8<=MEKPP_Phase2)
states: 0
-> the formula is FALSE
FORMULA MAPK-PT-00008-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [ERK<=MEK_RafP]
normalized: E [true U ERK<=MEK_RafP]
abstracting: (ERK<=MEK_RafP)
states: 3,175,002 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [MEK_RafP<=Phase2]
normalized: ~ [E [true U ~ [MEK_RafP<=Phase2]]]
abstracting: (MEK_RafP<=Phase2)
states: 6,110,643 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[~ [MEKP<=Phase3] & Phase1<=RasGTP]]
normalized: E [true U [~ [MEKP<=Phase3] & Phase1<=RasGTP]]
abstracting: (Phase1<=RasGTP)
states: 903,384 (5)
abstracting: (MEKP<=Phase3)
states: 5,975,888 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [~ [[~ [[Raf<=MEKPP_Phase2 & Raf_RasGTP<=ERKP]] | [MEKPP<=ERKP & MEKPP_Phase2<=7]]]]
normalized: E [true U ~ [[[MEKPP<=ERKP & MEKPP_Phase2<=7] | ~ [[Raf<=MEKPP_Phase2 & Raf_RasGTP<=ERKP]]]]]
abstracting: (Raf_RasGTP<=ERKP)
states: 4,163,448 (6)
abstracting: (Raf<=MEKPP_Phase2)
states: 2,047,605 (6)
abstracting: (MEKPP_Phase2<=7)
states: 6,110,643 (6)
abstracting: (MEKPP<=ERKP)
states: 4,889,661 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: AG [[3<=MEKP_RafP | [ERKPP_Phase3<=Phase2 | [6<=MEKP | [~ [3<=Phase3] | [~ [6<=ERKP_Phase3] & ~ [[5<=MEKPP_Phase2 & ERKP_Phase3<=1]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [[5<=MEKPP_Phase2 & ERKP_Phase3<=1]] & ~ [6<=ERKP_Phase3]] | ~ [3<=Phase3]] | 6<=MEKP] | ERKPP_Phase3<=Phase2] | 3<=MEKP_RafP]]]]
abstracting: (3<=MEKP_RafP)
states: 72,912 (4)
abstracting: (ERKPP_Phase3<=Phase2)
states: 5,547,264 (6)
abstracting: (6<=MEKP)
states: 0
abstracting: (3<=Phase3)
states: 4,818,125 (6)
abstracting: (6<=ERKP_Phase3)
states: 17,185 (4)
abstracting: (ERKP_Phase3<=1)
states: 4,262,263 (6)
abstracting: (5<=MEKPP_Phase2)
states: 0
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[MEK_RafP<=6 | [[~ [[[Phase3<=7 | ~ [Phase3<=5]] & ERK_MEKPP<=6]] & [MEKPP_Phase2<=1 & [[[MEKP_Phase2<=4 | ERKP_MEKPP<=ERKP] | [ERKPP<=RafP | Raf<=2]] | ~ [MEKP_RafP<=7]]]] & 2<=ERK]]]]
normalized: E [true U ~ [[MEK_RafP<=6 | [[[MEKPP_Phase2<=1 & [~ [MEKP_RafP<=7] | [[ERKPP<=RafP | Raf<=2] | [MEKP_Phase2<=4 | ERKP_MEKPP<=ERKP]]]] & ~ [[ERK_MEKPP<=6 & [Phase3<=7 | ~ [Phase3<=5]]]]] & 2<=ERK]]]]
abstracting: (2<=ERK)
states: 1,848,380 (6)
abstracting: (Phase3<=5)
states: 5,173,040 (6)
abstracting: (Phase3<=7)
states: 6,110,643 (6)
abstracting: (ERK_MEKPP<=6)
states: 6,110,643 (6)
abstracting: (ERKP_MEKPP<=ERKP)
states: 5,401,147 (6)
abstracting: (MEKP_Phase2<=4)
states: 6,110,643 (6)
abstracting: (Raf<=2)
states: 3,764,713 (6)
abstracting: (ERKPP<=RafP)
states: 4,700,658 (6)
abstracting: (MEKP_RafP<=7)
states: 6,110,643 (6)
abstracting: (MEKPP_Phase2<=1)
states: 5,366,487 (6)
abstracting: (MEK_RafP<=6)
states: 6,110,643 (6)
-> the formula is FALSE
FORMULA MAPK-PT-00008-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[~ [[6<=Phase3 | [[[[Phase2<=ERKP_MEKPP | 5<=Phase1] | [2<=RafP_Phase1 & ~ [ERK<=4]]] & Raf<=8] | 8<=MEKP]]] & [6<=MEKP_Phase2 & ~ [[~ [[1<=MEK_RafP & 2<=Phase2]] | [1<=ERKP_Phase3 | MEK_RafP<=MEKP_RafP]]]]]]
normalized: E [true U [[6<=MEKP_Phase2 & ~ [[[1<=ERKP_Phase3 | MEK_RafP<=MEKP_RafP] | ~ [[1<=MEK_RafP & 2<=Phase2]]]]] & ~ [[6<=Phase3 | [8<=MEKP | [Raf<=8 & [[2<=RafP_Phase1 & ~ [ERK<=4]] | [Phase2<=ERKP_MEKPP | 5<=Phase1]]]]]]]]
abstracting: (5<=Phase1)
states: 2,816,031 (6)
abstracting: (Phase2<=ERKP_MEKPP)
states: 194,145 (5)
abstracting: (ERK<=4)
states: 6,010,040 (6)
abstracting: (2<=RafP_Phase1)
states: 3,294,612 (6)
abstracting: (Raf<=8)
states: 6,110,643 (6)
abstracting: (8<=MEKP)
states: 0
abstracting: (6<=Phase3)
states: 937,603 (5)
abstracting: (2<=Phase2)
states: 5,488,833 (6)
abstracting: (1<=MEK_RafP)
states: 1,831,956 (6)
abstracting: (MEK_RafP<=MEKP_RafP)
states: 4,647,279 (6)
abstracting: (1<=ERKP_Phase3)
states: 3,510,710 (6)
abstracting: (6<=MEKP_Phase2)
states: 0
-> the formula is FALSE
FORMULA MAPK-PT-00008-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [~ [[[3<=Phase2 | [~ [Raf<=RasGTP] | ERKPP<=4]] & [~ [RafP_Phase1<=8] & [[[MEK_RafP<=Raf_RasGTP | ~ [MEKP<=Phase2]] & [~ [[[Phase1<=MEK & Raf<=ERKPP_Phase3] | ~ [MEK_RafP<=ERK]]] & ~ [1<=Phase2]]] & 1<=ERKPP_Phase3]]]]]
normalized: ~ [E [true U [[[1<=ERKPP_Phase3 & [[~ [1<=Phase2] & ~ [[~ [MEK_RafP<=ERK] | [Phase1<=MEK & Raf<=ERKPP_Phase3]]]] & [MEK_RafP<=Raf_RasGTP | ~ [MEKP<=Phase2]]]] & ~ [RafP_Phase1<=8]] & [3<=Phase2 | [ERKPP<=4 | ~ [Raf<=RasGTP]]]]]]
abstracting: (Raf<=RasGTP)
states: 2,753,814 (6)
abstracting: (ERKPP<=4)
states: 6,010,040 (6)
abstracting: (3<=Phase2)
states: 4,222,155 (6)
abstracting: (RafP_Phase1<=8)
states: 6,110,643 (6)
abstracting: (MEKP<=Phase2)
states: 6,110,643 (6)
abstracting: (MEK_RafP<=Raf_RasGTP)
states: 5,168,177 (6)
abstracting: (Raf<=ERKPP_Phase3)
states: 2,634,993 (6)
abstracting: (Phase1<=MEK)
states: 542,334 (5)
abstracting: (MEK_RafP<=ERK)
states: 5,211,423 (6)
abstracting: (1<=Phase2)
states: 6,000,393 (6)
abstracting: (1<=ERKPP_Phase3)
states: 3,510,710 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [~ [[[[[[~ [MEKPP_Phase2<=MEK] | 3<=MEKPP_Phase2] | [7<=ERK_MEKPP & ~ [MEK<=1]]] | ERKP_Phase3<=6] | [~ [[[ERKPP<=MEK & MEKPP<=RafP_Phase1] & MEK_RafP<=8]] | [[Phase2<=RafP_Phase1 & ~ [[8<=Raf_RasGTP & ERKPP<=1]]] & [[[RafP<=MEKP_Phase2 & 6<=MEK_RafP] | [RafP_Phase1<=MEK | ERK<=ERKP_Phase3]] | ~ [Raf<=Phase2]]]]] | Raf_RasGTP<=1]]]
normalized: E [true U ~ [[Raf_RasGTP<=1 | [[[[~ [Raf<=Phase2] | [[RafP_Phase1<=MEK | ERK<=ERKP_Phase3] | [RafP<=MEKP_Phase2 & 6<=MEK_RafP]]] & [Phase2<=RafP_Phase1 & ~ [[8<=Raf_RasGTP & ERKPP<=1]]]] | ~ [[MEK_RafP<=8 & [ERKPP<=MEK & MEKPP<=RafP_Phase1]]]] | [ERKP_Phase3<=6 | [[7<=ERK_MEKPP & ~ [MEK<=1]] | [3<=MEKPP_Phase2 | ~ [MEKPP_Phase2<=MEK]]]]]]]]
abstracting: (MEKPP_Phase2<=MEK)
states: 4,346,475 (6)
abstracting: (3<=MEKPP_Phase2)
states: 171,990 (5)
abstracting: (MEK<=1)
states: 5,366,487 (6)
abstracting: (7<=ERK_MEKPP)
states: 0
abstracting: (ERKP_Phase3<=6)
states: 6,110,643 (6)
abstracting: (MEKPP<=RafP_Phase1)
states: 5,351,787 (6)
abstracting: (ERKPP<=MEK)
states: 3,378,312 (6)
abstracting: (MEK_RafP<=8)
states: 6,110,643 (6)
abstracting: (ERKPP<=1)
states: 4,262,263 (6)
abstracting: (8<=Raf_RasGTP)
states: 0
abstracting: (Phase2<=RafP_Phase1)
states: 2,391,993 (6)
abstracting: (6<=MEK_RafP)
states: 0
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
abstracting: (ERK<=ERKP_Phase3)
states: 3,840,359 (6)
abstracting: (RafP_Phase1<=MEK)
states: 2,166,900 (6)
abstracting: (Raf<=Phase2)
states: 4,452,766 (6)
abstracting: (Raf_RasGTP<=1)
states: 4,558,463 (6)
-> the formula is FALSE
FORMULA MAPK-PT-00008-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [[ERKP_MEKPP<=MEK_RafP & [[~ [Raf_RasGTP<=MEKP_Phase2] & ERKP_MEKPP<=MEKPP] & [MEKPP<=MEK_RafP & [[~ [[[ERKP_Phase3<=ERKPP & MEKPP_Phase2<=MEKPP_Phase2] & [~ [MEK_RafP<=7] | [6<=MEK_RafP | RafP<=ERKP_Phase3]]]] | [6<=Phase2 | [[~ [5<=MEKPP] | [RafP_Phase1<=RafP | MEK<=3]] | ~ [[5<=ERKP_MEKPP & 2<=ERKP_MEKPP]]]]] & [[Phase3<=Phase2 & ~ [ERK_MEKPP<=2]] & [Raf<=8 | [[[Raf_RasGTP<=7 | 3<=ERK] | [8<=Phase2 & RafP<=8]] & ~ [[1<=MEKP_RafP | MEKP<=7]]]]]]]]]]
normalized: E [true U [ERKP_MEKPP<=MEK_RafP & [[MEKPP<=MEK_RafP & [[[Raf<=8 | [~ [[1<=MEKP_RafP | MEKP<=7]] & [[8<=Phase2 & RafP<=8] | [Raf_RasGTP<=7 | 3<=ERK]]]] & [Phase3<=Phase2 & ~ [ERK_MEKPP<=2]]] & [[6<=Phase2 | [~ [[5<=ERKP_MEKPP & 2<=ERKP_MEKPP]] | [[RafP_Phase1<=RafP | MEK<=3] | ~ [5<=MEKPP]]]] | ~ [[[[6<=MEK_RafP | RafP<=ERKP_Phase3] | ~ [MEK_RafP<=7]] & [ERKP_Phase3<=ERKPP & MEKPP_Phase2<=MEKPP_Phase2]]]]]] & [ERKP_MEKPP<=MEKPP & ~ [Raf_RasGTP<=MEKP_Phase2]]]]]
abstracting: (Raf_RasGTP<=MEKP_Phase2)
states: 3,506,328 (6)
abstracting: (ERKP_MEKPP<=MEKPP)
states: 5,129,901 (6)
abstracting: (MEKPP_Phase2<=MEKPP_Phase2)
states: 6,110,643 (6)
abstracting: (ERKP_Phase3<=ERKPP)
states: 3,840,359 (6)
abstracting: (MEK_RafP<=7)
states: 6,110,643 (6)
abstracting: (RafP<=ERKP_Phase3)
states: 2,634,993 (6)
abstracting: (6<=MEK_RafP)
states: 0
abstracting: (5<=MEKPP)
states: 0
abstracting: (MEK<=3)
states: 6,088,593 (6)
abstracting: (RafP_Phase1<=RafP)
states: 3,530,251 (6)
abstracting: (2<=ERKP_MEKPP)
states: 235,725 (5)
abstracting: (5<=ERKP_MEKPP)
states: 0
abstracting: (6<=Phase2)
states: 0
abstracting: (ERK_MEKPP<=2)
states: 6,083,238 (6)
abstracting: (Phase3<=Phase2)
states: 2,472,695 (6)
abstracting: (3<=ERK)
states: 863,522 (5)
abstracting: (Raf_RasGTP<=7)
states: 6,110,643 (6)
abstracting: (RafP<=8)
states: 6,110,643 (6)
abstracting: (8<=Phase2)
states: 0
abstracting: (MEKP<=7)
states: 6,110,643 (6)
abstracting: (1<=MEKP_RafP)
states: 1,831,956 (6)
abstracting: (Raf<=8)
states: 6,110,643 (6)
abstracting: (MEKPP<=MEK_RafP)
states: 4,213,167 (6)
abstracting: (ERKP_MEKPP<=MEK_RafP)
states: 5,044,452 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AG [[~ [[[[[4<=MEK | ERKPP<=ERKP_MEKPP] & ~ [[~ [4<=Phase1] & ~ [[5<=Phase1 | Phase3<=Phase2]]]]] & [[[[[ERKP<=6 | RasGTP<=5] | [Raf<=RafP | ERKPP<=ERKP_MEKPP]] & [[ERKPP_Phase3<=5 | 5<=Raf] | [Phase3<=8 & Raf_RasGTP<=1]]] & [[~ [RasGTP<=4] & [2<=MEKPP_Phase2 & ERKPP_Phase3<=8]] & ERK_MEKPP<=ERKP_MEKPP]] | [[~ [RafP<=0] & [[Phase3<=RafP & ERKP<=7] | [MEKPP<=4 | 3<=ERKPP_Phase3]]] | [[[ERK<=7 & RasGTP<=4] & Raf_RasGTP<=ERKPP] & ~ [Raf<=ERKP_Phase3]]]]] & 3<=MEK]] | Phase2<=8]]
normalized: ~ [E [true U ~ [[Phase2<=8 | ~ [[3<=MEK & [[[[~ [Raf<=ERKP_Phase3] & [Raf_RasGTP<=ERKPP & [ERK<=7 & RasGTP<=4]]] | [[[MEKPP<=4 | 3<=ERKPP_Phase3] | [Phase3<=RafP & ERKP<=7]] & ~ [RafP<=0]]] | [[ERK_MEKPP<=ERKP_MEKPP & [[2<=MEKPP_Phase2 & ERKPP_Phase3<=8] & ~ [RasGTP<=4]]] & [[[Phase3<=8 & Raf_RasGTP<=1] | [ERKPP_Phase3<=5 | 5<=Raf]] & [[Raf<=RafP | ERKPP<=ERKP_MEKPP] | [ERKP<=6 | RasGTP<=5]]]]] & [~ [[~ [[5<=Phase1 | Phase3<=Phase2]] & ~ [4<=Phase1]]] & [4<=MEK | ERKPP<=ERKP_MEKPP]]]]]]]]]
abstracting: (ERKPP<=ERKP_MEKPP)
states: 3,016,170 (6)
abstracting: (4<=MEK)
states: 22,050 (4)
abstracting: (4<=Phase1)
states: 3,899,133 (6)
abstracting: (Phase3<=Phase2)
states: 2,472,695 (6)
abstracting: (5<=Phase1)
states: 2,816,031 (6)
abstracting: (RasGTP<=5)
states: 6,110,643 (6)
abstracting: (ERKP<=6)
states: 6,110,643 (6)
abstracting: (ERKPP<=ERKP_MEKPP)
states: 3,016,170 (6)
abstracting: (Raf<=RafP)
states: 3,423,276 (6)
abstracting: (5<=Raf)
states: 828,503 (5)
abstracting: (ERKPP_Phase3<=5)
states: 6,093,458 (6)
abstracting: (Raf_RasGTP<=1)
states: 4,558,463 (6)
abstracting: (Phase3<=8)
states: 6,110,643 (6)
abstracting: (RasGTP<=4)
states: 6,110,643 (6)
abstracting: (ERKPP_Phase3<=8)
states: 6,110,643 (6)
abstracting: (2<=MEKPP_Phase2)
states: 744,156 (5)
abstracting: (ERK_MEKPP<=ERKP_MEKPP)
states: 4,951,779 (6)
abstracting: (RafP<=0)
states: 1,409,345 (6)
abstracting: (ERKP<=7)
states: 6,110,643 (6)
abstracting: (Phase3<=RafP)
states: 1,878,035 (6)
abstracting: (3<=ERKPP_Phase3)
states: 863,522 (5)
abstracting: (MEKPP<=4)
states: 6,110,643 (6)
abstracting: (RasGTP<=4)
states: 6,110,643 (6)
abstracting: (ERK<=7)
states: 6,110,643 (6)
abstracting: (Raf_RasGTP<=ERKPP)
states: 4,163,448 (6)
abstracting: (Raf<=ERKP_Phase3)
states: 2,634,993 (6)
abstracting: (3<=MEK)
states: 171,990 (5)
abstracting: (Phase2<=8)
states: 6,110,643 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [[[2<=ERK | [~ [[[[[[ERKP_Phase3<=1 & MEK<=ERKPP_Phase3] & MEK_RafP<=Phase3] | [[RasGTP<=Phase1 & 8<=MEK] | ~ [ERKPP<=5]]] & [~ [MEK_RafP<=MEKP] & [~ [MEK<=RafP_Phase1] | [Phase3<=2 | 8<=RafP_Phase1]]]] | [~ [6<=RafP_Phase1] | RafP_Phase1<=Raf_RasGTP]]] | [2<=ERKPP_Phase3 & [ERKP<=MEKP_Phase2 | [[2<=ERKP | [~ [ERKPP<=ERK_MEKPP] & [Phase3<=6 & ERKP<=ERKPP]]] | [~ [[MEK_RafP<=MEKPP_Phase2 & ERK<=2]] & [[ERKP_MEKPP<=1 & MEK<=MEK_RafP] & ERKP_Phase3<=Raf_RasGTP]]]]]]] & 8<=Phase2]]
normalized: E [true U [8<=Phase2 & [2<=ERK | [[2<=ERKPP_Phase3 & [ERKP<=MEKP_Phase2 | [[[ERKP_Phase3<=Raf_RasGTP & [ERKP_MEKPP<=1 & MEK<=MEK_RafP]] & ~ [[MEK_RafP<=MEKPP_Phase2 & ERK<=2]]] | [2<=ERKP | [[Phase3<=6 & ERKP<=ERKPP] & ~ [ERKPP<=ERK_MEKPP]]]]]] | ~ [[[RafP_Phase1<=Raf_RasGTP | ~ [6<=RafP_Phase1]] | [[[[Phase3<=2 | 8<=RafP_Phase1] | ~ [MEK<=RafP_Phase1]] & ~ [MEK_RafP<=MEKP]] & [[~ [ERKPP<=5] | [RasGTP<=Phase1 & 8<=MEK]] | [MEK_RafP<=Phase3 & [ERKP_Phase3<=1 & MEK<=ERKPP_Phase3]]]]]]]]]]
abstracting: (MEK<=ERKPP_Phase3)
states: 4,889,661 (6)
abstracting: (ERKP_Phase3<=1)
states: 4,262,263 (6)
abstracting: (MEK_RafP<=Phase3)
states: 6,027,367 (6)
abstracting: (8<=MEK)
states: 0
abstracting: (RasGTP<=Phase1)
states: 5,669,010 (6)
abstracting: (ERKPP<=5)
states: 6,093,458 (6)
abstracting: (MEK_RafP<=MEKP)
states: 4,773,195 (6)
abstracting: (MEK<=RafP_Phase1)
states: 5,351,787 (6)
abstracting: (8<=RafP_Phase1)
states: 0
abstracting: (Phase3<=2)
states: 1,292,518 (6)
abstracting: (6<=RafP_Phase1)
states: 252,450 (5)
abstracting: (RafP_Phase1<=Raf_RasGTP)
states: 2,599,422 (6)
abstracting: (ERKPP<=ERK_MEKPP)
states: 3,016,170 (6)
abstracting: (ERKP<=ERKPP)
states: 3,840,359 (6)
abstracting: (Phase3<=6)
states: 6,110,643 (6)
abstracting: (2<=ERKP)
states: 1,848,380 (6)
abstracting: (ERK<=2)
states: 5,247,121 (6)
abstracting: (MEK_RafP<=MEKPP_Phase2)
states: 4,773,195 (6)
abstracting: (MEK<=MEK_RafP)
states: 4,213,167 (6)
abstracting: (ERKP_MEKPP<=1)
states: 5,874,918 (6)
abstracting: (ERKP_Phase3<=Raf_RasGTP)
states: 3,824,610 (6)
abstracting: (ERKP<=MEKP_Phase2)
states: 3,378,312 (6)
abstracting: (2<=ERKPP_Phase3)
states: 1,848,380 (6)
abstracting: (2<=ERK)
states: 1,848,380 (6)
abstracting: (8<=Phase2)
states: 0
-> the formula is FALSE
FORMULA MAPK-PT-00008-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [[[~ [RasGTP<=MEKP] & [[[[[ERKPP<=6 & ~ [6<=MEKP]] | ~ [RafP<=Raf]] & [~ [[~ [ERKP_Phase3<=7] | ~ [6<=RafP_Phase1]]] | [[~ [MEK<=3] & [ERKP<=ERK_MEKPP | MEKPP<=MEKP]] | [[ERKPP<=5 | MEKPP_Phase2<=6] & [Raf<=6 & RasGTP<=MEKP_Phase2]]]]] | [[ERKP_Phase3<=ERKP | [[ERKPP_Phase3<=6 | RafP_Phase1<=7] | Phase3<=ERK_MEKPP]] | ~ [ERKP<=7]]] & [~ [RasGTP<=8] & ~ [[~ [[[MEKP_RafP<=3 | MEK_RafP<=2] & ~ [ERKPP_Phase3<=MEKP]]] & ~ [[[MEKP_RafP<=5 & 4<=MEKP_RafP] & [5<=MEKPP_Phase2 | 4<=RasGTP]]]]]]]] | [[[[~ [[ERKPP_Phase3<=ERK & ~ [2<=ERKPP]]] | Phase2<=ERKP] & ~ [[~ [[~ [RafP_Phase1<=ERKPP_Phase3] & [8<=RafP | 7<=MEKP_Phase2]]] & [RafP<=MEKP_Phase2 & [4<=MEKPP_Phase2 & [7<=Phase2 | 6<=MEK_RafP]]]]]] | [4<=ERK | ERKP_MEKPP<=Phase3]] | [[~ [[[[MEKP_RafP<=Phase1 | MEKP_Phase2<=MEKPP] & [ERKP_Phase3<=Phase2 | [ERKPP_Phase3<=ERKPP_Phase3 & ERK<=Phase1]]] & [~ [3<=MEKPP] & [[RafP<=7 & ERKP<=MEK_RafP] | [1<=RafP & 4<=MEK]]]]] & 6<=MEKPP] & MEKP_Phase2<=3]]]]
normalized: ~ [E [true U ~ [[[[MEKP_Phase2<=3 & [6<=MEKPP & ~ [[[[[1<=RafP & 4<=MEK] | [RafP<=7 & ERKP<=MEK_RafP]] & ~ [3<=MEKPP]] & [[ERKP_Phase3<=Phase2 | [ERKPP_Phase3<=ERKPP_Phase3 & ERK<=Phase1]] & [MEKP_RafP<=Phase1 | MEKP_Phase2<=MEKPP]]]]]] | [[4<=ERK | ERKP_MEKPP<=Phase3] | [~ [[[RafP<=MEKP_Phase2 & [4<=MEKPP_Phase2 & [7<=Phase2 | 6<=MEK_RafP]]] & ~ [[[8<=RafP | 7<=MEKP_Phase2] & ~ [RafP_Phase1<=ERKPP_Phase3]]]]] & [Phase2<=ERKP | ~ [[ERKPP_Phase3<=ERK & ~ [2<=ERKPP]]]]]]] | [[[~ [[~ [[[5<=MEKPP_Phase2 | 4<=RasGTP] & [MEKP_RafP<=5 & 4<=MEKP_RafP]]] & ~ [[~ [ERKPP_Phase3<=MEKP] & [MEKP_RafP<=3 | MEK_RafP<=2]]]]] & ~ [RasGTP<=8]] & [[~ [ERKP<=7] | [ERKP_Phase3<=ERKP | [Phase3<=ERK_MEKPP | [ERKPP_Phase3<=6 | RafP_Phase1<=7]]]] | [[[[[Raf<=6 & RasGTP<=MEKP_Phase2] & [ERKPP<=5 | MEKPP_Phase2<=6]] | [[ERKP<=ERK_MEKPP | MEKPP<=MEKP] & ~ [MEK<=3]]] | ~ [[~ [6<=RafP_Phase1] | ~ [ERKP_Phase3<=7]]]] & [~ [RafP<=Raf] | [ERKPP<=6 & ~ [6<=MEKP]]]]]] & ~ [RasGTP<=MEKP]]]]]]
abstracting: (RasGTP<=MEKP)
states: 2,639,546 (6)
abstracting: (6<=MEKP)
states: 0
abstracting: (ERKPP<=6)
states: 6,110,643 (6)
abstracting: (RafP<=Raf)
states: 3,423,276 (6)
abstracting: (ERKP_Phase3<=7)
states: 6,110,643 (6)
abstracting: (6<=RafP_Phase1)
states: 252,450 (5)
abstracting: (MEK<=3)
states: 6,088,593 (6)
abstracting: (MEKPP<=MEKP)
states: 4,346,475 (6)
abstracting: (ERKP<=ERK_MEKPP)
states: 3,016,170 (6)
abstracting: (MEKPP_Phase2<=6)
states: 6,110,643 (6)
abstracting: (ERKPP<=5)
states: 6,093,458 (6)
abstracting: (RasGTP<=MEKP_Phase2)
states: 2,639,546 (6)
abstracting: (Raf<=6)
states: 5,976,223 (6)
abstracting: (RafP_Phase1<=7)
states: 6,110,643 (6)
abstracting: (ERKPP_Phase3<=6)
states: 6,110,643 (6)
abstracting: (Phase3<=ERK_MEKPP)
states: 180,451 (5)
abstracting: (ERKP_Phase3<=ERKP)
states: 3,840,359 (6)
abstracting: (ERKP<=7)
states: 6,110,643 (6)
abstracting: (RasGTP<=8)
states: 6,110,643 (6)
abstracting: (MEK_RafP<=2)
states: 6,037,731 (6)
abstracting: (MEKP_RafP<=3)
states: 6,104,133 (6)
abstracting: (ERKPP_Phase3<=MEKP)
states: 3,378,312 (6)
abstracting: (4<=MEKP_RafP)
states: 6,510 (3)
abstracting: (MEKP_RafP<=5)
states: 6,110,643 (6)
abstracting: (4<=RasGTP)
states: 0
abstracting: (5<=MEKPP_Phase2)
states: 0
abstracting: (2<=ERKPP)
states: 1,848,380 (6)
abstracting: (ERKPP_Phase3<=ERK)
states: 3,840,359 (6)
abstracting: (Phase2<=ERKP)
states: 1,207,565 (6)
abstracting: (RafP_Phase1<=ERKPP_Phase3)
states: 2,757,588 (6)
abstracting: (7<=MEKP_Phase2)
states: 0
abstracting: (8<=RafP)
states: 27,445 (4)
abstracting: (6<=MEK_RafP)
states: 0
abstracting: (7<=Phase2)
states: 0
abstracting: (4<=MEKPP_Phase2)
states: 22,050 (4)
abstracting: (RafP<=MEKP_Phase2)
states: 2,047,605 (6)
abstracting: (ERKP_MEKPP<=Phase3)
states: 6,110,643 (6)
abstracting: (4<=ERK)
states: 338,986 (5)
abstracting: (MEKP_Phase2<=MEKPP)
states: 4,346,475 (6)
abstracting: (MEKP_RafP<=Phase1)
states: 6,043,023 (6)
abstracting: (ERK<=Phase1)
states: 5,672,318 (6)
abstracting: (ERKPP_Phase3<=ERKPP_Phase3)
states: 6,110,643 (6)
abstracting: (ERKP_Phase3<=Phase2)
states: 5,547,264 (6)
abstracting: (3<=MEKPP)
states: 171,990 (5)
abstracting: (ERKP<=MEK_RafP)
states: 3,175,002 (6)
abstracting: (RafP<=7)
states: 6,083,198 (6)
abstracting: (4<=MEK)
states: 22,050 (4)
abstracting: (1<=RafP)
states: 4,701,298 (6)
abstracting: (6<=MEKPP)
states: 0
abstracting: (MEKP_Phase2<=3)
states: 6,088,593 (6)
-> the formula is TRUE
FORMULA MAPK-PT-00008-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
totally nodes used: 87410 (8.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 236546 216017 452563
used/not used/entry size/cache size: 248804 66860060 16 1024MB
basic ops cache: hits/miss/sum: 174858 170158 345016
used/not used/entry size/cache size: 304826 16472390 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: 36761 25340 62101
used/not used/entry size/cache size: 25336 8363272 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 67031362
1 74388
2 1879
3 433
4 334
5 91
6 48
7 41
8 27
9 26
>= 10 235
Total processing time: 0m 4.482sec
BK_STOP 1679532427112
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:761 (25), effective:112 (3)
initing FirstDep: 0m 0.000sec
iterations count:146 (4), effective:24 (0)
iterations count:146 (4), effective:24 (0)
iterations count:520 (17), effective:83 (2)
iterations count:600 (20), effective:74 (2)
iterations count:485 (16), effective:66 (2)
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="MAPK-PT-00008"
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 MAPK-PT-00008, 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 r234-tall-167856420500550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00008.tgz
mv MAPK-PT-00008 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 ;