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-167838844700137.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844700137
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679419943420

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=Eratosthenes-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: 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.789sec


RS generation: 0m 0.000sec


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



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

checking: EG [1<=p5]
normalized: EG [1<=p5]

abstracting: (1<=p5)
states: 32

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [EG [AF [~ [EX [p9<=0]]]]]
normalized: ~ [EX [~ [EG [~ [EG [EX [p9<=0]]]]]]]

abstracting: (p9<=0)
states: 16
.......
EG iterations: 6

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EG [AX [AF [EG [[p4<=0 & 1<=p3]]]]]
normalized: EG [~ [EX [EG [~ [EG [[p4<=0 & 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 32
abstracting: (p4<=0)
states: 16
.
EG iterations: 1
......
EG iterations: 6
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (p7<=p4)
states: 16
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [~ [A [1<=p8 U AX [[AG [p6<=1] & EF [p10<=0]]]]]]
normalized: ~ [EG [[~ [EG [EX [~ [[E [true U p10<=0] & ~ [E [true U ~ [p6<=1]]]]]]]] & ~ [E [EX [~ [[E [true U p10<=0] & ~ [E [true U ~ [p6<=1]]]]]] U [EX [~ [[E [true U p10<=0] & ~ [E [true U ~ [p6<=1]]]]]] & ~ [1<=p8]]]]]]]

abstracting: (1<=p8)
states: 16
abstracting: (p6<=1)
states: 32
abstracting: (p10<=0)
states: 16
.abstracting: (p6<=1)
states: 32
abstracting: (p10<=0)
states: 16
.abstracting: (p6<=1)
states: 32
abstracting: (p10<=0)
states: 16
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AF [AG [~ [A [~ [1<=p3] U [p4<=1 & [1<=p8 | 1<=p9]]]]]]
normalized: ~ [EG [E [true U [~ [EG [~ [[[1<=p8 | 1<=p9] & p4<=1]]]] & ~ [E [~ [[[1<=p8 | 1<=p9] & p4<=1]] U [~ [[[1<=p8 | 1<=p9] & p4<=1]] & 1<=p3]]]]]]]

abstracting: (1<=p3)
states: 32
abstracting: (p4<=1)
states: 32
abstracting: (1<=p9)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p4<=1)
states: 32
abstracting: (1<=p9)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (p4<=1)
states: 32
abstracting: (1<=p9)
states: 16
abstracting: (1<=p8)
states: 16
.
EG iterations: 1
......
EG iterations: 6
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: ~ [[[EX [[p3<=1 & p6<=1]] | EG [AG [p5<=0]]] | EG [A [p5<=0 U p7<=0]]]]
normalized: ~ [[EG [[~ [EG [~ [p7<=0]]] & ~ [E [~ [p7<=0] U [~ [p5<=0] & ~ [p7<=0]]]]]] | [EG [~ [E [true U ~ [p5<=0]]]] | EX [[p3<=1 & p6<=1]]]]]

abstracting: (p6<=1)
states: 32
abstracting: (p3<=1)
states: 32
.abstracting: (p5<=0)
states: 0
.
EG iterations: 1
abstracting: (p7<=0)
states: 0
abstracting: (p5<=0)
states: 0
abstracting: (p7<=0)
states: 0
abstracting: (p7<=0)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [A [1<=p7 U [EG [[[1<=p10 & 1<=p10] | p8<=p7]] & ~ [1<=p3]]]]
normalized: ~ [[~ [EG [~ [[~ [1<=p3] & EG [[[1<=p10 & 1<=p10] | p8<=p7]]]]]] & ~ [E [~ [[~ [1<=p3] & EG [[[1<=p10 & 1<=p10] | p8<=p7]]]] U [~ [1<=p7] & ~ [[~ [1<=p3] & EG [[[1<=p10 & 1<=p10] | p8<=p7]]]]]]]]]

abstracting: (p8<=p7)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (1<=p10)
states: 16

EG iterations: 0
abstracting: (1<=p3)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p8<=p7)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (1<=p10)
states: 16

EG iterations: 0
abstracting: (1<=p3)
states: 32
abstracting: (p8<=p7)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (1<=p10)
states: 16

EG iterations: 0
abstracting: (1<=p3)
states: 32

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (p7<=1)
states: 32
abstracting: (p10<=p4)
states: 24
abstracting: (1<=p7)
states: 32
abstracting: (p2<=0)
states: 0
abstracting: (p4<=1)
states: 32
abstracting: (1<=p7)
states: 32
abstracting: (p9<=1)
states: 32

EG iterations: 0
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [[[E [~ [[1<=p6 & 1<=p4]] U p8<=p6] & AX [EF [p9<=p5]]] & p2<=p4]]]
normalized: ~ [E [true U [[~ [EX [~ [E [true U p9<=p5]]]] & E [~ [[1<=p6 & 1<=p4]] U p8<=p6]] & p2<=p4]]]

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

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

MC time: 0m 0.001sec

checking: AX [[[EF [EX [[1<=p2 | 1<=p6]]] & [~ [1<=p3] | ~ [EF [[1<=p2 & 1<=p9]]]]] | [p4<=p4 | AX [EX [[1<=p4 | p2<=1]]]]]]
normalized: ~ [EX [~ [[[~ [EX [~ [EX [[1<=p4 | p2<=1]]]]] | p4<=p4] | [[~ [E [true U [1<=p2 & 1<=p9]]] | ~ [1<=p3]] & E [true U EX [[1<=p2 | 1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 16
abstracting: (1<=p2)
states: 32
.abstracting: (1<=p3)
states: 32
abstracting: (1<=p9)
states: 16
abstracting: (1<=p2)
states: 32
abstracting: (p4<=p4)
states: 32
abstracting: (p2<=1)
states: 32
abstracting: (1<=p4)
states: 16
...-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [AG [EF [EF [EF [1<=p9]]]] & AF [A [[~ [[[p6<=1 | 1<=p8] | p3<=p7]] & E [1<=p8 U EG [p10<=p3]]] U AX [~ [1<=p4]]]]]
normalized: [~ [EG [~ [[~ [EG [EX [1<=p4]]] & ~ [E [EX [1<=p4] U [~ [[E [1<=p8 U EG [p10<=p3]] & ~ [[[p6<=1 | 1<=p8] | p3<=p7]]]] & EX [1<=p4]]]]]]]] & ~ [E [true U ~ [E [true U E [true U E [true U 1<=p9]]]]]]]

abstracting: (1<=p9)
states: 16
abstracting: (1<=p4)
states: 16
.abstracting: (p3<=p7)
states: 32
abstracting: (1<=p8)
states: 16
abstracting: (p6<=1)
states: 32
abstracting: (p10<=p3)
states: 32

EG iterations: 0
abstracting: (1<=p8)
states: 16
abstracting: (1<=p4)
states: 16
.abstracting: (1<=p4)
states: 16
......
EG iterations: 5
.....
EG iterations: 5
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

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

MC time: 0m 0.002sec

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

abstracting: (p7<=0)
states: 0
.
EG iterations: 1
abstracting: (p6<=p8)
states: 24
abstracting: (1<=p8)
states: 16
abstracting: (1<=p7)
states: 32
abstracting: (p8<=p5)
states: 32
abstracting: (1<=p7)
states: 32

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

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

MC time: 0m 0.000sec

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

abstracting: (p2<=1)
states: 32
.abstracting: (p6<=1)
states: 32
abstracting: (p10<=p5)
states: 32
abstracting: (p10<=1)
states: 32
.abstracting: (p4<=0)
states: 16
abstracting: (p10<=1)
states: 32
abstracting: (p9<=p5)
states: 32
abstracting: (p8<=0)
states: 16
abstracting: (p10<=0)
states: 16
abstracting: (p7<=1)
states: 32

EG iterations: 0
abstracting: (p5<=p10)
states: 16
.abstracting: (1<=p2)
states: 32
abstracting: (p3<=p7)
states: 32
abstracting: (p6<=p7)
states: 32

EG iterations: 0
.-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p3<=0)
states: 0
abstracting: (p9<=p4)
states: 24
abstracting: (p2<=p2)
states: 32
abstracting: (p8<=p7)
states: 32

EG iterations: 0
abstracting: (p8<=1)
states: 32
abstracting: (1<=p4)
states: 16
abstracting: (p2<=0)
states: 0
abstracting: (p4<=1)
states: 32
abstracting: (p8<=p10)
states: 24
abstracting: (p10<=1)
states: 32
abstracting: (1<=p8)
states: 16
abstracting: (p2<=1)
states: 32
abstracting: (p10<=1)
states: 32
abstracting: (p5<=1)
states: 32
.abstracting: (1<=p4)
states: 16
.-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 550 (5.5e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 909 840 1749
used/not used/entry size/cache size: 1290 67107574 16 1024MB
basic ops cache: hits/miss/sum: 674 749 1423
used/not used/entry size/cache size: 1322 16775894 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: 171 47 218
used/not used/entry size/cache size: 47 8388561 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 67108377
1 432
2 47
3 8
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.440sec


BK_STOP 1679419947931

--------------------
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.001sec


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

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:12 (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: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:8 (1), effective:0 (0)

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

iterations count:10 (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:28 (3), effective:5 (0)

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

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

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

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

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

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

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

iterations count:10 (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="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 Eratosthenes-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 r161-tall-167838844700137"
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 [ "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 ;