About the Execution of Marcie for CircadianClock-PT-000001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.548 | 5324.00 | 5051.00 | 0.00 | TTTFFTFTTTTTTTTT | 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.r065-smll-167814393000102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is CircadianClock-PT-000001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000102
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 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 12K 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 CircadianClock-PT-000001-ReachabilityCardinality-00
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-01
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-02
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-03
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-04
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-05
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-06
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-07
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-08
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-09
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-10
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-11
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-12
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-13
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-14
FORMULA_NAME CircadianClock-PT-000001-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678266269258
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-000001
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: CircadianClock_PT_000001
(NrP: 14 NrTr: 16 NrArc: 58)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.568sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 21 (2.1e+01) #states 128
starting MCC model checker
--------------------------
checking: AG [c<=1]
normalized: ~ [E [true U ~ [c<=1]]]
abstracting: (c<=1)
states: 128
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [1<=dr_a]]
normalized: E [true U ~ [1<=dr_a]]
abstracting: (1<=dr_a)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [r<=mr_cap]
normalized: E [true U r<=mr_cap]
abstracting: (r<=mr_cap)
states: 96
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [a_cap<=c]
normalized: E [true U a_cap<=c]
abstracting: (a_cap<=c)
states: 96
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[~ [1<=r_cap] & mr<=mr]]]
normalized: E [true U ~ [[~ [1<=r_cap] & mr<=mr]]]
abstracting: (mr<=mr)
states: 128
abstracting: (1<=r_cap)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[da_a<=1 & da<=mr_cap]]
normalized: E [true U [da_a<=1 & da<=mr_cap]]
abstracting: (da<=mr_cap)
states: 96
abstracting: (da_a<=1)
states: 128
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[~ [1<=c] | ~ [da_a<=c]] | 1<=c_cap]]
normalized: ~ [E [true U ~ [[[~ [1<=c] | ~ [da_a<=c]] | 1<=c_cap]]]]
abstracting: (1<=c_cap)
states: 64
abstracting: (da_a<=c)
states: 96
abstracting: (1<=c)
states: 64
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[~ [[1<=da & [[~ [1<=a] | [a<=ma & ~ [1<=a_cap]]] & ~ [1<=mr]]]] | ~ [mr<=1]]]
normalized: ~ [E [true U ~ [[~ [mr<=1] | ~ [[[~ [1<=mr] & [~ [1<=a] | [~ [1<=a_cap] & a<=ma]]] & 1<=da]]]]]]
abstracting: (1<=da)
states: 64
abstracting: (a<=ma)
states: 96
abstracting: (1<=a_cap)
states: 64
abstracting: (1<=a)
states: 64
abstracting: (1<=mr)
states: 64
abstracting: (mr<=1)
states: 128
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[dr_a<=1 & ~ [1<=da_a]] | [[~ [[dr_a<=ma | ~ [1<=ma]]] & [dr<=1 & [~ [dr<=c] & c_cap<=r_cap]]] | a<=0]]]
normalized: E [true U [[~ [1<=da_a] & dr_a<=1] | [[~ [[~ [1<=ma] | dr_a<=ma]] & [[~ [dr<=c] & c_cap<=r_cap] & dr<=1]] | a<=0]]]
abstracting: (a<=0)
states: 64
abstracting: (dr<=1)
states: 128
abstracting: (c_cap<=r_cap)
states: 96
abstracting: (dr<=c)
states: 96
abstracting: (dr_a<=ma)
states: 96
abstracting: (1<=ma)
states: 64
abstracting: (dr_a<=1)
states: 128
abstracting: (1<=da_a)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[a_cap<=a | [~ [[[[da<=ma | ~ [[1<=dr_a & [1<=c & dr_a<=mr_cap]]]] & 1<=dr] | 1<=da]] | ~ [[mr_cap<=0 & 1<=mr_cap]]]]]
normalized: E [true U [[~ [[mr_cap<=0 & 1<=mr_cap]] | ~ [[[[~ [[[1<=c & dr_a<=mr_cap] & 1<=dr_a]] | da<=ma] & 1<=dr] | 1<=da]]] | a_cap<=a]]
abstracting: (a_cap<=a)
states: 64
abstracting: (1<=da)
states: 64
abstracting: (1<=dr)
states: 64
abstracting: (da<=ma)
states: 96
abstracting: (1<=dr_a)
states: 64
abstracting: (dr_a<=mr_cap)
states: 96
abstracting: (1<=c)
states: 64
abstracting: (1<=mr_cap)
states: 64
abstracting: (mr_cap<=0)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [[~ [[[~ [[da_a<=1 & 1<=dr_a]] | [[c<=0 & mr<=1] & dr_a<=da]] | [[1<=mr & ~ [1<=mr_cap]] & ~ [1<=dr]]]] & 1<=a]] | ~ [[~ [[[[1<=a_cap | 1<=da_a] & 1<=a_cap] | [~ [[~ [1<=c] & ~ [da<=1]]] | dr<=ma_cap]]] & c_cap<=ma_cap]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[~ [1<=dr] & [~ [1<=mr_cap] & 1<=mr]] | [[[c<=0 & mr<=1] & dr_a<=da] | ~ [[da_a<=1 & 1<=dr_a]]]]] & 1<=a]] | ~ [[~ [[[~ [[~ [1<=c] & ~ [da<=1]]] | dr<=ma_cap] | [[1<=a_cap | 1<=da_a] & 1<=a_cap]]] & c_cap<=ma_cap]]]]]]
abstracting: (c_cap<=ma_cap)
states: 96
abstracting: (1<=a_cap)
states: 64
abstracting: (1<=da_a)
states: 64
abstracting: (1<=a_cap)
states: 64
abstracting: (dr<=ma_cap)
states: 96
abstracting: (da<=1)
states: 128
abstracting: (1<=c)
states: 64
abstracting: (1<=a)
states: 64
abstracting: (1<=dr_a)
states: 64
abstracting: (da_a<=1)
states: 128
abstracting: (dr_a<=da)
states: 96
abstracting: (mr<=1)
states: 128
abstracting: (c<=0)
states: 64
abstracting: (1<=mr)
states: 64
abstracting: (1<=mr_cap)
states: 64
abstracting: (1<=dr)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[1<=c_cap | [[~ [[~ [[r_cap<=da & ma<=r]] | [[da<=a | a<=c_cap] | [da_a<=a_cap | ma<=r]]]] & ~ [[[~ [[[dr_a<=1 | 1<=a_cap] & ~ [1<=mr]]] | [~ [a_cap<=0] | mr_cap<=1]] | [[[dr_a<=1 | 1<=r_cap] | [[r<=1 | a<=ma] & ~ [1<=dr_a]]] | ma<=dr_a]]]] & ~ [r_cap<=a]]]]
normalized: E [true U [[~ [r_cap<=a] & [~ [[[[~ [a_cap<=0] | mr_cap<=1] | ~ [[~ [1<=mr] & [dr_a<=1 | 1<=a_cap]]]] | [[[~ [1<=dr_a] & [r<=1 | a<=ma]] | [dr_a<=1 | 1<=r_cap]] | ma<=dr_a]]] & ~ [[[[da_a<=a_cap | ma<=r] | [da<=a | a<=c_cap]] | ~ [[r_cap<=da & ma<=r]]]]]] | 1<=c_cap]]
abstracting: (1<=c_cap)
states: 64
abstracting: (ma<=r)
states: 96
abstracting: (r_cap<=da)
states: 96
abstracting: (a<=c_cap)
states: 96
abstracting: (da<=a)
states: 96
abstracting: (ma<=r)
states: 96
abstracting: (da_a<=a_cap)
states: 96
abstracting: (ma<=dr_a)
states: 96
abstracting: (1<=r_cap)
states: 64
abstracting: (dr_a<=1)
states: 128
abstracting: (a<=ma)
states: 96
abstracting: (r<=1)
states: 128
abstracting: (1<=dr_a)
states: 64
abstracting: (1<=a_cap)
states: 64
abstracting: (dr_a<=1)
states: 128
abstracting: (1<=mr)
states: 64
abstracting: (mr_cap<=1)
states: 128
abstracting: (a_cap<=0)
states: 64
abstracting: (r_cap<=a)
states: 96
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [[[~ [[~ [r<=0] | [[r<=0 & 1<=c] | mr_cap<=1]]] & ~ [1<=a_cap]] | [[[[a<=r & ~ [[mr_cap<=0 & a<=0]]] & [~ [[da_a<=1 & mr_cap<=0]] | [[1<=dr | 1<=r] & ~ [da<=dr]]]] & ~ [ma_cap<=a_cap]] & [[[[[r_cap<=dr & 1<=mr] & ~ [da<=a]] & ~ [[ma_cap<=0 | mr_cap<=ma_cap]]] | [~ [[1<=mr_cap | 1<=c_cap]] | c_cap<=1]] | ~ [[r<=da & ~ [da<=0]]]]]]] & 1<=mr_cap]]
normalized: ~ [E [true U ~ [[~ [[[[~ [[~ [da<=0] & r<=da]] | [[~ [[1<=mr_cap | 1<=c_cap]] | c_cap<=1] | [~ [[ma_cap<=0 | mr_cap<=ma_cap]] & [~ [da<=a] & [r_cap<=dr & 1<=mr]]]]] & [~ [ma_cap<=a_cap] & [[[~ [da<=dr] & [1<=dr | 1<=r]] | ~ [[da_a<=1 & mr_cap<=0]]] & [~ [[mr_cap<=0 & a<=0]] & a<=r]]]] | [~ [1<=a_cap] & ~ [[[[r<=0 & 1<=c] | mr_cap<=1] | ~ [r<=0]]]]]] & 1<=mr_cap]]]]
abstracting: (1<=mr_cap)
states: 64
abstracting: (r<=0)
states: 64
abstracting: (mr_cap<=1)
states: 128
abstracting: (1<=c)
states: 64
abstracting: (r<=0)
states: 64
abstracting: (1<=a_cap)
states: 64
abstracting: (a<=r)
states: 96
abstracting: (a<=0)
states: 64
abstracting: (mr_cap<=0)
states: 64
abstracting: (mr_cap<=0)
states: 64
abstracting: (da_a<=1)
states: 128
abstracting: (1<=r)
states: 64
abstracting: (1<=dr)
states: 64
abstracting: (da<=dr)
states: 96
abstracting: (ma_cap<=a_cap)
states: 96
abstracting: (1<=mr)
states: 64
abstracting: (r_cap<=dr)
states: 96
abstracting: (da<=a)
states: 96
abstracting: (mr_cap<=ma_cap)
states: 96
abstracting: (ma_cap<=0)
states: 64
abstracting: (c_cap<=1)
states: 128
abstracting: (1<=c_cap)
states: 64
abstracting: (1<=mr_cap)
states: 64
abstracting: (r<=da)
states: 96
abstracting: (da<=0)
states: 64
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[[[~ [[[1<=a & ~ [1<=dr]] & [[1<=mr_cap & dr_a<=0] | [c<=0 | 1<=a]]]] & 1<=a] & ~ [[[1<=ma_cap & dr<=r] & ~ [c<=1]]]] | [[~ [[[~ [dr_a<=1] & [1<=r_cap & 1<=mr]] & [~ [1<=c] | [1<=mr | r_cap<=0]]]] & ~ [[1<=r | [~ [1<=r] | ~ [da_a<=ma]]]]] | [[[1<=ma & a<=r] & [[[ma<=r_cap & 1<=da] | c<=mr] & ~ [mr<=1]]] | [[~ [[a<=a_cap & c_cap<=a_cap]] & ~ [[dr_a<=c & 1<=dr]]] | ~ [[ma<=1 | [r<=0 & 1<=dr_a]]]]]]]] & ~ [1<=dr]]]
normalized: E [true U [~ [[[[[[[[ma<=r_cap & 1<=da] | c<=mr] & ~ [mr<=1]] & [1<=ma & a<=r]] | [~ [[[r<=0 & 1<=dr_a] | ma<=1]] | [~ [[dr_a<=c & 1<=dr]] & ~ [[a<=a_cap & c_cap<=a_cap]]]]] | [~ [[[~ [da_a<=ma] | ~ [1<=r]] | 1<=r]] & ~ [[[[1<=mr | r_cap<=0] | ~ [1<=c]] & [[1<=r_cap & 1<=mr] & ~ [dr_a<=1]]]]]] | [~ [[~ [c<=1] & [1<=ma_cap & dr<=r]]] & [~ [[[[c<=0 | 1<=a] | [1<=mr_cap & dr_a<=0]] & [~ [1<=dr] & 1<=a]]] & 1<=a]]]] & ~ [1<=dr]]]
abstracting: (1<=dr)
states: 64
abstracting: (1<=a)
states: 64
abstracting: (1<=a)
states: 64
abstracting: (1<=dr)
states: 64
abstracting: (dr_a<=0)
states: 64
abstracting: (1<=mr_cap)
states: 64
abstracting: (1<=a)
states: 64
abstracting: (c<=0)
states: 64
abstracting: (dr<=r)
states: 96
abstracting: (1<=ma_cap)
states: 64
abstracting: (c<=1)
states: 128
abstracting: (dr_a<=1)
states: 128
abstracting: (1<=mr)
states: 64
abstracting: (1<=r_cap)
states: 64
abstracting: (1<=c)
states: 64
abstracting: (r_cap<=0)
states: 64
abstracting: (1<=mr)
states: 64
abstracting: (1<=r)
states: 64
abstracting: (1<=r)
states: 64
abstracting: (da_a<=ma)
states: 96
abstracting: (c_cap<=a_cap)
states: 96
abstracting: (a<=a_cap)
states: 64
abstracting: (1<=dr)
states: 64
abstracting: (dr_a<=c)
states: 96
abstracting: (ma<=1)
states: 128
abstracting: (1<=dr_a)
states: 64
abstracting: (r<=0)
states: 64
abstracting: (a<=r)
states: 96
abstracting: (1<=ma)
states: 64
abstracting: (mr<=1)
states: 128
abstracting: (c<=mr)
states: 96
abstracting: (1<=da)
states: 64
abstracting: (ma<=r_cap)
states: 96
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[a_cap<=1 & [r_cap<=0 & r<=mr_cap]] | ~ [[~ [[~ [[da_a<=1 | ma_cap<=mr]] | ~ [[ma_cap<=0 | mr<=a_cap]]]] | ~ [[[[~ [a_cap<=0] | ~ [mr_cap<=1]] | da<=ma] | da<=r]]]]] | [[[dr_a<=ma | 1<=da_a] & ~ [[[[[1<=a & [dr<=r_cap & 1<=r_cap]] & [~ [1<=dr_a] & c_cap<=c]] | da<=c_cap] & 1<=dr_a]]] & [[ma_cap<=dr_a & ~ [[~ [[1<=da & 1<=a]] | [[[c_cap<=1 & 1<=dr_a] | [da<=dr | 1<=mr_cap]] | 1<=ma]]]] | ~ [dr_a<=r]]]]]
normalized: E [true U [[[~ [dr_a<=r] | [~ [[[[[da<=dr | 1<=mr_cap] | [c_cap<=1 & 1<=dr_a]] | 1<=ma] | ~ [[1<=da & 1<=a]]]] & ma_cap<=dr_a]] & [~ [[[[[~ [1<=dr_a] & c_cap<=c] & [[dr<=r_cap & 1<=r_cap] & 1<=a]] | da<=c_cap] & 1<=dr_a]] & [dr_a<=ma | 1<=da_a]]] | [~ [[~ [[[[~ [mr_cap<=1] | ~ [a_cap<=0]] | da<=ma] | da<=r]] | ~ [[~ [[ma_cap<=0 | mr<=a_cap]] | ~ [[da_a<=1 | ma_cap<=mr]]]]]] | [[r_cap<=0 & r<=mr_cap] & a_cap<=1]]]]
abstracting: (a_cap<=1)
states: 128
abstracting: (r<=mr_cap)
states: 96
abstracting: (r_cap<=0)
states: 64
abstracting: (ma_cap<=mr)
states: 96
abstracting: (da_a<=1)
states: 128
abstracting: (mr<=a_cap)
states: 96
abstracting: (ma_cap<=0)
states: 64
abstracting: (da<=r)
states: 96
abstracting: (da<=ma)
states: 96
abstracting: (a_cap<=0)
states: 64
abstracting: (mr_cap<=1)
states: 128
abstracting: (1<=da_a)
states: 64
abstracting: (dr_a<=ma)
states: 96
abstracting: (1<=dr_a)
states: 64
abstracting: (da<=c_cap)
states: 96
abstracting: (1<=a)
states: 64
abstracting: (1<=r_cap)
states: 64
abstracting: (dr<=r_cap)
states: 96
abstracting: (c_cap<=c)
states: 64
abstracting: (1<=dr_a)
states: 64
abstracting: (ma_cap<=dr_a)
states: 96
abstracting: (1<=a)
states: 64
abstracting: (1<=da)
states: 64
abstracting: (1<=ma)
states: 64
abstracting: (1<=dr_a)
states: 64
abstracting: (c_cap<=1)
states: 128
abstracting: (1<=mr_cap)
states: 64
abstracting: (da<=dr)
states: 96
abstracting: (dr_a<=r)
states: 96
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[[[[dr<=1 & [1<=c_cap & ~ [r<=da_a]]] | ~ [mr<=da]] & [~ [dr_a<=dr_a] & ~ [[~ [mr_cap<=0] | [dr_a<=r_cap | dr_a<=dr_a]]]]] | mr<=1] & [[[[[[1<=c | ~ [da<=c]] & da<=a_cap] | ~ [[c_cap<=da_a | a_cap<=c_cap]]] | ma_cap<=dr_a] & [[~ [[[c_cap<=mr_cap | dr<=ma_cap] & ~ [1<=c_cap]]] | [[[mr_cap<=0 & 1<=ma_cap] & c<=a] & [~ [a<=0] | da<=a]]] & ~ [[[a<=0 & [dr<=1 & r_cap<=1]] & [dr<=1 | ~ [r_cap<=1]]]]]] & ~ [[~ [[[~ [dr_a<=dr_a] & [ma<=1 & 1<=r_cap]] | [[a_cap<=1 | 1<=mr_cap] | [da_a<=ma_cap | 1<=c_cap]]]] & ~ [[da<=da_a | c_cap<=1]]]]]] | da<=1]]
normalized: ~ [E [true U ~ [[[[~ [[~ [[da<=da_a | c_cap<=1]] & ~ [[[[da_a<=ma_cap | 1<=c_cap] | [a_cap<=1 | 1<=mr_cap]] | [[ma<=1 & 1<=r_cap] & ~ [dr_a<=dr_a]]]]]] & [[~ [[[~ [r_cap<=1] | dr<=1] & [[dr<=1 & r_cap<=1] & a<=0]]] & [[[~ [a<=0] | da<=a] & [[mr_cap<=0 & 1<=ma_cap] & c<=a]] | ~ [[~ [1<=c_cap] & [c_cap<=mr_cap | dr<=ma_cap]]]]] & [[~ [[c_cap<=da_a | a_cap<=c_cap]] | [[~ [da<=c] | 1<=c] & da<=a_cap]] | ma_cap<=dr_a]]] & [[[~ [[[dr_a<=r_cap | dr_a<=dr_a] | ~ [mr_cap<=0]]] & ~ [dr_a<=dr_a]] & [~ [mr<=da] | [[~ [r<=da_a] & 1<=c_cap] & dr<=1]]] | mr<=1]] | da<=1]]]]
abstracting: (da<=1)
states: 128
abstracting: (mr<=1)
states: 128
abstracting: (dr<=1)
states: 128
abstracting: (1<=c_cap)
states: 64
abstracting: (r<=da_a)
states: 96
abstracting: (mr<=da)
states: 96
abstracting: (dr_a<=dr_a)
states: 128
abstracting: (mr_cap<=0)
states: 64
abstracting: (dr_a<=dr_a)
states: 128
abstracting: (dr_a<=r_cap)
states: 96
abstracting: (ma_cap<=dr_a)
states: 96
abstracting: (da<=a_cap)
states: 96
abstracting: (1<=c)
states: 64
abstracting: (da<=c)
states: 96
abstracting: (a_cap<=c_cap)
states: 96
abstracting: (c_cap<=da_a)
states: 96
abstracting: (dr<=ma_cap)
states: 96
abstracting: (c_cap<=mr_cap)
states: 96
abstracting: (1<=c_cap)
states: 64
abstracting: (c<=a)
states: 96
abstracting: (1<=ma_cap)
states: 64
abstracting: (mr_cap<=0)
states: 64
abstracting: (da<=a)
states: 96
abstracting: (a<=0)
states: 64
abstracting: (a<=0)
states: 64
abstracting: (r_cap<=1)
states: 128
abstracting: (dr<=1)
states: 128
abstracting: (dr<=1)
states: 128
abstracting: (r_cap<=1)
states: 128
abstracting: (dr_a<=dr_a)
states: 128
abstracting: (1<=r_cap)
states: 64
abstracting: (ma<=1)
states: 128
abstracting: (1<=mr_cap)
states: 64
abstracting: (a_cap<=1)
states: 128
abstracting: (1<=c_cap)
states: 64
abstracting: (da_a<=ma_cap)
states: 96
abstracting: (c_cap<=1)
states: 128
abstracting: (da<=da_a)
states: 64
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 1649 (1.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1233 2854 4087
used/not used/entry size/cache size: 3314 67105550 16 1024MB
basic ops cache: hits/miss/sum: 1332 3137 4469
used/not used/entry size/cache size: 6397 16770819 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: 347 388 735
used/not used/entry size/cache size: 388 8388220 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 67107234
1 1611
2 19
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.247sec
BK_STOP 1678266274582
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:113 (7), effective:18 (1)
initing FirstDep: 0m 0.000sec
iterations count:23 (1), effective:2 (0)
iterations count:17 (1), effective:1 (0)
iterations count:35 (2), effective:4 (0)
iterations count:18 (1), effective:1 (0)
iterations count:17 (1), effective:1 (0)
iterations count:65 (4), effective:8 (0)
iterations count:34 (2), effective:6 (0)
iterations count:22 (1), effective:2 (0)
iterations count:16 (1), effective:0 (0)
iterations count:22 (1), effective:2 (0)
iterations count:21 (1), effective:2 (0)
iterations count:37 (2), effective:5 (0)
iterations count:87 (5), effective:18 (1)
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="CircadianClock-PT-000001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is CircadianClock-PT-000001, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r065-smll-167814393000102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000001.tgz
mv CircadianClock-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 '
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 ;