About the Execution of Marcie+red for EGFr-PT-02010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.523 | 10580.00 | 12917.00 | 575.60 | TFTTFTTTTFFTFFTF | 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.r138-smll-167819421400646.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 EGFr-PT-02010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421400646
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 19:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 19:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 19:13 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 4.3K 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 4.6K 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 25 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 19:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 59K 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 EGFr-PT-02010-ReachabilityCardinality-00
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-01
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-02
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-03
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-04
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-05
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-06
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-07
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-08
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-09
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-10
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-11
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-12
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-13
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-14
FORMULA_NAME EGFr-PT-02010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679019058595
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=EGFr-PT-02010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 02:11:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 02:11:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 02:11:01] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-17 02:11:01] [INFO ] Transformed 40 places.
[2023-03-17 02:11:01] [INFO ] Transformed 68 transitions.
[2023-03-17 02:11:01] [INFO ] Found NUPN structural information;
[2023-03-17 02:11:01] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EGFr-PT-02010-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 447 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 5) seen :4
FORMULA EGFr-PT-02010-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EGFr-PT-02010-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EGFr-PT-02010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EGFr-PT-02010-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 02:11:02] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2023-03-17 02:11:02] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-17 02:11:02] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 02:11:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-17 02:11:02] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA EGFr-PT-02010-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1109 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: EGFr_PT_02010
(NrP: 40 NrTr: 68 NrArc: 338)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.499sec
RS generation: 0m 0.006sec
-> reachability set: #nodes 180 (1.8e+02) #states 4,200 (3)
starting MCC model checker
--------------------------
checking: EF [~ [ERalpha_equals_1<=1]]
normalized: E [true U ~ [ERalpha_equals_1<=1]]
abstracting: (ERalpha_equals_1<=1)
states: 4,200 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [ERBB3_equals_1<=0]]
normalized: ~ [E [true U ERBB3_equals_1<=0]]
abstracting: (ERBB3_equals_1<=0)
states: 939
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [1<=ERalpha_equals_0]
normalized: E [true U 1<=ERalpha_equals_0]
abstracting: (1<=ERalpha_equals_0)
states: 960
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [1<=p27_equals_0]
normalized: E [true U 1<=p27_equals_0]
abstracting: (1<=p27_equals_0)
states: 2,620 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [p21_equals_1<=MEK1_equals_0]
normalized: ~ [E [true U ~ [p21_equals_1<=MEK1_equals_0]]]
abstracting: (p21_equals_1<=MEK1_equals_0)
states: 3,198 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[IGF1R_equals_0<=1 | p27_equals_1<=1] | ~ [1<=pRB1_equals_1]]]
normalized: ~ [E [true U ~ [[~ [1<=pRB1_equals_1] | [IGF1R_equals_0<=1 | p27_equals_1<=1]]]]]
abstracting: (p27_equals_1<=1)
states: 4,200 (3)
abstracting: (IGF1R_equals_0<=1)
states: 4,200 (3)
abstracting: (1<=pRB1_equals_1)
states: 243
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[ERBB2_equals_0<=ERBB2_equals_0 & p27_equals_0<=1]]
normalized: ~ [E [true U ~ [[ERBB2_equals_0<=ERBB2_equals_0 & p27_equals_0<=1]]]]
abstracting: (p27_equals_0<=1)
states: 4,200 (3)
abstracting: (ERBB2_equals_0<=ERBB2_equals_0)
states: 4,200 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[1<=ERBB1_2_equals_1 | ~ [ERalpha_equals_0<=IGF1R_equals_1]]]]
normalized: E [true U ~ [[~ [ERalpha_equals_0<=IGF1R_equals_1] | 1<=ERBB1_2_equals_1]]]
abstracting: (1<=ERBB1_2_equals_1)
states: 1,545 (3)
abstracting: (ERalpha_equals_0<=IGF1R_equals_1)
states: 3,578 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[CyclinE1_equals_1<=MEK1_equals_0 | CyclinE1_equals_0<=MYC_equals_1]]
normalized: ~ [E [true U ~ [[CyclinE1_equals_1<=MEK1_equals_0 | CyclinE1_equals_0<=MYC_equals_1]]]]
abstracting: (CyclinE1_equals_0<=MYC_equals_1)
states: 3,528 (3)
abstracting: (CyclinE1_equals_1<=MEK1_equals_0)
states: 2,861 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[1<=ERBB2_3_equals_0 | [~ [[1<=MEK1_equals_1 & [~ [EGF_equals_0<=0] | ~ [[~ [CyclinE1_equals_1<=1] | [~ [CDK6_equals_0<=0] & ~ [ERBB3_equals_1<=0]]]]]]] | CDK6_equals_0<=1]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [[[~ [ERBB3_equals_1<=0] & ~ [CDK6_equals_0<=0]] | ~ [CyclinE1_equals_1<=1]]] | ~ [EGF_equals_0<=0]] & 1<=MEK1_equals_1]] | CDK6_equals_0<=1] | 1<=ERBB2_3_equals_0]]]]
abstracting: (1<=ERBB2_3_equals_0)
states: 2,801 (3)
abstracting: (CDK6_equals_0<=1)
states: 4,200 (3)
abstracting: (1<=MEK1_equals_1)
states: 2,693 (3)
abstracting: (EGF_equals_0<=0)
states: 4,196 (3)
abstracting: (CyclinE1_equals_1<=1)
states: 4,200 (3)
abstracting: (CDK6_equals_0<=0)
states: 1,215 (3)
abstracting: (ERBB3_equals_1<=0)
states: 939
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[[~ [[[[AKT1_equals_1<=0 | [ERalpha_equals_0<=CyclinE1_equals_0 | 1<=AKT1_0]] | ~ [CDK2_equals_1<=0]] & [~ [[1<=IGF1R_equals_0 | CDK6_equals_0<=AKT1_0]] & pRB1_equals_0<=0]]] | 1<=MEK1_equals_0] | ~ [[[ERBB1_3_equals_1<=0 & ~ [[[MEK1_equals_1<=ERalpha_equals_0 & pRB1_equals_0<=1] & ~ [CDK6_equals_1<=MEK1_equals_0]]]] | CyclinE1_equals_1<=1]]]]]
normalized: ~ [E [true U [~ [[[~ [[~ [CDK6_equals_1<=MEK1_equals_0] & [MEK1_equals_1<=ERalpha_equals_0 & pRB1_equals_0<=1]]] & ERBB1_3_equals_1<=0] | CyclinE1_equals_1<=1]] | [~ [[[~ [[1<=IGF1R_equals_0 | CDK6_equals_0<=AKT1_0]] & pRB1_equals_0<=0] & [~ [CDK2_equals_1<=0] | [[ERalpha_equals_0<=CyclinE1_equals_0 | 1<=AKT1_0] | AKT1_equals_1<=0]]]] | 1<=MEK1_equals_0]]]]
abstracting: (1<=MEK1_equals_0)
states: 1,507 (3)
abstracting: (AKT1_equals_1<=0)
states: 1,338 (3)
abstracting: (1<=AKT1_0)
states: 1,338 (3)
abstracting: (ERalpha_equals_0<=CyclinE1_equals_0)
states: 3,860 (3)
abstracting: (CDK2_equals_1<=0)
states: 3,646 (3)
abstracting: (pRB1_equals_0<=0)
states: 243
abstracting: (CDK6_equals_0<=AKT1_0)
states: 2,148 (3)
abstracting: (1<=IGF1R_equals_0)
states: 2,302 (3)
abstracting: (CyclinE1_equals_1<=1)
states: 4,200 (3)
abstracting: (ERBB1_3_equals_1<=0)
states: 2,655 (3)
abstracting: (pRB1_equals_0<=1)
states: 4,200 (3)
abstracting: (MEK1_equals_1<=ERalpha_equals_0)
states: 2,040 (3)
abstracting: (CDK6_equals_1<=MEK1_equals_0)
states: 3,390 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [1<=MYC_equals_1] | [[[[~ [ERalpha_equals_1<=pRB1_equals_1] & ~ [CDK4_equals_1<=1]] & 1<=p27_equals_1] | CyclinD1_equals_0<=AKT1_equals_1] & [[~ [ERBB1_3_equals_1<=0] | ~ [ERBB1_equals_1<=p27_equals_0]] & [~ [[~ [[CyclinD1_equals_0<=0 & 1<=ERBB1_2_equals_0]] & [[ERBB1_2_equals_1<=CyclinD1_equals_1 | 1<=AKT1_0] | ~ [ERBB3_equals_0<=0]]]] & ERBB2_equals_1<=CDK2_equals_0]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[~ [ERBB3_equals_0<=0] | [ERBB1_2_equals_1<=CyclinD1_equals_1 | 1<=AKT1_0]] & ~ [[CyclinD1_equals_0<=0 & 1<=ERBB1_2_equals_0]]]] & ERBB2_equals_1<=CDK2_equals_0] & [~ [ERBB1_equals_1<=p27_equals_0] | ~ [ERBB1_3_equals_1<=0]]] & [[[~ [CDK4_equals_1<=1] & ~ [ERalpha_equals_1<=pRB1_equals_1]] & 1<=p27_equals_1] | CyclinD1_equals_0<=AKT1_equals_1]] | ~ [1<=MYC_equals_1]]]]]
abstracting: (1<=MYC_equals_1)
states: 3,528 (3)
abstracting: (CyclinD1_equals_0<=AKT1_equals_1)
states: 3,591 (3)
abstracting: (1<=p27_equals_1)
states: 1,580 (3)
abstracting: (ERalpha_equals_1<=pRB1_equals_1)
states: 1,203 (3)
abstracting: (CDK4_equals_1<=1)
states: 4,200 (3)
abstracting: (ERBB1_3_equals_1<=0)
states: 2,655 (3)
abstracting: (ERBB1_equals_1<=p27_equals_0)
states: 2,692 (3)
abstracting: (ERBB2_equals_1<=CDK2_equals_0)
states: 3,769 (3)
abstracting: (1<=ERBB1_2_equals_0)
states: 2,655 (3)
abstracting: (CyclinD1_equals_0<=0)
states: 2,187 (3)
abstracting: (1<=AKT1_0)
states: 1,338 (3)
abstracting: (ERBB1_2_equals_1<=CyclinD1_equals_1)
states: 3,465 (3)
abstracting: (ERBB3_equals_0<=0)
states: 3,261 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [[[~ [[~ [[[1<=CyclinE1_equals_0 | ~ [[1<=ERBB1_3_equals_0 | 1<=MEK1_equals_1]]] | ~ [[MEK1_equals_1<=AKT1_0 | [CDK2_equals_1<=ERalpha_equals_0 | 1<=ERBB2_3_equals_0]]]]] & ~ [[[[1<=ERalpha_equals_0 & 1<=ERalpha_equals_1] | ~ [1<=p21_equals_1]] & AKT1_0<=ERalpha_equals_1]]]] | [[[[[[[CyclinD1_equals_1<=0 & 1<=ERBB2_3_equals_1] | ~ [ERBB3_equals_1<=1]] | [[CDK6_equals_0<=0 & CyclinE1_equals_1<=1] & [MEK1_equals_1<=EGF_equals_1 | pRB1_equals_1<=1]]] & [[CDK6_equals_1<=CDK4_equals_0 | MYC_equals_1<=p27_equals_0] & CDK4_equals_0<=0]] | ~ [[1<=ERBB3_equals_1 | pRB1_equals_1<=1]]] & pRB1_equals_0<=AKT1_0] & 1<=p21_equals_1]] | ERalpha_equals_0<=1]]
normalized: ~ [E [true U ~ [[[[[[~ [[1<=ERBB3_equals_1 | pRB1_equals_1<=1]] | [[[CDK6_equals_1<=CDK4_equals_0 | MYC_equals_1<=p27_equals_0] & CDK4_equals_0<=0] & [[[MEK1_equals_1<=EGF_equals_1 | pRB1_equals_1<=1] & [CDK6_equals_0<=0 & CyclinE1_equals_1<=1]] | [~ [ERBB3_equals_1<=1] | [CyclinD1_equals_1<=0 & 1<=ERBB2_3_equals_1]]]]] & pRB1_equals_0<=AKT1_0] & 1<=p21_equals_1] | ~ [[~ [[[~ [1<=p21_equals_1] | [1<=ERalpha_equals_0 & 1<=ERalpha_equals_1]] & AKT1_0<=ERalpha_equals_1]] & ~ [[~ [[[CDK2_equals_1<=ERalpha_equals_0 | 1<=ERBB2_3_equals_0] | MEK1_equals_1<=AKT1_0]] | [~ [[1<=ERBB1_3_equals_0 | 1<=MEK1_equals_1]] | 1<=CyclinE1_equals_0]]]]]] | ERalpha_equals_0<=1]]]]
abstracting: (ERalpha_equals_0<=1)
states: 4,200 (3)
abstracting: (1<=CyclinE1_equals_0)
states: 2,159 (3)
abstracting: (1<=MEK1_equals_1)
states: 2,693 (3)
abstracting: (1<=ERBB1_3_equals_0)
states: 2,655 (3)
abstracting: (MEK1_equals_1<=AKT1_0)
states: 2,769 (3)
abstracting: (1<=ERBB2_3_equals_0)
states: 2,801 (3)
abstracting: (CDK2_equals_1<=ERalpha_equals_0)
states: 3,714 (3)
abstracting: (AKT1_0<=ERalpha_equals_1)
states: 3,942 (3)
abstracting: (1<=ERalpha_equals_1)
states: 3,240 (3)
abstracting: (1<=ERalpha_equals_0)
states: 960
abstracting: (1<=p21_equals_1)
states: 1,580 (3)
abstracting: (1<=p21_equals_1)
states: 1,580 (3)
abstracting: (pRB1_equals_0<=AKT1_0)
states: 1,500 (3)
abstracting: (1<=ERBB2_3_equals_1)
states: 1,399 (3)
abstracting: (CyclinD1_equals_1<=0)
states: 2,013 (3)
abstracting: (ERBB3_equals_1<=1)
states: 4,200 (3)
abstracting: (CyclinE1_equals_1<=1)
states: 4,200 (3)
abstracting: (CDK6_equals_0<=0)
states: 1,215 (3)
abstracting: (pRB1_equals_1<=1)
states: 4,200 (3)
abstracting: (MEK1_equals_1<=EGF_equals_1)
states: 4,200 (3)
abstracting: (CDK4_equals_0<=0)
states: 729
abstracting: (MYC_equals_1<=p27_equals_0)
states: 2,956 (3)
abstracting: (CDK6_equals_1<=CDK4_equals_0)
states: 3,714 (3)
abstracting: (pRB1_equals_1<=1)
states: 4,200 (3)
abstracting: (1<=ERBB3_equals_1)
states: 3,261 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[IGF1R_equals_0<=1 | [[[[[[~ [ERBB2_equals_0<=MEK1_equals_1] | [[1<=MYC_equals_1 & 1<=ERBB1_3_equals_0] | [ERBB2_3_equals_1<=1 | 1<=ERBB2_equals_1]]] | ~ [[1<=CDK2_equals_0 & ~ [1<=ERBB1_2_equals_0]]]] & [pRB1_equals_0<=CDK2_equals_1 & ~ [[ERBB2_3_equals_1<=ERBB2_equals_0 & ERalpha_equals_1<=1]]]] & pRB1_equals_0<=AKT1_equals_1] & ERBB1_3_equals_0<=MYC_equals_1] & [[[p21_equals_1<=CyclinD1_equals_1 | [[MEK1_equals_1<=p21_equals_1 & [~ [1<=ERBB1_2_equals_0] & ERBB1_equals_1<=ERBB1_3_equals_0]] & ~ [[~ [CDK6_equals_0<=IGF1R_equals_0] & [CyclinE1_equals_0<=0 & 1<=ERalpha_equals_1]]]]] & ~ [1<=CyclinE1_equals_1]] & ~ [[~ [[1<=pRB1_equals_1 | CDK4_equals_0<=ERalpha_equals_0]] | ~ [[AKT1_0<=0 | 1<=ERBB1_2_equals_0]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [[AKT1_0<=0 | 1<=ERBB1_2_equals_0]] | ~ [[1<=pRB1_equals_1 | CDK4_equals_0<=ERalpha_equals_0]]]] & [~ [1<=CyclinE1_equals_1] & [[~ [[[CyclinE1_equals_0<=0 & 1<=ERalpha_equals_1] & ~ [CDK6_equals_0<=IGF1R_equals_0]]] & [[~ [1<=ERBB1_2_equals_0] & ERBB1_equals_1<=ERBB1_3_equals_0] & MEK1_equals_1<=p21_equals_1]] | p21_equals_1<=CyclinD1_equals_1]]] & [[[[~ [[ERBB2_3_equals_1<=ERBB2_equals_0 & ERalpha_equals_1<=1]] & pRB1_equals_0<=CDK2_equals_1] & [~ [[~ [1<=ERBB1_2_equals_0] & 1<=CDK2_equals_0]] | [[[ERBB2_3_equals_1<=1 | 1<=ERBB2_equals_1] | [1<=MYC_equals_1 & 1<=ERBB1_3_equals_0]] | ~ [ERBB2_equals_0<=MEK1_equals_1]]]] & pRB1_equals_0<=AKT1_equals_1] & ERBB1_3_equals_0<=MYC_equals_1]] | IGF1R_equals_0<=1]]]]
abstracting: (IGF1R_equals_0<=1)
states: 4,200 (3)
abstracting: (ERBB1_3_equals_0<=MYC_equals_1)
states: 3,768 (3)
abstracting: (pRB1_equals_0<=AKT1_equals_1)
states: 2,943 (3)
abstracting: (ERBB2_equals_0<=MEK1_equals_1)
states: 3,858 (3)
abstracting: (1<=ERBB1_3_equals_0)
states: 2,655 (3)
abstracting: (1<=MYC_equals_1)
states: 3,528 (3)
abstracting: (1<=ERBB2_equals_1)
states: 3,261 (3)
abstracting: (ERBB2_3_equals_1<=1)
states: 4,200 (3)
abstracting: (1<=CDK2_equals_0)
states: 3,646 (3)
abstracting: (1<=ERBB1_2_equals_0)
states: 2,655 (3)
abstracting: (pRB1_equals_0<=CDK2_equals_1)
states: 716
abstracting: (ERalpha_equals_1<=1)
states: 4,200 (3)
abstracting: (ERBB2_3_equals_1<=ERBB2_equals_0)
states: 2,801 (3)
abstracting: (p21_equals_1<=CyclinD1_equals_1)
states: 3,268 (3)
abstracting: (MEK1_equals_1<=p21_equals_1)
states: 2,509 (3)
abstracting: (ERBB1_equals_1<=ERBB1_3_equals_0)
states: 2,655 (3)
abstracting: (1<=ERBB1_2_equals_0)
states: 2,655 (3)
abstracting: (CDK6_equals_0<=IGF1R_equals_0)
states: 2,887 (3)
abstracting: (1<=ERalpha_equals_1)
states: 3,240 (3)
abstracting: (CyclinE1_equals_0<=0)
states: 2,041 (3)
abstracting: (1<=CyclinE1_equals_1)
states: 2,041 (3)
abstracting: (CDK4_equals_0<=ERalpha_equals_0)
states: 1,689 (3)
abstracting: (1<=pRB1_equals_1)
states: 243
abstracting: (1<=ERBB1_2_equals_0)
states: 2,655 (3)
abstracting: (AKT1_0<=0)
states: 2,862 (3)
-> the formula is TRUE
FORMULA EGFr-PT-02010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[[~ [CDK2_equals_0<=CyclinE1_equals_1] | [1<=CDK2_equals_0 | [~ [[CDK2_equals_1<=1 | [[ERBB2_3_equals_1<=MYC_equals_1 | ERBB1_2_equals_0<=AKT1_0] | ERBB2_3_equals_0<=1]]] & [[~ [[CyclinE1_equals_0<=0 | ERBB1_2_equals_1<=ERBB2_equals_1]] & ~ [[1<=EGF_equals_1 | CDK4_equals_0<=MEK1_equals_0]]] & [[[1<=CDK2_equals_1 | CyclinD1_equals_0<=ERBB1_equals_0] & ~ [CDK2_equals_1<=0]] | ERBB3_equals_0<=0]]]]] | CDK2_equals_1<=AKT1_0] | ~ [[[~ [[[[CyclinE1_equals_0<=AKT1_equals_1 | CyclinE1_equals_0<=ERBB2_equals_0] & pRB1_equals_0<=ERBB2_equals_0] | AKT1_equals_1<=ERBB1_3_equals_0]] | ~ [[[~ [1<=CyclinE1_equals_0] & ~ [[CyclinD1_equals_1<=EGF_equals_1 & CDK6_equals_1<=IGF1R_equals_0]]] & ERBB1_3_equals_0<=1]]] & ~ [[~ [[[[ERBB2_equals_0<=0 & CDK2_equals_0<=0] & [CDK6_equals_0<=1 | 1<=pRB1_equals_1]] & [ERBB2_equals_0<=0 & 1<=CDK2_equals_1]]] | [~ [[IGF1R_equals_1<=1 & IGF1R_equals_0<=IGF1R_equals_0]] | p27_equals_0<=CDK6_equals_0]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[~ [[IGF1R_equals_1<=1 & IGF1R_equals_0<=IGF1R_equals_0]] | p27_equals_0<=CDK6_equals_0] | ~ [[[ERBB2_equals_0<=0 & 1<=CDK2_equals_1] & [[CDK6_equals_0<=1 | 1<=pRB1_equals_1] & [ERBB2_equals_0<=0 & CDK2_equals_0<=0]]]]]] & [~ [[[~ [[CyclinD1_equals_1<=EGF_equals_1 & CDK6_equals_1<=IGF1R_equals_0]] & ~ [1<=CyclinE1_equals_0]] & ERBB1_3_equals_0<=1]] | ~ [[[[CyclinE1_equals_0<=AKT1_equals_1 | CyclinE1_equals_0<=ERBB2_equals_0] & pRB1_equals_0<=ERBB2_equals_0] | AKT1_equals_1<=ERBB1_3_equals_0]]]]] | [[[[[[[~ [CDK2_equals_1<=0] & [1<=CDK2_equals_1 | CyclinD1_equals_0<=ERBB1_equals_0]] | ERBB3_equals_0<=0] & [~ [[1<=EGF_equals_1 | CDK4_equals_0<=MEK1_equals_0]] & ~ [[CyclinE1_equals_0<=0 | ERBB1_2_equals_1<=ERBB2_equals_1]]]] & ~ [[[[ERBB2_3_equals_1<=MYC_equals_1 | ERBB1_2_equals_0<=AKT1_0] | ERBB2_3_equals_0<=1] | CDK2_equals_1<=1]]] | 1<=CDK2_equals_0] | ~ [CDK2_equals_0<=CyclinE1_equals_1]] | CDK2_equals_1<=AKT1_0]]]]]
abstracting: (CDK2_equals_1<=AKT1_0)
states: 3,822 (3)
abstracting: (CDK2_equals_0<=CyclinE1_equals_1)
states: 2,041 (3)
abstracting: (1<=CDK2_equals_0)
states: 3,646 (3)
abstracting: (CDK2_equals_1<=1)
states: 4,200 (3)
abstracting: (ERBB2_3_equals_0<=1)
states: 4,200 (3)
abstracting: (ERBB1_2_equals_0<=AKT1_0)
states: 2,398 (3)
abstracting: (ERBB2_3_equals_1<=MYC_equals_1)
states: 3,980 (3)
abstracting: (ERBB1_2_equals_1<=ERBB2_equals_1)
states: 4,200 (3)
abstracting: (CyclinE1_equals_0<=0)
states: 2,041 (3)
abstracting: (CDK4_equals_0<=MEK1_equals_0)
states: 1,993 (3)
abstracting: (1<=EGF_equals_1)
states: 4,196 (3)
abstracting: (ERBB3_equals_0<=0)
states: 3,261 (3)
abstracting: (CyclinD1_equals_0<=ERBB1_equals_0)
states: 2,289 (3)
abstracting: (1<=CDK2_equals_1)
states: 554
abstracting: (CDK2_equals_1<=0)
states: 3,646 (3)
abstracting: (AKT1_equals_1<=ERBB1_3_equals_0)
states: 3,140 (3)
abstracting: (pRB1_equals_0<=ERBB2_equals_0)
states: 1,128 (3)
abstracting: (CyclinE1_equals_0<=ERBB2_equals_0)
states: 2,527 (3)
abstracting: (CyclinE1_equals_0<=AKT1_equals_1)
states: 3,499 (3)
abstracting: (ERBB1_3_equals_0<=1)
states: 4,200 (3)
abstracting: (1<=CyclinE1_equals_0)
states: 2,159 (3)
abstracting: (CDK6_equals_1<=IGF1R_equals_0)
states: 3,615 (3)
abstracting: (CyclinD1_equals_1<=EGF_equals_1)
states: 4,200 (3)
abstracting: (CDK2_equals_0<=0)
states: 554
abstracting: (ERBB2_equals_0<=0)
states: 3,261 (3)
abstracting: (1<=pRB1_equals_1)
states: 243
abstracting: (CDK6_equals_0<=1)
states: 4,200 (3)
abstracting: (1<=CDK2_equals_1)
states: 554
abstracting: (ERBB2_equals_0<=0)
states: 3,261 (3)
abstracting: (p27_equals_0<=CDK6_equals_0)
states: 3,309 (3)
abstracting: (IGF1R_equals_0<=IGF1R_equals_0)
states: 4,200 (3)
abstracting: (IGF1R_equals_1<=1)
states: 4,200 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: AG [[[~ [[[[[1<=ERBB1_equals_1 & ~ [ERBB1_2_equals_1<=1]] | 1<=MEK1_equals_0] & [[1<=ERBB1_equals_1 & [~ [1<=CDK4_equals_0] & [CDK2_equals_1<=ERBB2_equals_1 | ERBB2_equals_0<=0]]] | [[[CDK6_equals_1<=0 | 1<=ERBB1_equals_0] & [1<=CyclinD1_equals_0 | pRB1_equals_0<=ERBB1_3_equals_0]] & [[MYC_equals_1<=ERalpha_equals_1 | 1<=MYC_equals_1] | [1<=p21_equals_0 | ERBB1_3_equals_1<=CDK4_equals_0]]]]] | [ERBB3_equals_0<=CyclinE1_equals_1 & [1<=CyclinE1_equals_0 | ~ [1<=ERBB1_2_equals_1]]]]] & [p21_equals_1<=CDK4_equals_1 | 1<=MEK1_equals_0]] & [IGF1R_equals_0<=CDK4_equals_0 | [ERBB2_equals_1<=pRB1_equals_0 | [~ [[[[[1<=CyclinD1_equals_1 & 1<=MEK1_equals_0] & [1<=MYC_equals_1 & pRB1_equals_0<=ERBB3_equals_0]] | CDK2_equals_1<=ERBB3_equals_1] | [1<=ERBB1_2_equals_1 | ~ [[CDK6_equals_1<=pRB1_equals_0 & CDK2_equals_0<=0]]]]] & [[~ [[[1<=IGF1R_equals_1 & CyclinD1_equals_0<=0] | ~ [AKT1_equals_1<=0]]] & MYC_equals_0<=CDK2_equals_1] | ~ [[[~ [1<=ERalpha_equals_1] & ~ [1<=MEK1_equals_0]] | ~ [[p27_equals_1<=ERBB1_2_equals_0 & MEK1_equals_0<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [[[~ [1<=ERalpha_equals_1] & ~ [1<=MEK1_equals_0]] | ~ [[p27_equals_1<=ERBB1_2_equals_0 & MEK1_equals_0<=1]]]] | [~ [[[1<=IGF1R_equals_1 & CyclinD1_equals_0<=0] | ~ [AKT1_equals_1<=0]]] & MYC_equals_0<=CDK2_equals_1]] & ~ [[[1<=ERBB1_2_equals_1 | ~ [[CDK6_equals_1<=pRB1_equals_0 & CDK2_equals_0<=0]]] | [[[1<=CyclinD1_equals_1 & 1<=MEK1_equals_0] & [1<=MYC_equals_1 & pRB1_equals_0<=ERBB3_equals_0]] | CDK2_equals_1<=ERBB3_equals_1]]]] | ERBB2_equals_1<=pRB1_equals_0] | IGF1R_equals_0<=CDK4_equals_0] & [~ [[[ERBB3_equals_0<=CyclinE1_equals_1 & [1<=CyclinE1_equals_0 | ~ [1<=ERBB1_2_equals_1]]] | [[[[[1<=CyclinD1_equals_0 | pRB1_equals_0<=ERBB1_3_equals_0] & [CDK6_equals_1<=0 | 1<=ERBB1_equals_0]] & [[MYC_equals_1<=ERalpha_equals_1 | 1<=MYC_equals_1] | [1<=p21_equals_0 | ERBB1_3_equals_1<=CDK4_equals_0]]] | [1<=ERBB1_equals_1 & [[CDK2_equals_1<=ERBB2_equals_1 | ERBB2_equals_0<=0] & ~ [1<=CDK4_equals_0]]]] & [1<=MEK1_equals_0 | [1<=ERBB1_equals_1 & ~ [ERBB1_2_equals_1<=1]]]]]] & [p21_equals_1<=CDK4_equals_1 | 1<=MEK1_equals_0]]]]]]
abstracting: (1<=MEK1_equals_0)
states: 1,507 (3)
abstracting: (p21_equals_1<=CDK4_equals_1)
states: 2,620 (3)
abstracting: (ERBB1_2_equals_1<=1)
states: 4,200 (3)
abstracting: (1<=ERBB1_equals_1)
states: 4,017 (3)
abstracting: (1<=MEK1_equals_0)
states: 1,507 (3)
abstracting: (1<=CDK4_equals_0)
states: 3,471 (3)
abstracting: (ERBB2_equals_0<=0)
states: 3,261 (3)
abstracting: (CDK2_equals_1<=ERBB2_equals_1)
states: 4,077 (3)
abstracting: (1<=ERBB1_equals_1)
states: 4,017 (3)
abstracting: (ERBB1_3_equals_1<=CDK4_equals_0)
states: 3,930 (3)
abstracting: (1<=p21_equals_0)
states: 2,620 (3)
abstracting: (1<=MYC_equals_1)
states: 3,528 (3)
abstracting: (MYC_equals_1<=ERalpha_equals_1)
states: 3,588 (3)
abstracting: (1<=ERBB1_equals_0)
states: 183
abstracting: (CDK6_equals_1<=0)
states: 2,985 (3)
abstracting: (pRB1_equals_0<=ERBB1_3_equals_0)
states: 2,745 (3)
abstracting: (1<=CyclinD1_equals_0)
states: 2,013 (3)
abstracting: (1<=ERBB1_2_equals_1)
states: 1,545 (3)
abstracting: (1<=CyclinE1_equals_0)
states: 2,159 (3)
abstracting: (ERBB3_equals_0<=CyclinE1_equals_1)
states: 3,714 (3)
abstracting: (IGF1R_equals_0<=CDK4_equals_0)
states: 3,822 (3)
abstracting: (ERBB2_equals_1<=pRB1_equals_0)
states: 4,011 (3)
abstracting: (CDK2_equals_1<=ERBB3_equals_1)
states: 4,077 (3)
abstracting: (pRB1_equals_0<=ERBB3_equals_0)
states: 1,128 (3)
abstracting: (1<=MYC_equals_1)
states: 3,528 (3)
abstracting: (1<=MEK1_equals_0)
states: 1,507 (3)
abstracting: (1<=CyclinD1_equals_1)
states: 2,187 (3)
abstracting: (CDK2_equals_0<=0)
states: 554
abstracting: (CDK6_equals_1<=pRB1_equals_0)
states: 3,957 (3)
abstracting: (1<=ERBB1_2_equals_1)
states: 1,545 (3)
abstracting: (MYC_equals_0<=CDK2_equals_1)
states: 3,528 (3)
abstracting: (AKT1_equals_1<=0)
states: 1,338 (3)
abstracting: (CyclinD1_equals_0<=0)
states: 2,187 (3)
abstracting: (1<=IGF1R_equals_1)
states: 1,898 (3)
abstracting: (MEK1_equals_0<=1)
states: 4,200 (3)
abstracting: (p27_equals_1<=ERBB1_2_equals_0)
states: 3,620 (3)
abstracting: (1<=MEK1_equals_0)
states: 1,507 (3)
abstracting: (1<=ERalpha_equals_1)
states: 3,240 (3)
-> the formula is FALSE
FORMULA EGFr-PT-02010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
totally nodes used: 40677 (4.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15590 71298 86888
used/not used/entry size/cache size: 103074 67005790 16 1024MB
basic ops cache: hits/miss/sum: 13876 54402 68278
used/not used/entry size/cache size: 100412 16676804 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: 1129 3594 4723
used/not used/entry size/cache size: 3593 8385015 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 67068666
1 39731
2 455
3 12
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.102sec
BK_STOP 1679019069175
--------------------
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:998 (14), effective:57 (0)
initing FirstDep: 0m 0.000sec
iterations count:68 (1), effective:0 (0)
iterations count:68 (1), effective:0 (0)
iterations count:121 (1), effective:4 (0)
iterations count:122 (1), effective:4 (0)
iterations count:99 (1), effective:4 (0)
iterations count:68 (1), effective:0 (0)
iterations count:196 (2), effective:12 (0)
iterations count:450 (6), effective:31 (0)
iterations count:308 (4), effective:17 (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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r138-smll-167819421400646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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 ;