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.r481-tall-167912691900401.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 Szymanski-PT-a02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691900401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a02-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679843448703

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=Szymanski-PT-a02
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: Szymanski_PT_a02
(NrP: 61 NrTr: 224 NrArc: 900)

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

net check time: 0m 0.000sec

init dd package: 0m 2.933sec


RS generation: 0m 0.179sec


-> reachability set: #nodes 664 (6.6e+02) #states 62,187 (4)



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

checking: AX [~ [E [AG [p12<=2] U ~ [AX [[p16<=l13 | 1<=s6]]]]]]
normalized: ~ [EX [E [~ [E [true U ~ [p12<=2]]] U EX [~ [[p16<=l13 | 1<=s6]]]]]]

abstracting: (1<=s6)
states: 310
abstracting: (p16<=l13)
states: 56,885 (4)
.abstracting: (p12<=2)
states: 62,187 (4)
.-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.285sec

checking: EF [[l28<=2 | ~ [A [1<=l19 U ~ [AF [s5<=l6]]]]]]
normalized: E [true U [~ [[~ [EG [~ [EG [~ [s5<=l6]]]]] & ~ [E [~ [EG [~ [s5<=l6]]] U [~ [1<=l19] & ~ [EG [~ [s5<=l6]]]]]]]] | l28<=2]]

abstracting: (l28<=2)
states: 62,187 (4)
abstracting: (s5<=l6)
states: 61,914 (4)
..
EG iterations: 2
abstracting: (1<=l19)
states: 6,524 (3)
abstracting: (s5<=l6)
states: 61,914 (4)
..
EG iterations: 2
abstracting: (s5<=l6)
states: 61,914 (4)
..
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[[[EF [AX [l12<=0]] | s2<=0] | EX [AF [~ [l13<=l35]]]] & ~ [EG [AF [~ [2<=s2]]]]]]
normalized: E [true U [~ [EG [~ [EG [2<=s2]]]] & [EX [~ [EG [l13<=l35]]] | [E [true U ~ [EX [~ [l12<=0]]]] | s2<=0]]]]

abstracting: (s2<=0)
states: 34,791 (4)
abstracting: (l12<=0)
states: 55,663 (4)
.abstracting: (l13<=l35)
states: 56,289 (4)
.
EG iterations: 1
.abstracting: (2<=s2)
states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

checking: AG [~ [[[[AF [l19<=l12] | 1<=l2] & 1<=l27] & AF [1<=s8]]]]
normalized: ~ [E [true U [~ [EG [~ [1<=s8]]] & [[~ [EG [~ [l19<=l12]]] | 1<=l2] & 1<=l27]]]]

abstracting: (1<=l27)
states: 6,209 (3)
abstracting: (1<=l2)
states: 1,279 (3)
abstracting: (l19<=l12)
states: 56,022 (4)
.
EG iterations: 1
abstracting: (1<=s8)
states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: [EX [2<=l17] | ~ [[[E [2<=s2 U 2<=l21] | AF [2<=l41]] & AF [EX [E [1<=s1 U s6<=l39]]]]]]
normalized: [~ [[~ [EG [~ [EX [E [1<=s1 U s6<=l39]]]]] & [~ [EG [~ [2<=l41]]] | E [2<=s2 U 2<=l21]]]] | EX [2<=l17]]

abstracting: (2<=l17)
states: 359
.abstracting: (2<=l21)
states: 0
abstracting: (2<=s2)
states: 0
abstracting: (2<=l41)
states: 0

EG iterations: 0
abstracting: (s6<=l39)
states: 61,894 (4)
abstracting: (1<=s1)
states: 27,187 (4)
...
EG iterations: 2
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [EF [[~ [[[AG [2<=l0] & [s5<=l5 & l37<=s2]] | l43<=1]] | ~ [l16<=s7]]]]
normalized: ~ [E [true U ~ [E [true U [~ [l16<=s7] | ~ [[[[s5<=l5 & l37<=s2] & ~ [E [true U ~ [2<=l0]]]] | l43<=1]]]]]]]

abstracting: (l43<=1)
states: 62,187 (4)
abstracting: (2<=l0)
states: 1
abstracting: (l37<=s2)
states: 58,647 (4)
abstracting: (s5<=l5)
states: 61,914 (4)
abstracting: (l16<=s7)
states: 55,663 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

checking: AG [[~ [[EG [AF [l10<=l15]] | E [E [2<=l40 U s0<=l37] U EG [s9<=0]]]] | EX [[l24<=2 & p10<=2]]]]
normalized: ~ [E [true U ~ [[EX [[l24<=2 & p10<=2]] | ~ [[E [E [2<=l40 U s0<=l37] U EG [s9<=0]] | EG [~ [EG [~ [l10<=l15]]]]]]]]]]

abstracting: (l10<=l15)
states: 56,022 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (s9<=0)
states: 62,187 (4)

EG iterations: 0
abstracting: (s0<=l37)
states: 61,601 (4)
abstracting: (2<=l40)
states: 323
abstracting: (p10<=2)
states: 62,187 (4)
abstracting: (l24<=2)
states: 62,187 (4)
.-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.316sec

checking: E [l20<=2 U [~ [EF [~ [EX [l27<=2]]]] | [s0<=1 & ~ [[[AG [1<=l14] & ~ [1<=l6]] | AX [[l30<=s2 & 1<=l37]]]]]]]
normalized: E [l20<=2 U [[~ [[~ [EX [~ [[l30<=s2 & 1<=l37]]]] | [~ [1<=l6] & ~ [E [true U ~ [1<=l14]]]]]] & s0<=1] | ~ [E [true U ~ [EX [l27<=2]]]]]]

abstracting: (l27<=2)
states: 62,187 (4)
.abstracting: (s0<=1)
states: 62,187 (4)
abstracting: (1<=l14)
states: 6,524 (3)
abstracting: (1<=l6)
states: 6,524 (3)
abstracting: (1<=l37)
states: 6,209 (3)
abstracting: (l30<=s2)
states: 58,647 (4)
.abstracting: (l20<=2)
states: 62,187 (4)
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: [~ [AG [EG [[A [2<=l3 U l21<=s6] | p14<=1]]]] | ~ [A [~ [[~ [[2<=l5 | l27<=0]] | [~ [l19<=0] | AX [2<=l16]]]] U l3<=2]]]
normalized: [~ [[~ [EG [~ [l3<=2]]] & ~ [E [~ [l3<=2] U [[[~ [EX [~ [2<=l16]]] | ~ [l19<=0]] | ~ [[2<=l5 | l27<=0]]] & ~ [l3<=2]]]]]] | E [true U ~ [EG [[[~ [EG [~ [l21<=s6]]] & ~ [E [~ [l21<=s6] U [~ [2<=l3] & ~ [l21<=s6]]]]] | p14<=1]]]]]

abstracting: (p14<=1)
states: 62,187 (4)
abstracting: (l21<=s6)
states: 62,187 (4)
abstracting: (2<=l3)
states: 2
abstracting: (l21<=s6)
states: 62,187 (4)
abstracting: (l21<=s6)
states: 62,187 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (l3<=2)
states: 62,187 (4)
abstracting: (l27<=0)
states: 55,978 (4)
abstracting: (2<=l5)
states: 359
abstracting: (l19<=0)
states: 55,663 (4)
abstracting: (2<=l16)
states: 359
.abstracting: (l3<=2)
states: 62,187 (4)
abstracting: (l3<=2)
states: 62,187 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: [EF [EG [[~ [EF [l22<=2]] | [EF [l25<=0] & ~ [[l41<=l36 | l6<=l29]]]]]] | EX [[AG [l7<=2] & AF [[[E [l35<=2 U l4<=s0] & AX [l25<=2]] | [1<=l35 & EX [2<=s3]]]]]]]
normalized: [EX [[~ [EG [~ [[[EX [2<=s3] & 1<=l35] | [~ [EX [~ [l25<=2]]] & E [l35<=2 U l4<=s0]]]]]] & ~ [E [true U ~ [l7<=2]]]]] | E [true U EG [[[~ [[l41<=l36 | l6<=l29]] & E [true U l25<=0]] | ~ [E [true U l22<=2]]]]]]

abstracting: (l22<=2)
states: 62,187 (4)
abstracting: (l25<=0)
states: 55,978 (4)
abstracting: (l6<=l29)
states: 56,289 (4)
abstracting: (l41<=l36)
states: 62,187 (4)
.
EG iterations: 1
abstracting: (l7<=2)
states: 62,187 (4)
abstracting: (l4<=s0)
states: 55,131 (4)
abstracting: (l35<=2)
states: 62,187 (4)
abstracting: (l25<=2)
states: 62,187 (4)
.abstracting: (1<=l35)
states: 6,209 (3)
abstracting: (2<=s3)
states: 0
..
EG iterations: 1
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

checking: A [AX [[EX [~ [l27<=1]] & [EF [[l16<=p12 & 2<=l33]] & l1<=0]]] U E [~ [A [[1<=l42 & [1<=p12 | 1<=s2]] U AF [1<=s4]]] U [p12<=1 & ~ [[A [l9<=s6 U l17<=1] | [[2<=p13 | l1<=1] | l41<=0]]]]]]
normalized: [~ [EG [~ [E [~ [[~ [EG [EG [~ [1<=s4]]]] & ~ [E [EG [~ [1<=s4]] U [~ [[[1<=p12 | 1<=s2] & 1<=l42]] & EG [~ [1<=s4]]]]]]] U [~ [[[[2<=p13 | l1<=1] | l41<=0] | [~ [EG [~ [l17<=1]]] & ~ [E [~ [l17<=1] U [~ [l9<=s6] & ~ [l17<=1]]]]]]] & p12<=1]]]]] & ~ [E [~ [E [~ [[~ [EG [EG [~ [1<=s4]]]] & ~ [E [EG [~ [1<=s4]] U [~ [[[1<=p12 | 1<=s2] & 1<=l42]] & EG [~ [1<=s4]]]]]]] U [~ [[[[2<=p13 | l1<=1] | l41<=0] | [~ [EG [~ [l17<=1]]] & ~ [E [~ [l17<=1] U [~ [l9<=s6] & ~ [l17<=1]]]]]]] & p12<=1]]] U [EX [~ [[[E [true U [l16<=p12 & 2<=l33]] & l1<=0] & EX [~ [l27<=1]]]]] & ~ [E [~ [[~ [EG [EG [~ [1<=s4]]]] & ~ [E [EG [~ [1<=s4]] U [~ [[[1<=p12 | 1<=s2] & 1<=l42]] & EG [~ [1<=s4]]]]]]] U [~ [[[[2<=p13 | l1<=1] | l41<=0] | [~ [EG [~ [l17<=1]]] & ~ [E [~ [l17<=1] U [~ [l9<=s6] & ~ [l17<=1]]]]]]] & p12<=1]]]]]]]

abstracting: (p12<=1)
states: 62,187 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l9<=s6)
states: 55,681 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l17<=1)
states: 61,828 (4)
.
EG iterations: 1
abstracting: (l41<=0)
states: 62,187 (4)
abstracting: (l1<=1)
states: 62,185 (4)
abstracting: (2<=p13)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=l42)
states: 0
abstracting: (1<=s2)
states: 27,396 (4)
abstracting: (1<=p12)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
.
EG iterations: 1
abstracting: (l27<=1)
states: 61,864 (4)
.abstracting: (l1<=0)
states: 60,950 (4)
abstracting: (2<=l33)
states: 323
abstracting: (l16<=p12)
states: 55,663 (4)
.abstracting: (p12<=1)
states: 62,187 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l9<=s6)
states: 55,681 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l17<=1)
states: 61,828 (4)
.
EG iterations: 1
abstracting: (l41<=0)
states: 62,187 (4)
abstracting: (l1<=1)
states: 62,185 (4)
abstracting: (2<=p13)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=l42)
states: 0
abstracting: (1<=s2)
states: 27,396 (4)
abstracting: (1<=p12)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=1)
states: 62,187 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l9<=s6)
states: 55,681 (4)
abstracting: (l17<=1)
states: 61,828 (4)
abstracting: (l17<=1)
states: 61,828 (4)
.
EG iterations: 1
abstracting: (l41<=0)
states: 62,187 (4)
abstracting: (l1<=1)
states: 62,185 (4)
abstracting: (2<=p13)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=l42)
states: 0
abstracting: (1<=s2)
states: 27,396 (4)
abstracting: (1<=p12)
states: 0
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
abstracting: (1<=s4)
states: 2
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.125sec

checking: E [A [[~ [[[~ [1<=p16] & ~ [l35<=2]] | s6<=s6]] | AG [~ [E [l23<=0 U l2<=l40]]]] U [[EG [AG [l12<=p12]] & E [~ [l18<=l16] U [l7<=s8 | 1<=p10]]] & AG [EX [1<=l27]]]] U 1<=l7]
normalized: E [[~ [EG [~ [[~ [E [true U ~ [EX [1<=l27]]]] & [E [~ [l18<=l16] U [l7<=s8 | 1<=p10]] & EG [~ [E [true U ~ [l12<=p12]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [EX [1<=l27]]]] & [E [~ [l18<=l16] U [l7<=s8 | 1<=p10]] & EG [~ [E [true U ~ [l12<=p12]]]]]]] U [~ [[~ [E [true U E [l23<=0 U l2<=l40]]] | ~ [[[~ [l35<=2] & ~ [1<=p16]] | s6<=s6]]]] & ~ [[~ [E [true U ~ [EX [1<=l27]]]] & [E [~ [l18<=l16] U [l7<=s8 | 1<=p10]] & EG [~ [E [true U ~ [l12<=p12]]]]]]]]]]] U 1<=l7]

abstracting: (1<=l7)
states: 6,524 (3)
abstracting: (l12<=p12)
states: 55,663 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 0
abstracting: (l7<=s8)
states: 55,663 (4)
abstracting: (l18<=l16)
states: 56,022 (4)
abstracting: (1<=l27)
states: 6,209 (3)
.abstracting: (s6<=s6)
states: 62,187 (4)
abstracting: (1<=p16)
states: 5,782 (3)
abstracting: (l35<=2)
states: 62,187 (4)
abstracting: (l2<=l40)
states: 60,977 (4)
abstracting: (l23<=0)
states: 56,235 (4)
abstracting: (l12<=p12)
states: 55,663 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 0
abstracting: (l7<=s8)
states: 55,663 (4)
abstracting: (l18<=l16)
states: 56,022 (4)
abstracting: (1<=l27)
states: 6,209 (3)
.abstracting: (l12<=p12)
states: 55,663 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 0
abstracting: (l7<=s8)
states: 55,663 (4)
abstracting: (l18<=l16)
states: 56,022 (4)
abstracting: (1<=l27)
states: 6,209 (3)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

checking: EF [[~ [[[[[[l13<=2 & l34<=l38] & l9<=0] & [[l31<=l1 | l30<=p15] | [s9<=1 & p13<=l25]]] | [EF [s8<=2] & l16<=1]] | [~ [EX [p12<=p16]] & EX [EF [l18<=1]]]]] | 2<=l10]]
normalized: E [true U [~ [[[EX [E [true U l18<=1]] & ~ [EX [p12<=p16]]] | [[E [true U s8<=2] & l16<=1] | [[[s9<=1 & p13<=l25] | [l31<=l1 | l30<=p15]] & [[l13<=2 & l34<=l38] & l9<=0]]]]] | 2<=l10]]

abstracting: (2<=l10)
states: 359
abstracting: (l9<=0)
states: 55,663 (4)
abstracting: (l34<=l38)
states: 56,301 (4)
abstracting: (l13<=2)
states: 62,187 (4)
abstracting: (l30<=p15)
states: 55,978 (4)
abstracting: (l31<=l1)
states: 56,047 (4)
abstracting: (p13<=l25)
states: 62,187 (4)
abstracting: (s9<=1)
states: 62,187 (4)
abstracting: (l16<=1)
states: 61,828 (4)
abstracting: (s8<=2)
states: 62,187 (4)
abstracting: (p12<=p16)
states: 62,187 (4)
.abstracting: (l18<=1)
states: 61,828 (4)
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.159sec

checking: ~ [E [[[[[[EF [1<=l38] & EF [p12<=1]] & [AG [l22<=0] | 1<=s7]] | A [2<=l14 U ~ [l12<=2]]] | l7<=1] & [[AF [AG [l32<=l0]] & E [[s2<=s6 & l41<=0] U [s2<=2 & 2<=p11]]] | s0<=1]] U ~ [[l22<=l31 | ~ [AG [~ [l41<=l6]]]]]]]
normalized: ~ [E [[[[E [[s2<=s6 & l41<=0] U [s2<=2 & 2<=p11]] & ~ [EG [E [true U ~ [l32<=l0]]]]] | s0<=1] & [[[~ [EG [l12<=2]] & ~ [E [l12<=2 U [~ [2<=l14] & l12<=2]]]] | [[~ [E [true U ~ [l22<=0]]] | 1<=s7] & [E [true U p12<=1] & E [true U 1<=l38]]]] | l7<=1]] U ~ [[E [true U l41<=l6] | l22<=l31]]]]

abstracting: (l22<=l31)
states: 62,187 (4)
abstracting: (l41<=l6)
states: 62,187 (4)
abstracting: (l7<=1)
states: 61,828 (4)
abstracting: (1<=l38)
states: 6,209 (3)
abstracting: (p12<=1)
states: 62,187 (4)
abstracting: (1<=s7)
states: 1
abstracting: (l22<=0)
states: 62,187 (4)
abstracting: (l12<=2)
states: 62,187 (4)
abstracting: (2<=l14)
states: 359
abstracting: (l12<=2)
states: 62,187 (4)
abstracting: (l12<=2)
states: 62,187 (4)

EG iterations: 0
abstracting: (s0<=1)
states: 62,187 (4)
abstracting: (l32<=l0)
states: 56,013 (4)
.
EG iterations: 1
abstracting: (2<=p11)
states: 0
abstracting: (s2<=2)
states: 62,187 (4)
abstracting: (l41<=0)
states: 62,187 (4)
abstracting: (s2<=s6)
states: 34,791 (4)
-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: AX [[[EX [~ [s5<=1]] | [E [EF [p15<=l30] U [l30<=l3 | [2<=l36 | l42<=l42]]] & [[~ [E [1<=l30 U s1<=0]] | AF [2<=l5]] | [AG [s0<=2] | AX [2<=l16]]]]] | [2<=l40 | EF [[A [l12<=1 U l42<=l9] & AG [l4<=l1]]]]]]
normalized: ~ [EX [~ [[[E [true U [~ [E [true U ~ [l4<=l1]]] & [~ [EG [~ [l42<=l9]]] & ~ [E [~ [l42<=l9] U [~ [l12<=1] & ~ [l42<=l9]]]]]]] | 2<=l40] | [[[[~ [EX [~ [2<=l16]]] | ~ [E [true U ~ [s0<=2]]]] | [~ [EG [~ [2<=l5]]] | ~ [E [1<=l30 U s1<=0]]]] & E [E [true U p15<=l30] U [[2<=l36 | l42<=l42] | l30<=l3]]] | EX [~ [s5<=1]]]]]]]

abstracting: (s5<=1)
states: 62,187 (4)
.abstracting: (l30<=l3)
states: 56,047 (4)
abstracting: (l42<=l42)
states: 62,187 (4)
abstracting: (2<=l36)
states: 323
abstracting: (p15<=l30)
states: 62,187 (4)
abstracting: (s1<=0)
states: 35,000 (4)
abstracting: (1<=l30)
states: 6,209 (3)
abstracting: (2<=l5)
states: 359
.
EG iterations: 1
abstracting: (s0<=2)
states: 62,187 (4)
abstracting: (2<=l16)
states: 359
.abstracting: (2<=l40)
states: 323
abstracting: (l42<=l9)
states: 62,187 (4)
abstracting: (l12<=1)
states: 61,828 (4)
abstracting: (l42<=l9)
states: 62,187 (4)
abstracting: (l42<=l9)
states: 62,187 (4)
.
EG iterations: 1
abstracting: (l4<=l1)
states: 55,168 (4)
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: E [[[1<=p12 & AX [~ [[l29<=2 | EG [l19<=l38]]]]] & EX [[AF [~ [p13<=2]] & EF [[1<=l4 & l36<=s0]]]]] U A [[AF [~ [[l28<=2 & l26<=s9]]] & [[~ [l35<=l11] & l6<=0] & ~ [[AX [2<=p10] & [l5<=1 & s0<=l20]]]]] U EF [A [EF [2<=s6] U AX [2<=l23]]]]]
normalized: E [[EX [[E [true U [1<=l4 & l36<=s0]] & ~ [EG [p13<=2]]]] & [1<=p12 & ~ [EX [[l29<=2 | EG [l19<=l38]]]]]] U [~ [EG [~ [E [true U [~ [EG [EX [~ [2<=l23]]]] & ~ [E [EX [~ [2<=l23]] U [~ [E [true U 2<=s6]] & EX [~ [2<=l23]]]]]]]]]] & ~ [E [~ [E [true U [~ [EG [EX [~ [2<=l23]]]] & ~ [E [EX [~ [2<=l23]] U [~ [E [true U 2<=s6]] & EX [~ [2<=l23]]]]]]]] U [~ [[[~ [[[l5<=1 & s0<=l20] & ~ [EX [~ [2<=p10]]]]] & [~ [l35<=l11] & l6<=0]] & ~ [EG [[l28<=2 & l26<=s9]]]]] & ~ [E [true U [~ [EG [EX [~ [2<=l23]]]] & ~ [E [EX [~ [2<=l23]] U [~ [E [true U 2<=s6]] & EX [~ [2<=l23]]]]]]]]]]]]]

abstracting: (2<=l23)
states: 153
.abstracting: (2<=s6)
states: 0
abstracting: (2<=l23)
states: 153
.abstracting: (2<=l23)
states: 153
..
EG iterations: 1
abstracting: (l26<=s9)
states: 55,978 (4)
abstracting: (l28<=2)
states: 62,187 (4)
.
EG iterations: 1
abstracting: (l6<=0)
states: 55,663 (4)
abstracting: (l35<=l11)
states: 56,606 (4)
abstracting: (2<=p10)
states: 0
.abstracting: (s0<=l20)
states: 61,603 (4)
abstracting: (l5<=1)
states: 61,828 (4)
abstracting: (2<=l23)
states: 153
.abstracting: (2<=s6)
states: 0
abstracting: (2<=l23)
states: 153
.abstracting: (2<=l23)
states: 153
..
EG iterations: 1
abstracting: (2<=l23)
states: 153
.abstracting: (2<=s6)
states: 0
abstracting: (2<=l23)
states: 153
.abstracting: (2<=l23)
states: 153
..
EG iterations: 1
.
EG iterations: 1
abstracting: (l19<=l38)
states: 56,289 (4)
.
EG iterations: 1
abstracting: (l29<=2)
states: 62,187 (4)
.abstracting: (1<=p12)
states: 0
abstracting: (p13<=2)
states: 62,187 (4)

EG iterations: 0
abstracting: (l36<=s0)
states: 56,012 (4)
abstracting: (1<=l4)
states: 7,092 (3)
.-> the formula is TRUE

FORMULA Szymanski-PT-a02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.255sec

totally nodes used: 393341 (3.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6316673 6846865 13163538
used/not used/entry size/cache size: 6723238 60385626 16 1024MB
basic ops cache: hits/miss/sum: 788559 384293 1172852
used/not used/entry size/cache size: 686812 16090404 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: 10566 11630 22196
used/not used/entry size/cache size: 11619 8376989 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 66725374
1 375623
2 7285
3 442
4 40
5 5
6 5
7 9
8 7
9 0
>= 10 74

Total processing time: 0m 7.188sec


BK_STOP 1679843455934

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
l41
l42
p14
p15
p11
p13
p12
s8
p10
s9
l21
l22

The net has transition(s) that can never fire:
t28
t53
t215
t136
t161
t190
t82
t107

check for constant places
s8
s9
p10
p11
p12
p13
p14
p15
found 8 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:38392 (171), effective:837 (3)

initing FirstDep: 0m 0.000sec


iterations count:22171 (98), effective:204 (0)

iterations count:1364 (6), effective:13 (0)

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

iterations count:3520 (15), effective:36 (0)

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

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

iterations count:5422 (24), effective:88 (0)

iterations count:20826 (92), effective:244 (1)

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

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

iterations count:52113 (232), effective:535 (2)

iterations count:52113 (232), effective:535 (2)

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

iterations count:2859 (12), effective:20 (0)

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

iterations count:4212 (18), effective:32 (0)

iterations count:1440 (6), effective:14 (0)

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

iterations count:31585 (141), effective:302 (1)

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

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

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

iterations count:4773 (21), effective:76 (0)

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

iterations count:4978 (22), effective:45 (0)

iterations count:989 (4), effective:11 (0)

iterations count:755 (3), effective:8 (0)

iterations count:4773 (21), effective:76 (0)

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

iterations count:4978 (22), effective:45 (0)

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

iterations count:4773 (21), effective:76 (0)

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

iterations count:4978 (22), effective:45 (0)

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

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

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

iterations count:7516 (33), effective:158 (0)

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

iterations count:24273 (108), effective:222 (0)

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

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

iterations count:15069 (67), effective:154 (0)

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

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

iterations count:3286 (14), effective:21 (0)

iterations count:3957 (17), effective:62 (0)

iterations count:20826 (92), effective:244 (1)

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

iterations count:52140 (232), effective:533 (2)

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

iterations count:52140 (232), effective:533 (2)

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

iterations count:52140 (232), effective:533 (2)

iterations count:5584 (24), effective:70 (0)

iterations count:224 (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="Szymanski-PT-a02"
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 Szymanski-PT-a02, 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 r481-tall-167912691900401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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