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.r161-tall-167838844700142.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 Eratosthenes-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844700142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 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 4.5K 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 Eratosthenes-PT-010-ReachabilityCardinality-00
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-01
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-02
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-03
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-04
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-05
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-06
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-07
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-08
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-09
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-10
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-11
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-12
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-13
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-14
FORMULA_NAME Eratosthenes-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679420018596

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=Eratosthenes-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: Eratosthenes_PT_010
(NrP: 9 NrTr: 8 NrArc: 24)

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

net check time: 0m 0.000sec

init dd package: 0m 2.898sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 9 (9.0e+00) #states 32



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

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

abstracting: (1<=p5)
states: 32
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (1<=p8)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p8<=0]
normalized: ~ [E [true U ~ [p8<=0]]]

abstracting: (p8<=0)
states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p3<=1)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p10)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p10)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [p4<=p5]
normalized: E [true U p4<=p5]

abstracting: (p4<=p5)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[[~ [p9<=0] & ~ [p7<=1]] | p2<=0] & [[~ [1<=p4] & ~ [p10<=1]] | ~ [[p4<=p3 | ~ [p8<=0]]]]] & 1<=p4]]
normalized: E [true U [[[[~ [p7<=1] & ~ [p9<=0]] | p2<=0] & [~ [[~ [p8<=0] | p4<=p3]] | [~ [p10<=1] & ~ [1<=p4]]]] & 1<=p4]]

abstracting: (1<=p4)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p10<=1)
states: 32
abstracting: (p4<=p3)
states: 32
abstracting: (p8<=0)
states: 16
abstracting: (p2<=0)
states: 0
abstracting: (p9<=0)
states: 16
abstracting: (p7<=1)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[p5<=p10 & [[[[p2<=p2 | ~ [1<=p2]] & p8<=0] & [[p9<=1 | [p3<=1 | 1<=p3]] | [[1<=p7 | p9<=1] & ~ [1<=p6]]]] | p5<=0]]] & 1<=p7]]
normalized: ~ [E [true U ~ [[~ [[[[[[~ [1<=p2] | p2<=p2] & p8<=0] & [[~ [1<=p6] & [1<=p7 | p9<=1]] | [[p3<=1 | 1<=p3] | p9<=1]]] | p5<=0] & p5<=p10]] & 1<=p7]]]]

abstracting: (1<=p7)
states: 32
abstracting: (p5<=p10)
states: 16
abstracting: (p5<=0)
states: 0
abstracting: (p9<=1)
states: 32
abstracting: (1<=p3)
states: 32
abstracting: (p3<=1)
states: 32
abstracting: (p9<=1)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (1<=p6)
states: 16
abstracting: (p8<=0)
states: 16
abstracting: (p2<=p2)
states: 32
abstracting: (1<=p2)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[[~ [p3<=0] & [[~ [[p10<=0 | 1<=p8]] | 1<=p6] | p7<=0]] | [~ [[~ [[[1<=p7 & p6<=1] | [p4<=p4 & p2<=1]]] | [~ [p3<=p4] | [p8<=p8 & ~ [p5<=p6]]]]] | ~ [1<=p5]]] | p3<=p10] & 1<=p8]]
normalized: ~ [E [true U ~ [[[[[~ [1<=p5] | ~ [[[[~ [p5<=p6] & p8<=p8] | ~ [p3<=p4]] | ~ [[[p4<=p4 & p2<=1] | [1<=p7 & p6<=1]]]]]] | [[[~ [[p10<=0 | 1<=p8]] | 1<=p6] | p7<=0] & ~ [p3<=0]]] | p3<=p10] & 1<=p8]]]]

abstracting: (1<=p8)
states: 16
abstracting: (p3<=p10)
states: 16
abstracting: (p3<=0)
states: 0
abstracting: (p7<=0)
states: 0
abstracting: (1<=p6)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p10<=0)
states: 16
abstracting: (p6<=1)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p2<=1)
states: 32
abstracting: (p4<=p4)
states: 32
abstracting: (p3<=p4)
states: 16
abstracting: (p8<=p8)
states: 32
abstracting: (p5<=p6)
states: 16
abstracting: (1<=p5)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [[[1<=p9 & p3<=0] | [~ [1<=p7] & p8<=p2]]] & 1<=p8] | [~ [[[[p4<=0 | 1<=p10] | ~ [[~ [p7<=p8] & p9<=1]]] | [~ [1<=p9] | [p10<=1 & ~ [[1<=p7 & p10<=p2]]]]]] | [1<=p4 & [p2<=p8 | 1<=p2]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[p4<=0 | 1<=p10] | ~ [[~ [p7<=p8] & p9<=1]]] | [[~ [[1<=p7 & p10<=p2]] & p10<=1] | ~ [1<=p9]]]] | [[p2<=p8 | 1<=p2] & 1<=p4]] | [~ [[[~ [1<=p7] & p8<=p2] | [1<=p9 & p3<=0]]] & 1<=p8]]]]]

abstracting: (1<=p8)
states: 16
abstracting: (p3<=0)
states: 0
abstracting: (1<=p9)
states: 16
abstracting: (p8<=p2)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p2<=p8)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (p10<=1)
states: 32
abstracting: (p10<=p2)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p9<=1)
states: 32
abstracting: (p7<=p8)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p4<=0)
states: 16
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[~ [[[1<=p3 & [[[[p7<=0 | 1<=p3] & [[1<=p8 | p10<=p9] | ~ [1<=p2]]] | [~ [p7<=p2] & p2<=0]] | [1<=p7 & [~ [p8<=p5] & [~ [p3<=p6] | [p5<=p5 | p6<=1]]]]]] | ~ [p9<=p7]]] & [[[[[~ [[p9<=1 | 1<=p10]] & ~ [p2<=p7]] & ~ [1<=p3]] | p8<=p8] & p3<=0] | ~ [p5<=1]]]]
normalized: E [true U [[~ [p5<=1] | [[[~ [1<=p3] & [~ [p2<=p7] & ~ [[p9<=1 | 1<=p10]]]] | p8<=p8] & p3<=0]] & ~ [[~ [p9<=p7] | [1<=p3 & [[[[[p5<=p5 | p6<=1] | ~ [p3<=p6]] & ~ [p8<=p5]] & 1<=p7] | [[~ [p7<=p2] & p2<=0] | [[~ [1<=p2] | [1<=p8 | p10<=p9]] & [p7<=0 | 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 32
abstracting: (p7<=0)
states: 0
abstracting: (p10<=p9)
states: 24
abstracting: (1<=p8)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p2<=0)
states: 0
abstracting: (p7<=p2)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p8<=p5)
states: 32
abstracting: (p3<=p6)
states: 16
abstracting: (p6<=1)
states: 32
abstracting: (p5<=p5)
states: 32
abstracting: (1<=p3)
states: 32
abstracting: (p9<=p7)
states: 32
abstracting: (p3<=0)
states: 0
abstracting: (p8<=p8)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (p9<=1)
states: 32
abstracting: (p2<=p7)
states: 32
abstracting: (1<=p3)
states: 32
abstracting: (p5<=1)
states: 32
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[~ [[[p5<=p6 & [[~ [[p6<=0 & 1<=p5]] & [[p4<=p2 | p8<=1] | ~ [p4<=p7]]] | p10<=p9]] & ~ [[[[p7<=p3 & [p2<=p10 & p3<=0]] & [[p7<=1 & 1<=p8] | ~ [p7<=0]]] & [[[p8<=p2 & p7<=p3] | p8<=p4] & [[p5<=0 | p5<=1] & [p3<=p3 & 1<=p8]]]]]]] | 1<=p8]]
normalized: ~ [E [true U ~ [[~ [[~ [[[[[p3<=p3 & 1<=p8] & [p5<=0 | p5<=1]] & [[p8<=p2 & p7<=p3] | p8<=p4]] & [[~ [p7<=0] | [p7<=1 & 1<=p8]] & [[p2<=p10 & p3<=0] & p7<=p3]]]] & [[[[~ [p4<=p7] | [p4<=p2 | p8<=1]] & ~ [[p6<=0 & 1<=p5]]] | p10<=p9] & p5<=p6]]] | 1<=p8]]]]

abstracting: (1<=p8)
states: 16
abstracting: (p5<=p6)
states: 16
abstracting: (p10<=p9)
states: 24
abstracting: (1<=p5)
states: 32
abstracting: (p6<=0)
states: 16
abstracting: (p8<=1)
states: 32
abstracting: (p4<=p2)
states: 32
abstracting: (p4<=p7)
states: 32
abstracting: (p7<=p3)
states: 32
abstracting: (p3<=0)
states: 0
abstracting: (p2<=p10)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p7<=1)
states: 32
abstracting: (p7<=0)
states: 0
abstracting: (p8<=p4)
states: 24
abstracting: (p7<=p3)
states: 32
abstracting: (p8<=p2)
states: 32
abstracting: (p5<=1)
states: 32
abstracting: (p5<=0)
states: 0
abstracting: (1<=p8)
states: 16
abstracting: (p3<=p3)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[1<=p8 & [[p4<=1 | [[[[~ [1<=p2] & p6<=p2] | [[p3<=p5 & p4<=p7] | ~ [p7<=1]]] | ~ [[~ [1<=p8] | [p5<=1 | p10<=p2]]]] | p5<=1]] | p6<=p6]] & ~ [[~ [1<=p9] | [[[[[p4<=p7 & p9<=p4] | ~ [1<=p8]] & p5<=0] | ~ [p2<=0]] | [[p5<=p2 & [[p5<=0 & p9<=1] | [1<=p6 | 1<=p8]]] | p6<=p3]]]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [[[p5<=1 | p10<=p2] | ~ [1<=p8]]] | [[~ [p7<=1] | [p3<=p5 & p4<=p7]] | [~ [1<=p2] & p6<=p2]]] | p5<=1] | p4<=1] | p6<=p6] & 1<=p8] & ~ [[[[[[[1<=p6 | 1<=p8] | [p5<=0 & p9<=1]] & p5<=p2] | p6<=p3] | [~ [p2<=0] | [[~ [1<=p8] | [p4<=p7 & p9<=p4]] & p5<=0]]] | ~ [1<=p9]]]]]]]

abstracting: (1<=p9)
states: 16
abstracting: (p5<=0)
states: 0
abstracting: (p9<=p4)
states: 24
abstracting: (p4<=p7)
states: 32
abstracting: (1<=p8)
states: 16
abstracting: (p2<=0)
states: 0
abstracting: (p6<=p3)
states: 32
abstracting: (p5<=p2)
states: 32
abstracting: (p9<=1)
states: 32
abstracting: (p5<=0)
states: 0
abstracting: (1<=p8)
states: 16
abstracting: (1<=p6)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p6<=p6)
states: 32
abstracting: (p4<=1)
states: 32
abstracting: (p5<=1)
states: 32
abstracting: (p6<=p2)
states: 32
abstracting: (1<=p2)
states: 32
abstracting: (p4<=p7)
states: 32
abstracting: (p3<=p5)
states: 32
abstracting: (p7<=1)
states: 32
abstracting: (1<=p8)
states: 16
abstracting: (p10<=p2)
states: 32
abstracting: (p5<=1)
states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[~ [p8<=p6] | [p6<=1 & [[p7<=1 & [~ [[p9<=p2 & 1<=p6]] & [[1<=p4 & p4<=0] | [1<=p3 & p7<=p5]]]] | [p9<=p5 & p2<=0]]]] | ~ [[~ [[~ [[p3<=0 & 1<=p2]] | p9<=0]] & ~ [[p4<=p5 & [[p8<=p5 | p2<=1] & [[p8<=p7 | p8<=1] & [1<=p2 & p9<=1]]]]]]]] | [[~ [1<=p5] | [[~ [[~ [1<=p5] & ~ [1<=p7]]] | [[p4<=0 & p8<=1] & [1<=p4 & ~ [p5<=0]]]] & p7<=1]] | [[[~ [[~ [[p3<=1 | p10<=p8]] & ~ [[p6<=p7 | 1<=p5]]]] & p4<=1] & p10<=0] | p4<=0]]]]
normalized: E [true U [[[[[~ [[~ [[p6<=p7 | 1<=p5]] & ~ [[p3<=1 | p10<=p8]]]] & p4<=1] & p10<=0] | p4<=0] | [[[[[~ [p5<=0] & 1<=p4] & [p4<=0 & p8<=1]] | ~ [[~ [1<=p7] & ~ [1<=p5]]]] & p7<=1] | ~ [1<=p5]]] | [~ [[~ [[[[[1<=p2 & p9<=1] & [p8<=p7 | p8<=1]] & [p8<=p5 | p2<=1]] & p4<=p5]] & ~ [[~ [[p3<=0 & 1<=p2]] | p9<=0]]]] | [[[[p9<=p5 & p2<=0] | [[[[1<=p3 & p7<=p5] | [1<=p4 & p4<=0]] & ~ [[p9<=p2 & 1<=p6]]] & p7<=1]] & p6<=1] | ~ [p8<=p6]]]]]

abstracting: (p8<=p6)
states: 24
abstracting: (p6<=1)
states: 32
abstracting: (p7<=1)
states: 32
abstracting: (1<=p6)
states: 16
abstracting: (p9<=p2)
states: 32
abstracting: (p4<=0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p7<=p5)
states: 32
abstracting: (1<=p3)
states: 32
abstracting: (p2<=0)
states: 0
abstracting: (p9<=p5)
states: 32
abstracting: (p9<=0)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p3<=0)
states: 0
abstracting: (p4<=p5)
states: 32
abstracting: (p2<=1)
states: 32
abstracting: (p8<=p5)
states: 32
abstracting: (p8<=1)
states: 32
abstracting: (p8<=p7)
states: 32
abstracting: (p9<=1)
states: 32
abstracting: (1<=p2)
states: 32
abstracting: (1<=p5)
states: 32
abstracting: (p7<=1)
states: 32
abstracting: (1<=p5)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p8<=1)
states: 32
abstracting: (p4<=0)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p5<=0)
states: 0
abstracting: (p4<=0)
states: 16
abstracting: (p10<=0)
states: 16
abstracting: (p4<=1)
states: 32
abstracting: (p10<=p8)
states: 24
abstracting: (p3<=1)
states: 32
abstracting: (1<=p5)
states: 32
abstracting: (p6<=p7)
states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[[[1<=p5 | [~ [[p10<=0 | p10<=1]] & ~ [[[p3<=0 & p3<=p5] | ~ [p2<=0]]]]] & p6<=p10] | [1<=p8 | ~ [[~ [p2<=p5] & [1<=p4 | p7<=p5]]]]] & [[[[[[1<=p6 | p3<=p3] | 1<=p3] & [~ [p8<=p8] | 1<=p5]] | [[~ [[1<=p3 & p2<=p3]] & 1<=p5] | ~ [[p6<=1 & p5<=p3]]]] | ~ [[[[1<=p10 | p10<=0] & [p5<=p5 | p2<=p7]] & [[1<=p4 | p3<=p10] & [p3<=0 & 1<=p2]]]]] | [~ [p2<=0] & ~ [[[~ [p2<=p7] & ~ [p2<=p4]] | ~ [[p2<=p4 | p8<=1]]]]]]] & [~ [[~ [[~ [p3<=p3] & [[p8<=p9 | [p7<=1 | p9<=p10]] | ~ [[p6<=0 & p10<=p7]]]]] | 1<=p10]] | ~ [[p8<=1 & [[p10<=1 | 1<=p6] & [~ [[[p6<=1 & p8<=1] & [p10<=1 | p4<=1]]] & [[[1<=p7 & p8<=p10] | ~ [1<=p6]] & ~ [p10<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [[p2<=p4 | p8<=1]] | [~ [p2<=p4] & ~ [p2<=p7]]]] & ~ [p2<=0]] | [~ [[[[p3<=0 & 1<=p2] & [1<=p4 | p3<=p10]] & [[p5<=p5 | p2<=p7] & [1<=p10 | p10<=0]]]] | [[~ [[p6<=1 & p5<=p3]] | [~ [[1<=p3 & p2<=p3]] & 1<=p5]] | [[~ [p8<=p8] | 1<=p5] & [[1<=p6 | p3<=p3] | 1<=p3]]]]] & [[~ [[[1<=p4 | p7<=p5] & ~ [p2<=p5]]] | 1<=p8] | [[[~ [[~ [p2<=0] | [p3<=0 & p3<=p5]]] & ~ [[p10<=0 | p10<=1]]] | 1<=p5] & p6<=p10]]] & [~ [[[[[~ [p10<=0] & [~ [1<=p6] | [1<=p7 & p8<=p10]]] & ~ [[[p10<=1 | p4<=1] & [p6<=1 & p8<=1]]]] & [p10<=1 | 1<=p6]] & p8<=1]] | ~ [[~ [[[~ [[p6<=0 & p10<=p7]] | [[p7<=1 | p9<=p10] | p8<=p9]] & ~ [p3<=p3]]] | 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 16
abstracting: (p3<=p3)
states: 32
abstracting: (p8<=p9)
states: 24
abstracting: (p9<=p10)
states: 24
abstracting: (p7<=1)
states: 32
abstracting: (p10<=p7)
states: 32
abstracting: (p6<=0)
states: 16
abstracting: (p8<=1)
states: 32
abstracting: (1<=p6)
states: 16
abstracting: (p10<=1)
states: 32
abstracting: (p8<=1)
states: 32
abstracting: (p6<=1)
states: 32
abstracting: (p4<=1)
states: 32
abstracting: (p10<=1)
states: 32
abstracting: (p8<=p10)
states: 24
abstracting: (1<=p7)
states: 32
abstracting: (1<=p6)
states: 16
abstracting: (p10<=0)
states: 16
abstracting: (p6<=p10)
states: 24
abstracting: (1<=p5)
states: 32
abstracting: (p10<=1)
states: 32
abstracting: (p10<=0)
states: 16
abstracting: (p3<=p5)
states: 32
abstracting: (p3<=0)
states: 0
abstracting: (p2<=0)
states: 0
abstracting: (1<=p8)
states: 16
abstracting: (p2<=p5)
states: 32
abstracting: (p7<=p5)
states: 32
abstracting: (1<=p4)
states: 16
abstracting: (1<=p3)
states: 32
abstracting: (p3<=p3)
states: 32
abstracting: (1<=p6)
states: 16
abstracting: (1<=p5)
states: 32
abstracting: (p8<=p8)
states: 32
abstracting: (1<=p5)
states: 32
abstracting: (p2<=p3)
states: 32
abstracting: (1<=p3)
states: 32
abstracting: (p5<=p3)
states: 32
abstracting: (p6<=1)
states: 32
abstracting: (p10<=0)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p2<=p7)
states: 32
abstracting: (p5<=p5)
states: 32
abstracting: (p3<=p10)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p3<=0)
states: 0
abstracting: (p2<=0)
states: 0
abstracting: (p2<=p7)
states: 32
abstracting: (p2<=p4)
states: 16
abstracting: (p8<=1)
states: 32
abstracting: (p2<=p4)
states: 16
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 385 (3.8e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 153 342 495
used/not used/entry size/cache size: 515 67108349 16 1024MB
basic ops cache: hits/miss/sum: 343 744 1087
used/not used/entry size/cache size: 1365 16775851 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: 200 58 258
used/not used/entry size/cache size: 58 8388550 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 67108528
1 294
2 35
3 7
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.583sec


BK_STOP 1679420023240

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p7

The net has transition(s) that can never fire:


check for constant places
p2
p3
p7
p5
found 4 constant places
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:28 (3), effective:5 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

iterations count:21 (2), effective:2 (0)

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

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

iterations count:8 (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="Eratosthenes-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 Eratosthenes-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 r161-tall-167838844700142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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