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.r321-tall-167889192600753.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 ResAllocation-PT-R020C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192600753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R020C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678942514198

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=ResAllocation-PT-R020C002
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: ResAllocation_PT_R020C002
(NrP: 80 NrTr: 42 NrArc: 200)

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

net check time: 0m 0.000sec

init dd package: 0m 2.841sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 226 (2.3e+02) #states 11,534,336 (7)



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

checking: EG [1<=r_1_3]
normalized: EG [1<=r_1_3]

abstracting: (1<=r_1_3)
states: 10,223,616 (7)
............................................................................................................................................
EG iterations: 140
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.112sec

checking: A [AG [r_0_1<=1] U 1<=p_1_3]
normalized: [~ [EG [~ [1<=p_1_3]]] & ~ [E [~ [1<=p_1_3] U [~ [1<=p_1_3] & E [true U ~ [r_0_1<=1]]]]]]

abstracting: (r_0_1<=1)
states: 11,534,336 (7)
abstracting: (1<=p_1_3)
states: 1,310,720 (6)
abstracting: (1<=p_1_3)
states: 1,310,720 (6)
abstracting: (1<=p_1_3)
states: 1,310,720 (6)
............................................................................................................................................
EG iterations: 140
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[AF [EF [AF [1<=p_1_4]]] | AF [[EG [1<=p_0_16] & ~ [EF [1<=r_1_15]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[~ [E [true U 1<=r_1_15]] & EG [1<=p_0_16]]]]] | ~ [EG [~ [E [true U ~ [EG [~ [1<=p_1_4]]]]]]]]]]

abstracting: (1<=p_1_4)
states: 1,572,864 (6)
...............................................................................................................................
EG iterations: 127
.
EG iterations: 1
abstracting: (1<=p_0_16)
states: 1,310,720 (6)
..........................................................................................................................................
EG iterations: 138
abstracting: (1<=r_1_15)
states: 7,077,888 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.194sec

checking: ~ [E [EF [EF [A [1<=p_0_13 U r_1_12<=1]]] U ~ [AG [A [p_1_0<=0 U 1<=p_0_0]]]]]
normalized: ~ [E [E [true U E [true U [~ [EG [~ [r_1_12<=1]]] & ~ [E [~ [r_1_12<=1] U [~ [1<=p_0_13] & ~ [r_1_12<=1]]]]]]] U E [true U ~ [[~ [EG [~ [1<=p_0_0]]] & ~ [E [~ [1<=p_0_0] U [~ [p_1_0<=0] & ~ [1<=p_0_0]]]]]]]]]

abstracting: (1<=p_0_0)
states: 5,505,024 (6)
abstracting: (p_1_0<=0)
states: 11,010,048 (7)
abstracting: (1<=p_0_0)
states: 5,505,024 (6)
abstracting: (1<=p_0_0)
states: 5,505,024 (6)
............................................................................................................................................................................
EG iterations: 172
abstracting: (r_1_12<=1)
states: 11,534,336 (7)
abstracting: (1<=p_0_13)
states: 2,097,152 (6)
abstracting: (r_1_12<=1)
states: 11,534,336 (7)
abstracting: (r_1_12<=1)
states: 11,534,336 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.828sec

checking: EF [~ [E [EG [AF [1<=p_0_6]] U ~ [A [E [p_0_16<=1 U 1<=r_0_5] U AG [p_0_18<=1]]]]]]
normalized: E [true U ~ [E [EG [~ [EG [~ [1<=p_0_6]]]] U ~ [[~ [EG [E [true U ~ [p_0_18<=1]]]] & ~ [E [E [true U ~ [p_0_18<=1]] U [~ [E [p_0_16<=1 U 1<=r_0_5]] & E [true U ~ [p_0_18<=1]]]]]]]]]]

abstracting: (p_0_18<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_5)
states: 5,505,024 (6)
abstracting: (p_0_16<=1)
states: 11,534,336 (7)
abstracting: (p_0_18<=1)
states: 11,534,336 (7)
abstracting: (p_0_18<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 3,932,160 (6)
....................................................................................................
EG iterations: 100
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: [A [p_1_13<=1 U EF [EG [AG [p_0_16<=p_1_16]]]] & AX [p_0_16<=1]]
normalized: [~ [EX [~ [p_0_16<=1]]] & [~ [E [~ [E [true U EG [~ [E [true U ~ [p_0_16<=p_1_16]]]]]] U [~ [E [true U EG [~ [E [true U ~ [p_0_16<=p_1_16]]]]]] & ~ [p_1_13<=1]]]] & ~ [EG [~ [E [true U EG [~ [E [true U ~ [p_0_16<=p_1_16]]]]]]]]]]

abstracting: (p_0_16<=p_1_16)
states: 10,223,616 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_1_13<=1)
states: 11,534,336 (7)
abstracting: (p_0_16<=p_1_16)
states: 10,223,616 (7)
.
EG iterations: 1
abstracting: (p_0_16<=p_1_16)
states: 10,223,616 (7)
.
EG iterations: 1
abstracting: (p_0_16<=1)
states: 11,534,336 (7)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AX [EG [[[E [E [r_0_19<=1 U p_1_0<=1] U A [1<=p_0_5 U 1<=r_0_12]] & [1<=r_0_10 | AX [1<=p_1_2]]] & 1<=r_1_14]]]
normalized: ~ [EX [~ [EG [[[[~ [EX [~ [1<=p_1_2]]] | 1<=r_0_10] & E [E [r_0_19<=1 U p_1_0<=1] U [~ [EG [~ [1<=r_0_12]]] & ~ [E [~ [1<=r_0_12] U [~ [1<=p_0_5] & ~ [1<=r_0_12]]]]]]] & 1<=r_1_14]]]]]

abstracting: (1<=r_1_14)
states: 7,340,032 (6)
abstracting: (1<=r_0_12)
states: 5,505,024 (6)
abstracting: (1<=p_0_5)
states: 4,194,304 (6)
abstracting: (1<=r_0_12)
states: 5,505,024 (6)
abstracting: (1<=r_0_12)
states: 5,505,024 (6)
..............................................................................................
EG iterations: 94
abstracting: (p_1_0<=1)
states: 11,534,336 (7)
abstracting: (r_0_19<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_10)
states: 5,505,024 (6)
abstracting: (1<=p_1_2)
states: 1,048,576 (6)
..............................................................................................................................................................................
EG iterations: 173
.-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.211sec

checking: A [EX [[EG [p_1_14<=0] | ~ [EG [p_0_10<=p_1_15]]]] U [~ [[EF [AF [p_1_1<=1]] | E [~ [EX [1<=r_1_0]] U r_1_5<=p_0_1]]] & AF [~ [AG [[p_0_6<=r_1_5 | 1<=p_0_6]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [E [true U ~ [[p_0_6<=r_1_5 | 1<=p_0_6]]]]]] & ~ [[E [true U ~ [EG [~ [p_1_1<=1]]]] | E [~ [EX [1<=r_1_0]] U r_1_5<=p_0_1]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U ~ [[p_0_6<=r_1_5 | 1<=p_0_6]]]]]] & ~ [[E [true U ~ [EG [~ [p_1_1<=1]]]] | E [~ [EX [1<=r_1_0]] U r_1_5<=p_0_1]]]]] U [~ [EX [[~ [EG [p_0_10<=p_1_15]] | EG [p_1_14<=0]]]] & ~ [[~ [EG [~ [E [true U ~ [[p_0_6<=r_1_5 | 1<=p_0_6]]]]]] & ~ [[E [true U ~ [EG [~ [p_1_1<=1]]]] | E [~ [EX [1<=r_1_0]] U r_1_5<=p_0_1]]]]]]]]]

abstracting: (r_1_5<=p_0_1)
states: 6,422,528 (6)
abstracting: (1<=r_1_0)
states: 11,010,048 (7)
.abstracting: (p_1_1<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 3,932,160 (6)
abstracting: (p_0_6<=r_1_5)
states: 11,534,336 (7)

EG iterations: 0
abstracting: (p_1_14<=0)
states: 7,340,032 (6)
...........................................................................................................
EG iterations: 107
abstracting: (p_0_10<=p_1_15)
states: 9,437,184 (6)
........................................................................
EG iterations: 72
.abstracting: (r_1_5<=p_0_1)
states: 6,422,528 (6)
abstracting: (1<=r_1_0)
states: 11,010,048 (7)
.abstracting: (p_1_1<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 3,932,160 (6)
abstracting: (p_0_6<=r_1_5)
states: 11,534,336 (7)

EG iterations: 0
abstracting: (r_1_5<=p_0_1)
states: 6,422,528 (6)
abstracting: (1<=r_1_0)
states: 11,010,048 (7)
.abstracting: (p_1_1<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 3,932,160 (6)
abstracting: (p_0_6<=r_1_5)
states: 11,534,336 (7)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.539sec

checking: [AX [~ [[[~ [AG [r_1_16<=1]] | p_1_10<=r_0_1] & A [AG [1<=p_0_0] U EG [p_1_8<=0]]]]] | ~ [[AF [[~ [AF [p_1_11<=0]] | [r_0_16<=0 & E [r_0_1<=1 U 1<=p_0_4]]]] | AX [[p_0_2<=1 | AF [1<=r_0_16]]]]]]
normalized: [~ [[~ [EX [~ [[~ [EG [~ [1<=r_0_16]]] | p_0_2<=1]]]] | ~ [EG [~ [[[E [r_0_1<=1 U 1<=p_0_4] & r_0_16<=0] | EG [~ [p_1_11<=0]]]]]]]] | ~ [EX [[[~ [EG [~ [EG [p_1_8<=0]]]] & ~ [E [~ [EG [p_1_8<=0]] U [E [true U ~ [1<=p_0_0]] & ~ [EG [p_1_8<=0]]]]]] & [p_1_10<=r_0_1 | E [true U ~ [r_1_16<=1]]]]]]]

abstracting: (r_1_16<=1)
states: 11,534,336 (7)
abstracting: (p_1_10<=r_0_1)
states: 9,830,400 (6)
abstracting: (p_1_8<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
abstracting: (1<=p_0_0)
states: 5,505,024 (6)
abstracting: (p_1_8<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
abstracting: (p_1_8<=0)
states: 8,912,896 (6)
...............................................................................................
EG iterations: 95
.
EG iterations: 1
.abstracting: (p_1_11<=0)
states: 8,126,464 (6)
..................................................................................
EG iterations: 82
abstracting: (r_0_16<=0)
states: 6,029,312 (6)
abstracting: (1<=p_0_4)
states: 4,456,448 (6)
abstracting: (r_0_1<=1)
states: 11,534,336 (7)
.....................................................................................................................................................................................................................................
EG iterations: 229
abstracting: (p_0_2<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_16)
states: 5,505,024 (6)
..........................................................................................................................................
EG iterations: 138
.-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.977sec

checking: E [[[~ [EG [A [p_1_8<=0 U p_1_4<=p_0_12]]] | E [[~ [r_1_19<=p_0_16] | [[1<=r_1_15 | 1<=p_0_2] | ~ [1<=p_0_0]]] U A [r_1_16<=r_0_19 U r_1_0<=1]]] | AX [EF [AG [r_0_10<=1]]]] U EG [r_1_8<=1]]
normalized: E [[~ [EX [~ [E [true U ~ [E [true U ~ [r_0_10<=1]]]]]]] | [~ [EG [[~ [EG [~ [p_1_4<=p_0_12]]] & ~ [E [~ [p_1_4<=p_0_12] U [~ [p_1_4<=p_0_12] & ~ [p_1_8<=0]]]]]]] | E [[~ [r_1_19<=p_0_16] | [[1<=r_1_15 | 1<=p_0_2] | ~ [1<=p_0_0]]] U [~ [EG [~ [r_1_0<=1]]] & ~ [E [~ [r_1_0<=1] U [~ [r_1_16<=r_0_19] & ~ [r_1_0<=1]]]]]]]] U EG [r_1_8<=1]]

abstracting: (r_1_8<=1)
states: 11,534,336 (7)

EG iterations: 0
abstracting: (r_1_0<=1)
states: 11,534,336 (7)
abstracting: (r_1_16<=r_0_19)
states: 7,864,320 (6)
abstracting: (r_1_0<=1)
states: 11,534,336 (7)
abstracting: (r_1_0<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p_0_0)
states: 5,505,024 (6)
abstracting: (1<=p_0_2)
states: 4,980,736 (6)
abstracting: (1<=r_1_15)
states: 7,077,888 (6)
abstracting: (r_1_19<=p_0_16)
states: 6,291,456 (6)
abstracting: (p_1_8<=0)
states: 8,912,896 (6)
abstracting: (p_1_4<=p_0_12)
states: 9,961,472 (6)
abstracting: (p_1_4<=p_0_12)
states: 9,961,472 (6)
abstracting: (p_1_4<=p_0_12)
states: 9,961,472 (6)
............................................................................................................................
EG iterations: 124
...............................................................................................................................
EG iterations: 127
abstracting: (r_0_10<=1)
states: 11,534,336 (7)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: ~ [A [[~ [[[~ [AF [r_1_19<=p_0_11]] & ~ [r_1_11<=0]] | EG [~ [r_0_3<=0]]]] & [AG [[EF [p_1_14<=p_0_18] | p_0_1<=1]] | ~ [[AG [r_1_7<=r_0_8] & ~ [p_1_19<=p_0_15]]]]] U [AX [~ [EF [r_1_4<=0]]] | ~ [EG [~ [AG [r_0_16<=0]]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [E [true U ~ [r_0_16<=0]]]] | ~ [EX [E [true U r_1_4<=0]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [r_0_16<=0]]]] | ~ [EX [E [true U r_1_4<=0]]]]] U [~ [[[~ [[~ [p_1_19<=p_0_15] & ~ [E [true U ~ [r_1_7<=r_0_8]]]]] | ~ [E [true U ~ [[p_0_1<=1 | E [true U p_1_14<=p_0_18]]]]]] & ~ [[EG [~ [r_0_3<=0]] | [~ [r_1_11<=0] & EG [~ [r_1_19<=p_0_11]]]]]]] & ~ [[~ [EG [E [true U ~ [r_0_16<=0]]]] | ~ [EX [E [true U r_1_4<=0]]]]]]]]]]

abstracting: (r_1_4<=0)
states: 1,572,864 (6)
.abstracting: (r_0_16<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
abstracting: (r_1_19<=p_0_11)
states: 6,946,816 (6)
..................................................................................................................................................................................................................................................................
EG iterations: 258
abstracting: (r_1_11<=0)
states: 3,407,872 (6)
abstracting: (r_0_3<=0)
states: 6,029,312 (6)
........................................................................................................................................................................................................................................................................................
EG iterations: 280
abstracting: (p_1_14<=p_0_18)
states: 7,340,032 (6)
abstracting: (p_0_1<=1)
states: 11,534,336 (7)
abstracting: (r_1_7<=r_0_8)
states: 6,684,672 (6)
abstracting: (p_1_19<=p_0_15)
states: 6,684,672 (6)
abstracting: (r_1_4<=0)
states: 1,572,864 (6)
.abstracting: (r_0_16<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
abstracting: (r_1_4<=0)
states: 1,572,864 (6)
.abstracting: (r_0_16<=0)
states: 6,029,312 (6)
...........................................................................................................................................................................................
EG iterations: 187
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.569sec

checking: AG [A [[[1<=r_1_3 & ~ [AX [r_0_10<=p_0_8]]] & A [E [r_0_8<=0 U r_0_15<=p_0_2] U r_0_5<=1]] U [[[[~ [r_0_3<=r_0_5] | ~ [r_0_18<=1]] | p_1_9<=0] & [p_0_13<=r_0_14 | r_1_15<=1]] & AF [1<=r_0_13]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [EG [~ [1<=r_0_13]]] & [[p_0_13<=r_0_14 | r_1_15<=1] & [p_1_9<=0 | [~ [r_0_18<=1] | ~ [r_0_3<=r_0_5]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=r_0_13]]] & [[p_0_13<=r_0_14 | r_1_15<=1] & [p_1_9<=0 | [~ [r_0_18<=1] | ~ [r_0_3<=r_0_5]]]]]] U [~ [[[~ [EG [~ [r_0_5<=1]]] & ~ [E [~ [r_0_5<=1] U [~ [E [r_0_8<=0 U r_0_15<=p_0_2]] & ~ [r_0_5<=1]]]]] & [1<=r_1_3 & EX [~ [r_0_10<=p_0_8]]]]] & ~ [[~ [EG [~ [1<=r_0_13]]] & [[p_0_13<=r_0_14 | r_1_15<=1] & [p_1_9<=0 | [~ [r_0_18<=1] | ~ [r_0_3<=r_0_5]]]]]]]]]]]]]

abstracting: (r_0_3<=r_0_5)
states: 8,650,752 (6)
abstracting: (r_0_18<=1)
states: 11,534,336 (7)
abstracting: (p_1_9<=0)
states: 8,650,752 (6)
abstracting: (r_1_15<=1)
states: 11,534,336 (7)
abstracting: (p_0_13<=r_0_14)
states: 10,354,688 (7)
abstracting: (1<=r_0_13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (r_0_10<=p_0_8)
states: 7,602,176 (6)
.abstracting: (1<=r_1_3)
states: 10,223,616 (7)
abstracting: (r_0_5<=1)
states: 11,534,336 (7)
abstracting: (r_0_15<=p_0_2)
states: 8,388,608 (6)
abstracting: (r_0_8<=0)
states: 6,029,312 (6)
abstracting: (r_0_5<=1)
states: 11,534,336 (7)
abstracting: (r_0_5<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (r_0_3<=r_0_5)
states: 8,650,752 (6)
abstracting: (r_0_18<=1)
states: 11,534,336 (7)
abstracting: (p_1_9<=0)
states: 8,650,752 (6)
abstracting: (r_1_15<=1)
states: 11,534,336 (7)
abstracting: (p_0_13<=r_0_14)
states: 10,354,688 (7)
abstracting: (1<=r_0_13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
abstracting: (r_0_3<=r_0_5)
states: 8,650,752 (6)
abstracting: (r_0_18<=1)
states: 11,534,336 (7)
abstracting: (p_1_9<=0)
states: 8,650,752 (6)
abstracting: (r_1_15<=1)
states: 11,534,336 (7)
abstracting: (p_0_13<=r_0_14)
states: 10,354,688 (7)
abstracting: (1<=r_0_13)
states: 5,505,024 (6)
......................................................................................................
EG iterations: 102
...............................................................................
EG iterations: 79
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.952sec

checking: EF [[EG [~ [[~ [p_1_16<=0] | EG [p_0_15<=1]]]] | [AG [AX [[p_0_17<=1 & p_1_6<=r_0_3]]] & ~ [[~ [A [1<=r_1_8 U p_1_2<=0]] | [[A [p_1_17<=1 U r_0_18<=p_0_13] | [1<=p_0_0 | r_1_1<=0]] | [[1<=r_1_17 & p_1_4<=1] & AG [r_0_14<=p_1_14]]]]]]]]
normalized: E [true U [EG [~ [[EG [p_0_15<=1] | ~ [p_1_16<=0]]]] | [~ [E [true U EX [~ [[p_0_17<=1 & p_1_6<=r_0_3]]]]] & ~ [[~ [[~ [EG [~ [p_1_2<=0]]] & ~ [E [~ [p_1_2<=0] U [~ [1<=r_1_8] & ~ [p_1_2<=0]]]]]] | [[[1<=p_0_0 | r_1_1<=0] | [~ [E [~ [r_0_18<=p_0_13] U [~ [r_0_18<=p_0_13] & ~ [p_1_17<=1]]]] & ~ [EG [~ [r_0_18<=p_0_13]]]]] | [~ [E [true U ~ [r_0_14<=p_1_14]]] & [1<=r_1_17 & p_1_4<=1]]]]]]]]

abstracting: (p_1_4<=1)
states: 11,534,336 (7)
abstracting: (1<=r_1_17)
states: 6,553,600 (6)
abstracting: (r_0_14<=p_1_14)
states: 6,029,312 (6)
abstracting: (r_0_18<=p_0_13)
states: 6,946,816 (6)
.........................................................................................................................................................................................................................................................................
EG iterations: 265
abstracting: (p_1_17<=1)
states: 11,534,336 (7)
abstracting: (r_0_18<=p_0_13)
states: 6,946,816 (6)
abstracting: (r_0_18<=p_0_13)
states: 6,946,816 (6)
abstracting: (r_1_1<=0)
states: 786,432 (5)
abstracting: (1<=p_0_0)
states: 5,505,024 (6)
abstracting: (p_1_2<=0)
states: 10,485,760 (7)
abstracting: (1<=r_1_8)
states: 8,912,896 (6)
abstracting: (p_1_2<=0)
states: 10,485,760 (7)
abstracting: (p_1_2<=0)
states: 10,485,760 (7)
.
EG iterations: 1
abstracting: (p_1_6<=r_0_3)
states: 10,354,688 (7)
abstracting: (p_0_17<=1)
states: 11,534,336 (7)
.abstracting: (p_1_16<=0)
states: 6,815,744 (6)
abstracting: (p_0_15<=1)
states: 11,534,336 (7)

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

FORMULA ResAllocation-PT-R020C002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.706sec

checking: [E [[EX [[~ [1<=r_1_15] | 1<=r_1_13]] & r_0_13<=r_0_8] U ~ [[~ [EX [p_1_4<=1]] | r_0_18<=p_1_1]]] & [AF [[EG [[p_0_2<=1 | ~ [r_0_2<=p_0_13]]] & EF [1<=p_1_18]]] & [E [r_0_7<=p_0_19 U r_1_8<=r_1_6] | AF [[~ [1<=p_1_1] | r_0_12<=0]]]]]
normalized: [[[~ [EG [~ [[r_0_12<=0 | ~ [1<=p_1_1]]]]] | E [r_0_7<=p_0_19 U r_1_8<=r_1_6]] & ~ [EG [~ [[E [true U 1<=p_1_18] & EG [[p_0_2<=1 | ~ [r_0_2<=p_0_13]]]]]]]] & E [[r_0_13<=r_0_8 & EX [[1<=r_1_13 | ~ [1<=r_1_15]]]] U ~ [[r_0_18<=p_1_1 | ~ [EX [p_1_4<=1]]]]]]

abstracting: (p_1_4<=1)
states: 11,534,336 (7)
.abstracting: (r_0_18<=p_1_1)
states: 6,422,528 (6)
abstracting: (1<=r_1_15)
states: 7,077,888 (6)
abstracting: (1<=r_1_13)
states: 7,602,176 (6)
.abstracting: (r_0_13<=r_0_8)
states: 8,650,752 (6)
abstracting: (r_0_2<=p_0_13)
states: 7,077,888 (6)
abstracting: (p_0_2<=1)
states: 11,534,336 (7)

EG iterations: 0
abstracting: (1<=p_1_18)
states: 5,242,880 (6)
.
EG iterations: 1
abstracting: (r_1_8<=r_1_6)
states: 10,485,760 (7)
abstracting: (r_0_7<=p_0_19)
states: 6,291,456 (6)
abstracting: (1<=p_1_1)
states: 786,432 (5)
abstracting: (r_0_12<=0)
states: 6,029,312 (6)
.........................................................
EG iterations: 57
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.140sec

checking: [[[[AX [AG [~ [1<=p_1_13]]] | AG [[[AF [p_1_13<=1] | p_0_9<=1] | r_1_14<=r_1_6]]] & AF [[r_1_5<=0 | [[AX [p_1_7<=1] | E [1<=p_1_13 U r_1_3<=r_1_7]] | AG [1<=r_1_4]]]]] & A [[AF [AX [p_1_6<=0]] | r_0_9<=0] U E [r_1_10<=1 U ~ [[[p_0_18<=1 | p_0_1<=p_1_11] | A [r_0_16<=p_1_12 U 1<=r_0_3]]]]]] & [EF [[AF [p_1_9<=p_0_9] & ~ [AX [~ [r_0_3<=p_0_2]]]]] | AX [[[p_1_7<=p_0_17 | EX [EX [1<=p_0_7]]] & [[p_1_15<=1 | AG [p_1_6<=0]] | AX [AF [r_1_2<=p_1_12]]]]]]]
normalized: [[~ [EX [~ [[[~ [EX [EG [~ [r_1_2<=p_1_12]]]] | [p_1_15<=1 | ~ [E [true U ~ [p_1_6<=0]]]]] & [p_1_7<=p_0_17 | EX [EX [1<=p_0_7]]]]]]] | E [true U [EX [r_0_3<=p_0_2] & ~ [EG [~ [p_1_9<=p_0_9]]]]]] & [[~ [EG [~ [E [r_1_10<=1 U ~ [[[~ [EG [~ [1<=r_0_3]]] & ~ [E [~ [1<=r_0_3] U [~ [r_0_16<=p_1_12] & ~ [1<=r_0_3]]]]] | [p_0_18<=1 | p_0_1<=p_1_11]]]]]]] & ~ [E [~ [E [r_1_10<=1 U ~ [[[~ [EG [~ [1<=r_0_3]]] & ~ [E [~ [1<=r_0_3] U [~ [r_0_16<=p_1_12] & ~ [1<=r_0_3]]]]] | [p_0_18<=1 | p_0_1<=p_1_11]]]]] U [~ [[r_0_9<=0 | ~ [EG [EX [~ [p_1_6<=0]]]]]] & ~ [E [r_1_10<=1 U ~ [[[~ [EG [~ [1<=r_0_3]]] & ~ [E [~ [1<=r_0_3] U [~ [r_0_16<=p_1_12] & ~ [1<=r_0_3]]]]] | [p_0_18<=1 | p_0_1<=p_1_11]]]]]]]]] & [~ [EG [~ [[r_1_5<=0 | [~ [E [true U ~ [1<=r_1_4]]] | [E [1<=p_1_13 U r_1_3<=r_1_7] | ~ [EX [~ [p_1_7<=1]]]]]]]]] & [~ [E [true U ~ [[r_1_14<=r_1_6 | [p_0_9<=1 | ~ [EG [~ [p_1_13<=1]]]]]]]] | ~ [EX [E [true U 1<=p_1_13]]]]]]]

abstracting: (1<=p_1_13)
states: 3,932,160 (6)
.abstracting: (p_1_13<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (p_0_9<=1)
states: 11,534,336 (7)
abstracting: (r_1_14<=r_1_6)
states: 10,485,760 (7)
abstracting: (p_1_7<=1)
states: 11,534,336 (7)
.abstracting: (r_1_3<=r_1_7)
states: 9,830,400 (6)
abstracting: (1<=p_1_13)
states: 3,932,160 (6)
abstracting: (1<=r_1_4)
states: 9,961,472 (6)
abstracting: (r_1_5<=0)
states: 1,835,008 (6)
.
EG iterations: 1
abstracting: (p_0_1<=p_1_11)
states: 7,733,248 (6)
abstracting: (p_0_18<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (r_0_16<=p_1_12)
states: 7,864,320 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
..........................................................................................................................................
EG iterations: 138
abstracting: (r_1_10<=1)
states: 11,534,336 (7)
abstracting: (p_1_6<=0)
states: 9,437,184 (6)
...................................................................................................................................................................................
EG iterations: 178
abstracting: (r_0_9<=0)
states: 6,029,312 (6)
abstracting: (p_0_1<=p_1_11)
states: 7,733,248 (6)
abstracting: (p_0_18<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (r_0_16<=p_1_12)
states: 7,864,320 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
..........................................................................................................................................
EG iterations: 138
abstracting: (r_1_10<=1)
states: 11,534,336 (7)
abstracting: (p_0_1<=p_1_11)
states: 7,733,248 (6)
abstracting: (p_0_18<=1)
states: 11,534,336 (7)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (r_0_16<=p_1_12)
states: 7,864,320 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
..........................................................................................................................................
EG iterations: 138
abstracting: (r_1_10<=1)
states: 11,534,336 (7)

EG iterations: 0
abstracting: (p_1_9<=p_0_9)
states: 8,650,752 (6)
....................................................................................
EG iterations: 84
abstracting: (r_0_3<=p_0_2)
states: 8,388,608 (6)
.abstracting: (1<=p_0_7)
states: 3,670,016 (6)
..abstracting: (p_1_7<=p_0_17)
states: 9,175,040 (6)
abstracting: (p_1_6<=0)
states: 9,437,184 (6)
abstracting: (p_1_15<=1)
states: 11,534,336 (7)
abstracting: (r_1_2<=p_1_12)
states: 4,194,304 (6)
...................................................................................................
EG iterations: 99
..-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.864sec

checking: [[~ [EX [[AG [p_0_3<=1] & ~ [[r_1_2<=1 | p_0_3<=0]]]]] & [AX [[[EX [1<=p_0_7] | AF [p_0_6<=0]] & [[~ [p_0_10<=1] | AX [1<=p_0_5]] & [1<=r_0_9 & [r_0_8<=0 & r_1_17<=r_0_14]]]]] | [[[E [[p_0_1<=1 | 1<=r_0_6] U [p_0_14<=0 & r_0_12<=p_0_9]] | ~ [AX [1<=r_1_4]]] | EG [EX [1<=r_1_14]]] & [~ [EF [E [p_1_8<=r_0_5 U r_0_12<=0]]] | [[AG [1<=p_1_18] & E [p_0_7<=1 U r_0_3<=0]] & A [EF [r_0_4<=0] U AG [1<=r_0_3]]]]]]] | AG [[~ [r_0_5<=0] | [EX [[A [1<=p_1_17 U r_0_9<=1] | EF [p_0_3<=0]]] | EF [~ [1<=p_0_2]]]]]]
normalized: [~ [E [true U ~ [[~ [r_0_5<=0] | [E [true U ~ [1<=p_0_2]] | EX [[E [true U p_0_3<=0] | [~ [EG [~ [r_0_9<=1]]] & ~ [E [~ [r_0_9<=1] U [~ [1<=p_1_17] & ~ [r_0_9<=1]]]]]]]]]]]] | [~ [EX [[~ [E [true U ~ [p_0_3<=1]]] & ~ [[r_1_2<=1 | p_0_3<=0]]]]] & [~ [EX [~ [[[[~ [EX [~ [1<=p_0_5]]] | ~ [p_0_10<=1]] & [1<=r_0_9 & [r_0_8<=0 & r_1_17<=r_0_14]]] & [~ [EG [~ [p_0_6<=0]]] | EX [1<=p_0_7]]]]]] | [[EG [EX [1<=r_1_14]] | [EX [~ [1<=r_1_4]] | E [[p_0_1<=1 | 1<=r_0_6] U [p_0_14<=0 & r_0_12<=p_0_9]]]] & [~ [E [true U E [p_1_8<=r_0_5 U r_0_12<=0]]] | [[~ [EG [E [true U ~ [1<=r_0_3]]]] & ~ [E [E [true U ~ [1<=r_0_3]] U [~ [E [true U r_0_4<=0]] & E [true U ~ [1<=r_0_3]]]]]] & [~ [E [true U ~ [1<=p_1_18]]] & E [p_0_7<=1 U r_0_3<=0]]]]]]]]

abstracting: (r_0_3<=0)
states: 6,029,312 (6)
abstracting: (p_0_7<=1)
states: 11,534,336 (7)
abstracting: (1<=p_1_18)
states: 5,242,880 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (r_0_4<=0)
states: 6,029,312 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)
abstracting: (1<=r_0_3)
states: 5,505,024 (6)

EG iterations: 0
abstracting: (r_0_12<=0)
states: 6,029,312 (6)
abstracting: (p_1_8<=r_0_5)
states: 10,092,544 (7)
abstracting: (r_0_12<=p_0_9)
states: 7,471,104 (6)
abstracting: (p_0_14<=0)
states: 9,699,328 (6)
abstracting: (1<=r_0_6)
states: 5,505,024 (6)
abstracting: (p_0_1<=1)
states: 11,534,336 (7)
abstracting: (1<=r_1_4)
states: 9,961,472 (6)
.abstracting: (1<=r_1_14)
states: 7,340,032 (6)
...............................................................................................................................................................................................
EG iterations: 190
abstracting: (1<=p_0_7)
states: 3,670,016 (6)
.abstracting: (p_0_6<=0)
states: 7,602,176 (6)
........................................................................................
EG iterations: 88
abstracting: (r_1_17<=r_0_14)
states: 8,126,464 (6)
abstracting: (r_0_8<=0)
states: 6,029,312 (6)
abstracting: (1<=r_0_9)
states: 5,505,024 (6)
abstracting: (p_0_10<=1)
states: 11,534,336 (7)
abstracting: (1<=p_0_5)
states: 4,194,304 (6)
..abstracting: (p_0_3<=0)
states: 6,815,744 (6)
abstracting: (r_1_2<=1)
states: 11,534,336 (7)
abstracting: (p_0_3<=1)
states: 11,534,336 (7)
.abstracting: (r_0_9<=1)
states: 11,534,336 (7)
abstracting: (1<=p_1_17)
states: 4,980,736 (6)
abstracting: (r_0_9<=1)
states: 11,534,336 (7)
abstracting: (r_0_9<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (p_0_3<=0)
states: 6,815,744 (6)
.abstracting: (1<=p_0_2)
states: 4,980,736 (6)
abstracting: (r_0_5<=0)
states: 6,029,312 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.856sec

totally nodes used: 12662851 (1.3e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5568694 19773795 25342489
used/not used/entry size/cache size: 24410665 42698199 16 1024MB
basic ops cache: hits/miss/sum: 1117180 4030332 5147512
used/not used/entry size/cache size: 6619138 10158078 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: 2103 6441 8544
used/not used/entry size/cache size: 6439 8382169 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 56219007
1 9350954
2 1332269
3 182014
4 22025
5 2370
6 209
7 15
8 1
9 0
>= 10 0

Total processing time: 0m15.720sec


BK_STOP 1678942529967

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1569 (37), effective:420 (10)

initing FirstDep: 0m 0.000sec


iterations count:572 (13), effective:152 (3)

iterations count:89 (2), effective:16 (0)

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

iterations count:788 (18), effective:210 (5)

iterations count:119 (2), effective:20 (0)

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

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

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

iterations count:115 (2), effective:21 (0)

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

iterations count:553 (13), effective:170 (4)

iterations count:86 (2), effective:16 (0)

iterations count:553 (13), effective:170 (4)

iterations count:86 (2), effective:16 (0)

iterations count:553 (13), effective:170 (4)

iterations count:86 (2), effective:16 (0)

iterations count:66 (1), effective:6 (0)

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

iterations count:137 (3), effective:30 (0)

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

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

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

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

iterations count:1030 (24), effective:271 (6)

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

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

iterations count:119 (2), effective:20 (0)

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

iterations count:103 (2), effective:20 (0)

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

iterations count:80 (1), effective:12 (0)

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

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

iterations count:572 (13), effective:152 (3)

iterations count:104 (2), effective:21 (0)

iterations count:86 (2), effective:15 (0)

iterations count:360 (8), effective:95 (2)

iterations count:572 (13), effective:152 (3)

iterations count:104 (2), effective:21 (0)

iterations count:572 (13), effective:152 (3)

iterations count:104 (2), effective:21 (0)

iterations count:120 (2), effective:24 (0)

iterations count:447 (10), effective:130 (3)

iterations count:701 (16), effective:187 (4)

iterations count:106 (2), effective:21 (0)

iterations count:80 (1), effective:12 (0)

iterations count:1356 (32), effective:381 (9)

iterations count:145 (3), effective:35 (0)

iterations count:53 (1), effective:5 (0)

iterations count:80 (1), effective:12 (0)

iterations count:149 (3), effective:35 (0)

iterations count:54 (1), effective:4 (0)

iterations count:572 (13), effective:152 (3)

iterations count:111 (2), effective:23 (0)

iterations count:111 (2), effective:23 (0)

iterations count:870 (20), effective:232 (5)

iterations count:111 (2), effective:23 (0)

iterations count:607 (14), effective:163 (3)

iterations count:450 (10), effective:119 (2)

iterations count:592 (14), effective:157 (3)

iterations count:99 (2), effective:19 (0)

iterations count:592 (14), effective:157 (3)

iterations count:533 (12), effective:141 (3)

iterations count:592 (14), effective:157 (3)

iterations count:592 (14), effective:157 (3)

iterations count:205 (4), effective:49 (1)

iterations count:68 (1), effective:8 (0)

iterations count:221 (5), effective:54 (1)

iterations count:106 (2), effective:17 (0)

iterations count:110 (2), effective:18 (0)

iterations count:3971 (94), effective:1147 (27)

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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r321-tall-167889192600753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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