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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:58 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-a04-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679843452371

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-a04
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_a04
(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.860sec


RS generation: 0m 1.315sec


-> reachability set: #nodes 1981 (2.0e+03) #states 87,423,102 (7)



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

checking: EG [EF [4<=s6]]
normalized: EG [E [true U 4<=s6]]

abstracting: (4<=s6)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

checking: E [~ [AX [AX [~ [l17<=0]]]] U 1<=l36]
normalized: E [EX [EX [l17<=0]] U 1<=l36]

abstracting: (1<=l36)
states: 15,607,057 (7)
abstracting: (l17<=0)
states: 71,041,505 (7)
..-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.785sec

checking: E [~ [AG [l39<=2]] U ~ [AX [p13<=s4]]]
normalized: E [E [true U ~ [l39<=2]] U EX [~ [p13<=s4]]]

abstracting: (p13<=s4)
states: 87,423,102 (7)
.abstracting: (l39<=2)
states: 87,212,217 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.885sec

checking: AG [[AF [EF [EF [l10<=l11]]] | l5<=l34]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U E [true U l10<=l11]]]]] | l5<=l34]]]]

abstracting: (l5<=l34)
states: 73,613,111 (7)
abstracting: (l10<=l11)
states: 73,211,997 (7)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.147sec

checking: EF [EX [AG [[l30<=1 | [~ [s9<=l41] & AG [1<=l26]]]]]]
normalized: E [true U EX [~ [E [true U ~ [[[~ [s9<=l41] & ~ [E [true U ~ [1<=l26]]]] | l30<=1]]]]]]

abstracting: (l30<=1)
states: 85,246,915 (7)
abstracting: (1<=l26)
states: 15,607,057 (7)
abstracting: (s9<=l41)
states: 87,423,102 (7)
.-> the formula is TRUE

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

MC time: 0m 1.077sec

checking: ~ [E [EF [AX [AX [l25<=p14]]] U A [AF [l34<=l29] U ~ [AG [[1<=l1 | l25<=2]]]]]]
normalized: ~ [E [E [true U ~ [EX [EX [~ [l25<=p14]]]]] U [~ [EG [~ [E [true U ~ [[1<=l1 | l25<=2]]]]]] & ~ [E [~ [E [true U ~ [[1<=l1 | l25<=2]]]] U [EG [~ [l34<=l29]] & ~ [E [true U ~ [[1<=l1 | l25<=2]]]]]]]]]]

abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (1<=l1)
states: 5,318,769 (6)
abstracting: (l34<=l29)
states: 73,792,006 (7)
.
EG iterations: 1
abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (1<=l1)
states: 5,318,769 (6)
abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (1<=l1)
states: 5,318,769 (6)
.
EG iterations: 1
abstracting: (l25<=p14)
states: 71,816,045 (7)
..-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.083sec

checking: ~ [E [[1<=p12 | AG [AF [A [l42<=l12 U l39<=2]]]] U ~ [AG [EG [[3<=l0 & 3<=l34]]]]]]
normalized: ~ [E [[~ [E [true U EG [~ [[~ [EG [~ [l39<=2]]] & ~ [E [~ [l39<=2] U [~ [l42<=l12] & ~ [l39<=2]]]]]]]]] | 1<=p12] U E [true U ~ [EG [[3<=l0 & 3<=l34]]]]]]

abstracting: (3<=l34)
states: 210,885 (5)
abstracting: (3<=l0)
states: 638
.
EG iterations: 1
abstracting: (1<=p12)
states: 0
abstracting: (l39<=2)
states: 87,212,217 (7)
abstracting: (l42<=l12)
states: 87,423,102 (7)
abstracting: (l39<=2)
states: 87,212,217 (7)
abstracting: (l39<=2)
states: 87,212,217 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.112sec

checking: [~ [EX [[~ [[E [l22<=1 U l14<=l38] & AG [p13<=l11]]] & l26<=0]]] | AX [AX [EF [~ [EF [2<=s6]]]]]]
normalized: [~ [EX [EX [~ [E [true U ~ [E [true U 2<=s6]]]]]]] | ~ [EX [[~ [[~ [E [true U ~ [p13<=l11]]] & E [l22<=1 U l14<=l38]]] & l26<=0]]]]

abstracting: (l26<=0)
states: 71,816,045 (7)
abstracting: (l14<=l38)
states: 73,613,111 (7)
abstracting: (l22<=1)
states: 87,423,102 (7)
abstracting: (p13<=l11)
states: 87,423,102 (7)
.abstracting: (2<=s6)
states: 0
..-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

checking: [EF [[AF [AG [[l28<=3 & l41<=l30]]] | [AX [~ [l23<=3]] & ~ [l40<=l5]]]] | EG [l1<=s9]]
normalized: [EG [l1<=s9] | E [true U [[~ [l40<=l5] & ~ [EX [l23<=3]]] | ~ [EG [E [true U ~ [[l28<=3 & l41<=l30]]]]]]]]

abstracting: (l41<=l30)
states: 87,423,102 (7)
abstracting: (l28<=3)
states: 87,412,443 (7)
.
EG iterations: 1
abstracting: (l23<=3)
states: 87,418,257 (7)
.abstracting: (l40<=l5)
states: 74,409,631 (7)
abstracting: (l1<=s9)
states: 82,104,333 (7)
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 1.574sec

checking: EG [[EX [A [AG [s6<=l30] U [~ [4<=l0] & [l7<=l27 | 2<=l2]]]] & l16<=l15]]
normalized: EG [[EX [[~ [E [~ [[[l7<=l27 | 2<=l2] & ~ [4<=l0]]] U [~ [[[l7<=l27 | 2<=l2] & ~ [4<=l0]]] & E [true U ~ [s6<=l30]]]]] & ~ [EG [~ [[[l7<=l27 | 2<=l2] & ~ [4<=l0]]]]]]] & l16<=l15]]

abstracting: (l16<=l15)
states: 73,211,997 (7)
abstracting: (4<=l0)
states: 1
abstracting: (2<=l2)
states: 116,629 (5)
abstracting: (l7<=l27)
states: 73,613,111 (7)
..
EG iterations: 2
abstracting: (s6<=l30)
states: 86,387,595 (7)
abstracting: (4<=l0)
states: 1
abstracting: (2<=l2)
states: 116,629 (5)
abstracting: (l7<=l27)
states: 73,613,111 (7)
abstracting: (4<=l0)
states: 1
abstracting: (2<=l2)
states: 116,629 (5)
abstracting: (l7<=l27)
states: 73,613,111 (7)
...
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.579sec

checking: EF [[AX [[EG [[1<=l35 & l42<=2]] & [[[p14<=3 | s2<=2] & 1<=l0] & ~ [l30<=4]]]] & AX [AX [[~ [s6<=0] | ~ [l33<=s3]]]]]]
normalized: E [true U [~ [EX [EX [~ [[~ [l33<=s3] | ~ [s6<=0]]]]]] & ~ [EX [~ [[[~ [l30<=4] & [1<=l0 & [p14<=3 | s2<=2]]] & EG [[1<=l35 & l42<=2]]]]]]]]

abstracting: (l42<=2)
states: 87,423,102 (7)
abstracting: (1<=l35)
states: 15,607,057 (7)
.
EG iterations: 1
abstracting: (s2<=2)
states: 87,423,102 (7)
abstracting: (p14<=3)
states: 87,423,102 (7)
abstracting: (1<=l0)
states: 2,950,727 (6)
abstracting: (l30<=4)
states: 87,423,102 (7)
.abstracting: (s6<=0)
states: 86,210,710 (7)
abstracting: (l33<=s3)
states: 72,131,038 (7)
..-> the formula is TRUE

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

MC time: 0m 0.731sec

checking: [A [AF [~ [[A [s1<=1 U l42<=l39] | [l41<=0 & [p11<=0 | l24<=l34]]]]] U l21<=1] & A [l27<=3 U ~ [[E [s9<=2 U ~ [AX [l7<=3]]] & AG [[AG [l25<=2] | 3<=l2]]]]]]
normalized: [[~ [EG [[~ [E [true U ~ [[3<=l2 | ~ [E [true U ~ [l25<=2]]]]]]] & E [s9<=2 U EX [~ [l7<=3]]]]]] & ~ [E [[~ [E [true U ~ [[3<=l2 | ~ [E [true U ~ [l25<=2]]]]]]] & E [s9<=2 U EX [~ [l7<=3]]]] U [~ [l27<=3] & [~ [E [true U ~ [[3<=l2 | ~ [E [true U ~ [l25<=2]]]]]]] & E [s9<=2 U EX [~ [l7<=3]]]]]]]] & [~ [EG [~ [l21<=1]]] & ~ [E [~ [l21<=1] U [EG [[[l41<=0 & [p11<=0 | l24<=l34]] | [~ [EG [~ [l42<=l39]]] & ~ [E [~ [l42<=l39] U [~ [s1<=1] & ~ [l42<=l39]]]]]]] & ~ [l21<=1]]]]]]

abstracting: (l21<=1)
states: 87,423,102 (7)
abstracting: (l42<=l39)
states: 87,423,102 (7)
abstracting: (s1<=1)
states: 87,423,102 (7)
abstracting: (l42<=l39)
states: 87,423,102 (7)
abstracting: (l42<=l39)
states: 87,423,102 (7)
.
EG iterations: 1
abstracting: (l24<=l34)
states: 73,792,006 (7)
abstracting: (p11<=0)
states: 87,423,102 (7)
abstracting: (l41<=0)
states: 87,423,102 (7)

EG iterations: 0
abstracting: (l21<=1)
states: 87,423,102 (7)
abstracting: (l21<=1)
states: 87,423,102 (7)
.
EG iterations: 1
abstracting: (l7<=3)
states: 87,409,993 (7)
.abstracting: (s9<=2)
states: 87,423,102 (7)
abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (3<=l2)
states: 1,279 (3)
abstracting: (l27<=3)
states: 87,412,443 (7)
abstracting: (l7<=3)
states: 87,409,993 (7)
.abstracting: (s9<=2)
states: 87,423,102 (7)
abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (3<=l2)
states: 1,279 (3)
abstracting: (l7<=3)
states: 87,409,993 (7)
.abstracting: (s9<=2)
states: 87,423,102 (7)
abstracting: (l25<=2)
states: 87,212,217 (7)
abstracting: (3<=l2)
states: 1,279 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.080sec

checking: EG [[~ [[[~ [AF [l20<=0]] & p10<=4] | [~ [1<=l28] | E [EX [l12<=2] U [3<=l33 & 2<=l12]]]]] | [[[EX [l28<=l30] | l31<=p11] | ~ [AF [AX [l34<=l1]]]] | ~ [[2<=l32 & [~ [EX [l25<=l41]] & AF [3<=l29]]]]]]]
normalized: EG [[[~ [[2<=l32 & [~ [EG [~ [3<=l29]]] & ~ [EX [l25<=l41]]]]] | [EG [EX [~ [l34<=l1]]] | [l31<=p11 | EX [l28<=l30]]]] | ~ [[[E [EX [l12<=2] U [3<=l33 & 2<=l12]] | ~ [1<=l28]] | [p10<=4 & EG [~ [l20<=0]]]]]]]

abstracting: (l20<=0)
states: 71,041,505 (7)
.
EG iterations: 1
abstracting: (p10<=4)
states: 87,423,102 (7)
abstracting: (1<=l28)
states: 15,607,057 (7)
abstracting: (2<=l12)
states: 2,402,859 (6)
abstracting: (3<=l33)
states: 210,885 (5)
abstracting: (l12<=2)
states: 87,177,626 (7)
.abstracting: (l28<=l30)
states: 73,792,006 (7)
.abstracting: (l31<=p11)
states: 71,816,045 (7)
abstracting: (l34<=l1)
states: 72,504,334 (7)
..
EG iterations: 1
abstracting: (l25<=l41)
states: 71,816,045 (7)
.abstracting: (3<=l29)
states: 210,885 (5)
.
EG iterations: 1
abstracting: (2<=l32)
states: 2,176,187 (6)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.808sec

checking: ~ [[AX [[[EX [l30<=4] | [[EG [l10<=p11] & EX [l33<=l12]] & [AX [p16<=0] | AG [l41<=1]]]] | [p12<=l9 | EF [[l14<=0 & 1<=l22]]]]] & ~ [AF [[[AG [l41<=0] & A [4<=l39 U l9<=l5]] | [2<=l21 & EX [l0<=0]]]]]]]
normalized: ~ [[EG [~ [[[2<=l21 & EX [l0<=0]] | [[~ [EG [~ [l9<=l5]]] & ~ [E [~ [l9<=l5] U [~ [4<=l39] & ~ [l9<=l5]]]]] & ~ [E [true U ~ [l41<=0]]]]]]] & ~ [EX [~ [[[p12<=l9 | E [true U [l14<=0 & 1<=l22]]] | [[[~ [E [true U ~ [l41<=1]]] | ~ [EX [~ [p16<=0]]]] & [EX [l33<=l12] & EG [l10<=p11]]] | EX [l30<=4]]]]]]]]

abstracting: (l30<=4)
states: 87,423,102 (7)
.abstracting: (l10<=p11)
states: 71,041,505 (7)
.
EG iterations: 1
abstracting: (l33<=l12)
states: 74,409,631 (7)
.abstracting: (p16<=0)
states: 74,683,881 (7)
.abstracting: (l41<=1)
states: 87,423,102 (7)
abstracting: (1<=l22)
states: 0
abstracting: (l14<=0)
states: 71,041,505 (7)
abstracting: (p12<=l9)
states: 87,423,102 (7)
.abstracting: (l41<=0)
states: 87,423,102 (7)
abstracting: (l9<=l5)
states: 73,211,997 (7)
abstracting: (4<=l39)
states: 10,659 (4)
abstracting: (l9<=l5)
states: 73,211,997 (7)
abstracting: (l9<=l5)
states: 73,211,997 (7)
.
EG iterations: 1
abstracting: (l0<=0)
states: 84,472,375 (7)
.abstracting: (2<=l21)
states: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.291sec

checking: EF [[3<=l21 & [EF [[A [p15<=l36 U 3<=l26] & ~ [E [l37<=2 U 3<=l10]]]] & [[2<=l31 | [~ [[s5<=0 | l41<=l5]] & [~ [l9<=l5] | [l38<=s4 | l27<=s7]]]] | AG [s2<=l18]]]]]
normalized: E [true U [3<=l21 & [[~ [E [true U ~ [s2<=l18]]] | [2<=l31 | [[[l38<=s4 | l27<=s7] | ~ [l9<=l5]] & ~ [[s5<=0 | l41<=l5]]]]] & E [true U [~ [E [l37<=2 U 3<=l10]] & [~ [EG [~ [3<=l26]]] & ~ [E [~ [3<=l26] U [~ [p15<=l36] & ~ [3<=l26]]]]]]]]]]

abstracting: (3<=l26)
states: 210,885 (5)
abstracting: (p15<=l36)
states: 87,423,102 (7)
abstracting: (3<=l26)
states: 210,885 (5)
abstracting: (3<=l26)
states: 210,885 (5)
.
EG iterations: 1
abstracting: (3<=l10)
states: 245,476 (5)
abstracting: (l37<=2)
states: 87,212,217 (7)
abstracting: (l41<=l5)
states: 87,423,102 (7)
abstracting: (s5<=0)
states: 86,212,250 (7)
abstracting: (l9<=l5)
states: 73,211,997 (7)
abstracting: (l27<=s7)
states: 71,821,366 (7)
abstracting: (l38<=s4)
states: 71,821,366 (7)
abstracting: (2<=l31)
states: 2,176,187 (6)
abstracting: (s2<=l18)
states: 60,265,928 (7)
abstracting: (3<=l21)
states: 0
-> the formula is FALSE

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

MC time: 0m 1.084sec

checking: E [[[[[[[EX [l11<=1] | l23<=s5] & s0<=l39] & [l39<=l43 & ~ [[4<=l14 | 2<=p16]]]] & [[AX [l6<=l39] | [2<=s7 & [l14<=4 | 3<=l36]]] | AF [[l18<=1 & l37<=l25]]]] | [E [AX [2<=l28] U ~ [2<=s0]] & [[E [l14<=4 U 1<=l17] | ~ [2<=s5]] & AX [AX [l34<=4]]]]] | l33<=0] U EX [AG [~ [EX [l29<=s7]]]]]
normalized: E [[l33<=0 | [[[~ [EX [EX [~ [l34<=4]]]] & [~ [2<=s5] | E [l14<=4 U 1<=l17]]] & E [~ [EX [~ [2<=l28]]] U ~ [2<=s0]]] | [[~ [EG [~ [[l18<=1 & l37<=l25]]]] | [[2<=s7 & [l14<=4 | 3<=l36]] | ~ [EX [~ [l6<=l39]]]]] & [[l39<=l43 & ~ [[4<=l14 | 2<=p16]]] & [s0<=l39 & [l23<=s5 | EX [l11<=1]]]]]]] U EX [~ [E [true U EX [l29<=s7]]]]]

abstracting: (l29<=s7)
states: 71,821,366 (7)
..abstracting: (l11<=1)
states: 85,020,243 (7)
.abstracting: (l23<=s5)
states: 71,988,208 (7)
abstracting: (s0<=l39)
states: 85,376,662 (7)
abstracting: (2<=p16)
states: 0
abstracting: (4<=l14)
states: 13,109 (4)
abstracting: (l39<=l43)
states: 73,660,259 (7)
abstracting: (l6<=l39)
states: 73,613,111 (7)
.abstracting: (3<=l36)
states: 210,885 (5)
abstracting: (l14<=4)
states: 87,423,102 (7)
abstracting: (2<=s7)
states: 0
abstracting: (l37<=l25)
states: 73,792,006 (7)
abstracting: (l18<=1)
states: 85,020,243 (7)
.
EG iterations: 1
abstracting: (2<=s0)
states: 0
abstracting: (2<=l28)
states: 2,176,187 (6)
.abstracting: (1<=l17)
states: 16,381,597 (7)
abstracting: (l14<=4)
states: 87,423,102 (7)
abstracting: (2<=s5)
states: 0
abstracting: (l34<=4)
states: 87,423,102 (7)
..abstracting: (l33<=0)
states: 71,816,045 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.572sec

totally nodes used: 2348661 (2.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 55786166 34940424 90726590
used/not used/entry size/cache size: 27900389 39208475 16 1024MB
basic ops cache: hits/miss/sum: 4763408 2107749 6871157
used/not used/entry size/cache size: 3407403 13369813 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: 54001 32702 86703
used/not used/entry size/cache size: 32633 8355975 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 64865739
1 2166217
2 69867
3 4330
4 763
5 386
6 220
7 136
8 141
9 53
>= 10 1012

Total processing time: 0m19.311sec


BK_STOP 1679843471732

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

2399
iterations count:154823 (691), effective:3975 (17)

initing FirstDep: 0m 0.000sec


iterations count:29593 (132), effective:322 (1)

iterations count:74956 (334), effective:787 (3)

iterations count:9958 (44), effective:151 (0)

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

iterations count:90715 (404), effective:1266 (5)

iterations count:6029 (26), effective:59 (0)

iterations count:46434 (207), effective:508 (2)

iterations count:26882 (120), effective:320 (1)

iterations count:71258 (318), effective:796 (3)

iterations count:71258 (318), effective:796 (3)

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

iterations count:71258 (318), effective:796 (3)

iterations count:12978 (57), effective:166 (0)

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

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

iterations count:74956 (334), effective:787 (3)

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

iterations count:1812 (8), effective:26 (0)

iterations count:224 (1), effective:0 (0)
1696
iterations count:101149 (451), effective:1108 (4)
4155
iterations count:132878 (593), effective:1375 (6)

iterations count:6189 (27), effective:67 (0)

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

iterations count:63027 (281), effective:705 (3)

iterations count:16421 (73), effective:333 (1)

iterations count:71160 (317), effective:793 (3)

iterations count:1254 (5), effective:15 (0)

iterations count:16421 (73), effective:333 (1)

iterations count:71160 (317), effective:793 (3)

iterations count:1254 (5), effective:15 (0)

iterations count:16421 (73), effective:333 (1)

iterations count:71160 (317), effective:793 (3)

iterations count:1254 (5), effective:15 (0)

iterations count:78999 (352), effective:1016 (4)

iterations count:2683 (11), effective:18 (0)

iterations count:10085 (45), effective:311 (1)
1857
iterations count:102116 (455), effective:1476 (6)

iterations count:4412 (19), effective:51 (0)

iterations count:5278 (23), effective:48 (0)

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

iterations count:5648 (25), effective:103 (0)

iterations count:24284 (108), effective:261 (1)

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-a04"
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-a04, 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-167912691900409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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