fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r481-tall-167912692000425
Last Updated
May 14, 2023

About the Execution of Marcie for Szymanski-PT-a08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6829.747 77409.00 77550.00 539.40 TFFFTTTFFFFFTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 16:48 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.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 11K Feb 26 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:50 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-a08-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679843466095

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-a08
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_a08
(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.819sec


RS generation: 0m 7.641sec


-> reachability set: #nodes 6763 (6.8e+03) #states 3,955,934,872,799 (12)



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

checking: EF [1<=l35]
normalized: E [true U 1<=l35]

abstracting: (1<=l35)
states: 1,186,019,411,904 (12)
-> the formula is TRUE

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

MC time: 0m 1.875sec

checking: EX [EF [EX [EF [AF [8<=p10]]]]]
normalized: EX [E [true U EX [E [true U ~ [EG [~ [8<=p10]]]]]]]

abstracting: (8<=p10)
states: 0

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

FORMULA Szymanski-PT-a08-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [EX [~ [[AG [EX [p10<=0]] | s0<=0]]]]
normalized: ~ [EX [~ [EX [~ [[~ [E [true U ~ [EX [p10<=0]]]] | s0<=0]]]]]]

abstracting: (s0<=0)
states: 3,724,010,395,780 (12)
abstracting: (p10<=0)
states: 3,955,934,872,799 (12)
...-> the formula is TRUE

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

MC time: 0m 4.433sec

checking: AF [AX [AG [[[l8<=7 & [l3<=4 | l14<=4]] | AG [3<=p14]]]]]
normalized: ~ [EG [EX [E [true U ~ [[~ [E [true U ~ [3<=p14]]] | [[l3<=4 | l14<=4] & l8<=7]]]]]]]

abstracting: (l8<=7)
states: 3,955,932,363,546 (12)
abstracting: (l14<=4)
states: 3,952,423,919,556 (12)
abstracting: (l3<=4)
states: 3,955,929,445,872 (12)
abstracting: (3<=p14)
states: 0
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 3.299sec

checking: ~ [EF [A [~ [s9<=4] U ~ [AG [E [l8<=0 U l38<=l2]]]]]]
normalized: ~ [E [true U [~ [EG [~ [E [true U ~ [E [l8<=0 U l38<=l2]]]]]] & ~ [E [~ [E [true U ~ [E [l8<=0 U l38<=l2]]]] U [~ [E [true U ~ [E [l8<=0 U l38<=l2]]]] & s9<=4]]]]]]

abstracting: (s9<=4)
states: 3,955,934,872,799 (12)
abstracting: (l38<=l2)
states: 2,895,795,908,481 (12)
abstracting: (l8<=0)
states: 2,719,579,903,615 (12)
abstracting: (l38<=l2)
states: 2,895,795,908,481 (12)
abstracting: (l8<=0)
states: 2,719,579,903,615 (12)
abstracting: (l38<=l2)
states: 2,895,795,908,481 (12)
abstracting: (l8<=0)
states: 2,719,579,903,615 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 5.296sec

checking: EF [[AX [AX [[AG [s4<=l32] | ~ [p16<=6]]]] & l9<=l24]]
normalized: E [true U [l9<=l24 & ~ [EX [EX [~ [[~ [p16<=6] | ~ [E [true U ~ [s4<=l32]]]]]]]]]]

abstracting: (s4<=l32)
states: 3,941,497,154,609 (12)
abstracting: (p16<=6)
states: 3,955,934,872,799 (12)
..abstracting: (l9<=l24)
states: 3,009,085,326,107 (12)
-> the formula is TRUE

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

MC time: 0m 3.484sec

checking: ~ [[EF [A [[l1<=5 & s0<=0] U [7<=s6 | l38<=3]]] & AG [EX [[s0<=6 | 3<=s9]]]]]
normalized: ~ [[~ [E [true U ~ [EX [[s0<=6 | 3<=s9]]]]] & E [true U [~ [EG [~ [[7<=s6 | l38<=3]]]] & ~ [E [~ [[7<=s6 | l38<=3]] U [~ [[l1<=5 & s0<=0]] & ~ [[7<=s6 | l38<=3]]]]]]]]]

abstracting: (l38<=3)
states: 3,939,727,832,291 (12)
abstracting: (7<=s6)
states: 0
abstracting: (s0<=0)
states: 3,724,010,395,780 (12)
abstracting: (l1<=5)
states: 3,955,934,756,630 (12)
abstracting: (l38<=3)
states: 3,939,727,832,291 (12)
abstracting: (7<=s6)
states: 0
abstracting: (l38<=3)
states: 3,939,727,832,291 (12)
abstracting: (7<=s6)
states: 0
.
EG iterations: 1
abstracting: (3<=s9)
states: 0
abstracting: (s0<=6)
states: 3,955,934,872,799 (12)
.-> the formula is TRUE

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

MC time: 0m 0.658sec

checking: EF [EX [[5<=l30 & E [[p15<=l14 & EG [l13<=l18]] U 7<=p11]]]]
normalized: E [true U EX [[5<=l30 & E [[p15<=l14 & EG [l13<=l18]] U 7<=p11]]]]

abstracting: (7<=p11)
states: 0
abstracting: (l13<=l18)
states: 2,997,993,837,675 (12)
.
EG iterations: 1
abstracting: (p15<=l14)
states: 3,955,934,872,799 (12)
abstracting: (5<=l30)
states: 2,806,153,263 (9)
.-> the formula is FALSE

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

MC time: 0m 0.328sec

checking: ~ [E [A [p13<=8 U EF [~ [l38<=l37]]] U E [[EF [7<=l13] | EF [6<=s3]] U EG [4<=l29]]]]
normalized: ~ [E [[~ [EG [~ [E [true U ~ [l38<=l37]]]]] & ~ [E [~ [E [true U ~ [l38<=l37]]] U [~ [p13<=8] & ~ [E [true U ~ [l38<=l37]]]]]]] U E [[E [true U 6<=s3] | E [true U 7<=l13]] U EG [4<=l29]]]]

abstracting: (4<=l29)
states: 16,207,040,508 (10)
.
EG iterations: 1
abstracting: (7<=l13)
states: 48,988,114 (7)
abstracting: (6<=s3)
states: 0
abstracting: (l38<=l37)
states: 3,028,084,629,047 (12)
abstracting: (p13<=8)
states: 3,955,934,872,799 (12)
abstracting: (l38<=l37)
states: 3,028,084,629,047 (12)
abstracting: (l38<=l37)
states: 3,028,084,629,047 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 6.444sec

checking: AF [A [A [EG [A [2<=l18 U l19<=0]] U [~ [2<=l39] | [AF [p12<=4] & p11<=2]]] U AF [~ [AG [l15<=l15]]]]]
normalized: ~ [EG [~ [[~ [EG [EG [~ [E [true U ~ [l15<=l15]]]]]] & ~ [E [EG [~ [E [true U ~ [l15<=l15]]]] U [~ [[~ [EG [~ [[[p11<=2 & ~ [EG [~ [p12<=4]]]] | ~ [2<=l39]]]]] & ~ [E [~ [[[p11<=2 & ~ [EG [~ [p12<=4]]]] | ~ [2<=l39]]] U [~ [EG [[~ [EG [~ [l19<=0]]] & ~ [E [~ [l19<=0] U [~ [2<=l18] & ~ [l19<=0]]]]]]] & ~ [[[p11<=2 & ~ [EG [~ [p12<=4]]]] | ~ [2<=l39]]]]]]]] & EG [~ [E [true U ~ [l15<=l15]]]]]]]]]]]

abstracting: (l15<=l15)
states: 3,955,934,872,799 (12)

EG iterations: 0
abstracting: (2<=l39)
states: 322,146,612,954 (11)
abstracting: (p12<=4)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=2)
states: 3,955,934,872,799 (12)
abstracting: (l19<=0)
states: 2,719,579,903,615 (12)
abstracting: (2<=l18)
states: 350,611,139,480 (11)
abstracting: (l19<=0)
states: 2,719,579,903,615 (12)
abstracting: (l19<=0)
states: 2,719,579,903,615 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (2<=l39)
states: 322,146,612,954 (11)
abstracting: (p12<=4)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=2)
states: 3,955,934,872,799 (12)
abstracting: (2<=l39)
states: 322,146,612,954 (11)
abstracting: (p12<=4)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=2)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (l15<=l15)
states: 3,955,934,872,799 (12)

EG iterations: 0
abstracting: (l15<=l15)
states: 3,955,934,872,799 (12)

EG iterations: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.159sec

checking: EG [[[~ [4<=l12] & [~ [EF [~ [3<=l38]]] | [[AX [l30<=2] & EF [6<=l36]] | ~ [EF [l37<=l11]]]]] & ~ [AG [AG [p12<=5]]]]]
normalized: EG [[E [true U E [true U ~ [p12<=5]]] & [[[~ [E [true U l37<=l11]] | [E [true U 6<=l36] & ~ [EX [~ [l30<=2]]]]] | ~ [E [true U ~ [3<=l38]]]] & ~ [4<=l12]]]]

abstracting: (4<=l12)
states: 19,322,882,728 (10)
abstracting: (3<=l38)
states: 77,723,151,666 (10)
abstracting: (l30<=2)
states: 3,878,211,721,133 (12)
.abstracting: (6<=l36)
states: 378,459,423 (8)
abstracting: (l37<=l11)
states: 3,064,248,699,187 (12)
abstracting: (p12<=5)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a08-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.404sec

checking: AF [AG [~ [A [[l10<=8 | p13<=l13] U [[2<=l36 & l18<=5] & [p10<=l42 & 1<=l17]]]]]]
normalized: ~ [EG [E [true U [~ [EG [~ [[[p10<=l42 & 1<=l17] & [2<=l36 & l18<=5]]]]] & ~ [E [~ [[[p10<=l42 & 1<=l17] & [2<=l36 & l18<=5]]] U [~ [[l10<=8 | p13<=l13]] & ~ [[[p10<=l42 & 1<=l17] & [2<=l36 & l18<=5]]]]]]]]]]

abstracting: (l18<=5)
states: 3,955,437,041,966 (12)
abstracting: (2<=l36)
states: 322,146,612,954 (11)
abstracting: (1<=l17)
states: 1,236,354,969,184 (12)
abstracting: (p10<=l42)
states: 3,955,934,872,799 (12)
abstracting: (p13<=l13)
states: 3,955,934,872,799 (12)
abstracting: (l10<=8)
states: 3,955,934,872,799 (12)
abstracting: (l18<=5)
states: 3,955,437,041,966 (12)
abstracting: (2<=l36)
states: 322,146,612,954 (11)
abstracting: (1<=l17)
states: 1,236,354,969,184 (12)
abstracting: (p10<=l42)
states: 3,955,934,872,799 (12)
abstracting: (l18<=5)
states: 3,955,437,041,966 (12)
abstracting: (2<=l36)
states: 322,146,612,954 (11)
abstracting: (1<=l17)
states: 1,236,354,969,184 (12)
abstracting: (p10<=l42)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 1.921sec

checking: EF [~ [[l17<=5 & E [s7<=l40 U [AX [l33<=p11] & [~ [4<=l21] & EG [l28<=l36]]]]]]]
normalized: E [true U ~ [[l17<=5 & E [s7<=l40 U [~ [EX [~ [l33<=p11]]] & [EG [l28<=l36] & ~ [4<=l21]]]]]]]

abstracting: (4<=l21)
states: 0
abstracting: (l28<=l36)
states: 3,028,084,629,047 (12)
.
EG iterations: 1
abstracting: (l33<=p11)
states: 2,769,915,460,895 (12)
.abstracting: (s7<=l40)
states: 3,941,497,331,709 (12)
abstracting: (l17<=5)
states: 3,955,437,041,966 (12)
-> the formula is TRUE

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

MC time: 0m 9.745sec

checking: ~ [E [[AG [l16<=6] & EX [AX [[l38<=l20 | l0<=p10]]]] U ~ [[[~ [AG [l25<=l29]] & EX [EF [8<=s0]]] | A [EX [1<=l7] U AF [4<=l35]]]]]]
normalized: ~ [E [[EX [~ [EX [~ [[l38<=l20 | l0<=p10]]]]] & ~ [E [true U ~ [l16<=6]]]] U ~ [[[~ [EG [EG [~ [4<=l35]]]] & ~ [E [EG [~ [4<=l35]] U [~ [EX [1<=l7]] & EG [~ [4<=l35]]]]]] | [EX [E [true U 8<=s0]] & E [true U ~ [l25<=l29]]]]]]]

abstracting: (l25<=l29)
states: 3,028,084,629,047 (12)
abstracting: (8<=s0)
states: 0
.abstracting: (4<=l35)
states: 16,207,040,508 (10)
.
EG iterations: 1
abstracting: (1<=l7)
states: 1,236,354,969,184 (12)
.abstracting: (4<=l35)
states: 16,207,040,508 (10)
.
EG iterations: 1
abstracting: (4<=l35)
states: 16,207,040,508 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (l16<=6)
states: 3,955,885,884,685 (12)
abstracting: (l0<=p10)
states: 3,583,452,702,565 (12)
abstracting: (l38<=l20)
states: 3,064,248,699,187 (12)
..-> the formula is FALSE

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

MC time: 0m 7.548sec

checking: AG [[~ [[~ [AX [l39<=0]] & A [[AG [l32<=p15] & 7<=l10] U [EF [5<=l0] | [s8<=1 | 3<=l19]]]]] & ~ [[AX [[1<=l34 & AF [2<=l15]]] & [[7<=l4 & EF [l16<=4]] | E [~ [l41<=7] U AX [s7<=s9]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[E [~ [l41<=7] U ~ [EX [~ [s7<=s9]]]] | [7<=l4 & E [true U l16<=4]]] & ~ [EX [~ [[1<=l34 & ~ [EG [~ [2<=l15]]]]]]]]] & ~ [[[~ [EG [~ [[[s8<=1 | 3<=l19] | E [true U 5<=l0]]]]] & ~ [E [~ [[[s8<=1 | 3<=l19] | E [true U 5<=l0]]] U [~ [[7<=l10 & ~ [E [true U ~ [l32<=p15]]]]] & ~ [[[s8<=1 | 3<=l19] | E [true U 5<=l0]]]]]]] & EX [~ [l39<=0]]]]]]]]

abstracting: (l39<=0)
states: 2,769,915,460,895 (12)
.abstracting: (5<=l0)
states: 2,950,727 (6)
abstracting: (3<=l19)
states: 88,460,486,877 (10)
abstracting: (s8<=1)
states: 3,955,934,872,799 (12)
abstracting: (l32<=p15)
states: 2,769,915,460,895 (12)
abstracting: (7<=l10)
states: 48,988,114 (7)
abstracting: (5<=l0)
states: 2,950,727 (6)
abstracting: (3<=l19)
states: 88,460,486,877 (10)
abstracting: (s8<=1)
states: 3,955,934,872,799 (12)
abstracting: (5<=l0)
states: 2,950,727 (6)
abstracting: (3<=l19)
states: 88,460,486,877 (10)
abstracting: (s8<=1)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (2<=l15)
states: 350,611,139,480 (11)
.
EG iterations: 1
abstracting: (1<=l34)
states: 1,186,019,411,904 (12)
.abstracting: (l16<=4)
states: 3,952,423,919,556 (12)
abstracting: (7<=l4)
states: 61,274,786 (7)
abstracting: (s7<=s9)
states: 3,936,621,610,091 (12)
.abstracting: (l41<=7)
states: 3,955,934,872,799 (12)
-> the formula is FALSE

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

MC time: 0m 5.780sec

checking: ~ [A [AF [[l22<=6 & [EG [p11<=l27] | ~ [[4<=l0 | p10<=3]]]]] U ~ [[[AF [AG [s8<=l43]] | A [l17<=3 U [3<=s6 & p11<=s3]]] | ~ [[l26<=6 & [EG [5<=l40] | [l21<=0 | p13<=l6]]]]]]]]
normalized: ~ [[~ [EG [[~ [[l26<=6 & [[l21<=0 | p13<=l6] | EG [5<=l40]]]] | [[~ [EG [~ [[3<=s6 & p11<=s3]]]] & ~ [E [~ [[3<=s6 & p11<=s3]] U [~ [l17<=3] & ~ [[3<=s6 & p11<=s3]]]]]] | ~ [EG [E [true U ~ [s8<=l43]]]]]]]] & ~ [E [[~ [[l26<=6 & [[l21<=0 | p13<=l6] | EG [5<=l40]]]] | [[~ [EG [~ [[3<=s6 & p11<=s3]]]] & ~ [E [~ [[3<=s6 & p11<=s3]] U [~ [l17<=3] & ~ [[3<=s6 & p11<=s3]]]]]] | ~ [EG [E [true U ~ [s8<=l43]]]]]] U [[~ [[l26<=6 & [[l21<=0 | p13<=l6] | EG [5<=l40]]]] | [[~ [EG [~ [[3<=s6 & p11<=s3]]]] & ~ [E [~ [[3<=s6 & p11<=s3]] U [~ [l17<=3] & ~ [[3<=s6 & p11<=s3]]]]]] | ~ [EG [E [true U ~ [s8<=l43]]]]]] & EG [~ [[l22<=6 & [EG [p11<=l27] | ~ [[4<=l0 | p10<=3]]]]]]]]]]]

abstracting: (p10<=3)
states: 3,955,934,872,799 (12)
abstracting: (4<=l0)
states: 87,423,102 (7)
abstracting: (p11<=l27)
states: 3,955,934,872,799 (12)

EG iterations: 0
abstracting: (l22<=6)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (s8<=l43)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (l17<=3)
states: 3,936,611,990,071 (12)
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0

EG iterations: 0
abstracting: (5<=l40)
states: 2,806,153,263 (9)
.
EG iterations: 1
abstracting: (p13<=l6)
states: 3,955,934,872,799 (12)
abstracting: (l21<=0)
states: 3,955,934,872,799 (12)
abstracting: (l26<=6)
states: 3,955,899,516,896 (12)
abstracting: (s8<=l43)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (l17<=3)
states: 3,936,611,990,071 (12)
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0

EG iterations: 0
abstracting: (5<=l40)
states: 2,806,153,263 (9)
.
EG iterations: 1
abstracting: (p13<=l6)
states: 3,955,934,872,799 (12)
abstracting: (l21<=0)
states: 3,955,934,872,799 (12)
abstracting: (l26<=6)
states: 3,955,899,516,896 (12)
abstracting: (s8<=l43)
states: 3,955,934,872,799 (12)
.
EG iterations: 1
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (l17<=3)
states: 3,936,611,990,071 (12)
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0
abstracting: (p11<=s3)
states: 3,955,934,872,799 (12)
abstracting: (3<=s6)
states: 0

EG iterations: 0
abstracting: (5<=l40)
states: 2,806,153,263 (9)
.
EG iterations: 1
abstracting: (p13<=l6)
states: 3,955,934,872,799 (12)
abstracting: (l21<=0)
states: 3,955,934,872,799 (12)
abstracting: (l26<=6)
states: 3,955,899,516,896 (12)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 2.902sec

totally nodes used: 10723371 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 509091825 151833234 660925059
used/not used/entry size/cache size: 59717881 7390983 16 1024MB
basic ops cache: hits/miss/sum: 36233620 9836531 46070151
used/not used/entry size/cache size: 10781456 5995760 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: 255647 84586 340233
used/not used/entry size/cache size: 84096 8304512 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 57549217
1 8721019
2 735284
3 66282
4 13581
5 6267
6 4192
7 2544
8 1521
9 1064
>= 10 7893

Total processing time: 1m17.355sec


BK_STOP 1679843543504

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

4865 10220 8273 6543
iterations count:423545 (1890), effective:11673 (52)

initing FirstDep: 0m 0.000sec


iterations count:24528 (109), effective:251 (1)

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

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

iterations count:33156 (148), effective:826 (3)

iterations count:6258 (27), effective:86 (0)

iterations count:33200 (148), effective:468 (2)

iterations count:6258 (27), effective:86 (0)

iterations count:33200 (148), effective:468 (2)

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

iterations count:6258 (27), effective:86 (0)

iterations count:33200 (148), effective:468 (2)

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

iterations count:34012 (151), effective:417 (1)

iterations count:8116 (36), effective:137 (0)

iterations count:21183 (94), effective:276 (1)

iterations count:5430 (24), effective:56 (0)

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

iterations count:30054 (134), effective:1336 (5)
6679
iterations count:110312 (492), effective:1370 (6)

iterations count:31513 (140), effective:363 (1)

iterations count:31513 (140), effective:363 (1)

iterations count:31513 (140), effective:363 (1)

iterations count:6604 (29), effective:68 (0)

iterations count:3212 (14), effective:41 (0)

iterations count:5748 (25), effective:63 (0)
4642
iterations count:157025 (701), effective:1773 (7)

iterations count:43145 (192), effective:1208 (5)

iterations count:55154 (246), effective:670 (2)

iterations count:91875 (410), effective:782 (3)

iterations count:25234 (112), effective:855 (3)

iterations count:38771 (173), effective:592 (2)

iterations count:3939 (17), effective:57 (0)

iterations count:25977 (115), effective:964 (4)

iterations count:944 (4), effective:5 (0)

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

iterations count:17173 (76), effective:188 (0)

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

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

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

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

iterations count:40978 (182), effective:547 (2)

iterations count:15247 (68), effective:493 (2)

iterations count:15247 (68), effective:493 (2)

iterations count:15247 (68), effective:493 (2)

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

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