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-167838856600006.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 ERK-PT-000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 ERK-PT-000001-ReachabilityCardinality-00
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-01
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-02
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-03
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-04
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-05
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-06
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-07
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-08
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-09
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-10
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-11
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-12
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-13
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-14
FORMULA_NAME ERK-PT-000001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678463920386

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=ERK-PT-000001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:58:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 15:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:58:42] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-10 15:58:42] [INFO ] Transformed 11 places.
[2023-03-10 15:58:42] [INFO ] Transformed 11 transitions.
[2023-03-10 15:58:42] [INFO ] Found NUPN structural information;
[2023-03-10 15:58:42] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA ERK-PT-000001-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000001-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :6
FORMULA ERK-PT-000001-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ERK-PT-000001-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ERK-PT-000001-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ERK-PT-000001-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ERK-PT-000001-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ERK-PT-000001-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:58:42] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-10 15:58:42] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 15:58:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 15:58:42] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ERK-PT-000001-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 499 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: ERK_PT_000001
(NrP: 11 NrTr: 11 NrArc: 34)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.809sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 21 (2.1e+01) #states 13



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

checking: AG [Raf1Star<=0]
normalized: ~ [E [true U ~ [Raf1Star<=0]]]

abstracting: (Raf1Star<=0)
states: 4
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=Raf1Star]
normalized: E [true U 1<=Raf1Star]

abstracting: (1<=Raf1Star)
states: 9
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [ERK<=0]]
normalized: ~ [E [true U ERK<=0]]

abstracting: (ERK<=0)
states: 9
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [Raf1Star<=1]
normalized: E [true U Raf1Star<=1]

abstracting: (Raf1Star<=1)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [ERK<=0] & ~ [1<=RKIP]]]]
normalized: ~ [E [true U [~ [1<=RKIP] & ~ [ERK<=0]]]]

abstracting: (ERK<=0)
states: 9
abstracting: (1<=RKIP)
states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [RKIPP_RP<=Raf1Star]
normalized: E [true U RKIPP_RP<=Raf1Star]

abstracting: (RKIPP_RP<=Raf1Star)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [RKIPP<=Raf1Star_RKIP_ERKPP] & ~ [1<=Raf1Star_RKIP]]]
normalized: ~ [E [true U ~ [[~ [1<=Raf1Star_RKIP] & ~ [RKIPP<=Raf1Star_RKIP_ERKPP]]]]]

abstracting: (RKIPP<=Raf1Star_RKIP_ERKPP)
states: 10
abstracting: (1<=Raf1Star_RKIP)
states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [RKIP<=RKIPP_RP] | RKIP<=RP]]]
normalized: ~ [E [true U [~ [RKIP<=RKIPP_RP] | RKIP<=RP]]]

abstracting: (RKIP<=RP)
states: 13
abstracting: (RKIP<=RKIPP_RP)
states: 10
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [RKIP<=1] & [~ [Raf1Star_RKIP<=RP] | [[1<=RKIP & ERK<=0] | Raf1Star_RKIP_ERKPP<=0]]]]
normalized: E [true U [[[[1<=RKIP & ERK<=0] | Raf1Star_RKIP_ERKPP<=0] | ~ [Raf1Star_RKIP<=RP]] & ~ [RKIP<=1]]]

abstracting: (RKIP<=1)
states: 13
abstracting: (Raf1Star_RKIP<=RP)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (ERK<=0)
states: 9
abstracting: (1<=RKIP)
states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[ERK<=RKIPP & [[[[RKIP<=1 | [[[RKIP<=0 & [RKIPP<=RKIP | Raf1Star_RKIP<=0]] & [[Raf1Star<=0 & 1<=MEKPP_ERK] | [1<=RP | RP<=RKIPP_RP]]] & [1<=MEKPP_ERK | 1<=Raf1Star]]] | ~ [[[1<=RP & [[Raf1Star_RKIP<=Raf1Star_RKIP & 1<=ERK] & ~ [Raf1Star_RKIP<=RKIPP]]] | [RKIPP<=RKIPP_RP | ~ [[1<=ERK & ERKPP<=0]]]]]] | ~ [RKIPP_RP<=1]] | [1<=ERK | 1<=RKIPP_RP]]]]
normalized: E [true U [[[~ [RKIPP_RP<=1] | [~ [[[~ [[1<=ERK & ERKPP<=0]] | RKIPP<=RKIPP_RP] | [[~ [Raf1Star_RKIP<=RKIPP] & [Raf1Star_RKIP<=Raf1Star_RKIP & 1<=ERK]] & 1<=RP]]] | [[[1<=MEKPP_ERK | 1<=Raf1Star] & [[[1<=RP | RP<=RKIPP_RP] | [Raf1Star<=0 & 1<=MEKPP_ERK]] & [[RKIPP<=RKIP | Raf1Star_RKIP<=0] & RKIP<=0]]] | RKIP<=1]]] | [1<=ERK | 1<=RKIPP_RP]] & ERK<=RKIPP]]

abstracting: (ERK<=RKIPP)
states: 10
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=ERK)
states: 4
abstracting: (RKIP<=1)
states: 13
abstracting: (RKIP<=0)
states: 10
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (RKIPP<=RKIP)
states: 10
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (Raf1Star<=0)
states: 4
abstracting: (RP<=RKIPP_RP)
states: 3
abstracting: (1<=RP)
states: 10
abstracting: (1<=Raf1Star)
states: 9
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (1<=RP)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (Raf1Star_RKIP<=Raf1Star_RKIP)
states: 13
abstracting: (Raf1Star_RKIP<=RKIPP)
states: 10
abstracting: (RKIPP<=RKIPP_RP)
states: 10
abstracting: (ERKPP<=0)
states: 9
abstracting: (1<=ERK)
states: 4
abstracting: (RKIPP_RP<=1)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[Raf1Star<=0 | [~ [1<=MEKPP] & 1<=MEKPP_ERK]]] | [~ [[[1<=Raf1Star_RKIP | [[ERK<=1 & 1<=Raf1Star_RKIP] & ~ [[RKIPP<=RKIP & RKIP<=0]]]] & ~ [[~ [[1<=Raf1Star_RKIP & Raf1Star_RKIP_ERKPP<=0]] | [~ [RKIPP_RP<=MEKPP_ERK] & 1<=ERKPP]]]]] | [~ [1<=Raf1Star_RKIP] | [RKIP<=RKIP | [[ERK<=Raf1Star_RKIP_ERKPP & [[~ [RP<=Raf1Star] & ~ [1<=RKIPP_RP]] & [[RKIPP<=0 & 1<=Raf1Star_RKIP_ERKPP] & [MEKPP<=RP & MEKPP<=RKIPP]]]] & Raf1Star_RKIP_ERKPP<=0]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[~ [[RKIPP<=RKIP & RKIP<=0]] & [ERK<=1 & 1<=Raf1Star_RKIP]] | 1<=Raf1Star_RKIP] & ~ [[[~ [RKIPP_RP<=MEKPP_ERK] & 1<=ERKPP] | ~ [[1<=Raf1Star_RKIP & Raf1Star_RKIP_ERKPP<=0]]]]]] | [[[[[[[MEKPP<=RP & MEKPP<=RKIPP] & [RKIPP<=0 & 1<=Raf1Star_RKIP_ERKPP]] & [~ [1<=RKIPP_RP] & ~ [RP<=Raf1Star]]] & ERK<=Raf1Star_RKIP_ERKPP] & Raf1Star_RKIP_ERKPP<=0] | RKIP<=RKIP] | ~ [1<=Raf1Star_RKIP]]] | ~ [[[~ [1<=MEKPP] & 1<=MEKPP_ERK] | Raf1Star<=0]]]]]]

abstracting: (Raf1Star<=0)
states: 4
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (1<=MEKPP)
states: 9
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (RKIP<=RKIP)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (ERK<=Raf1Star_RKIP_ERKPP)
states: 9
abstracting: (RP<=Raf1Star)
states: 9
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (RKIPP<=0)
states: 10
abstracting: (MEKPP<=RKIPP)
states: 6
abstracting: (MEKPP<=RP)
states: 11
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (1<=ERKPP)
states: 4
abstracting: (RKIPP_RP<=MEKPP_ERK)
states: 11
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (ERK<=1)
states: 13
abstracting: (RKIP<=0)
states: 10
abstracting: (RKIPP<=RKIP)
states: 10
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[Raf1Star_RKIP<=RP & [[~ [[[~ [ERKPP<=1] | [~ [MEKPP<=1] & ~ [1<=MEKPP]]] | [~ [RP<=RKIPP] & [[1<=Raf1Star_RKIP | RKIPP<=Raf1Star_RKIP] | [RKIPP_RP<=1 & Raf1Star_RKIP_ERKPP<=MEKPP]]]]] | [[1<=Raf1Star_RKIP & [~ [MEKPP<=0] | ~ [[[ERKPP<=1 | 1<=RKIPP_RP] & [ERKPP<=RKIPP | 1<=Raf1Star_RKIP]]]]] | [~ [Raf1Star_RKIP_ERKPP<=MEKPP] | RP<=MEKPP_ERK]]] | [[~ [Raf1Star_RKIP_ERKPP<=1] & 1<=RKIP] | [[~ [1<=RKIPP_RP] | RKIP<=0] & MEKPP<=Raf1Star_RKIP_ERKPP]]]]]
normalized: E [true U [[[~ [[[[~ [MEKPP<=1] & ~ [1<=MEKPP]] | ~ [ERKPP<=1]] | [[[RKIPP_RP<=1 & Raf1Star_RKIP_ERKPP<=MEKPP] | [1<=Raf1Star_RKIP | RKIPP<=Raf1Star_RKIP]] & ~ [RP<=RKIPP]]]] | [[~ [Raf1Star_RKIP_ERKPP<=MEKPP] | RP<=MEKPP_ERK] | [[~ [[[ERKPP<=RKIPP | 1<=Raf1Star_RKIP] & [ERKPP<=1 | 1<=RKIPP_RP]]] | ~ [MEKPP<=0]] & 1<=Raf1Star_RKIP]]] | [[[~ [1<=RKIPP_RP] | RKIP<=0] & MEKPP<=Raf1Star_RKIP_ERKPP] | [~ [Raf1Star_RKIP_ERKPP<=1] & 1<=RKIP]]] & Raf1Star_RKIP<=RP]]

abstracting: (Raf1Star_RKIP<=RP)
states: 13
abstracting: (1<=RKIP)
states: 3
abstracting: (Raf1Star_RKIP_ERKPP<=1)
states: 13
abstracting: (MEKPP<=Raf1Star_RKIP_ERKPP)
states: 5
abstracting: (RKIP<=0)
states: 10
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (MEKPP<=0)
states: 4
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (ERKPP<=1)
states: 13
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (ERKPP<=RKIPP)
states: 10
abstracting: (RP<=MEKPP_ERK)
states: 6
abstracting: (Raf1Star_RKIP_ERKPP<=MEKPP)
states: 13
abstracting: (RP<=RKIPP)
states: 6
abstracting: (RKIPP<=Raf1Star_RKIP)
states: 10
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (Raf1Star_RKIP_ERKPP<=MEKPP)
states: 13
abstracting: (RKIPP_RP<=1)
states: 13
abstracting: (ERKPP<=1)
states: 13
abstracting: (1<=MEKPP)
states: 9
abstracting: (MEKPP<=1)
states: 13
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [[[[[[1<=ERK & Raf1Star_RKIP_ERKPP<=0] & ~ [ERKPP<=MEKPP]] & ERKPP<=ERKPP] | ~ [Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP]] | [1<=RP & ~ [[~ [RKIPP_RP<=ERKPP] & [ERKPP<=RKIP | MEKPP_ERK<=1]]]]]] & [[[[~ [ERK<=Raf1Star] | [[1<=RP & ~ [RP<=RKIPP_RP]] | [~ [ERK<=RKIP] & RKIP<=1]]] | MEKPP<=RKIPP_RP] | RP<=Raf1Star] | ~ [[~ [[Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP & RKIPP_RP<=ERK]] & ~ [MEKPP<=ERK]]]]]]]
normalized: ~ [E [true U [[[[[[[~ [RP<=RKIPP_RP] & 1<=RP] | [~ [ERK<=RKIP] & RKIP<=1]] | ~ [ERK<=Raf1Star]] | MEKPP<=RKIPP_RP] | RP<=Raf1Star] | ~ [[~ [MEKPP<=ERK] & ~ [[Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP & RKIPP_RP<=ERK]]]]] & ~ [[[~ [[[ERKPP<=RKIP | MEKPP_ERK<=1] & ~ [RKIPP_RP<=ERKPP]]] & 1<=RP] | [~ [Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP] | [[~ [ERKPP<=MEKPP] & [1<=ERK & Raf1Star_RKIP_ERKPP<=0]] & ERKPP<=ERKPP]]]]]]]

abstracting: (ERKPP<=ERKPP)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (1<=ERK)
states: 4
abstracting: (ERKPP<=MEKPP)
states: 13
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP)
states: 13
abstracting: (1<=RP)
states: 10
abstracting: (RKIPP_RP<=ERKPP)
states: 11
abstracting: (MEKPP_ERK<=1)
states: 13
abstracting: (ERKPP<=RKIP)
states: 10
abstracting: (RKIPP_RP<=ERK)
states: 11
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP)
states: 13
abstracting: (MEKPP<=ERK)
states: 8
abstracting: (RP<=Raf1Star)
states: 9
abstracting: (MEKPP<=RKIPP_RP)
states: 6
abstracting: (ERK<=Raf1Star)
states: 12
abstracting: (RKIP<=1)
states: 13
abstracting: (ERK<=RKIP)
states: 10
abstracting: (1<=RP)
states: 10
abstracting: (RP<=RKIPP_RP)
states: 3
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [[~ [[[RKIPP<=1 & 1<=Raf1Star_RKIP] & ~ [1<=MEKPP]]] | [[[1<=ERK & 1<=RKIP] | MEKPP<=MEKPP_ERK] | ~ [RKIPP<=0]]]] & 1<=Raf1Star_RKIP] & [ERK<=Raf1Star_RKIP | [[~ [[Raf1Star_RKIP<=MEKPP & [[RKIPP_RP<=1 & MEKPP<=1] & ~ [1<=Raf1Star]]]] & [[~ [[~ [1<=ERKPP] & ~ [1<=RKIPP]]] & Raf1Star_RKIP_ERKPP<=0] | [~ [RP<=0] | [[~ [Raf1Star<=0] & [RKIPP_RP<=1 & 1<=Raf1Star_RKIP]] | [RP<=MEKPP | 1<=RKIPP]]]]] | [[~ [[1<=MEKPP | [~ [ERKPP<=MEKPP] | ~ [1<=RP]]]] | [Raf1Star<=1 | MEKPP_ERK<=1]] | RKIP<=1]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [RKIPP<=0] | [MEKPP<=MEKPP_ERK | [1<=ERK & 1<=RKIP]]] | ~ [[~ [1<=MEKPP] & [RKIPP<=1 & 1<=Raf1Star_RKIP]]]]] & 1<=Raf1Star_RKIP] & [[[[[Raf1Star<=1 | MEKPP_ERK<=1] | ~ [[[~ [1<=RP] | ~ [ERKPP<=MEKPP]] | 1<=MEKPP]]] | RKIP<=1] | [[[[[RP<=MEKPP | 1<=RKIPP] | [[RKIPP_RP<=1 & 1<=Raf1Star_RKIP] & ~ [Raf1Star<=0]]] | ~ [RP<=0]] | [~ [[~ [1<=RKIPP] & ~ [1<=ERKPP]]] & Raf1Star_RKIP_ERKPP<=0]] & ~ [[[~ [1<=Raf1Star] & [RKIPP_RP<=1 & MEKPP<=1]] & Raf1Star_RKIP<=MEKPP]]]] | ERK<=Raf1Star_RKIP]]]]]

abstracting: (ERK<=Raf1Star_RKIP)
states: 10
abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (MEKPP<=1)
states: 13
abstracting: (RKIPP_RP<=1)
states: 13
abstracting: (1<=Raf1Star)
states: 9
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (1<=ERKPP)
states: 4
abstracting: (1<=RKIPP)
states: 3
abstracting: (RP<=0)
states: 3
abstracting: (Raf1Star<=0)
states: 4
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (RKIPP_RP<=1)
states: 13
abstracting: (1<=RKIPP)
states: 3
abstracting: (RP<=MEKPP)
states: 10
abstracting: (RKIP<=1)
states: 13
abstracting: (1<=MEKPP)
states: 9
abstracting: (ERKPP<=MEKPP)
states: 13
abstracting: (1<=RP)
states: 10
abstracting: (MEKPP_ERK<=1)
states: 13
abstracting: (Raf1Star<=1)
states: 13
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (1<=Raf1Star_RKIP)
states: 3
abstracting: (RKIPP<=1)
states: 13
abstracting: (1<=MEKPP)
states: 9
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=ERK)
states: 4
abstracting: (MEKPP<=MEKPP_ERK)
states: 4
abstracting: (RKIPP<=0)
states: 10
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[RKIPP<=0 | [[[[[[[RKIPP<=0 | RKIPP_RP<=1] | ~ [ERKPP<=ERK]] & Raf1Star_RKIP_ERKPP<=1] & [ERK<=1 | [[Raf1Star<=RKIPP_RP & RKIP<=ERKPP] | [1<=MEKPP | MEKPP<=Raf1Star_RKIP_ERKPP]]]] & ~ [[~ [1<=RP] | [Raf1Star_RKIP<=1 | [MEKPP<=RKIP | Raf1Star<=1]]]]] & [1<=MEKPP_ERK & [[[[RP<=Raf1Star_RKIP & Raf1Star_RKIP_ERKPP<=1] & [RKIP<=ERKPP | Raf1Star_RKIP<=MEKPP]] & ~ [[RKIP<=ERKPP | Raf1Star_RKIP_ERKPP<=0]]] | [RKIPP<=1 & ~ [[1<=MEKPP | RKIP<=MEKPP]]]]]] | 1<=RKIPP_RP]]]]
normalized: E [true U ~ [[[[[[[~ [[1<=MEKPP | RKIP<=MEKPP]] & RKIPP<=1] | [~ [[RKIP<=ERKPP | Raf1Star_RKIP_ERKPP<=0]] & [[RKIP<=ERKPP | Raf1Star_RKIP<=MEKPP] & [RP<=Raf1Star_RKIP & Raf1Star_RKIP_ERKPP<=1]]]] & 1<=MEKPP_ERK] & [~ [[[[MEKPP<=RKIP | Raf1Star<=1] | Raf1Star_RKIP<=1] | ~ [1<=RP]]] & [[[[1<=MEKPP | MEKPP<=Raf1Star_RKIP_ERKPP] | [Raf1Star<=RKIPP_RP & RKIP<=ERKPP]] | ERK<=1] & [[~ [ERKPP<=ERK] | [RKIPP<=0 | RKIPP_RP<=1]] & Raf1Star_RKIP_ERKPP<=1]]]] | 1<=RKIPP_RP] | RKIPP<=0]]]

abstracting: (RKIPP<=0)
states: 10
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (Raf1Star_RKIP_ERKPP<=1)
states: 13
abstracting: (RKIPP_RP<=1)
states: 13
abstracting: (RKIPP<=0)
states: 10
abstracting: (ERKPP<=ERK)
states: 9
abstracting: (ERK<=1)
states: 13
abstracting: (RKIP<=ERKPP)
states: 11
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
abstracting: (MEKPP<=Raf1Star_RKIP_ERKPP)
states: 5
abstracting: (1<=MEKPP)
states: 9
abstracting: (1<=RP)
states: 10
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (Raf1Star<=1)
states: 13
abstracting: (MEKPP<=RKIP)
states: 6
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (Raf1Star_RKIP_ERKPP<=1)
states: 13
abstracting: (RP<=Raf1Star_RKIP)
states: 6
abstracting: (Raf1Star_RKIP<=MEKPP)
states: 12
abstracting: (RKIP<=ERKPP)
states: 11
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (RKIP<=ERKPP)
states: 11
abstracting: (RKIPP<=1)
states: 13
abstracting: (RKIP<=MEKPP)
states: 12
abstracting: (1<=MEKPP)
states: 9
-> the formula is TRUE

FORMULA ERK-PT-000001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[RKIP<=MEKPP_ERK & [ERKPP<=1 & [[[[Raf1Star<=0 | RKIP<=1] & [[[MEKPP_ERK<=RP | RP<=MEKPP_ERK] | [Raf1Star_RKIP_ERKPP<=0 & RKIPP_RP<=0]] & [[1<=MEKPP & RKIP<=0] & [1<=MEKPP_ERK & RP<=0]]]] | ~ [ERKPP<=1]] & [[~ [1<=RKIP] | [[~ [1<=RKIP] & 1<=Raf1Star_RKIP_ERKPP] | [~ [1<=RKIPP_RP] | ~ [1<=ERKPP]]]] | [RKIPP<=0 & [1<=RKIPP | [MEKPP_ERK<=1 | [RKIP<=RP & Raf1Star_RKIP<=1]]]]]]]] & [RKIPP_RP<=0 & [[[~ [[[[1<=Raf1Star | MEKPP_ERK<=RKIPP] | [Raf1Star<=RKIPP_RP | 1<=ERK]] & ~ [MEKPP_ERK<=0]]] & [[1<=RKIPP_RP | [~ [MEKPP<=Raf1Star] | [Raf1Star_RKIP<=0 & 1<=ERK]]] & ERK<=0]] & [~ [[[RKIPP<=RP | MEKPP_ERK<=MEKPP_ERK] & [RKIP<=1 & Raf1Star<=0]]] | [~ [[1<=Raf1Star & ~ [1<=RKIPP]]] & [[[Raf1Star_RKIP<=1 | 1<=RP] & 1<=Raf1Star_RKIP_ERKPP] & [ERKPP<=0 | [RKIP<=MEKPP_ERK & Raf1Star_RKIP<=1]]]]]] | [[[[[[1<=MEKPP_ERK & 1<=MEKPP] | [ERK<=1 & 1<=RKIP]] | ~ [[1<=RKIPP_RP | RKIPP<=0]]] & [ERK<=Raf1Star & RKIPP<=0]] & RP<=0] & ~ [MEKPP<=RP]]]]]]
normalized: E [true U [[[[[~ [[[RKIP<=1 & Raf1Star<=0] & [RKIPP<=RP | MEKPP_ERK<=MEKPP_ERK]]] | [[[[RKIP<=MEKPP_ERK & Raf1Star_RKIP<=1] | ERKPP<=0] & [[Raf1Star_RKIP<=1 | 1<=RP] & 1<=Raf1Star_RKIP_ERKPP]] & ~ [[~ [1<=RKIPP] & 1<=Raf1Star]]]] & [[[[[Raf1Star_RKIP<=0 & 1<=ERK] | ~ [MEKPP<=Raf1Star]] | 1<=RKIPP_RP] & ERK<=0] & ~ [[~ [MEKPP_ERK<=0] & [[Raf1Star<=RKIPP_RP | 1<=ERK] | [1<=Raf1Star | MEKPP_ERK<=RKIPP]]]]]] | [~ [MEKPP<=RP] & [[[ERK<=Raf1Star & RKIPP<=0] & [~ [[1<=RKIPP_RP | RKIPP<=0]] | [[ERK<=1 & 1<=RKIP] | [1<=MEKPP_ERK & 1<=MEKPP]]]] & RP<=0]]] & RKIPP_RP<=0] & [[[[[[[[RKIP<=RP & Raf1Star_RKIP<=1] | MEKPP_ERK<=1] | 1<=RKIPP] & RKIPP<=0] | [[[~ [1<=ERKPP] | ~ [1<=RKIPP_RP]] | [~ [1<=RKIP] & 1<=Raf1Star_RKIP_ERKPP]] | ~ [1<=RKIP]]] & [~ [ERKPP<=1] | [[[[1<=MEKPP_ERK & RP<=0] & [1<=MEKPP & RKIP<=0]] & [[Raf1Star_RKIP_ERKPP<=0 & RKIPP_RP<=0] | [MEKPP_ERK<=RP | RP<=MEKPP_ERK]]] & [Raf1Star<=0 | RKIP<=1]]]] & ERKPP<=1] & RKIP<=MEKPP_ERK]]]

abstracting: (RKIP<=MEKPP_ERK)
states: 11
abstracting: (ERKPP<=1)
states: 13
abstracting: (RKIP<=1)
states: 13
abstracting: (Raf1Star<=0)
states: 4
abstracting: (RP<=MEKPP_ERK)
states: 6
abstracting: (MEKPP_ERK<=RP)
states: 12
abstracting: (RKIPP_RP<=0)
states: 10
abstracting: (Raf1Star_RKIP_ERKPP<=0)
states: 12
abstracting: (RKIP<=0)
states: 10
abstracting: (1<=MEKPP)
states: 9
abstracting: (RP<=0)
states: 3
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (ERKPP<=1)
states: 13
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (1<=RKIP)
states: 3
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (1<=ERKPP)
states: 4
abstracting: (RKIPP<=0)
states: 10
abstracting: (1<=RKIPP)
states: 3
abstracting: (MEKPP_ERK<=1)
states: 13
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (RKIP<=RP)
states: 13
abstracting: (RKIPP_RP<=0)
states: 10
abstracting: (RP<=0)
states: 3
abstracting: (1<=MEKPP)
states: 9
abstracting: (1<=MEKPP_ERK)
states: 4
abstracting: (1<=RKIP)
states: 3
abstracting: (ERK<=1)
states: 13
abstracting: (RKIPP<=0)
states: 10
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (RKIPP<=0)
states: 10
abstracting: (ERK<=Raf1Star)
states: 12
abstracting: (MEKPP<=RP)
states: 11
abstracting: (MEKPP_ERK<=RKIPP)
states: 10
abstracting: (1<=Raf1Star)
states: 9
abstracting: (1<=ERK)
states: 4
abstracting: (Raf1Star<=RKIPP_RP)
states: 7
abstracting: (MEKPP_ERK<=0)
states: 9
abstracting: (ERK<=0)
states: 9
abstracting: (1<=RKIPP_RP)
states: 3
abstracting: (MEKPP<=Raf1Star)
states: 10
abstracting: (1<=ERK)
states: 4
abstracting: (Raf1Star_RKIP<=0)
states: 10
abstracting: (1<=Raf1Star)
states: 9
abstracting: (1<=RKIPP)
states: 3
abstracting: (1<=Raf1Star_RKIP_ERKPP)
states: 1
abstracting: (1<=RP)
states: 10
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (ERKPP<=0)
states: 9
abstracting: (Raf1Star_RKIP<=1)
states: 13
abstracting: (RKIP<=MEKPP_ERK)
states: 11
abstracting: (MEKPP_ERK<=MEKPP_ERK)
states: 13
abstracting: (RKIPP<=RP)
states: 13
abstracting: (Raf1Star<=0)
states: 4
abstracting: (RKIP<=1)
states: 13
-> the formula is FALSE

FORMULA ERK-PT-000001-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 580 (5.8e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 392 802 1194
used/not used/entry size/cache size: 925 67107939 16 1024MB
basic ops cache: hits/miss/sum: 646 1635 2281
used/not used/entry size/cache size: 3036 16774180 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: 300 214 514
used/not used/entry size/cache size: 214 8388394 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 67108300
1 548
2 16
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.429sec


BK_STOP 1678463929118

--------------------
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:35 (3), effective:8 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:36 (3), effective:7 (0)

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

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

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

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

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

iterations count:31 (2), effective:6 (0)

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

iterations count:32 (2), effective:6 (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="ERK-PT-000001"
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 ERK-PT-000001, 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-167838856600006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000001.tgz
mv ERK-PT-000001 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;