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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.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 12K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:59 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-a06-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679843453427

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-a06
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_a06
(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.918sec


RS generation: 0m 3.580sec


-> reachability set: #nodes 4014 (4.0e+03) #states 29,158,928,706 (10)



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

checking: AG [~ [AX [EF [4<=p11]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U 4<=p11]]]]]]

abstracting: (4<=p11)
states: 0
.-> the formula is FALSE

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

MC time: 0m 2.858sec

checking: EF [5<=l28]
normalized: E [true U 5<=l28]

abstracting: (5<=l28)
states: 3,431,229 (6)
-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.570sec

checking: ~ [AX [AF [AG [E [l23<=l35 U s1<=6]]]]]
normalized: EX [EG [E [true U ~ [E [l23<=l35 U s1<=6]]]]]

abstracting: (s1<=6)
states: 29,158,928,706 (10)
abstracting: (l23<=l35)
states: 23,313,147,173 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [A [E [~ [[s9<=l16 & 4<=l23]] U ~ [[l35<=1 & AG [2<=l2]]]] U p11<=s8]]
normalized: ~ [E [true U ~ [[~ [EG [~ [p11<=s8]]] & ~ [E [~ [p11<=s8] U [~ [E [~ [[s9<=l16 & 4<=l23]] U ~ [[~ [E [true U ~ [2<=l2]]] & l35<=1]]]] & ~ [p11<=s8]]]]]]]]

abstracting: (p11<=s8)
states: 29,158,928,706 (10)
abstracting: (l35<=1)
states: 27,655,586,882 (10)
abstracting: (2<=l2)
states: 152,325,119 (8)
abstracting: (4<=l23)
states: 35,858,814 (7)
abstracting: (s9<=l16)
states: 29,158,928,706 (10)
abstracting: (p11<=s8)
states: 29,158,928,706 (10)
abstracting: (p11<=s8)
states: 29,158,928,706 (10)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.175sec

checking: [AG [A [~ [l3<=l0] U AX [[~ [4<=l26] & A [s4<=s1 U l6<=5]]]]] & EF [p15<=6]]
normalized: [E [true U p15<=6] & ~ [E [true U ~ [[~ [EG [EX [~ [[[~ [EG [~ [l6<=5]]] & ~ [E [~ [l6<=5] U [~ [s4<=s1] & ~ [l6<=5]]]]] & ~ [4<=l26]]]]]] & ~ [E [EX [~ [[[~ [EG [~ [l6<=5]]] & ~ [E [~ [l6<=5] U [~ [s4<=s1] & ~ [l6<=5]]]]] & ~ [4<=l26]]]] U [EX [~ [[[~ [EG [~ [l6<=5]]] & ~ [E [~ [l6<=5] U [~ [s4<=s1] & ~ [l6<=5]]]]] & ~ [4<=l26]]]] & l3<=l0]]]]]]]]

abstracting: (l3<=l0)
states: 26,094,204,849 (10)
abstracting: (4<=l26)
states: 36,131,103 (7)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (s4<=s1)
states: 29,092,773,598 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
.abstracting: (4<=l26)
states: 36,131,103 (7)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (s4<=s1)
states: 29,092,773,598 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
.abstracting: (4<=l26)
states: 36,131,103 (7)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (s4<=s1)
states: 29,092,773,598 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
abstracting: (l6<=5)
states: 29,158,700,479 (10)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (p15<=6)
states: 29,158,928,706 (10)
-> the formula is FALSE

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

MC time: 0m 2.018sec

checking: AG [[[l5<=6 & l17<=2] | [[[1<=l9 & EF [[l4<=p11 | 4<=l9]]] & AG [AX [3<=l1]]] & 6<=l30]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U EX [~ [3<=l1]]]] & [E [true U [l4<=p11 | 4<=l9]] & 1<=l9]] & 6<=l30] | [l5<=6 & l17<=2]]]]]

abstracting: (l17<=2)
states: 28,855,413,913 (10)
abstracting: (l5<=6)
states: 29,158,928,706 (10)
abstracting: (6<=l30)
states: 169,575 (5)
abstracting: (1<=l9)
states: 7,444,514,363 (9)
abstracting: (4<=l9)
states: 43,701,231 (7)
abstracting: (l4<=p11)
states: 20,586,176,071 (10)
abstracting: (3<=l1)
states: 5,318,769 (6)
.-> the formula is FALSE

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

MC time: 0m 2.024sec

checking: [~ [E [[~ [EF [p13<=4]] | s9<=1] U [l10<=3 | EX [l18<=6]]]] | [AG [EX [l16<=l22]] & EF [s1<=l12]]]
normalized: [[~ [E [true U ~ [EX [l16<=l22]]]] & E [true U s1<=l12]] | ~ [E [[~ [E [true U p13<=4]] | s9<=1] U [EX [l18<=6] | l10<=3]]]]

abstracting: (l10<=3)
states: 29,115,227,475 (10)
abstracting: (l18<=6)
states: 29,158,928,706 (10)
.abstracting: (s9<=1)
states: 29,158,928,706 (10)
abstracting: (p13<=4)
states: 29,158,928,706 (10)
abstracting: (s1<=l12)
states: 21,796,732,378 (10)
abstracting: (l16<=l22)
states: 21,714,414,343 (10)
.-> the formula is FALSE

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

MC time: 0m 1.289sec

checking: EG [[EX [EF [EG [3<=l14]]] | A [[EG [~ [l24<=l41]] | [EG [4<=s1] | A [2<=l22 U 4<=l15]]] U A [l38<=4 U EG [5<=l19]]]]]
normalized: EG [[EX [E [true U EG [3<=l14]]] | [~ [EG [~ [[~ [EG [~ [EG [5<=l19]]]] & ~ [E [~ [EG [5<=l19]] U [~ [EG [5<=l19]] & ~ [l38<=4]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [5<=l19]]]] & ~ [E [~ [EG [5<=l19]] U [~ [EG [5<=l19]] & ~ [l38<=4]]]]]] U [~ [[[[~ [EG [~ [4<=l15]]] & ~ [E [~ [4<=l15] U [~ [4<=l15] & ~ [2<=l22]]]]] | EG [4<=s1]] | EG [~ [l24<=l41]]]] & ~ [[~ [EG [~ [EG [5<=l19]]]] & ~ [E [~ [EG [5<=l19]] U [~ [EG [5<=l19]] & ~ [l38<=4]]]]]]]]]]]]

abstracting: (l38<=4)
states: 29,155,497,477 (10)
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (l24<=l41)
states: 22,040,540,614 (10)
.
EG iterations: 1
abstracting: (4<=s1)
states: 0
.
EG iterations: 1
abstracting: (2<=l22)
states: 0
abstracting: (4<=l15)
states: 43,701,231 (7)
abstracting: (4<=l15)
states: 43,701,231 (7)
abstracting: (4<=l15)
states: 43,701,231 (7)
.
EG iterations: 1
abstracting: (l38<=4)
states: 29,155,497,477 (10)
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (l38<=4)
states: 29,155,497,477 (10)
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
abstracting: (5<=l19)
states: 4,373,416 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=l14)
states: 303,514,793 (8)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 4.353sec

checking: ~ [[EG [~ [E [[l32<=l34 & ~ [4<=l17]] U E [6<=s0 U 2<=l7]]]] | [AX [[AX [EF [1<=l42]] | [EX [l34<=3] & [~ [1<=s2] | AX [1<=l20]]]]] & EX [p16<=1]]]]
normalized: ~ [[[~ [EX [~ [[~ [EX [~ [E [true U 1<=l42]]]] | [EX [l34<=3] & [~ [EX [~ [1<=l20]]] | ~ [1<=s2]]]]]]] & EX [p16<=1]] | EG [~ [E [[l32<=l34 & ~ [4<=l17]] U E [6<=s0 U 2<=l7]]]]]]

abstracting: (2<=l7)
states: 1,647,184,612 (9)
abstracting: (6<=s0)
states: 0
abstracting: (4<=l17)
states: 43,701,231 (7)
abstracting: (l32<=l34)
states: 23,312,842,646 (10)
.
EG iterations: 1
abstracting: (p16<=1)
states: 29,158,928,706 (10)
.abstracting: (1<=s2)
states: 9,988,440,149 (9)
abstracting: (1<=l20)
states: 7,444,514,363 (9)
.abstracting: (l34<=3)
states: 29,122,797,603 (10)
.abstracting: (1<=l42)
states: 0
..-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.929sec

checking: E [AF [~ [A [[EG [3<=l9] | [l16<=5 & l24<=1]] U AG [l34<=l31]]]] U [~ [[1<=l5 | ~ [1<=s9]]] & EG [[EG [[s5<=5 | l26<=l39]] & s1<=2]]]]
normalized: E [~ [EG [[~ [EG [E [true U ~ [l34<=l31]]]] & ~ [E [E [true U ~ [l34<=l31]] U [~ [[[l16<=5 & l24<=1] | EG [3<=l9]]] & E [true U ~ [l34<=l31]]]]]]]] U [EG [[s1<=2 & EG [[s5<=5 | l26<=l39]]]] & ~ [[1<=l5 | ~ [1<=s9]]]]]

abstracting: (1<=s9)
states: 0
abstracting: (1<=l5)
states: 7,444,514,363 (9)
abstracting: (l26<=l39)
states: 23,312,842,646 (10)
abstracting: (s5<=5)
states: 29,158,928,706 (10)

EG iterations: 0
abstracting: (s1<=2)
states: 29,158,928,706 (10)

EG iterations: 0
abstracting: (l34<=l31)
states: 23,312,842,646 (10)
abstracting: (3<=l9)
states: 303,514,793 (8)
.
EG iterations: 1
abstracting: (l24<=1)
states: 27,655,586,882 (10)
abstracting: (l16<=5)
states: 29,158,700,479 (10)
abstracting: (l34<=l31)
states: 23,312,842,646 (10)
abstracting: (l34<=l31)
states: 23,312,842,646 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.070sec

checking: [~ [AX [[[E [l1<=2 U 4<=l13] & E [s9<=6 U p11<=s4]] & [A [s6<=s3 U l4<=s9] | 2<=p15]]]] | EX [EF [EF [AX [2<=l35]]]]]
normalized: [EX [E [true U E [true U ~ [EX [~ [2<=l35]]]]]] | EX [~ [[[2<=p15 | [~ [E [~ [l4<=s9] U [~ [l4<=s9] & ~ [s6<=s3]]]] & ~ [EG [~ [l4<=s9]]]]] & [E [s9<=6 U p11<=s4] & E [l1<=2 U 4<=l13]]]]]]

abstracting: (4<=l13)
states: 43,701,231 (7)
abstracting: (l1<=2)
states: 29,153,609,937 (10)
abstracting: (p11<=s4)
states: 29,158,928,706 (10)
abstracting: (s9<=6)
states: 29,158,928,706 (10)
abstracting: (l4<=s9)
states: 20,586,176,071 (10)
.
EG iterations: 1
abstracting: (s6<=s3)
states: 28,495,488,214 (10)
abstracting: (l4<=s9)
states: 20,586,176,071 (10)
abstracting: (l4<=s9)
states: 20,586,176,071 (10)
abstracting: (2<=p15)
states: 0
.abstracting: (2<=l35)
states: 1,503,341,824 (9)
..-> the formula is TRUE

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

MC time: 0m 4.413sec

checking: AG [[~ [[~ [[[[2<=l40 & p13<=l30] | [l28<=1 & l35<=5]] & AX [l9<=l11]]] | [[[[l2<=1 & l7<=0] & ~ [s5<=3]] & ~ [EX [p14<=3]]] | ~ [l8<=3]]]] | AF [AX [AF [p14<=2]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [s5<=3] & [l2<=1 & l7<=0]] & ~ [EX [p14<=3]]] | ~ [l8<=3]] | ~ [[~ [EX [~ [l9<=l11]]] & [[l28<=1 & l35<=5] | [2<=l40 & p13<=l30]]]]]] | ~ [EG [EX [EG [~ [p14<=2]]]]]]]]]

abstracting: (p14<=2)
states: 29,158,928,706 (10)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (p13<=l30)
states: 29,158,928,706 (10)
abstracting: (2<=l40)
states: 1,503,341,824 (9)
abstracting: (l35<=5)
states: 29,158,759,131 (10)
abstracting: (l28<=1)
states: 27,655,586,882 (10)
abstracting: (l9<=l11)
states: 23,097,640,204 (10)
.abstracting: (l8<=3)
states: 29,115,227,475 (10)
abstracting: (p14<=3)
states: 29,158,928,706 (10)
.abstracting: (l7<=0)
states: 21,714,414,343 (10)
abstracting: (l2<=1)
states: 29,006,603,587 (10)
abstracting: (s5<=3)
states: 29,158,928,706 (10)
-> the formula is TRUE

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

MC time: 0m 0.108sec

checking: EG [[E [AX [AX [l22<=l12]] U [[[AX [l23<=4] | [s7<=2 | l30<=1]] & [[s4<=6 & l12<=l5] | p11<=l36]] & ~ [l16<=s8]]] & EG [E [[~ [2<=l40] & EX [l17<=2]] U l25<=1]]]]
normalized: EG [[EG [E [[EX [l17<=2] & ~ [2<=l40]] U l25<=1]] & E [~ [EX [EX [~ [l22<=l12]]]] U [~ [l16<=s8] & [[p11<=l36 | [s4<=6 & l12<=l5]] & [[s7<=2 | l30<=1] | ~ [EX [~ [l23<=4]]]]]]]]]

abstracting: (l23<=4)
states: 29,155,703,874 (10)
.abstracting: (l30<=1)
states: 27,655,586,882 (10)
abstracting: (s7<=2)
states: 29,158,928,706 (10)
abstracting: (l12<=l5)
states: 23,097,640,204 (10)
abstracting: (s4<=6)
states: 29,158,928,706 (10)
abstracting: (p11<=l36)
states: 29,158,928,706 (10)
abstracting: (l16<=s8)
states: 21,714,414,343 (10)
abstracting: (l22<=l12)
states: 29,158,928,706 (10)
..abstracting: (l25<=1)
states: 27,655,586,882 (10)
abstracting: (2<=l40)
states: 1,503,341,824 (9)
abstracting: (l17<=2)
states: 28,855,413,913 (10)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.293sec

checking: E [EX [[[E [[l12<=3 | 4<=l18] U ~ [2<=l11]] | ~ [[[p11<=l14 | l38<=p12] & [l8<=l14 & 5<=l28]]]] | EF [l13<=3]]] U AG [EX [[[[l11<=1 & 3<=l8] | [3<=l22 & 1<=l16]] & 5<=l21]]]]
normalized: E [EX [[E [true U l13<=3] | [~ [[[l8<=l14 & 5<=l28] & [p11<=l14 | l38<=p12]]] | E [[l12<=3 | 4<=l18] U ~ [2<=l11]]]]] U ~ [E [true U ~ [EX [[5<=l21 & [[3<=l22 & 1<=l16] | [l11<=1 & 3<=l8]]]]]]]]

abstracting: (3<=l8)
states: 303,514,793 (8)
abstracting: (l11<=1)
states: 27,511,744,094 (10)
abstracting: (1<=l16)
states: 7,444,514,363 (9)
abstracting: (3<=l22)
states: 0
abstracting: (5<=l21)
states: 0
.abstracting: (2<=l11)
states: 1,647,184,612 (9)
abstracting: (4<=l18)
states: 43,701,231 (7)
abstracting: (l12<=3)
states: 29,115,227,475 (10)
abstracting: (l38<=p12)
states: 22,040,540,614 (10)
abstracting: (p11<=l14)
states: 29,158,928,706 (10)
abstracting: (5<=l28)
states: 3,431,229 (6)
abstracting: (l8<=l14)
states: 23,097,640,204 (10)
abstracting: (l13<=3)
states: 29,115,227,475 (10)
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.506sec

checking: AG [[EX [l24<=3] | [[[[[~ [s8<=2] & [l36<=6 | l12<=s8]] & [[p14<=l29 & 5<=l35] & ~ [p12<=3]]] | [3<=l27 & [~ [s8<=l27] & EG [l0<=p10]]]] | AX [EG [l15<=6]]] & ~ [s8<=5]]]]
normalized: ~ [E [true U ~ [[[~ [s8<=5] & [~ [EX [~ [EG [l15<=6]]]] | [[3<=l27 & [EG [l0<=p10] & ~ [s8<=l27]]] | [[~ [p12<=3] & [p14<=l29 & 5<=l35]] & [[l36<=6 | l12<=s8] & ~ [s8<=2]]]]]] | EX [l24<=3]]]]]

abstracting: (l24<=3)
states: 29,122,797,603 (10)
.abstracting: (s8<=2)
states: 29,158,928,706 (10)
abstracting: (l12<=s8)
states: 21,714,414,343 (10)
abstracting: (l36<=6)
states: 29,158,928,706 (10)
abstracting: (5<=l35)
states: 3,431,229 (6)
abstracting: (p14<=l29)
states: 29,158,928,706 (10)
abstracting: (p12<=3)
states: 29,158,928,706 (10)
abstracting: (s8<=l27)
states: 29,158,928,706 (10)
abstracting: (l0<=p10)
states: 27,329,460,611 (10)
.
EG iterations: 1
abstracting: (3<=l27)
states: 263,909,241 (8)
abstracting: (l15<=6)
states: 29,158,928,706 (10)

EG iterations: 0
.abstracting: (s8<=5)
states: 29,158,928,706 (10)
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.754sec

checking: E [~ [[AF [~ [AF [p10<=5]]] | [~ [A [l25<=l43 U EX [l19<=l19]]] & 6<=l4]]] U [AF [[[EF [l39<=l25] | EG [3<=l4]] & E [AG [6<=l4] U [l42<=6 & l36<=l9]]]] & [[~ [EF [2<=s7]] | ~ [AX [[p15<=l22 | l36<=5]]]] & [[l20<=s9 | ~ [EF [l11<=0]]] & [[EX [1<=l15] & AF [l22<=2]] | AX [[l14<=l17 & s3<=5]]]]]]]
normalized: E [~ [[[6<=l4 & ~ [[~ [EG [~ [EX [l19<=l19]]]] & ~ [E [~ [EX [l19<=l19]] U [~ [l25<=l43] & ~ [EX [l19<=l19]]]]]]]] | ~ [EG [~ [EG [~ [p10<=5]]]]]]] U [[[EX [~ [[p15<=l22 | l36<=5]]] | ~ [E [true U 2<=s7]]] & [[~ [EX [~ [[l14<=l17 & s3<=5]]]] | [~ [EG [~ [l22<=2]]] & EX [1<=l15]]] & [l20<=s9 | ~ [E [true U l11<=0]]]]] & ~ [EG [~ [[E [~ [E [true U ~ [6<=l4]]] U [l42<=6 & l36<=l9]] & [EG [3<=l4] | E [true U l39<=l25]]]]]]]]

abstracting: (l39<=l25)
states: 23,312,842,646 (10)
abstracting: (3<=l4)
states: 356,890,353 (8)
.
EG iterations: 1
abstracting: (l36<=l9)
states: 23,555,306,572 (10)
abstracting: (l42<=6)
states: 29,158,928,706 (10)
abstracting: (6<=l4)
states: 280,894 (5)
.
EG iterations: 1
abstracting: (l11<=0)
states: 21,714,414,343 (10)
abstracting: (l20<=s9)
states: 21,714,414,343 (10)
abstracting: (1<=l15)
states: 7,444,514,363 (9)
.abstracting: (l22<=2)
states: 29,158,928,706 (10)
.
EG iterations: 1
abstracting: (s3<=5)
states: 29,158,928,706 (10)
abstracting: (l14<=l17)
states: 23,097,640,204 (10)
.abstracting: (2<=s7)
states: 0
abstracting: (l36<=5)
states: 29,158,759,131 (10)
abstracting: (p15<=l22)
states: 29,158,928,706 (10)
.abstracting: (p10<=5)
states: 29,158,928,706 (10)
.
EG iterations: 1

EG iterations: 0
abstracting: (l19<=l19)
states: 29,158,928,706 (10)
.abstracting: (l25<=l43)
states: 23,006,506,850 (10)
abstracting: (l19<=l19)
states: 29,158,928,706 (10)
.abstracting: (l19<=l19)
states: 29,158,928,706 (10)
..
EG iterations: 1
abstracting: (6<=l4)
states: 280,894 (5)
-> the formula is TRUE

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

MC time: 0m 4.292sec

totally nodes used: 5259670 (5.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 200380973 80990096 281371069
used/not used/entry size/cache size: 46917606 20191258 16 1024MB
basic ops cache: hits/miss/sum: 13437762 4823402 18261164
used/not used/entry size/cache size: 6708414 10068802 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: 174910 75343 250253
used/not used/entry size/cache size: 74992 8313616 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 62199127
1 4655551
2 225434
3 17090
4 3858
5 2055
6 1537
7 788
8 541
9 394
>= 10 2489

Total processing time: 0m39.443sec


BK_STOP 1679843492921

--------------------
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

3303 4704
iterations count:289167 (1290), effective:7823 (34)

initing FirstDep: 0m 0.000sec


iterations count:63027 (281), effective:705 (3)
5286
iterations count:147081 (656), effective:1862 (8)

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

iterations count:1480 (6), effective:28 (0)

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

iterations count:4201 (18), effective:36 (0)

iterations count:29808 (133), effective:642 (2)

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

iterations count:3717 (16), effective:38 (0)

iterations count:938 (4), effective:14 (0)

iterations count:11826 (52), effective:342 (1)

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

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

iterations count:3156 (14), effective:20 (0)

iterations count:8150 (36), effective:162 (0)
6504
iterations count:126086 (562), effective:1366 (6)

iterations count:224 (1), effective:0 (0)
6504
iterations count:126086 (562), effective:1366 (6)

iterations count:7857 (35), effective:96 (0)
6504
iterations count:126086 (562), effective:1366 (6)

iterations count:9806 (43), effective:319 (1)

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

iterations count:9733 (43), effective:169 (0)

iterations count:40805 (182), effective:380 (1)

iterations count:40805 (182), effective:380 (1)

iterations count:18258 (81), effective:515 (2)

iterations count:40805 (182), effective:380 (1)

iterations count:13876 (61), effective:517 (2)

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

iterations count:5217 (23), effective:44 (0)

iterations count:98117 (438), effective:1013 (4)

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

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

iterations count:6917 (30), effective:73 (0)

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

iterations count:2622 (11), effective:38 (0)

iterations count:4056 (18), effective:37 (0)
5318
iterations count:128109 (571), effective:1466 (6)

iterations count:6456 (28), effective:69 (0)

iterations count:570 (2), effective:4 (0)

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

iterations count:2751 (12), effective:43 (0)

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

iterations count:34202 (152), effective:790 (3)

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

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