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-167814393000105.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-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:33 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.9K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:37 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 11K 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-000010-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678266293296

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-000010
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: CircadianClock_PT_000010
(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.651sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 66 (6.6e+01) #states 644,204 (5)



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

checking: EF [7<=ma_cap]
normalized: E [true U 7<=ma_cap]

abstracting: (7<=ma_cap)
states: 234,256 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[AF [dr<=7] & ~ [AX [AX [mr_cap<=c]]]]]
normalized: ~ [E [true U ~ [[EX [EX [~ [mr_cap<=c]]] & ~ [EG [~ [dr<=7]]]]]]]

abstracting: (dr<=7)
states: 644,204 (5)
.
EG iterations: 1
abstracting: (mr_cap<=c)
states: 351,384 (5)
..-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [E [ma_cap<=mr U ~ [AX [AG [da_a<=ma_cap]]]]]
normalized: EX [E [ma_cap<=mr U EX [E [true U ~ [da_a<=ma_cap]]]]]

abstracting: (da_a<=ma_cap)
states: 614,922 (5)
.abstracting: (ma_cap<=mr)
states: 351,384 (5)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [[[da<=ma | 2<=dr_a] & ~ [EF [AG [da<=3]]]]]
normalized: EG [[~ [E [true U ~ [E [true U ~ [da<=3]]]]] & [da<=ma | 2<=dr_a]]]

abstracting: (2<=dr_a)
states: 0
abstracting: (da<=ma)
states: 614,922 (5)
abstracting: (da<=3)
states: 644,204 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EF [[AF [AG [dr_a<=c]] | ~ [A [EG [r<=ma_cap] U EF [a<=4]]]]]]
normalized: ~ [E [true U [~ [EG [E [true U ~ [dr_a<=c]]]] | ~ [[~ [EG [~ [E [true U a<=4]]]] & ~ [E [~ [E [true U a<=4]] U [~ [EG [r<=ma_cap]] & ~ [E [true U a<=4]]]]]]]]]]

abstracting: (a<=4)
states: 292,820 (5)
abstracting: (r<=ma_cap)
states: 351,384 (5)
.
EG iterations: 1
abstracting: (a<=4)
states: 292,820 (5)
abstracting: (a<=4)
states: 292,820 (5)
.
EG iterations: 1
abstracting: (dr_a<=c)
states: 614,922 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [EX [7<=a] U AG [[[a_cap<=7 | EX [AX [ma<=ma]]] | AF [da_a<=8]]]]
normalized: E [EX [7<=a] U ~ [E [true U ~ [[~ [EG [~ [da_a<=8]]] | [EX [~ [EX [~ [ma<=ma]]]] | a_cap<=7]]]]]]

abstracting: (a_cap<=7)
states: 468,512 (5)
abstracting: (ma<=ma)
states: 644,204 (5)
..abstracting: (da_a<=8)
states: 644,204 (5)
.
EG iterations: 1
abstracting: (7<=a)
states: 234,256 (5)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AG [EX [[[[da<=mr_cap & [8<=ma_cap | c<=9]] | r<=mr_cap] & 5<=c_cap]]]]
normalized: E [true U ~ [EX [[[[[8<=ma_cap | c<=9] & da<=mr_cap] | r<=mr_cap] & 5<=c_cap]]]]

abstracting: (5<=c_cap)
states: 351,384 (5)
abstracting: (r<=mr_cap)
states: 351,384 (5)
abstracting: (da<=mr_cap)
states: 614,922 (5)
abstracting: (c<=9)
states: 585,640 (5)
abstracting: (8<=ma_cap)
states: 175,692 (5)
.-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [E [2<=ma U [[AF [6<=c] & [[~ [3<=mr_cap] & AX [4<=da]] & c_cap<=dr_a]] | ma<=8]]]
normalized: ~ [E [true U ~ [E [2<=ma U [[[[~ [EX [~ [4<=da]]] & ~ [3<=mr_cap]] & c_cap<=dr_a] & ~ [EG [~ [6<=c]]]] | ma<=8]]]]]

abstracting: (ma<=8)
states: 527,076 (5)
abstracting: (6<=c)
states: 292,820 (5)
.
EG iterations: 1
abstracting: (c_cap<=dr_a)
states: 87,846 (4)
abstracting: (3<=mr_cap)
states: 468,512 (5)
abstracting: (4<=da)
states: 0
.abstracting: (2<=ma)
states: 527,076 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[AX [ma<=ma_cap] | ~ [[6<=a_cap & [[AX [10<=ma_cap] & [da_a<=da | dr_a<=6]] | ~ [[dr_a<=2 | da<=ma]]]]]]]]
normalized: E [true U ~ [[~ [[[~ [[dr_a<=2 | da<=ma]] | [[da_a<=da | dr_a<=6] & ~ [EX [~ [10<=ma_cap]]]]] & 6<=a_cap]] | ~ [EX [~ [ma<=ma_cap]]]]]]

abstracting: (ma<=ma_cap)
states: 351,384 (5)
.abstracting: (6<=a_cap)
states: 292,820 (5)
abstracting: (10<=ma_cap)
states: 58,564 (4)
.abstracting: (dr_a<=6)
states: 644,204 (5)
abstracting: (da_a<=da)
states: 322,102 (5)
abstracting: (da<=ma)
states: 614,922 (5)
abstracting: (dr_a<=2)
states: 644,204 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [EF [[[[E [ma<=mr_cap U a<=7] & c<=7] | ~ [[9<=da | ~ [a_cap<=mr_cap]]]] | [~ [AF [ma<=0]] & EF [[4<=a_cap & 4<=da]]]]]]
normalized: E [true U E [true U [[E [true U [4<=a_cap & 4<=da]] & EG [~ [ma<=0]]] | [~ [[~ [a_cap<=mr_cap] | 9<=da]] | [E [ma<=mr_cap U a<=7] & c<=7]]]]]

abstracting: (c<=7)
states: 468,512 (5)
abstracting: (a<=7)
states: 468,512 (5)
abstracting: (ma<=mr_cap)
states: 351,384 (5)
abstracting: (9<=da)
states: 0
abstracting: (a_cap<=mr_cap)
states: 351,384 (5)
abstracting: (ma<=0)
states: 58,564 (4)
.
EG iterations: 1
abstracting: (4<=da)
states: 0
abstracting: (4<=a_cap)
states: 409,948 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EG [A [c<=dr U [r<=7 & r_cap<=1]]] | [[~ [EF [[[EF [r<=9] & [dr<=8 | 8<=a]] | AG [5<=da]]]] | AF [[~ [[~ [r_cap<=9] & EG [4<=r]]] & EG [a_cap<=8]]]] | EX [AF [4<=a]]]]
normalized: [[EX [~ [EG [~ [4<=a]]]] | [~ [EG [~ [[EG [a_cap<=8] & ~ [[EG [4<=r] & ~ [r_cap<=9]]]]]]] | ~ [E [true U [~ [E [true U ~ [5<=da]]] | [[dr<=8 | 8<=a] & E [true U r<=9]]]]]]] | EG [[~ [EG [~ [[r<=7 & r_cap<=1]]]] & ~ [E [~ [[r<=7 & r_cap<=1]] U [~ [c<=dr] & ~ [[r<=7 & r_cap<=1]]]]]]]]

abstracting: (r_cap<=1)
states: 117,128 (5)
abstracting: (r<=7)
states: 468,512 (5)
abstracting: (c<=dr)
states: 87,846 (4)
abstracting: (r_cap<=1)
states: 117,128 (5)
abstracting: (r<=7)
states: 468,512 (5)
abstracting: (r_cap<=1)
states: 117,128 (5)
abstracting: (r<=7)
states: 468,512 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (r<=9)
states: 585,640 (5)
abstracting: (8<=a)
states: 175,692 (5)
abstracting: (dr<=8)
states: 644,204 (5)
abstracting: (5<=da)
states: 0
abstracting: (r_cap<=9)
states: 585,640 (5)
abstracting: (4<=r)
states: 409,948 (5)
.
EG iterations: 1
abstracting: (a_cap<=8)
states: 527,076 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (4<=a)
states: 409,948 (5)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [~ [EG [A [AF [r_cap<=da] U 9<=c]]] U ~ [[[ma<=2 | EF [~ [r<=a]]] & [[EX [r<=da_a] | [[a<=0 & r_cap<=r] & [2<=r_cap & a_cap<=3]]] | ~ [AG [5<=dr]]]]]]
normalized: E [~ [EG [[~ [EG [~ [9<=c]]] & ~ [E [~ [9<=c] U [EG [~ [r_cap<=da]] & ~ [9<=c]]]]]]] U ~ [[[E [true U ~ [5<=dr]] | [[[2<=r_cap & a_cap<=3] & [a<=0 & r_cap<=r]] | EX [r<=da_a]]] & [ma<=2 | E [true U ~ [r<=a]]]]]]

abstracting: (r<=a)
states: 351,384 (5)
abstracting: (ma<=2)
states: 175,692 (5)
abstracting: (r<=da_a)
states: 87,846 (4)
.abstracting: (r_cap<=r)
states: 351,384 (5)
abstracting: (a<=0)
states: 58,564 (4)
abstracting: (a_cap<=3)
states: 234,256 (5)
abstracting: (2<=r_cap)
states: 527,076 (5)
abstracting: (5<=dr)
states: 0
abstracting: (9<=c)
states: 117,128 (5)
abstracting: (r_cap<=da)
states: 87,846 (4)
.
EG iterations: 1
abstracting: (9<=c)
states: 117,128 (5)
abstracting: (9<=c)
states: 117,128 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EG [~ [[~ [E [A [c<=ma_cap U c<=3] U EG [mr_cap<=2]]] | A [~ [a<=2] U r_cap<=r_cap]]]] | E [AX [AX [A [c_cap<=10 U r<=7]]] U EX [[9<=r & [EX [mr<=4] & A [ma_cap<=da U ma<=a_cap]]]]]]
normalized: [E [~ [EX [EX [~ [[~ [EG [~ [r<=7]]] & ~ [E [~ [r<=7] U [~ [c_cap<=10] & ~ [r<=7]]]]]]]]] U EX [[[[~ [EG [~ [ma<=a_cap]]] & ~ [E [~ [ma<=a_cap] U [~ [ma_cap<=da] & ~ [ma<=a_cap]]]]] & EX [mr<=4]] & 9<=r]]] | EG [~ [[[~ [EG [~ [r_cap<=r_cap]]] & ~ [E [~ [r_cap<=r_cap] U [~ [r_cap<=r_cap] & a<=2]]]] | ~ [E [[~ [EG [~ [c<=3]]] & ~ [E [~ [c<=3] U [~ [c<=ma_cap] & ~ [c<=3]]]]] U EG [mr_cap<=2]]]]]]]

abstracting: (mr_cap<=2)
states: 175,692 (5)
.
EG iterations: 1
abstracting: (c<=3)
states: 234,256 (5)
abstracting: (c<=ma_cap)
states: 351,384 (5)
abstracting: (c<=3)
states: 234,256 (5)
abstracting: (c<=3)
states: 234,256 (5)
.
EG iterations: 1
abstracting: (a<=2)
states: 175,692 (5)
abstracting: (r_cap<=r_cap)
states: 644,204 (5)
abstracting: (r_cap<=r_cap)
states: 644,204 (5)
abstracting: (r_cap<=r_cap)
states: 644,204 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (9<=r)
states: 117,128 (5)
abstracting: (mr<=4)
states: 292,820 (5)
.abstracting: (ma<=a_cap)
states: 351,384 (5)
abstracting: (ma_cap<=da)
states: 87,846 (4)
abstracting: (ma<=a_cap)
states: 351,384 (5)
abstracting: (ma<=a_cap)
states: 351,384 (5)
.
EG iterations: 1
.abstracting: (r<=7)
states: 468,512 (5)
abstracting: (c_cap<=10)
states: 644,204 (5)
abstracting: (r<=7)
states: 468,512 (5)
abstracting: (r<=7)
states: 468,512 (5)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[E [[[[c_cap<=5 | c<=0] | ~ [a_cap<=4]] & [[9<=mr_cap & 8<=a] & EG [10<=r]]] U da_a<=4] | ~ [[[~ [4<=mr] | [[mr<=mr | 8<=r] & A [6<=da_a U da<=ma]]] | [ma_cap<=9 & [10<=c_cap | ~ [dr_a<=2]]]]]] & [A [dr<=8 U ~ [1<=r_cap]] & [~ [AF [~ [5<=a]]] & ~ [A [8<=dr_a U A [a<=a U 5<=r]]]]]]]
normalized: E [true U [[[~ [[~ [EG [~ [[~ [EG [~ [5<=r]]] & ~ [E [~ [5<=r] U [~ [a<=a] & ~ [5<=r]]]]]]]] & ~ [E [~ [[~ [EG [~ [5<=r]]] & ~ [E [~ [5<=r] U [~ [a<=a] & ~ [5<=r]]]]]] U [~ [8<=dr_a] & ~ [[~ [EG [~ [5<=r]]] & ~ [E [~ [5<=r] U [~ [a<=a] & ~ [5<=r]]]]]]]]]]] & EG [5<=a]] & [~ [EG [1<=r_cap]] & ~ [E [1<=r_cap U [1<=r_cap & ~ [dr<=8]]]]]] & [~ [[[ma_cap<=9 & [10<=c_cap | ~ [dr_a<=2]]] | [[[~ [EG [~ [da<=ma]]] & ~ [E [~ [da<=ma] U [~ [6<=da_a] & ~ [da<=ma]]]]] & [mr<=mr | 8<=r]] | ~ [4<=mr]]]] | E [[[EG [10<=r] & [9<=mr_cap & 8<=a]] & [~ [a_cap<=4] | [c_cap<=5 | c<=0]]] U da_a<=4]]]]

abstracting: (da_a<=4)
states: 644,204 (5)
abstracting: (c<=0)
states: 58,564 (4)
abstracting: (c_cap<=5)
states: 351,384 (5)
abstracting: (a_cap<=4)
states: 292,820 (5)
abstracting: (8<=a)
states: 175,692 (5)
abstracting: (9<=mr_cap)
states: 117,128 (5)
abstracting: (10<=r)
states: 58,564 (4)
.
EG iterations: 1
abstracting: (4<=mr)
states: 409,948 (5)
abstracting: (8<=r)
states: 175,692 (5)
abstracting: (mr<=mr)
states: 644,204 (5)
abstracting: (da<=ma)
states: 614,922 (5)
abstracting: (6<=da_a)
states: 0
abstracting: (da<=ma)
states: 614,922 (5)
abstracting: (da<=ma)
states: 614,922 (5)
.
EG iterations: 1
abstracting: (dr_a<=2)
states: 644,204 (5)
abstracting: (10<=c_cap)
states: 58,564 (4)
abstracting: (ma_cap<=9)
states: 585,640 (5)
abstracting: (dr<=8)
states: 644,204 (5)
abstracting: (1<=r_cap)
states: 585,640 (5)
abstracting: (1<=r_cap)
states: 585,640 (5)
abstracting: (1<=r_cap)
states: 585,640 (5)
.
EG iterations: 1
abstracting: (5<=a)
states: 351,384 (5)
.
EG iterations: 1
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (a<=a)
states: 644,204 (5)
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (5<=r)
states: 351,384 (5)
.
EG iterations: 1
abstracting: (8<=dr_a)
states: 0
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (a<=a)
states: 644,204 (5)
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (5<=r)
states: 351,384 (5)
.
EG iterations: 1
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (a<=a)
states: 644,204 (5)
abstracting: (5<=r)
states: 351,384 (5)
abstracting: (5<=r)
states: 351,384 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [AG [E [~ [E [[a_cap<=4 | r<=a] U 5<=dr]] U AF [[[a_cap<=a_cap & ma_cap<=8] | EF [mr<=0]]]]] & E [EX [[E [~ [c<=dr] U [a<=4 | 4<=a_cap]] & [AG [dr<=6] & E [r<=9 U 1<=ma]]]] U ~ [[[6<=ma_cap & ma_cap<=da_a] | [~ [AG [2<=r]] | [[[c<=ma_cap & 2<=da_a] | EF [3<=dr]] | [A [ma_cap<=r U 4<=r_cap] | AX [ma_cap<=0]]]]]]]]
normalized: [E [EX [[[E [r<=9 U 1<=ma] & ~ [E [true U ~ [dr<=6]]]] & E [~ [c<=dr] U [a<=4 | 4<=a_cap]]]] U ~ [[[[[~ [EX [~ [ma_cap<=0]]] | [~ [EG [~ [4<=r_cap]]] & ~ [E [~ [4<=r_cap] U [~ [ma_cap<=r] & ~ [4<=r_cap]]]]]] | [E [true U 3<=dr] | [c<=ma_cap & 2<=da_a]]] | E [true U ~ [2<=r]]] | [6<=ma_cap & ma_cap<=da_a]]]] & ~ [E [true U ~ [E [~ [E [[a_cap<=4 | r<=a] U 5<=dr]] U ~ [EG [~ [[E [true U mr<=0] | [a_cap<=a_cap & ma_cap<=8]]]]]]]]]]

abstracting: (ma_cap<=8)
states: 527,076 (5)
abstracting: (a_cap<=a_cap)
states: 644,204 (5)
abstracting: (mr<=0)
states: 58,564 (4)
.
EG iterations: 1
abstracting: (5<=dr)
states: 0
abstracting: (r<=a)
states: 351,384 (5)
abstracting: (a_cap<=4)
states: 292,820 (5)
abstracting: (ma_cap<=da_a)
states: 87,846 (4)
abstracting: (6<=ma_cap)
states: 292,820 (5)
abstracting: (2<=r)
states: 527,076 (5)
abstracting: (2<=da_a)
states: 0
abstracting: (c<=ma_cap)
states: 351,384 (5)
abstracting: (3<=dr)
states: 0
abstracting: (4<=r_cap)
states: 409,948 (5)
abstracting: (ma_cap<=r)
states: 351,384 (5)
abstracting: (4<=r_cap)
states: 409,948 (5)
abstracting: (4<=r_cap)
states: 409,948 (5)
.
EG iterations: 1
abstracting: (ma_cap<=0)
states: 58,564 (4)
.abstracting: (4<=a_cap)
states: 409,948 (5)
abstracting: (a<=4)
states: 292,820 (5)
abstracting: (c<=dr)
states: 87,846 (4)
abstracting: (dr<=6)
states: 644,204 (5)
abstracting: (1<=ma)
states: 585,640 (5)
abstracting: (r<=9)
states: 585,640 (5)
.-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [E [[[da_a<=10 | A [[r_cap<=2 & dr_a<=4] U ~ [a<=a]]] & [[E [ma_cap<=c U da<=ma] | a<=da_a] & A [[a<=1 & ma_cap<=7] U A [5<=mr_cap U mr<=1]]]] U 6<=mr] U ~ [[[E [~ [da_a<=mr_cap] U ~ [10<=a_cap]] & ma_cap<=ma] | [AF [da_a<=da_a] | [[[a<=4 | 8<=c_cap] | ~ [2<=c_cap]] & AF [dr<=ma_cap]]]]]]
normalized: [~ [EG [[[[~ [EG [~ [dr<=ma_cap]]] & [~ [2<=c_cap] | [a<=4 | 8<=c_cap]]] | ~ [EG [~ [da_a<=da_a]]]] | [ma_cap<=ma & E [~ [da_a<=mr_cap] U ~ [10<=a_cap]]]]]] & ~ [E [[[[~ [EG [~ [dr<=ma_cap]]] & [~ [2<=c_cap] | [a<=4 | 8<=c_cap]]] | ~ [EG [~ [da_a<=da_a]]]] | [ma_cap<=ma & E [~ [da_a<=mr_cap] U ~ [10<=a_cap]]]] U [~ [E [[[[~ [EG [~ [[~ [EG [~ [mr<=1]]] & ~ [E [~ [mr<=1] U [~ [5<=mr_cap] & ~ [mr<=1]]]]]]]] & ~ [E [~ [[~ [EG [~ [mr<=1]]] & ~ [E [~ [mr<=1] U [~ [5<=mr_cap] & ~ [mr<=1]]]]]] U [~ [[a<=1 & ma_cap<=7]] & ~ [[~ [EG [~ [mr<=1]]] & ~ [E [~ [mr<=1] U [~ [5<=mr_cap] & ~ [mr<=1]]]]]]]]]] & [a<=da_a | E [ma_cap<=c U da<=ma]]] & [da_a<=10 | [~ [EG [a<=a]] & ~ [E [a<=a U [a<=a & ~ [[r_cap<=2 & dr_a<=4]]]]]]]] U 6<=mr]] & [[[~ [EG [~ [dr<=ma_cap]]] & [~ [2<=c_cap] | [a<=4 | 8<=c_cap]]] | ~ [EG [~ [da_a<=da_a]]]] | [ma_cap<=ma & E [~ [da_a<=mr_cap] U ~ [10<=a_cap]]]]]]]]

abstracting: (10<=a_cap)
states: 58,564 (4)
abstracting: (da_a<=mr_cap)
states: 614,922 (5)
abstracting: (ma_cap<=ma)
states: 351,384 (5)
abstracting: (da_a<=da_a)
states: 644,204 (5)
.
EG iterations: 1
abstracting: (8<=c_cap)
states: 175,692 (5)
abstracting: (a<=4)
states: 292,820 (5)
abstracting: (2<=c_cap)
states: 527,076 (5)
abstracting: (dr<=ma_cap)
states: 614,922 (5)
.
EG iterations: 1
abstracting: (6<=mr)
states: 292,820 (5)
abstracting: (dr_a<=4)
states: 644,204 (5)
abstracting: (r_cap<=2)
states: 175,692 (5)
abstracting: (a<=a)
states: 644,204 (5)
abstracting: (a<=a)
states: 644,204 (5)
abstracting: (a<=a)
states: 644,204 (5)

EG iterations: 0
abstracting: (da_a<=10)
states: 644,204 (5)
abstracting: (da<=ma)
states: 614,922 (5)
abstracting: (ma_cap<=c)
states: 351,384 (5)
abstracting: (a<=da_a)
states: 87,846 (4)
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (5<=mr_cap)
states: 351,384 (5)
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (mr<=1)
states: 117,128 (5)
.
EG iterations: 1
abstracting: (ma_cap<=7)
states: 468,512 (5)
abstracting: (a<=1)
states: 117,128 (5)
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (5<=mr_cap)
states: 351,384 (5)
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (mr<=1)
states: 117,128 (5)
.
EG iterations: 1
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (5<=mr_cap)
states: 351,384 (5)
abstracting: (mr<=1)
states: 117,128 (5)
abstracting: (mr<=1)
states: 117,128 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (10<=a_cap)
states: 58,564 (4)
abstracting: (da_a<=mr_cap)
states: 614,922 (5)
abstracting: (ma_cap<=ma)
states: 351,384 (5)
abstracting: (da_a<=da_a)
states: 644,204 (5)
.
EG iterations: 1
abstracting: (8<=c_cap)
states: 175,692 (5)
abstracting: (a<=4)
states: 292,820 (5)
abstracting: (2<=c_cap)
states: 527,076 (5)
abstracting: (dr<=ma_cap)
states: 614,922 (5)
.
EG iterations: 1
abstracting: (10<=a_cap)
states: 58,564 (4)
abstracting: (da_a<=mr_cap)
states: 614,922 (5)
abstracting: (ma_cap<=ma)
states: 351,384 (5)
abstracting: (da_a<=da_a)
states: 644,204 (5)
.
EG iterations: 1
abstracting: (8<=c_cap)
states: 175,692 (5)
abstracting: (a<=4)
states: 292,820 (5)
abstracting: (2<=c_cap)
states: 527,076 (5)
abstracting: (dr<=ma_cap)
states: 614,922 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

totally nodes used: 17849 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 58985 57520 116505
used/not used/entry size/cache size: 72507 67036357 16 1024MB
basic ops cache: hits/miss/sum: 24034 27177 51211
used/not used/entry size/cache size: 47565 16729651 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: 2733 2688 5421
used/not used/entry size/cache size: 2688 8385920 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 67092229
1 16391
2 106
3 46
4 33
5 1
6 3
7 1
8 4
9 1
>= 10 49

Total processing time: 0m 5.480sec


BK_STOP 1678266298848

--------------------
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:878 (54), effective:153 (9)

initing FirstDep: 0m 0.000sec


iterations count:44 (2), effective:7 (0)

iterations count:164 (10), effective:36 (2)

iterations count:180 (11), effective:43 (2)

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

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

iterations count:37 (2), effective:7 (0)

iterations count:37 (2), effective:7 (0)

iterations count:37 (2), effective:7 (0)

iterations count:94 (5), effective:24 (1)

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

iterations count:371 (23), effective:71 (4)

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

iterations count:28 (1), effective:4 (0)

iterations count:26 (1), effective:10 (0)

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

iterations count:83 (5), effective:12 (0)

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

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

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

iterations count:67 (4), effective:14 (0)

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

iterations count:36 (2), effective:5 (0)

iterations count:121 (7), effective:28 (1)

iterations count:56 (3), effective:16 (1)

iterations count:40 (2), effective:5 (0)

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

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

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

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

iterations count:26 (1), effective:10 (0)

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

iterations count:34 (2), effective:9 (0)

iterations count:58 (3), effective:11 (0)

iterations count:31 (1), effective:5 (0)

iterations count:31 (1), effective:4 (0)

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

iterations count:22 (1), effective:3 (0)

iterations count:28 (1), effective:3 (0)

iterations count:36 (2), effective:8 (0)

iterations count:36 (2), effective:8 (0)

iterations count:37 (2), effective:4 (0)

iterations count:36 (2), effective:8 (0)

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

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

iterations count:21 (1), effective:5 (0)

iterations count:25 (1), effective:2 (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="CircadianClock-PT-000010"
export BK_EXAMINATION="CTLCardinality"
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-000010, examination is CTLCardinality"
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-167814393000105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000010.tgz
mv CircadianClock-PT-000010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;