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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 15K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:01 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-a10-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679843472735

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-a10
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_a10
(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.857sec


RS generation: 0m13.954sec


-> reachability set: #nodes 10228 (1.0e+04) #states 284,523,132,989,069 (14)



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

checking: EF [~ [l39<=2]]
normalized: E [true U ~ [l39<=2]]

abstracting: (l39<=2)
states: 275,014,300,024,685 (14)
-> the formula is TRUE

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

MC time: 0m 6.451sec

checking: E [AF [AX [l33<=l18]] U 4<=l29]
normalized: E [~ [EG [EX [~ [l33<=l18]]]] U 4<=l29]

abstracting: (4<=l29)
states: 2,558,679,058,416 (12)
abstracting: (l33<=l18)
states: 212,886,930,237,722 (14)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m22.486sec

checking: ~ [AG [E [EX [A [l40<=0 U 1<=l40]] U A [s9<=8 U AX [l31<=1]]]]]
normalized: E [true U ~ [E [EX [[~ [EG [~ [1<=l40]]] & ~ [E [~ [1<=l40] U [~ [l40<=0] & ~ [1<=l40]]]]]] U [~ [EG [EX [~ [l31<=1]]]] & ~ [E [EX [~ [l31<=1]] U [~ [s9<=8] & EX [~ [l31<=1]]]]]]]]]

abstracting: (l31<=1)
states: 252,527,040,103,208 (14)
.abstracting: (s9<=8)
states: 284,523,132,989,069 (14)
abstracting: (l31<=1)
states: 252,527,040,103,208 (14)
.abstracting: (l31<=1)
states: 252,527,040,103,208 (14)
..
EG iterations: 1
abstracting: (1<=l40)
states: 98,949,358,231,399 (13)
abstracting: (l40<=0)
states: 185,573,774,757,670 (14)
abstracting: (1<=l40)
states: 98,949,358,231,399 (13)
abstracting: (1<=l40)
states: 98,949,358,231,399 (13)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 4.178sec

checking: EF [~ [[EF [[l11<=s4 & ~ [AX [s6<=0]]]] | AX [~ [EG [l10<=l5]]]]]]
normalized: E [true U ~ [[E [true U [l11<=s4 & EX [~ [s6<=0]]]] | ~ [EX [EG [l10<=l5]]]]]]

abstracting: (l10<=l5)
states: 207,957,671,224,162 (14)
.
EG iterations: 1
.abstracting: (s6<=0)
states: 273,938,274,610,299 (14)
.abstracting: (l11<=s4)
states: 182,193,117,068,937 (14)
-> the formula is TRUE

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

MC time: 0m12.845sec

checking: EG [~ [[EF [[AG [l43<=l41] & s0<=l18]] & l31<=2]]]
normalized: EG [~ [[l31<=2 & E [true U [s0<=l18 & ~ [E [true U ~ [l43<=l41]]]]]]]]

abstracting: (l43<=l41)
states: 226,296,540,534,259 (14)
abstracting: (s0<=l18)
states: 271,509,172,953,771 (14)
abstracting: (l31<=2)
states: 275,014,300,024,685 (14)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 6.449sec

checking: EF [AG [E [~ [[~ [10<=l26] & [l6<=l25 & 4<=l19]]] U EF [~ [6<=l17]]]]]
normalized: E [true U ~ [E [true U ~ [E [~ [[[l6<=l25 & 4<=l19] & ~ [10<=l26]]] U E [true U ~ [6<=l17]]]]]]]

abstracting: (6<=l17)
states: 162,564,615,862 (11)
abstracting: (10<=l26)
states: 12,666,445 (7)
abstracting: (4<=l19)
states: 3,012,794,480,636 (12)
abstracting: (l6<=l25)
states: 208,445,324,591,179 (14)
-> the formula is TRUE

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

MC time: 0m24.128sec

checking: E [~ [9<=l6] U EG [EX [E [E [l38<=l11 U l2<=8] U [7<=l12 & l28<=8]]]]]
normalized: E [~ [9<=l6] U EG [EX [E [E [l38<=l11 U l2<=8] U [7<=l12 & l28<=8]]]]]

abstracting: (l28<=8)
states: 284,522,868,137,790 (14)
abstracting: (7<=l12)
states: 29,189,289,159 (10)
abstracting: (l2<=8)
states: 284,523,132,987,790 (14)
abstracting: (l38<=l11)
states: 212,886,930,237,722 (14)
..
EG iterations: 1
abstracting: (9<=l6)
states: 396,457,302 (8)
-> the formula is TRUE

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

MC time: 0m 7.849sec

checking: EX [A [p14<=p16 U EF [[~ [AG [p12<=l38]] | A [s9<=5 U 2<=l37]]]]]
normalized: EX [[~ [EG [~ [E [true U [[~ [EG [~ [2<=l37]]] & ~ [E [~ [2<=l37] U [~ [s9<=5] & ~ [2<=l37]]]]] | E [true U ~ [p12<=l38]]]]]]] & ~ [E [~ [E [true U [[~ [EG [~ [2<=l37]]] & ~ [E [~ [2<=l37] U [~ [s9<=5] & ~ [2<=l37]]]]] | E [true U ~ [p12<=l38]]]]] U [~ [p14<=p16] & ~ [E [true U [[~ [EG [~ [2<=l37]]] & ~ [E [~ [2<=l37] U [~ [s9<=5] & ~ [2<=l37]]]]] | E [true U ~ [p12<=l38]]]]]]]]]]

abstracting: (p12<=l38)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (s9<=5)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
.
EG iterations: 1
abstracting: (p14<=p16)
states: 284,523,132,989,069 (14)
abstracting: (p12<=l38)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (s9<=5)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
.
EG iterations: 1
abstracting: (p12<=l38)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (s9<=5)
states: 284,523,132,989,069 (14)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
abstracting: (2<=l37)
states: 31,996,092,885,861 (13)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Szymanski-PT-a10-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.972sec

checking: E [AX [[EG [E [l18<=2 U 6<=s6]] | l35<=l18]] U EG [AF [EX [A [p14<=l36 U 8<=l26]]]]]
normalized: E [~ [EX [~ [[l35<=l18 | EG [E [l18<=2 U 6<=s6]]]]]] U EG [~ [EG [~ [EX [[~ [EG [~ [8<=l26]]] & ~ [E [~ [8<=l26] U [~ [p14<=l36] & ~ [8<=l26]]]]]]]]]]]

abstracting: (8<=l26)
states: 2,873,812,073 (9)
abstracting: (p14<=l36)
states: 284,523,132,989,069 (14)
abstracting: (8<=l26)
states: 2,873,812,073 (9)
abstracting: (8<=l26)
states: 2,873,812,073 (9)
.
EG iterations: 1
...
EG iterations: 2
.
EG iterations: 1
abstracting: (6<=s6)
states: 0
abstracting: (l18<=2)
states: 273,798,084,873,901 (14)
.
EG iterations: 1
abstracting: (l35<=l18)
states: 212,886,930,237,722 (14)
.-> the formula is TRUE

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

MC time: 0m21.489sec

checking: E [[AG [3<=l29] | EF [E [EX [l6<=l16] U ~ [s9<=l7]]]] U ~ [AF [l43<=p15]]]
normalized: E [[E [true U E [EX [l6<=l16] U ~ [s9<=l7]]] | ~ [E [true U ~ [3<=l29]]]] U EG [~ [l43<=p15]]]

abstracting: (l43<=p15)
states: 226,296,540,534,259 (14)
.
EG iterations: 1
abstracting: (3<=l29)
states: 9,508,832,964,384 (12)
abstracting: (s9<=l7)
states: 284,523,132,989,069 (14)
abstracting: (l6<=l16)
states: 207,957,671,224,162 (14)
.-> the formula is FALSE

FORMULA Szymanski-PT-a10-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.453sec

checking: EF [[[[~ [AG [A [6<=l18 U l39<=p15]]] | ~ [AX [~ [2<=s1]]]] & ~ [AF [[EX [l19<=6] & AG [s6<=l13]]]]] & AG [AX [EX [l19<=10]]]]]
normalized: E [true U [~ [E [true U EX [~ [EX [l19<=10]]]]] & [EG [~ [[~ [E [true U ~ [s6<=l13]]] & EX [l19<=6]]]] & [EX [2<=s1] | E [true U ~ [[~ [EG [~ [l39<=p15]]] & ~ [E [~ [l39<=p15] U [~ [6<=l18] & ~ [l39<=p15]]]]]]]]]]]

abstracting: (l39<=p15)
states: 185,573,774,757,670 (14)
abstracting: (6<=l18)
states: 162,564,615,862 (11)
abstracting: (l39<=p15)
states: 185,573,774,757,670 (14)
abstracting: (l39<=p15)
states: 185,573,774,757,670 (14)
.
EG iterations: 1
abstracting: (2<=s1)
states: 0
.abstracting: (l19<=6)
states: 284,493,943,699,910 (14)
.abstracting: (s6<=l13)
states: 277,601,040,601,209 (14)
..
EG iterations: 2
abstracting: (l19<=10)
states: 284,523,132,989,069 (14)
..-> the formula is TRUE

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

MC time: 0m20.175sec

checking: A [[[~ [10<=l34] & ~ [AX [[~ [l32<=l23] | EF [1<=l23]]]]] | E [1<=l10 U ~ [l24<=l37]]] U AG [l21<=6]]
normalized: [~ [EG [E [true U ~ [l21<=6]]]] & ~ [E [E [true U ~ [l21<=6]] U [E [true U ~ [l21<=6]] & ~ [[E [1<=l10 U ~ [l24<=l37]] | [EX [~ [[E [true U 1<=l23] | ~ [l32<=l23]]]] & ~ [10<=l34]]]]]]]]

abstracting: (10<=l34)
states: 12,666,445 (7)
abstracting: (l32<=l23)
states: 210,115,676,979,203 (14)
abstracting: (1<=l23)
states: 98,949,317,480,910 (13)
.abstracting: (l24<=l37)
states: 210,115,676,979,203 (14)
abstracting: (1<=l10)
states: 102,858,754,955,372 (14)
abstracting: (l21<=6)
states: 284,523,132,989,069 (14)
abstracting: (l21<=6)
states: 284,523,132,989,069 (14)
abstracting: (l21<=6)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.741sec

checking: E [~ [[AG [~ [[EG [l27<=5] | [2<=p11 & l24<=0]]]] | [~ [l29<=l41] | E [~ [AX [l43<=l22]] U AF [1<=l32]]]]] U ~ [p14<=l30]]
normalized: E [~ [[[E [EX [~ [l43<=l22]] U ~ [EG [~ [1<=l32]]]] | ~ [l29<=l41]] | ~ [E [true U [[2<=p11 & l24<=0] | EG [l27<=5]]]]]] U ~ [p14<=l30]]

abstracting: (p14<=l30)
states: 284,523,132,989,069 (14)
abstracting: (l27<=5)
states: 284,397,059,788,631 (14)
.
EG iterations: 1
abstracting: (l24<=0)
states: 185,573,774,757,670 (14)
abstracting: (2<=p11)
states: 0
abstracting: (l29<=l41)
states: 185,573,774,757,670 (14)
abstracting: (1<=l32)
states: 98,949,358,231,399 (13)
.
EG iterations: 1
abstracting: (l43<=l22)
states: 226,296,540,534,259 (14)
.-> the formula is FALSE

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

MC time: 0m 3.412sec

checking: EF [[AF [10<=l15] & [AF [~ [AX [1<=l0]]] | A [[[E [s7<=p14 U 6<=l16] | [l30<=5 | p10<=9]] | [AX [l32<=8] | AG [l20<=4]]] U AF [AX [l14<=s5]]]]]]
normalized: E [true U [~ [EG [~ [10<=l15]]] & [[~ [EG [EG [EX [~ [l14<=s5]]]]] & ~ [E [EG [EX [~ [l14<=s5]]] U [~ [[[~ [E [true U ~ [l20<=4]]] | ~ [EX [~ [l32<=8]]]] | [[l30<=5 | p10<=9] | E [s7<=p14 U 6<=l16]]]] & EG [EX [~ [l14<=s5]]]]]]] | ~ [EG [~ [EX [~ [1<=l0]]]]]]]]

abstracting: (1<=l0)
states: 35,905,489,609,834 (13)
...
EG iterations: 2
abstracting: (l14<=s5)
states: 184,157,182,423,292 (14)
..
EG iterations: 1
abstracting: (6<=l16)
states: 162,564,615,862 (11)
abstracting: (s7<=p14)
states: 282,200,127,030,770 (14)
abstracting: (p10<=9)
states: 284,523,132,989,069 (14)
abstracting: (l30<=5)
states: 284,397,059,788,631 (14)
abstracting: (l32<=8)
states: 284,522,868,137,790 (14)
.abstracting: (l20<=4)
states: 283,770,694,391,960 (14)
abstracting: (l14<=s5)
states: 184,157,182,423,292 (14)
..
EG iterations: 1
abstracting: (l14<=s5)
states: 184,157,182,423,292 (14)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (10<=l15)
states: 19,997,119 (7)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m23.315sec

checking: AG [~ [[~ [[EG [[s5<=8 | 9<=l26]] | [E [l34<=p11 U p11<=l14] | A [s7<=4 U p14<=4]]]] & A [E [l15<=p10 U AG [l19<=l31]] U 3<=l6]]]]
normalized: ~ [E [true U [[~ [EG [~ [3<=l6]]] & ~ [E [~ [3<=l6] U [~ [E [l15<=p10 U ~ [E [true U ~ [l19<=l31]]]]] & ~ [3<=l6]]]]] & ~ [[[[~ [EG [~ [p14<=4]]] & ~ [E [~ [p14<=4] U [~ [s7<=4] & ~ [p14<=4]]]]] | E [l34<=p11 U p11<=l14]] | EG [[s5<=8 | 9<=l26]]]]]]]

abstracting: (9<=l26)
states: 264,851,279 (8)
abstracting: (s5<=8)
states: 284,523,132,989,069 (14)

EG iterations: 0
abstracting: (p11<=l14)
states: 284,523,132,989,069 (14)
abstracting: (l34<=p11)
states: 185,573,774,757,670 (14)
abstracting: (p14<=4)
states: 284,523,132,989,069 (14)
abstracting: (s7<=4)
states: 284,523,132,989,069 (14)
abstracting: (p14<=4)
states: 284,523,132,989,069 (14)
abstracting: (p14<=4)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
abstracting: (3<=l6)
states: 10,725,048,115,168 (13)
abstracting: (l19<=l31)
states: 208,445,324,591,179 (14)
abstracting: (l15<=p10)
states: 181,664,378,033,697 (14)
abstracting: (3<=l6)
states: 10,725,048,115,168 (13)
abstracting: (3<=l6)
states: 10,725,048,115,168 (13)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m30.291sec

checking: [E [l39<=l38 U A [~ [[EG [s5<=l6] | [EG [l26<=l29] & 10<=l15]]] U [EG [~ [s0<=8]] | [[[l6<=l31 | 7<=l40] & [s8<=l6 | l11<=4]] | ~ [s9<=3]]]]] & [[[EX [AG [EX [7<=l24]]] & EF [A [EF [l25<=s4] U ~ [l43<=8]]]] & EX [E [AG [l24<=l2] U EF [l17<=6]]]] | EF [AG [~ [EX [l26<=l18]]]]]]
normalized: [[E [true U ~ [E [true U EX [l26<=l18]]]] | [EX [E [~ [E [true U ~ [l24<=l2]]] U E [true U l17<=6]]] & [E [true U [~ [EG [l43<=8]] & ~ [E [l43<=8 U [l43<=8 & ~ [E [true U l25<=s4]]]]]]] & EX [~ [E [true U ~ [EX [7<=l24]]]]]]]] & E [l39<=l38 U [~ [EG [~ [[[~ [s9<=3] | [[s8<=l6 | l11<=4] & [l6<=l31 | 7<=l40]]] | EG [~ [s0<=8]]]]]] & ~ [E [~ [[[~ [s9<=3] | [[s8<=l6 | l11<=4] & [l6<=l31 | 7<=l40]]] | EG [~ [s0<=8]]]] U [[[10<=l15 & EG [l26<=l29]] | EG [s5<=l6]] & ~ [[[~ [s9<=3] | [[s8<=l6 | l11<=4] & [l6<=l31 | 7<=l40]]] | EG [~ [s0<=8]]]]]]]]]]

abstracting: (s0<=8)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
abstracting: (7<=l40)
states: 21,577,024,359 (10)
abstracting: (l6<=l31)
states: 208,445,324,591,179 (14)
abstracting: (l11<=4)
states: 283,770,694,391,960 (14)
abstracting: (s8<=l6)
states: 284,523,132,989,069 (14)
abstracting: (s9<=3)
states: 284,523,132,989,069 (14)
abstracting: (s5<=l6)
states: 277,601,045,288,034 (14)
.
EG iterations: 1
abstracting: (l26<=l29)
states: 210,115,676,979,203 (14)
.
EG iterations: 1
abstracting: (10<=l15)
states: 19,997,119 (7)
abstracting: (s0<=8)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
abstracting: (7<=l40)
states: 21,577,024,359 (10)
abstracting: (l6<=l31)
states: 208,445,324,591,179 (14)
abstracting: (l11<=4)
states: 283,770,694,391,960 (14)
abstracting: (s8<=l6)
states: 284,523,132,989,069 (14)
abstracting: (s9<=3)
states: 284,523,132,989,069 (14)
abstracting: (s0<=8)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
abstracting: (7<=l40)
states: 21,577,024,359 (10)
abstracting: (l6<=l31)
states: 208,445,324,591,179 (14)
abstracting: (l11<=4)
states: 283,770,694,391,960 (14)
abstracting: (s8<=l6)
states: 284,523,132,989,069 (14)
abstracting: (s9<=3)
states: 284,523,132,989,069 (14)
.
EG iterations: 1
abstracting: (l39<=l38)
states: 210,115,676,979,203 (14)
abstracting: (7<=l24)
states: 21,577,024,359 (10)
..abstracting: (l25<=s4)
states: 186,089,926,756,396 (14)
abstracting: (l43<=8)
states: 284,523,132,989,069 (14)
abstracting: (l43<=8)
states: 284,523,132,989,069 (14)
abstracting: (l43<=8)
states: 284,523,132,989,069 (14)

EG iterations: 0
abstracting: (l17<=6)
states: 284,493,943,699,910 (14)
abstracting: (l24<=l2)
states: 198,439,656,652,141 (14)
.abstracting: (l26<=l18)
states: 212,886,930,237,722 (14)
.-> the formula is TRUE

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

MC time: 0m38.116sec

totally nodes used: 32713200 (3.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1754536082 453566412 2208102494
used/not used/entry size/cache size: 66930106 178758 16 1024MB
basic ops cache: hits/miss/sum: 135426660 32793424 168220084
used/not used/entry size/cache size: 16084442 692774 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: 723510 183022 906532
used/not used/entry size/cache size: 181085 8207523 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 42212664
1 19283257
2 4552466
3 791148
4 144692
5 42100
6 21094
7 13492
8 8086
9 5953
>= 10 33912

Total processing time: 4m10.302sec


BK_STOP 1679843723107

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

7289 7563 15750 12355 10031
iterations count:557923 (2490), effective:15523 (69)

initing FirstDep: 0m 0.000sec


iterations count:81273 (362), effective:924 (4)
25695
iterations count:127557 (569), effective:1784 (7)

iterations count:42581 (190), effective:361 (1)

iterations count:42089 (187), effective:509 (2)

iterations count:5491 (24), effective:89 (0)

iterations count:22873 (102), effective:612 (2)

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

iterations count:2809 (12), effective:35 (0)

iterations count:224 (1), effective:0 (0)
8965
iterations count:100656 (449), effective:2620 (11)

iterations count:44182 (197), effective:1399 (6)

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

iterations count:30919 (138), effective:1361 (6)

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

iterations count:55278 (246), effective:617 (2)

iterations count:55278 (246), effective:617 (2)

iterations count:55278 (246), effective:617 (2)
19643 26917 24618 21053
iterations count:433997 (1937), effective:7532 (33)

iterations count:9794 (43), effective:115 (0)

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

iterations count:2835 (12), effective:35 (0)

iterations count:29617 (132), effective:324 (1)

iterations count:5419 (24), effective:89 (0)

iterations count:24284 (108), effective:261 (1)
11717
iterations count:145597 (649), effective:1814 (8)

iterations count:1518 (6), effective:25 (0)

iterations count:26680 (119), effective:417 (1)

iterations count:6963 (31), effective:73 (0)

iterations count:13258 (59), effective:178 (0)

iterations count:22829 (101), effective:843 (3)

iterations count:21303 (95), effective:673 (3)

iterations count:25523 (113), effective:1206 (5)

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

iterations count:37608 (167), effective:1228 (5)

iterations count:31002 (138), effective:387 (1)

iterations count:3619 (16), effective:156 (0)

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

iterations count:2984 (13), effective:40 (0)

iterations count:6788 (30), effective:77 (0)

iterations count:11851 (52), effective:165 (0)
16435
iterations count:129344 (577), effective:1617 (7)

iterations count:2438 (10), effective:29 (0)

iterations count:17140 (76), effective:179 (0)

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

iterations count:27439 (122), effective:950 (4)

iterations count:63027 (281), effective:705 (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-a10"
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-a10, 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-167912692000433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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