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-167819403200006.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403200006
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678256669831

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

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

net check time: 0m 0.000sec

init dd package: 0m 4.441sec


RS generation: 0m 0.021sec


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



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

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

abstracting: (p1_2<=1)
states: 6,144 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [p0_0<=1]
normalized: ~ [E [true U ~ [p0_0<=1]]]

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

FORMULA Dekker-PT-010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=p0_1]
normalized: ~ [E [true U ~ [1<=p0_1]]]

abstracting: (1<=p0_1)
states: 2,816 (3)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: AG [1<=flag_1_2]
normalized: ~ [E [true U ~ [1<=flag_1_2]]]

abstracting: (1<=flag_1_2)
states: 3,328 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [1<=flag_0_6]
normalized: ~ [E [true U ~ [1<=flag_0_6]]]

abstracting: (1<=flag_0_6)
states: 2,816 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [flag_1_8<=0] | flag_0_5<=1]]
normalized: ~ [E [true U ~ [[~ [flag_1_8<=0] | flag_0_5<=1]]]]

abstracting: (flag_0_5<=1)
states: 6,144 (3)
abstracting: (flag_1_8<=0)
states: 2,816 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [flag_1_6<=p3_5]
normalized: ~ [E [true U ~ [flag_1_6<=p3_5]]]

abstracting: (flag_1_6<=p3_5)
states: 3,072 (3)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[p1_1<=flag_0_1 & p3_8<=0]]
normalized: E [true U [p1_1<=flag_0_1 & p3_8<=0]]

abstracting: (p3_8<=0)
states: 5,632 (3)
abstracting: (p1_1<=flag_0_1)
states: 3,328 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[1<=p3_5 & [1<=p1_1 & ~ [[~ [[1<=p3_1 & [1<=p0_8 & flag_0_5<=p1_7]]] & p1_6<=1]]]] & 1<=p3_5]]
normalized: E [true U [[[~ [[~ [[[1<=p0_8 & flag_0_5<=p1_7] & 1<=p3_1]] & p1_6<=1]] & 1<=p1_1] & 1<=p3_5] & 1<=p3_5]]

abstracting: (1<=p3_5)
states: 512
abstracting: (1<=p3_5)
states: 512
abstracting: (1<=p1_1)
states: 2,816 (3)
abstracting: (p1_6<=1)
states: 6,144 (3)
abstracting: (1<=p3_1)
states: 512
abstracting: (flag_0_5<=p1_7)
states: 4,608 (3)
abstracting: (1<=p0_8)
states: 2,816 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [1<=p3_0] | ~ [[[[[1<=p1_2 | p1_4<=0] | 1<=p1_0] | p3_5<=p1_8] & [[[1<=p0_5 | 1<=p0_5] & [1<=p1_9 | flag_0_8<=1]] & ~ [[flag_0_0<=0 | [~ [p0_4<=flag_1_3] & [~ [flag_0_8<=p0_7] | ~ [p1_3<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[flag_0_0<=0 | [[~ [p1_3<=1] | ~ [flag_0_8<=p0_7]] & ~ [p0_4<=flag_1_3]]]] & [[1<=p1_9 | flag_0_8<=1] & [1<=p0_5 | 1<=p0_5]]] & [p3_5<=p1_8 | [1<=p1_0 | [1<=p1_2 | p1_4<=0]]]]] | ~ [1<=p3_0]]]]]

abstracting: (1<=p3_0)
states: 512
abstracting: (p1_4<=0)
states: 3,328 (3)
abstracting: (1<=p1_2)
states: 2,816 (3)
abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (p3_5<=p1_8)
states: 5,888 (3)
abstracting: (1<=p0_5)
states: 2,816 (3)
abstracting: (1<=p0_5)
states: 2,816 (3)
abstracting: (flag_0_8<=1)
states: 6,144 (3)
abstracting: (1<=p1_9)
states: 2,816 (3)
abstracting: (p0_4<=flag_1_3)
states: 4,864 (3)
abstracting: (flag_0_8<=p0_7)
states: 4,608 (3)
abstracting: (p1_3<=1)
states: 6,144 (3)
abstracting: (flag_0_0<=0)
states: 3,328 (3)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AG [~ [[p1_0<=1 | ~ [[[[[flag_1_6<=0 | [flag_1_1<=0 | flag_1_7<=flag_0_5]] & ~ [[p1_9<=1 & p1_1<=0]]] & [[flag_0_7<=flag_0_8 | p3_1<=p1_2] & [~ [1<=p0_3] & flag_0_4<=flag_0_9]]] & ~ [[[[p1_6<=1 & flag_0_0<=0] & [p1_1<=flag_1_9 | flag_0_0<=p3_7]] & [p0_5<=0 | ~ [flag_0_5<=1]]]]]]]]]
normalized: ~ [E [true U [p1_0<=1 | ~ [[~ [[[p0_5<=0 | ~ [flag_0_5<=1]] & [[p1_1<=flag_1_9 | flag_0_0<=p3_7] & [p1_6<=1 & flag_0_0<=0]]]] & [[[flag_0_4<=flag_0_9 & ~ [1<=p0_3]] & [flag_0_7<=flag_0_8 | p3_1<=p1_2]] & [~ [[p1_9<=1 & p1_1<=0]] & [flag_1_6<=0 | [flag_1_1<=0 | flag_1_7<=flag_0_5]]]]]]]]]

abstracting: (flag_1_7<=flag_0_5)
states: 4,352 (3)
abstracting: (flag_1_1<=0)
states: 2,816 (3)
abstracting: (flag_1_6<=0)
states: 2,816 (3)
abstracting: (p1_1<=0)
states: 3,328 (3)
abstracting: (p1_9<=1)
states: 6,144 (3)
abstracting: (p3_1<=p1_2)
states: 5,888 (3)
abstracting: (flag_0_7<=flag_0_8)
states: 4,608 (3)
abstracting: (1<=p0_3)
states: 2,816 (3)
abstracting: (flag_0_4<=flag_0_9)
states: 4,608 (3)
abstracting: (flag_0_0<=0)
states: 3,328 (3)
abstracting: (p1_6<=1)
states: 6,144 (3)
abstracting: (flag_0_0<=p3_7)
states: 3,584 (3)
abstracting: (p1_1<=flag_1_9)
states: 4,864 (3)
abstracting: (flag_0_5<=1)
states: 6,144 (3)
abstracting: (p0_5<=0)
states: 3,328 (3)
abstracting: (p1_0<=1)
states: 6,144 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[[[~ [1<=flag_1_6] | [~ [[1<=p3_0 & 1<=p1_2]] | [~ [flag_1_0<=flag_1_1] | [flag_1_0<=p34 | ~ [[p3_2<=1 & p0_8<=0]]]]]] & [[~ [[[[p0_3<=1 & 1<=p3_9] & [1<=p0_3 | 1<=flag_1_2]] | [[p3_7<=p0_3 | flag_0_4<=flag_1_3] & p3_5<=1]]] | 1<=flag_0_8] & flag_0_2<=p0_4]] | p0_9<=flag_1_4]]]
normalized: ~ [E [true U [p0_9<=flag_1_4 | [[flag_0_2<=p0_4 & [1<=flag_0_8 | ~ [[[p3_5<=1 & [p3_7<=p0_3 | flag_0_4<=flag_1_3]] | [[1<=p0_3 | 1<=flag_1_2] & [p0_3<=1 & 1<=p3_9]]]]]] & [[[[flag_1_0<=p34 | ~ [[p3_2<=1 & p0_8<=0]]] | ~ [flag_1_0<=flag_1_1]] | ~ [[1<=p3_0 & 1<=p1_2]]] | ~ [1<=flag_1_6]]]]]]

abstracting: (1<=flag_1_6)
states: 3,328 (3)
abstracting: (1<=p1_2)
states: 2,816 (3)
abstracting: (1<=p3_0)
states: 512
abstracting: (flag_1_0<=flag_1_1)
states: 4,608 (3)
abstracting: (p0_8<=0)
states: 3,328 (3)
abstracting: (p3_2<=1)
states: 6,144 (3)
abstracting: (flag_1_0<=p34)
states: 3,072 (3)
abstracting: (1<=p3_9)
states: 512
abstracting: (p0_3<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_2)
states: 3,328 (3)
abstracting: (1<=p0_3)
states: 2,816 (3)
abstracting: (flag_0_4<=flag_1_3)
states: 4,864 (3)
abstracting: (p3_7<=p0_3)
states: 5,888 (3)
abstracting: (p3_5<=1)
states: 6,144 (3)
abstracting: (1<=flag_0_8)
states: 2,816 (3)
abstracting: (flag_0_2<=p0_4)
states: 4,608 (3)
abstracting: (p0_9<=flag_1_4)
states: 4,864 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[[~ [p1_8<=p1_9] & [[p0_2<=flag_0_5 | 1<=flag_0_2] & [flag_1_0<=1 & [1<=flag_1_0 & ~ [flag_1_0<=p0_8]]]]] & ~ [[p3_5<=1 | [[[1<=p1_4 | [[p1_0<=p3_9 & ~ [1<=p3_1]] & ~ [[flag_0_5<=0 & p3_0<=0]]]] & [~ [[~ [1<=p3_3] & flag_1_2<=0]] & [[[p1_0<=0 | flag_0_6<=p3_8] | [flag_1_0<=p3_9 | 1<=p1_7]] & [~ [1<=p1_8] | flag_0_3<=flag_0_1]]]] & p3_0<=p3_3]]]]]
normalized: E [true U [~ [[p3_5<=1 | [p3_0<=p3_3 & [[[[flag_0_3<=flag_0_1 | ~ [1<=p1_8]] & [[flag_1_0<=p3_9 | 1<=p1_7] | [p1_0<=0 | flag_0_6<=p3_8]]] & ~ [[flag_1_2<=0 & ~ [1<=p3_3]]]] & [1<=p1_4 | [~ [[flag_0_5<=0 & p3_0<=0]] & [p1_0<=p3_9 & ~ [1<=p3_1]]]]]]]] & [[[flag_1_0<=1 & [1<=flag_1_0 & ~ [flag_1_0<=p0_8]]] & [p0_2<=flag_0_5 | 1<=flag_0_2]] & ~ [p1_8<=p1_9]]]]

abstracting: (p1_8<=p1_9)
states: 4,608 (3)
abstracting: (1<=flag_0_2)
states: 2,816 (3)
abstracting: (p0_2<=flag_0_5)
states: 4,608 (3)
abstracting: (flag_1_0<=p0_8)
states: 4,352 (3)
abstracting: (1<=flag_1_0)
states: 3,328 (3)
abstracting: (flag_1_0<=1)
states: 6,144 (3)
abstracting: (1<=p3_1)
states: 512
abstracting: (p1_0<=p3_9)
states: 3,584 (3)
abstracting: (p3_0<=0)
states: 5,632 (3)
abstracting: (flag_0_5<=0)
states: 3,328 (3)
abstracting: (1<=p1_4)
states: 2,816 (3)
abstracting: (1<=p3_3)
states: 512
abstracting: (flag_1_2<=0)
states: 2,816 (3)
abstracting: (flag_0_6<=p3_8)
states: 3,584 (3)
abstracting: (p1_0<=0)
states: 3,328 (3)
abstracting: (1<=p1_7)
states: 2,816 (3)
abstracting: (flag_1_0<=p3_9)
states: 3,072 (3)
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (flag_0_3<=flag_0_1)
states: 4,608 (3)
abstracting: (p3_0<=p3_3)
states: 5,632 (3)
abstracting: (p3_5<=1)
states: 6,144 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[p0_7<=1 & [[1<=p1_9 & [p3_5<=p1_0 | ~ [1<=p0_2]]] | [[[~ [[p0_8<=flag_0_6 & [[p3_8<=1 | p1_2<=p1_2] | ~ [p1_4<=1]]]] | [[~ [[p1_1<=1 | p3_2<=1]] & [~ [flag_0_0<=1] & [flag_1_1<=p0_3 | p0_0<=0]]] & ~ [p1_3<=flag_0_1]]] | ~ [[[[p3_7<=0 & p3_0<=flag_0_6] & ~ [flag_0_7<=flag_0_3]] & ~ [[flag_1_7<=1 | flag_0_5<=p0_6]]]]] | ~ [[p34<=0 & ~ [p1_2<=p0_4]]]]]]]
normalized: ~ [E [true U ~ [[p0_7<=1 & [[~ [[p34<=0 & ~ [p1_2<=p0_4]]] | [~ [[~ [[flag_1_7<=1 | flag_0_5<=p0_6]] & [~ [flag_0_7<=flag_0_3] & [p3_7<=0 & p3_0<=flag_0_6]]]] | [[~ [p1_3<=flag_0_1] & [[[flag_1_1<=p0_3 | p0_0<=0] & ~ [flag_0_0<=1]] & ~ [[p1_1<=1 | p3_2<=1]]]] | ~ [[p0_8<=flag_0_6 & [~ [p1_4<=1] | [p3_8<=1 | p1_2<=p1_2]]]]]]] | [1<=p1_9 & [p3_5<=p1_0 | ~ [1<=p0_2]]]]]]]]

abstracting: (1<=p0_2)
states: 2,816 (3)
abstracting: (p3_5<=p1_0)
states: 5,888 (3)
abstracting: (1<=p1_9)
states: 2,816 (3)
abstracting: (p1_2<=p1_2)
states: 6,144 (3)
abstracting: (p3_8<=1)
states: 6,144 (3)
abstracting: (p1_4<=1)
states: 6,144 (3)
abstracting: (p0_8<=flag_0_6)
states: 4,608 (3)
abstracting: (p3_2<=1)
states: 6,144 (3)
abstracting: (p1_1<=1)
states: 6,144 (3)
abstracting: (flag_0_0<=1)
states: 6,144 (3)
abstracting: (p0_0<=0)
states: 3,328 (3)
abstracting: (flag_1_1<=p0_3)
states: 4,352 (3)
abstracting: (p1_3<=flag_0_1)
states: 4,608 (3)
abstracting: (p3_0<=flag_0_6)
states: 5,888 (3)
abstracting: (p3_7<=0)
states: 5,632 (3)
abstracting: (flag_0_7<=flag_0_3)
states: 4,608 (3)
abstracting: (flag_0_5<=p0_6)
states: 4,608 (3)
abstracting: (flag_1_7<=1)
states: 6,144 (3)
abstracting: (p1_2<=p0_4)
states: 4,608 (3)
abstracting: (p34<=0)
states: 5,632 (3)
abstracting: (p0_7<=1)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[p3_1<=1 | [[[1<=p1_8 | 1<=p3_9] & [~ [[[[1<=p0_6 | p1_6<=p3_7] | [p1_2<=flag_0_1 & p1_0<=0]] | [[p0_8<=1 & 1<=p1_5] | [p1_4<=1 | p1_7<=flag_1_8]]]] & ~ [flag_1_3<=1]]] | [[[[flag_0_9<=flag_0_5 & ~ [1<=flag_1_3]] & ~ [[~ [p0_8<=p1_8] | [p1_6<=0 & flag_0_0<=1]]]] & [[[[flag_0_0<=p3_6 & 1<=flag_1_2] | [1<=p3_6 & p0_3<=0]] & ~ [1<=flag_1_5]] | flag_0_3<=1]] & [[p1_9<=p0_3 | [p1_6<=1 | [1<=p1_8 & ~ [1<=flag_0_1]]]] | ~ [[[[p0_5<=p1_4 | flag_0_6<=0] | 1<=p3_5] & ~ [p1_0<=p1_8]]]]]]] | [p1_3<=1 & [flag_1_6<=1 & [~ [p1_7<=flag_0_7] & ~ [[[[[flag_0_0<=0 | p0_6<=1] | [p3_8<=flag_1_2 & p3_9<=0]] & [~ [p3_3<=0] | [1<=p3_5 | p0_7<=1]]] | ~ [1<=flag_0_8]]]]]]]]
normalized: ~ [E [true U ~ [[[p1_3<=1 & [flag_1_6<=1 & [~ [[~ [1<=flag_0_8] | [[[1<=p3_5 | p0_7<=1] | ~ [p3_3<=0]] & [[p3_8<=flag_1_2 & p3_9<=0] | [flag_0_0<=0 | p0_6<=1]]]]] & ~ [p1_7<=flag_0_7]]]] | [p3_1<=1 | [[[~ [[~ [p1_0<=p1_8] & [1<=p3_5 | [p0_5<=p1_4 | flag_0_6<=0]]]] | [p1_9<=p0_3 | [p1_6<=1 | [1<=p1_8 & ~ [1<=flag_0_1]]]]] & [[flag_0_3<=1 | [~ [1<=flag_1_5] & [[1<=p3_6 & p0_3<=0] | [flag_0_0<=p3_6 & 1<=flag_1_2]]]] & [~ [[[p1_6<=0 & flag_0_0<=1] | ~ [p0_8<=p1_8]]] & [flag_0_9<=flag_0_5 & ~ [1<=flag_1_3]]]]] | [[~ [flag_1_3<=1] & ~ [[[[p1_4<=1 | p1_7<=flag_1_8] | [p0_8<=1 & 1<=p1_5]] | [[p1_2<=flag_0_1 & p1_0<=0] | [1<=p0_6 | p1_6<=p3_7]]]]] & [1<=p1_8 | 1<=p3_9]]]]]]]]

abstracting: (1<=p3_9)
states: 512
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (p1_6<=p3_7)
states: 3,584 (3)
abstracting: (1<=p0_6)
states: 2,816 (3)
abstracting: (p1_0<=0)
states: 3,328 (3)
abstracting: (p1_2<=flag_0_1)
states: 4,608 (3)
abstracting: (1<=p1_5)
states: 2,816 (3)
abstracting: (p0_8<=1)
states: 6,144 (3)
abstracting: (p1_7<=flag_1_8)
states: 4,864 (3)
abstracting: (p1_4<=1)
states: 6,144 (3)
abstracting: (flag_1_3<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_3)
states: 3,328 (3)
abstracting: (flag_0_9<=flag_0_5)
states: 4,608 (3)
abstracting: (p0_8<=p1_8)
states: 3,328 (3)
abstracting: (flag_0_0<=1)
states: 6,144 (3)
abstracting: (p1_6<=0)
states: 3,328 (3)
abstracting: (1<=flag_1_2)
states: 3,328 (3)
abstracting: (flag_0_0<=p3_6)
states: 3,584 (3)
abstracting: (p0_3<=0)
states: 3,328 (3)
abstracting: (1<=p3_6)
states: 512
abstracting: (1<=flag_1_5)
states: 3,328 (3)
abstracting: (flag_0_3<=1)
states: 6,144 (3)
abstracting: (1<=flag_0_1)
states: 2,816 (3)
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (p1_6<=1)
states: 6,144 (3)
abstracting: (p1_9<=p0_3)
states: 4,608 (3)
abstracting: (flag_0_6<=0)
states: 3,328 (3)
abstracting: (p0_5<=p1_4)
states: 4,608 (3)
abstracting: (1<=p3_5)
states: 512
abstracting: (p1_0<=p1_8)
states: 4,608 (3)
abstracting: (p3_1<=1)
states: 6,144 (3)
abstracting: (p1_7<=flag_0_7)
states: 3,328 (3)
abstracting: (p0_6<=1)
states: 6,144 (3)
abstracting: (flag_0_0<=0)
states: 3,328 (3)
abstracting: (p3_9<=0)
states: 5,632 (3)
abstracting: (p3_8<=flag_1_2)
states: 5,888 (3)
abstracting: (p3_3<=0)
states: 5,632 (3)
abstracting: (p0_7<=1)
states: 6,144 (3)
abstracting: (1<=p3_5)
states: 512
abstracting: (1<=flag_0_8)
states: 2,816 (3)
abstracting: (flag_1_6<=1)
states: 6,144 (3)
abstracting: (p1_3<=1)
states: 6,144 (3)
-> the formula is TRUE

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

MC time: 0m 0.011sec

checking: AG [~ [[[p3_8<=flag_0_5 & [[[~ [1<=p3_0] | [flag_1_1<=0 & [[p1_4<=p3_5 & 1<=flag_0_5] & p3_7<=p3_0]]] | p3_5<=0] & ~ [[[[p0_0<=1 | [1<=p3_6 & flag_0_9<=p0_4]] | [[1<=flag_1_1 & p3_0<=1] | [flag_0_0<=1 & p34<=1]]] | [[[1<=p0_6 & 1<=p1_4] & p1_8<=0] & p0_8<=0]]]]] & [[[[[p1_0<=p3_3 & [[p0_2<=flag_1_6 | p3_3<=p0_9] & [1<=p3_3 & p1_2<=0]]] | [[1<=p0_8 | ~ [p3_5<=1]] | [~ [p1_6<=flag_0_6] & ~ [1<=p1_6]]]] | [[[~ [p1_7<=p0_5] & [1<=p1_0 | p0_0<=1]] & 1<=p3_5] & ~ [[[p3_0<=1 | flag_1_1<=flag_1_6] | [p1_6<=1 | 1<=p1_3]]]]] | [1<=p3_9 & [~ [1<=p3_0] & ~ [[1<=flag_1_8 | p1_0<=1]]]]] | ~ [[[[flag_1_7<=0 | ~ [1<=flag_0_2]] | p3_8<=0] | [p0_1<=0 | [[flag_0_9<=1 & [p0_9<=p1_2 | p0_7<=flag_1_4]] & p1_4<=flag_1_6]]]]]]]]
normalized: ~ [E [true U [[~ [[[p0_1<=0 | [p1_4<=flag_1_6 & [flag_0_9<=1 & [p0_9<=p1_2 | p0_7<=flag_1_4]]]] | [p3_8<=0 | [flag_1_7<=0 | ~ [1<=flag_0_2]]]]] | [[1<=p3_9 & [~ [[1<=flag_1_8 | p1_0<=1]] & ~ [1<=p3_0]]] | [[~ [[[p1_6<=1 | 1<=p1_3] | [p3_0<=1 | flag_1_1<=flag_1_6]]] & [1<=p3_5 & [[1<=p1_0 | p0_0<=1] & ~ [p1_7<=p0_5]]]] | [[[~ [1<=p1_6] & ~ [p1_6<=flag_0_6]] | [1<=p0_8 | ~ [p3_5<=1]]] | [p1_0<=p3_3 & [[1<=p3_3 & p1_2<=0] & [p0_2<=flag_1_6 | p3_3<=p0_9]]]]]]] & [p3_8<=flag_0_5 & [~ [[[p0_8<=0 & [p1_8<=0 & [1<=p0_6 & 1<=p1_4]]] | [[[flag_0_0<=1 & p34<=1] | [1<=flag_1_1 & p3_0<=1]] | [p0_0<=1 | [1<=p3_6 & flag_0_9<=p0_4]]]]] & [p3_5<=0 | [[flag_1_1<=0 & [p3_7<=p3_0 & [p1_4<=p3_5 & 1<=flag_0_5]]] | ~ [1<=p3_0]]]]]]]]

abstracting: (1<=p3_0)
states: 512
abstracting: (1<=flag_0_5)
states: 2,816 (3)
abstracting: (p1_4<=p3_5)
states: 3,584 (3)
abstracting: (p3_7<=p3_0)
states: 5,632 (3)
abstracting: (flag_1_1<=0)
states: 2,816 (3)
abstracting: (p3_5<=0)
states: 5,632 (3)
abstracting: (flag_0_9<=p0_4)
states: 4,608 (3)
abstracting: (1<=p3_6)
states: 512
abstracting: (p0_0<=1)
states: 6,144 (3)
abstracting: (p3_0<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_1)
states: 3,328 (3)
abstracting: (p34<=1)
states: 6,144 (3)
abstracting: (flag_0_0<=1)
states: 6,144 (3)
abstracting: (1<=p1_4)
states: 2,816 (3)
abstracting: (1<=p0_6)
states: 2,816 (3)
abstracting: (p1_8<=0)
states: 3,328 (3)
abstracting: (p0_8<=0)
states: 3,328 (3)
abstracting: (p3_8<=flag_0_5)
states: 5,888 (3)
abstracting: (p3_3<=p0_9)
states: 5,888 (3)
abstracting: (p0_2<=flag_1_6)
states: 4,864 (3)
abstracting: (p1_2<=0)
states: 3,328 (3)
abstracting: (1<=p3_3)
states: 512
abstracting: (p1_0<=p3_3)
states: 3,584 (3)
abstracting: (p3_5<=1)
states: 6,144 (3)
abstracting: (1<=p0_8)
states: 2,816 (3)
abstracting: (p1_6<=flag_0_6)
states: 3,328 (3)
abstracting: (1<=p1_6)
states: 2,816 (3)
abstracting: (p1_7<=p0_5)
states: 4,608 (3)
abstracting: (p0_0<=1)
states: 6,144 (3)
abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (1<=p3_5)
states: 512
abstracting: (flag_1_1<=flag_1_6)
states: 4,608 (3)
abstracting: (p3_0<=1)
states: 6,144 (3)
abstracting: (1<=p1_3)
states: 2,816 (3)
abstracting: (p1_6<=1)
states: 6,144 (3)
abstracting: (1<=p3_0)
states: 512
abstracting: (p1_0<=1)
states: 6,144 (3)
abstracting: (1<=flag_1_8)
states: 3,328 (3)
abstracting: (1<=p3_9)
states: 512
abstracting: (1<=flag_0_2)
states: 2,816 (3)
abstracting: (flag_1_7<=0)
states: 2,816 (3)
abstracting: (p3_8<=0)
states: 5,632 (3)
abstracting: (p0_7<=flag_1_4)
states: 4,864 (3)
abstracting: (p0_9<=p1_2)
states: 4,608 (3)
abstracting: (flag_0_9<=1)
states: 6,144 (3)
abstracting: (p1_4<=flag_1_6)
states: 4,864 (3)
abstracting: (p0_1<=0)
states: 3,328 (3)
-> the formula is TRUE

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

MC time: 0m 0.010sec

totally nodes used: 39747 (4.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16193 122547 138740
used/not used/entry size/cache size: 130923 66977941 16 1024MB
basic ops cache: hits/miss/sum: 12605 93243 105848
used/not used/entry size/cache size: 168154 16609062 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: 2742 13783 16525
used/not used/entry size/cache size: 13783 8374825 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 67070268
1 37478
2 1085
3 33
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.533sec


BK_STOP 1678256676456

--------------------
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:123 (1), effective:1 (0)

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

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

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

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

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

iterations count:131 (1), effective:1 (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="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 Dekker-PT-010, 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 r129-smll-167819403200006"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;