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.r129-smll-167819403200001.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 Dekker-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403200001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 01:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K 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 Dekker-PT-010-CTLCardinality-00
FORMULA_NAME Dekker-PT-010-CTLCardinality-01
FORMULA_NAME Dekker-PT-010-CTLCardinality-02
FORMULA_NAME Dekker-PT-010-CTLCardinality-03
FORMULA_NAME Dekker-PT-010-CTLCardinality-04
FORMULA_NAME Dekker-PT-010-CTLCardinality-05
FORMULA_NAME Dekker-PT-010-CTLCardinality-06
FORMULA_NAME Dekker-PT-010-CTLCardinality-07
FORMULA_NAME Dekker-PT-010-CTLCardinality-08
FORMULA_NAME Dekker-PT-010-CTLCardinality-09
FORMULA_NAME Dekker-PT-010-CTLCardinality-10
FORMULA_NAME Dekker-PT-010-CTLCardinality-11
FORMULA_NAME Dekker-PT-010-CTLCardinality-12
FORMULA_NAME Dekker-PT-010-CTLCardinality-13
FORMULA_NAME Dekker-PT-010-CTLCardinality-14
FORMULA_NAME Dekker-PT-010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678256654170

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=Dekker-PT-010
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: Dekker_PT_010
(NrP: 50 NrTr: 120 NrArc: 820)

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

net check time: 0m 0.000sec

init dd package: 0m 3.416sec


RS generation: 0m 0.018sec


-> reachability set: #nodes 462 (4.6e+02) #states 6,144 (3)



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

checking: EF [AG [AF [EF [EG [p3_0<=0]]]]]
normalized: E [true U ~ [E [true U EG [~ [E [true U EG [p3_0<=0]]]]]]]

abstracting: (p3_0<=0)
states: 5,632 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [~ [EF [~ [p1_0<=flag_1_0]]]]
normalized: ~ [E [true U E [true U ~ [p1_0<=flag_1_0]]]]

abstracting: (p1_0<=flag_1_0)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AG [EF [[[flag_0_9<=p1_2 | p3_1<=1] & ~ [flag_0_9<=0]]]]]
normalized: E [true U ~ [E [true U [[flag_0_9<=p1_2 | p3_1<=1] & ~ [flag_0_9<=0]]]]]

abstracting: (flag_0_9<=0)
states: 3,328 (3)
abstracting: (p3_1<=1)
states: 6,144 (3)
abstracting: (flag_0_9<=p1_2)
states: 4,608 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [EX [EX [[[p3_3<=p0_4 & 1<=p1_0] | EF [flag_1_0<=1]]]]]]
normalized: E [true U ~ [EX [EX [[E [true U flag_1_0<=1] | [p3_3<=p0_4 & 1<=p1_0]]]]]]

abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (p3_3<=p0_4)
states: 5,888 (3)
abstracting: (flag_1_0<=1)
states: 6,144 (3)
..-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [~ [E [~ [flag_1_3<=flag_0_9] U [[flag_0_2<=1 | 1<=p1_0] & p0_5<=0]]]]]
normalized: E [true U ~ [E [true U E [~ [flag_1_3<=flag_0_9] U [p0_5<=0 & [flag_0_2<=1 | 1<=p1_0]]]]]]

abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (flag_0_2<=1)
states: 6,144 (3)
abstracting: (p0_5<=0)
states: 3,328 (3)
abstracting: (flag_1_3<=flag_0_9)
states: 4,352 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AF [AG [[EF [1<=p0_4] | [p1_5<=p0_4 & ~ [EG [p0_4<=p3_0]]]]]]
normalized: ~ [EG [E [true U ~ [[[p1_5<=p0_4 & ~ [EG [p0_4<=p3_0]]] | E [true U 1<=p0_4]]]]]]

abstracting: (1<=p0_4)
states: 2,816 (3)
abstracting: (p0_4<=p3_0)
states: 3,584 (3)
.
EG iterations: 1
abstracting: (p1_5<=p0_4)
states: 4,608 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [AX [[AX [A [p0_8<=1 U flag_1_6<=0]] & [p0_8<=p0_7 | ~ [A [1<=p1_0 U flag_1_6<=flag_0_6]]]]]]
normalized: E [true U ~ [EX [~ [[[p0_8<=p0_7 | ~ [[~ [EG [~ [flag_1_6<=flag_0_6]]] & ~ [E [~ [flag_1_6<=flag_0_6] U [~ [1<=p1_0] & ~ [flag_1_6<=flag_0_6]]]]]]] & ~ [EX [~ [[~ [EG [~ [flag_1_6<=0]]] & ~ [E [~ [flag_1_6<=0] U [~ [p0_8<=1] & ~ [flag_1_6<=0]]]]]]]]]]]]]

abstracting: (flag_1_6<=0)
states: 2,816 (3)
abstracting: (p0_8<=1)
states: 6,144 (3)
abstracting: (flag_1_6<=0)
states: 2,816 (3)
abstracting: (flag_1_6<=0)
states: 2,816 (3)
.
EG iterations: 1
.abstracting: (flag_1_6<=flag_0_6)
states: 2,816 (3)
abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (flag_1_6<=flag_0_6)
states: 2,816 (3)
abstracting: (flag_1_6<=flag_0_6)
states: 2,816 (3)
.
EG iterations: 1
abstracting: (p0_8<=p0_7)
states: 4,608 (3)
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [EG [E [1<=p0_3 U E [[[1<=p0_9 | flag_1_9<=1] & [1<=flag_0_6 | flag_1_2<=0]] U ~ [EF [p3_6<=flag_1_6]]]]]]
normalized: ~ [EG [E [1<=p0_3 U E [[[1<=flag_0_6 | flag_1_2<=0] & [1<=p0_9 | flag_1_9<=1]] U ~ [E [true U p3_6<=flag_1_6]]]]]]

abstracting: (p3_6<=flag_1_6)
states: 6,144 (3)
abstracting: (flag_1_9<=1)
states: 6,144 (3)
abstracting: (1<=p0_9)
states: 2,816 (3)
abstracting: (flag_1_2<=0)
states: 2,816 (3)
abstracting: (1<=flag_0_6)
states: 2,816 (3)
abstracting: (1<=p0_3)
states: 2,816 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AG [~ [E [[[1<=flag_0_9 & AF [flag_0_2<=0]] & ~ [AX [1<=flag_0_6]]] U [[1<=p0_3 & flag_1_3<=p1_5] & E [1<=flag_0_2 U 1<=flag_1_5]]]]] | AG [p0_0<=1]]
normalized: [~ [E [true U ~ [p0_0<=1]]] | ~ [E [true U E [[EX [~ [1<=flag_0_6]] & [1<=flag_0_9 & ~ [EG [~ [flag_0_2<=0]]]]] U [E [1<=flag_0_2 U 1<=flag_1_5] & [1<=p0_3 & flag_1_3<=p1_5]]]]]]

abstracting: (flag_1_3<=p1_5)
states: 4,352 (3)
abstracting: (1<=p0_3)
states: 2,816 (3)
abstracting: (1<=flag_1_5)
states: 3,328 (3)
abstracting: (1<=flag_0_2)
states: 2,816 (3)
abstracting: (flag_0_2<=0)
states: 3,328 (3)
.
EG iterations: 1
abstracting: (1<=flag_0_9)
states: 2,816 (3)
abstracting: (1<=flag_0_6)
states: 2,816 (3)
.abstracting: (p0_0<=1)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: ~ [[E [EF [E [p0_7<=1 U [1<=flag_0_2 | 1<=p1_7]]] U ~ [[p34<=0 & [EG [1<=flag_1_3] & [AG [1<=flag_1_2] | A [p0_2<=1 U 1<=p1_9]]]]]] & EF [~ [[[1<=flag_0_1 & 1<=flag_1_2] | EX [1<=flag_1_1]]]]]]
normalized: ~ [[E [true U ~ [[EX [1<=flag_1_1] | [1<=flag_0_1 & 1<=flag_1_2]]]] & E [E [true U E [p0_7<=1 U [1<=flag_0_2 | 1<=p1_7]]] U ~ [[p34<=0 & [[[~ [EG [~ [1<=p1_9]]] & ~ [E [~ [1<=p1_9] U [~ [p0_2<=1] & ~ [1<=p1_9]]]]] | ~ [E [true U ~ [1<=flag_1_2]]]] & EG [1<=flag_1_3]]]]]]]

abstracting: (1<=flag_1_3)
states: 3,328 (3)
.
EG iterations: 1
abstracting: (1<=flag_1_2)
states: 3,328 (3)
abstracting: (1<=p1_9)
states: 2,816 (3)
abstracting: (p0_2<=1)
states: 6,144 (3)
abstracting: (1<=p1_9)
states: 2,816 (3)
abstracting: (1<=p1_9)
states: 2,816 (3)
.
EG iterations: 1
abstracting: (p34<=0)
states: 5,632 (3)
abstracting: (1<=p1_7)
states: 2,816 (3)
abstracting: (1<=flag_0_2)
states: 2,816 (3)
abstracting: (p0_7<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_2)
states: 3,328 (3)
abstracting: (1<=flag_0_1)
states: 2,816 (3)
abstracting: (1<=flag_1_1)
states: 3,328 (3)
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: A [~ [AG [[~ [p0_1<=p0_8] & [[p3_5<=flag_0_4 & [p3_9<=1 | 1<=flag_1_6]] | A [1<=p1_3 U p0_2<=p1_6]]]]] U [AG [flag_1_8<=1] | p0_2<=flag_0_5]]
normalized: [~ [EG [~ [[p0_2<=flag_0_5 | ~ [E [true U ~ [flag_1_8<=1]]]]]]] & ~ [E [~ [[p0_2<=flag_0_5 | ~ [E [true U ~ [flag_1_8<=1]]]]] U [~ [E [true U ~ [[[[~ [EG [~ [p0_2<=p1_6]]] & ~ [E [~ [p0_2<=p1_6] U [~ [1<=p1_3] & ~ [p0_2<=p1_6]]]]] | [p3_5<=flag_0_4 & [p3_9<=1 | 1<=flag_1_6]]] & ~ [p0_1<=p0_8]]]]] & ~ [[p0_2<=flag_0_5 | ~ [E [true U ~ [flag_1_8<=1]]]]]]]]]

abstracting: (flag_1_8<=1)
states: 6,144 (3)
abstracting: (p0_2<=flag_0_5)
states: 4,608 (3)
abstracting: (p0_1<=p0_8)
states: 4,608 (3)
abstracting: (1<=flag_1_6)
states: 3,328 (3)
abstracting: (p3_9<=1)
states: 6,144 (3)
abstracting: (p3_5<=flag_0_4)
states: 5,888 (3)
abstracting: (p0_2<=p1_6)
states: 4,608 (3)
abstracting: (1<=p1_3)
states: 2,816 (3)
abstracting: (p0_2<=p1_6)
states: 4,608 (3)
abstracting: (p0_2<=p1_6)
states: 4,608 (3)
.
EG iterations: 1
abstracting: (flag_1_8<=1)
states: 6,144 (3)
abstracting: (p0_2<=flag_0_5)
states: 4,608 (3)
abstracting: (flag_1_8<=1)
states: 6,144 (3)
abstracting: (p0_2<=flag_0_5)
states: 4,608 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: ~ [E [[A [EX [~ [p1_8<=1]] U [AX [flag_1_9<=1] & ~ [p0_0<=0]]] & [~ [AF [[flag_1_4<=1 | p3_0<=p1_0]]] & [~ [[[1<=flag_1_5 | p1_3<=1] & [p1_4<=p0_9 & flag_1_1<=0]]] | EF [~ [flag_0_1<=0]]]]] U p1_3<=1]]
normalized: ~ [E [[[[E [true U ~ [flag_0_1<=0]] | ~ [[[p1_4<=p0_9 & flag_1_1<=0] & [1<=flag_1_5 | p1_3<=1]]]] & EG [~ [[flag_1_4<=1 | p3_0<=p1_0]]]] & [~ [EG [~ [[~ [p0_0<=0] & ~ [EX [~ [flag_1_9<=1]]]]]]] & ~ [E [~ [[~ [p0_0<=0] & ~ [EX [~ [flag_1_9<=1]]]]] U [~ [EX [~ [p1_8<=1]]] & ~ [[~ [p0_0<=0] & ~ [EX [~ [flag_1_9<=1]]]]]]]]]] U p1_3<=1]]

abstracting: (p1_3<=1)
states: 6,144 (3)
abstracting: (flag_1_9<=1)
states: 6,144 (3)
.abstracting: (p0_0<=0)
states: 3,328 (3)
abstracting: (p1_8<=1)
states: 6,144 (3)
.abstracting: (flag_1_9<=1)
states: 6,144 (3)
.abstracting: (p0_0<=0)
states: 3,328 (3)
abstracting: (flag_1_9<=1)
states: 6,144 (3)
.abstracting: (p0_0<=0)
states: 3,328 (3)
.
EG iterations: 1
abstracting: (p3_0<=p1_0)
states: 5,632 (3)
abstracting: (flag_1_4<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (p1_3<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_5)
states: 3,328 (3)
abstracting: (flag_1_1<=0)
states: 2,816 (3)
abstracting: (p1_4<=p0_9)
states: 4,608 (3)
abstracting: (flag_0_1<=0)
states: 3,328 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: E [[AF [~ [[[AF [p1_2<=flag_0_9] & [1<=p1_3 | 1<=p3_2]] | AG [p1_3<=flag_1_7]]]] & A [~ [[[[p1_1<=0 & 1<=p3_1] | 1<=p3_1] | EG [p1_1<=p3_8]]] U p3_8<=0]] U AX [AG [[EG [flag_0_4<=1] & EF [p0_8<=flag_1_3]]]]]
normalized: E [[[~ [EG [~ [p3_8<=0]]] & ~ [E [~ [p3_8<=0] U [[EG [p1_1<=p3_8] | [1<=p3_1 | [p1_1<=0 & 1<=p3_1]]] & ~ [p3_8<=0]]]]] & ~ [EG [[~ [E [true U ~ [p1_3<=flag_1_7]]] | [[1<=p1_3 | 1<=p3_2] & ~ [EG [~ [p1_2<=flag_0_9]]]]]]]] U ~ [EX [E [true U ~ [[E [true U p0_8<=flag_1_3] & EG [flag_0_4<=1]]]]]]]

abstracting: (flag_0_4<=1)
states: 6,144 (3)

EG iterations: 0
abstracting: (p0_8<=flag_1_3)
states: 4,864 (3)
.abstracting: (p1_2<=flag_0_9)
states: 4,608 (3)
.
EG iterations: 1
abstracting: (1<=p3_2)
states: 512
abstracting: (1<=p1_3)
states: 2,816 (3)
abstracting: (p1_3<=flag_1_7)
states: 4,864 (3)
.
EG iterations: 1
abstracting: (p3_8<=0)
states: 5,632 (3)
abstracting: (1<=p3_1)
states: 512
abstracting: (p1_1<=0)
states: 3,328 (3)
abstracting: (1<=p3_1)
states: 512
abstracting: (p1_1<=p3_8)
states: 3,584 (3)
.
EG iterations: 1
abstracting: (p3_8<=0)
states: 5,632 (3)
abstracting: (p3_8<=0)
states: 5,632 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: ~ [EX [[[[~ [[p1_5<=flag_0_2 & AX [p3_8<=0]]] & E [[p3_6<=flag_1_9 | 1<=p1_5] U [flag_0_9<=p1_6 | 1<=p0_7]]] & [p1_2<=p3_0 | AG [AX [p0_0<=flag_0_2]]]] & [EX [AG [flag_0_5<=1]] & 1<=p0_1]]]]
normalized: ~ [EX [[[1<=p0_1 & EX [~ [E [true U ~ [flag_0_5<=1]]]]] & [[p1_2<=p3_0 | ~ [E [true U EX [~ [p0_0<=flag_0_2]]]]] & [E [[p3_6<=flag_1_9 | 1<=p1_5] U [flag_0_9<=p1_6 | 1<=p0_7]] & ~ [[p1_5<=flag_0_2 & ~ [EX [~ [p3_8<=0]]]]]]]]]]

abstracting: (p3_8<=0)
states: 5,632 (3)
.abstracting: (p1_5<=flag_0_2)
states: 4,608 (3)
abstracting: (1<=p0_7)
states: 2,816 (3)
abstracting: (flag_0_9<=p1_6)
states: 4,608 (3)
abstracting: (1<=p1_5)
states: 2,816 (3)
abstracting: (p3_6<=flag_1_9)
states: 5,888 (3)
abstracting: (p0_0<=flag_0_2)
states: 4,608 (3)
.abstracting: (p1_2<=p3_0)
states: 3,584 (3)
abstracting: (flag_0_5<=1)
states: 6,144 (3)
.abstracting: (1<=p0_1)
states: 2,816 (3)
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: ~ [[[EF [~ [EF [~ [1<=p1_7]]]] | E [[~ [p0_5<=1] | [[~ [p3_1<=flag_0_4] | p0_2<=1] | ~ [AF [flag_1_7<=flag_0_4]]]] U [AX [1<=p3_0] & [A [flag_0_3<=1 U p1_2<=1] | ~ [[1<=p1_3 & flag_1_6<=0]]]]]] | AX [EG [~ [[p34<=0 | [p1_4<=1 | p3_5<=flag_1_6]]]]]]]
normalized: ~ [[~ [EX [~ [EG [~ [[p34<=0 | [p1_4<=1 | p3_5<=flag_1_6]]]]]]] | [E [[[EG [~ [flag_1_7<=flag_0_4]] | [p0_2<=1 | ~ [p3_1<=flag_0_4]]] | ~ [p0_5<=1]] U [[~ [[1<=p1_3 & flag_1_6<=0]] | [~ [EG [~ [p1_2<=1]]] & ~ [E [~ [p1_2<=1] U [~ [flag_0_3<=1] & ~ [p1_2<=1]]]]]] & ~ [EX [~ [1<=p3_0]]]]] | E [true U ~ [E [true U ~ [1<=p1_7]]]]]]]

abstracting: (1<=p1_7)
states: 2,816 (3)
abstracting: (1<=p3_0)
states: 512
.abstracting: (p1_2<=1)
states: 6,144 (3)
abstracting: (flag_0_3<=1)
states: 6,144 (3)
abstracting: (p1_2<=1)
states: 6,144 (3)
abstracting: (p1_2<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (flag_1_6<=0)
states: 2,816 (3)
abstracting: (1<=p1_3)
states: 2,816 (3)
abstracting: (p0_5<=1)
states: 6,144 (3)
abstracting: (p3_1<=flag_0_4)
states: 5,888 (3)
abstracting: (p0_2<=1)
states: 6,144 (3)
abstracting: (flag_1_7<=flag_0_4)
states: 4,352 (3)
.
EG iterations: 1
abstracting: (p3_5<=flag_1_6)
states: 5,888 (3)
abstracting: (p1_4<=1)
states: 6,144 (3)
abstracting: (p34<=0)
states: 5,632 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AX [p3_0<=p0_5] & [E [E [E [~ [flag_1_5<=p0_8] U [1<=p0_7 & 1<=flag_1_0]] U AG [[flag_0_1<=1 | flag_0_5<=1]]] U [1<=flag_0_2 & [EG [[flag_1_9<=flag_0_3 | flag_0_5<=0]] & [[E [1<=p1_8 U flag_0_2<=flag_1_6] | [p1_4<=0 & 1<=p1_3]] | ~ [EG [p3_1<=0]]]]]] & EF [[AX [flag_1_9<=1] | A [E [flag_0_3<=0 U flag_0_9<=flag_1_2] U [[flag_1_5<=flag_0_9 & p1_2<=1] & flag_1_8<=flag_0_3]]]]]]
normalized: [[E [true U [[~ [EG [~ [[flag_1_8<=flag_0_3 & [flag_1_5<=flag_0_9 & p1_2<=1]]]]] & ~ [E [~ [[flag_1_8<=flag_0_3 & [flag_1_5<=flag_0_9 & p1_2<=1]]] U [~ [E [flag_0_3<=0 U flag_0_9<=flag_1_2]] & ~ [[flag_1_8<=flag_0_3 & [flag_1_5<=flag_0_9 & p1_2<=1]]]]]]] | ~ [EX [~ [flag_1_9<=1]]]]] & E [E [E [~ [flag_1_5<=p0_8] U [1<=p0_7 & 1<=flag_1_0]] U ~ [E [true U ~ [[flag_0_1<=1 | flag_0_5<=1]]]]] U [1<=flag_0_2 & [[~ [EG [p3_1<=0]] | [[p1_4<=0 & 1<=p1_3] | E [1<=p1_8 U flag_0_2<=flag_1_6]]] & EG [[flag_1_9<=flag_0_3 | flag_0_5<=0]]]]]] & ~ [EX [~ [p3_0<=p0_5]]]]

abstracting: (p3_0<=p0_5)
states: 5,888 (3)
.abstracting: (flag_0_5<=0)
states: 3,328 (3)
abstracting: (flag_1_9<=flag_0_3)
states: 4,352 (3)
.
EG iterations: 1
abstracting: (flag_0_2<=flag_1_6)
states: 4,864 (3)
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (1<=p1_3)
states: 2,816 (3)
abstracting: (p1_4<=0)
states: 3,328 (3)
abstracting: (p3_1<=0)
states: 5,632 (3)
.
EG iterations: 1
abstracting: (1<=flag_0_2)
states: 2,816 (3)
abstracting: (flag_0_5<=1)
states: 6,144 (3)
abstracting: (flag_0_1<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_0)
states: 3,328 (3)
abstracting: (1<=p0_7)
states: 2,816 (3)
abstracting: (flag_1_5<=p0_8)
states: 4,352 (3)
abstracting: (flag_1_9<=1)
states: 6,144 (3)
.abstracting: (p1_2<=1)
states: 6,144 (3)
abstracting: (flag_1_5<=flag_0_9)
states: 4,352 (3)
abstracting: (flag_1_8<=flag_0_3)
states: 4,352 (3)
abstracting: (flag_0_9<=flag_1_2)
states: 4,864 (3)
abstracting: (flag_0_3<=0)
states: 3,328 (3)
abstracting: (p1_2<=1)
states: 6,144 (3)
abstracting: (flag_1_5<=flag_0_9)
states: 4,352 (3)
abstracting: (flag_1_8<=flag_0_3)
states: 4,352 (3)
abstracting: (p1_2<=1)
states: 6,144 (3)
abstracting: (flag_1_5<=flag_0_9)
states: 4,352 (3)
abstracting: (flag_1_8<=flag_0_3)
states: 4,352 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

totally nodes used: 130468 (1.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 114666 922258 1036924
used/not used/entry size/cache size: 1013296 66095568 16 1024MB
basic ops cache: hits/miss/sum: 22428 130746 153174
used/not used/entry size/cache size: 210666 16566550 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: 1902 10235 12137
used/not used/entry size/cache size: 10233 8378375 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 66987518
1 113133
2 7375
3 775
4 56
5 6
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.380sec


BK_STOP 1678256659657

--------------------
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:1475 (12), effective:80 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:298 (2), effective:3 (0)

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

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

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

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

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

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

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

iterations count:159 (1), effective:6 (0)

iterations count:164 (1), effective:7 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:120 (1), effective:0 (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="Dekker-PT-010"
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 Dekker-PT-010, 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 r129-smll-167819403200001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 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 ;