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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 14K 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-R003C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940418588

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-R003C002
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_R003C002
(NrP: 12 NrTr: 8 NrArc: 30)

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

net check time: 0m 0.000sec

init dd package: 0m 2.869sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 39 (3.9e+01) #states 20



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

checking: EX [p_1_2<=0]
normalized: EX [p_1_2<=0]

abstracting: (p_1_2<=0)
states: 12
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[EG [r_0_2<=1] | AF [EG [~ [E [1<=p_0_0 U p_0_0<=1]]]]]]
normalized: ~ [[~ [EG [~ [EG [~ [E [1<=p_0_0 U p_0_0<=1]]]]]] | EG [r_0_2<=1]]]

abstracting: (r_0_2<=1)
states: 20

EG iterations: 0
abstracting: (p_0_0<=1)
states: 20
abstracting: (1<=p_0_0)
states: 8
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [AF [~ [[1<=r_0_1 | r_0_1<=p_0_1]]]]]
normalized: ~ [E [true U ~ [EG [[1<=r_0_1 | r_0_1<=p_0_1]]]]]

abstracting: (r_0_1<=p_0_1)
states: 12
abstracting: (1<=r_0_1)
states: 8

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[EG [AG [[AG [p_0_2<=p_1_2] | [1<=r_1_0 | r_0_0<=1]]]] & r_0_1<=1]]
normalized: ~ [E [true U ~ [[EG [~ [E [true U ~ [[~ [E [true U ~ [p_0_2<=p_1_2]]] | [1<=r_1_0 | r_0_0<=1]]]]]] & r_0_1<=1]]]]

abstracting: (r_0_1<=1)
states: 20
abstracting: (r_0_0<=1)
states: 20
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_0_2<=p_1_2)
states: 16

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [p_0_2<=r_0_1 U [p_1_0<=r_1_0 | ~ [1<=r_0_0]]]
normalized: E [p_0_2<=r_0_1 U [~ [1<=r_0_0] | p_1_0<=r_1_0]]

abstracting: (p_1_0<=r_1_0)
states: 16
abstracting: (1<=r_0_0)
states: 8
abstracting: (p_0_2<=r_0_1)
states: 18
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EX [EG [E [[AG [1<=r_0_0] | EX [r_0_1<=r_0_0]] U [p_0_1<=r_0_0 & [[p_1_2<=1 & p_1_1<=0] & ~ [1<=r_0_1]]]]]]
normalized: EX [EG [E [[EX [r_0_1<=r_0_0] | ~ [E [true U ~ [1<=r_0_0]]]] U [[~ [1<=r_0_1] & [p_1_2<=1 & p_1_1<=0]] & p_0_1<=r_0_0]]]]

abstracting: (p_0_1<=r_0_0)
states: 17
abstracting: (p_1_1<=0)
states: 14
abstracting: (p_1_2<=1)
states: 20
abstracting: (1<=r_0_1)
states: 8
abstracting: (1<=r_0_0)
states: 8
abstracting: (r_0_1<=r_0_0)
states: 15
....
EG iterations: 3
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[[AG [~ [[1<=r_1_1 & r_0_2<=1]]] | AX [[r_1_1<=r_1_0 & EF [p_1_2<=r_1_1]]]] & [AG [EG [EF [1<=p_0_1]]] & r_0_1<=r_0_2]]]
normalized: ~ [EG [~ [[[~ [EX [~ [[E [true U p_1_2<=r_1_1] & r_1_1<=r_1_0]]]] | ~ [E [true U [1<=r_1_1 & r_0_2<=1]]]] & [~ [E [true U ~ [EG [E [true U 1<=p_0_1]]]]] & r_0_1<=r_0_2]]]]]

abstracting: (r_0_1<=r_0_2)
states: 15
abstracting: (1<=p_0_1)
states: 6
.
EG iterations: 1
abstracting: (r_0_2<=1)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (r_1_1<=r_1_0)
states: 18
abstracting: (p_1_2<=r_1_1)
states: 17
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[EX [E [1<=r_0_1 U r_0_0<=0]] & [[~ [AX [p_0_0<=r_0_1]] & r_1_2<=r_1_2] & EF [~ [1<=r_1_0]]]] | ~ [EF [EF [E [p_1_1<=p_1_0 U p_1_2<=p_0_1]]]]]]
normalized: ~ [E [true U ~ [[[EX [E [1<=r_0_1 U r_0_0<=0]] & [E [true U ~ [1<=r_1_0]] & [EX [~ [p_0_0<=r_0_1]] & r_1_2<=r_1_2]]] | ~ [E [true U E [true U E [p_1_1<=p_1_0 U p_1_2<=p_0_1]]]]]]]]

abstracting: (p_1_2<=p_0_1)
states: 14
abstracting: (p_1_1<=p_1_0)
states: 16
abstracting: (r_1_2<=r_1_2)
states: 20
abstracting: (p_0_0<=r_0_1)
states: 15
.abstracting: (1<=r_1_0)
states: 16
abstracting: (r_0_0<=0)
states: 12
abstracting: (1<=r_0_1)
states: 8
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EG [A [r_1_1<=p_1_1 U AF [[[[r_0_1<=0 & 1<=r_0_2] | E [1<=r_0_1 U 1<=p_1_0]] | [[1<=r_0_0 & r_0_1<=p_0_1] | [p_0_0<=0 & 1<=r_1_2]]]]]]
normalized: EG [[~ [EG [EG [~ [[[[p_0_0<=0 & 1<=r_1_2] | [1<=r_0_0 & r_0_1<=p_0_1]] | [E [1<=r_0_1 U 1<=p_1_0] | [r_0_1<=0 & 1<=r_0_2]]]]]]] & ~ [E [EG [~ [[[[p_0_0<=0 & 1<=r_1_2] | [1<=r_0_0 & r_0_1<=p_0_1]] | [E [1<=r_0_1 U 1<=p_1_0] | [r_0_1<=0 & 1<=r_0_2]]]]] U [EG [~ [[[[p_0_0<=0 & 1<=r_1_2] | [1<=r_0_0 & r_0_1<=p_0_1]] | [E [1<=r_0_1 U 1<=p_1_0] | [r_0_1<=0 & 1<=r_0_2]]]]] & ~ [r_1_1<=p_1_1]]]]]]

abstracting: (r_1_1<=p_1_1)
states: 6
abstracting: (1<=r_0_2)
states: 8
abstracting: (r_0_1<=0)
states: 12
abstracting: (1<=p_1_0)
states: 4
abstracting: (1<=r_0_1)
states: 8
abstracting: (r_0_1<=p_0_1)
states: 12
abstracting: (1<=r_0_0)
states: 8
abstracting: (1<=r_1_2)
states: 12
abstracting: (p_0_0<=0)
states: 12
....
EG iterations: 4
abstracting: (1<=r_0_2)
states: 8
abstracting: (r_0_1<=0)
states: 12
abstracting: (1<=p_1_0)
states: 4
abstracting: (1<=r_0_1)
states: 8
abstracting: (r_0_1<=p_0_1)
states: 12
abstracting: (1<=r_0_0)
states: 8
abstracting: (1<=r_1_2)
states: 12
abstracting: (p_0_0<=0)
states: 12
....
EG iterations: 4
abstracting: (1<=r_0_2)
states: 8
abstracting: (r_0_1<=0)
states: 12
abstracting: (1<=p_1_0)
states: 4
abstracting: (1<=r_0_1)
states: 8
abstracting: (r_0_1<=p_0_1)
states: 12
abstracting: (1<=r_0_0)
states: 8
abstracting: (1<=r_1_2)
states: 12
abstracting: (p_0_0<=0)
states: 12
....
EG iterations: 4
.
EG iterations: 1
...
EG iterations: 3
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [EG [~ [[[[~ [1<=p_0_2] | E [p_1_0<=p_1_1 U p_1_1<=p_1_2]] | EX [p_1_1<=0]] | [p_0_2<=p_0_0 & [EX [p_1_2<=r_1_0] & ~ [1<=p_1_1]]]]]]]
normalized: ~ [E [true U ~ [EG [~ [[[[~ [1<=p_0_2] | E [p_1_0<=p_1_1 U p_1_1<=p_1_2]] | EX [p_1_1<=0]] | [[~ [1<=p_1_1] & EX [p_1_2<=r_1_0]] & p_0_2<=p_0_0]]]]]]]

abstracting: (p_0_2<=p_0_0)
states: 18
abstracting: (p_1_2<=r_1_0)
states: 18
.abstracting: (1<=p_1_1)
states: 6
abstracting: (p_1_1<=0)
states: 14
.abstracting: (p_1_1<=p_1_2)
states: 17
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (1<=p_0_2)
states: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[EF [AX [[[[r_1_2<=p_1_1 | 1<=p_0_2] | [r_0_0<=p_1_0 & 1<=r_0_2]] & p_1_2<=0]]] | AF [[E [[AG [1<=r_1_1] & [p_1_2<=r_0_1 | 1<=p_1_0]] U r_0_2<=0] | [1<=p_0_0 | p_1_1<=p_0_2]]]]]
normalized: ~ [[~ [EG [~ [[[1<=p_0_0 | p_1_1<=p_0_2] | E [[[p_1_2<=r_0_1 | 1<=p_1_0] & ~ [E [true U ~ [1<=r_1_1]]]] U r_0_2<=0]]]]] | E [true U ~ [EX [~ [[[[r_0_0<=p_1_0 & 1<=r_0_2] | [r_1_2<=p_1_1 | 1<=p_0_2]] & p_1_2<=0]]]]]]]

abstracting: (p_1_2<=0)
states: 12
abstracting: (1<=p_0_2)
states: 4
abstracting: (r_1_2<=p_1_1)
states: 11
abstracting: (1<=r_0_2)
states: 8
abstracting: (r_0_0<=p_1_0)
states: 12
.abstracting: (r_0_2<=0)
states: 12
abstracting: (1<=r_1_1)
states: 14
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_2<=r_0_1)
states: 15
abstracting: (p_1_1<=p_0_2)
states: 14
abstracting: (1<=p_0_0)
states: 8
...
EG iterations: 3
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[r_1_1<=r_1_2 & [[[EF [~ [1<=p_0_2]] & 1<=p_1_1] & [~ [EX [p_1_2<=1]] & ~ [[~ [p_1_0<=0] & A [1<=r_1_2 U r_1_1<=r_0_2]]]]] & [A [~ [p_0_1<=p_0_0] U p_0_1<=0] | [r_0_2<=1 | E [AX [r_0_2<=p_0_0] U [1<=r_0_1 | 1<=r_0_1]]]]]]]
normalized: E [true U [r_1_1<=r_1_2 & [[[~ [[~ [p_1_0<=0] & [~ [EG [~ [r_1_1<=r_0_2]]] & ~ [E [~ [r_1_1<=r_0_2] U [~ [r_1_1<=r_0_2] & ~ [1<=r_1_2]]]]]]] & ~ [EX [p_1_2<=1]]] & [E [true U ~ [1<=p_0_2]] & 1<=p_1_1]] & [[E [~ [EX [~ [r_0_2<=p_0_0]]] U [1<=r_0_1 | 1<=r_0_1]] | r_0_2<=1] | [~ [EG [~ [p_0_1<=0]]] & ~ [E [~ [p_0_1<=0] U [~ [p_0_1<=0] & p_0_1<=p_0_0]]]]]]]]

abstracting: (p_0_1<=p_0_0)
states: 17
abstracting: (p_0_1<=0)
states: 14
abstracting: (p_0_1<=0)
states: 14
abstracting: (p_0_1<=0)
states: 14
.
EG iterations: 1
abstracting: (r_0_2<=1)
states: 20
abstracting: (1<=r_0_1)
states: 8
abstracting: (1<=r_0_1)
states: 8
abstracting: (r_0_2<=p_0_0)
states: 15
.abstracting: (1<=p_1_1)
states: 6
abstracting: (1<=p_0_2)
states: 4
abstracting: (p_1_2<=1)
states: 20
.abstracting: (1<=r_1_2)
states: 12
abstracting: (r_1_1<=r_0_2)
states: 11
abstracting: (r_1_1<=r_0_2)
states: 11
abstracting: (r_1_1<=r_0_2)
states: 11
.....
EG iterations: 5
abstracting: (p_1_0<=0)
states: 16
abstracting: (r_1_1<=r_1_2)
states: 15
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AX [[EG [[[[1<=p_1_2 & p_0_2<=p_0_1] | [p_1_1<=1 | 1<=r_0_0]] | [~ [1<=r_0_0] & [1<=p_1_1 | p_0_2<=r_0_0]]]] & [~ [EG [1<=r_1_1]] & [1<=p_0_0 | ~ [p_1_1<=0]]]]] | ~ [A [AF [[[~ [1<=r_1_2] | [p_1_2<=r_0_2 | 1<=r_0_0]] | EG [p_1_0<=r_1_2]]] U AF [EF [~ [p_1_0<=0]]]]]]
normalized: [~ [EX [~ [[EG [[[[1<=p_1_1 | p_0_2<=r_0_0] & ~ [1<=r_0_0]] | [[p_1_1<=1 | 1<=r_0_0] | [1<=p_1_2 & p_0_2<=p_0_1]]]] & [[~ [p_1_1<=0] | 1<=p_0_0] & ~ [EG [1<=r_1_1]]]]]]] | ~ [[~ [EG [EG [~ [E [true U ~ [p_1_0<=0]]]]]] & ~ [E [EG [~ [E [true U ~ [p_1_0<=0]]]] U [EG [~ [[EG [p_1_0<=r_1_2] | [[p_1_2<=r_0_2 | 1<=r_0_0] | ~ [1<=r_1_2]]]]] & EG [~ [E [true U ~ [p_1_0<=0]]]]]]]]]]

abstracting: (p_1_0<=0)
states: 16
.
EG iterations: 1
abstracting: (1<=r_1_2)
states: 12
abstracting: (1<=r_0_0)
states: 8
abstracting: (p_1_2<=r_0_2)
states: 12
abstracting: (p_1_0<=r_1_2)
states: 18
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_1_0<=0)
states: 16
.
EG iterations: 1
abstracting: (p_1_0<=0)
states: 16
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=r_1_1)
states: 14
.
EG iterations: 1
abstracting: (1<=p_0_0)
states: 8
abstracting: (p_1_1<=0)
states: 14
abstracting: (p_0_2<=p_0_1)
states: 18
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_0_0)
states: 8
abstracting: (p_1_1<=1)
states: 20
abstracting: (1<=r_0_0)
states: 8
abstracting: (p_0_2<=r_0_0)
states: 18
abstracting: (1<=p_1_1)
states: 6

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: A [A [1<=p_1_1 U [1<=r_0_1 | [EG [AX [p_0_2<=0]] | [[E [1<=r_1_0 U r_1_1<=0] & AF [p_0_1<=0]] | AX [r_1_1<=r_1_0]]]]] U A [[EG [[EG [p_1_0<=p_1_2] & [p_1_0<=p_0_1 | 1<=r_1_0]]] & EX [E [r_0_1<=p_0_0 U p_0_0<=r_0_2]]] U EG [[1<=p_1_0 & ~ [[1<=p_1_0 | p_1_1<=0]]]]]]
normalized: [~ [EG [~ [[~ [E [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]] U [~ [[EG [[[p_1_0<=p_0_1 | 1<=r_1_0] & EG [p_1_0<=p_1_2]]] & EX [E [r_0_1<=p_0_0 U p_0_0<=r_0_2]]]] & ~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]] & ~ [EG [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]]]]] & ~ [E [~ [[~ [E [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]] U [~ [[EG [[[p_1_0<=p_0_1 | 1<=r_1_0] & EG [p_1_0<=p_1_2]]] & EX [E [r_0_1<=p_0_0 U p_0_0<=r_0_2]]]] & ~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]] & ~ [EG [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]]] U [~ [[~ [E [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]] U [~ [[EG [[[p_1_0<=p_0_1 | 1<=r_1_0] & EG [p_1_0<=p_1_2]]] & EX [E [r_0_1<=p_0_0 U p_0_0<=r_0_2]]]] & ~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]] & ~ [EG [~ [EG [[~ [[1<=p_1_0 | p_1_1<=0]] & 1<=p_1_0]]]]]]] & ~ [[~ [EG [~ [[[[~ [EX [~ [r_1_1<=r_1_0]]] | [~ [EG [~ [p_0_1<=0]]] & E [1<=r_1_0 U r_1_1<=0]]] | EG [~ [EX [~ [p_0_2<=0]]]]] | 1<=r_0_1]]]] & ~ [E [~ [[[[~ [EX [~ [r_1_1<=r_1_0]]] | [~ [EG [~ [p_0_1<=0]]] & E [1<=r_1_0 U r_1_1<=0]]] | EG [~ [EX [~ [p_0_2<=0]]]]] | 1<=r_0_1]] U [~ [1<=p_1_1] & ~ [[[[~ [EX [~ [r_1_1<=r_1_0]]] | [~ [EG [~ [p_0_1<=0]]] & E [1<=r_1_0 U r_1_1<=0]]] | EG [~ [EX [~ [p_0_2<=0]]]]] | 1<=r_0_1]]]]]]]]]]]

abstracting: (1<=r_0_1)
states: 8
abstracting: (p_0_2<=0)
states: 16
...
EG iterations: 2
abstracting: (r_1_1<=0)
states: 6
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_0_1<=0)
states: 14
.
EG iterations: 1
abstracting: (r_1_1<=r_1_0)
states: 18
.abstracting: (1<=p_1_1)
states: 6
abstracting: (1<=r_0_1)
states: 8
abstracting: (p_0_2<=0)
states: 16
...
EG iterations: 2
abstracting: (r_1_1<=0)
states: 6
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_0_1<=0)
states: 14
.
EG iterations: 1
abstracting: (r_1_1<=r_1_0)
states: 18
.abstracting: (1<=r_0_1)
states: 8
abstracting: (p_0_2<=0)
states: 16
...
EG iterations: 2
abstracting: (r_1_1<=0)
states: 6
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_0_1<=0)
states: 14
.
EG iterations: 1
abstracting: (r_1_1<=r_1_0)
states: 18
..
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1
abstracting: (p_0_0<=r_0_2)
states: 15
abstracting: (r_0_1<=p_0_0)
states: 15
.abstracting: (p_1_0<=p_1_2)
states: 18
.
EG iterations: 1
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_1_0<=p_0_1)
states: 16
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1
abstracting: (p_0_0<=r_0_2)
states: 15
abstracting: (r_0_1<=p_0_0)
states: 15
.abstracting: (p_1_0<=p_1_2)
states: 18
.
EG iterations: 1
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_1_0<=p_0_1)
states: 16
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1
abstracting: (p_0_0<=r_0_2)
states: 15
abstracting: (r_0_1<=p_0_0)
states: 15
.abstracting: (p_1_0<=p_1_2)
states: 18
.
EG iterations: 1
abstracting: (1<=r_1_0)
states: 16
abstracting: (p_1_0<=p_0_1)
states: 16
.
EG iterations: 1
abstracting: (1<=p_1_0)
states: 4
abstracting: (p_1_1<=0)
states: 14
abstracting: (1<=p_1_0)
states: 4
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: ~ [A [~ [A [~ [A [r_0_0<=r_1_1 U r_0_1<=0]] U AG [[1<=r_0_0 & 1<=p_1_1]]]] U A [[~ [p_1_1<=r_0_0] & [[[r_1_0<=p_1_1 | r_0_1<=0] | AF [r_0_1<=0]] & ~ [[p_1_0<=p_0_0 | r_1_1<=0]]]] U [A [EX [1<=r_1_1] U ~ [1<=p_1_2]] | [p_1_0<=p_1_1 & [AX [p_0_0<=p_0_1] | [1<=r_1_1 | p_0_2<=r_1_0]]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]] & ~ [E [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]] U [~ [[[~ [[p_1_0<=p_0_0 | r_1_1<=0]] & [~ [EG [~ [r_0_1<=0]]] | [r_1_0<=p_1_1 | r_0_1<=0]]] & ~ [p_1_1<=r_0_0]]] & ~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]] & ~ [E [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]] U [~ [[[~ [[p_1_0<=p_0_0 | r_1_1<=0]] & [~ [EG [~ [r_0_1<=0]]] | [r_1_0<=p_1_1 | r_0_1<=0]]] & ~ [p_1_1<=r_0_0]]] & ~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]]]]] U [[~ [EG [E [true U ~ [[1<=r_0_0 & 1<=p_1_1]]]]] & ~ [E [E [true U ~ [[1<=r_0_0 & 1<=p_1_1]]] U [[~ [EG [~ [r_0_1<=0]]] & ~ [E [~ [r_0_1<=0] U [~ [r_0_0<=r_1_1] & ~ [r_0_1<=0]]]]] & E [true U ~ [[1<=r_0_0 & 1<=p_1_1]]]]]]] & ~ [[~ [EG [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]] & ~ [E [~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]] U [~ [[[~ [[p_1_0<=p_0_0 | r_1_1<=0]] & [~ [EG [~ [r_0_1<=0]]] | [r_1_0<=p_1_1 | r_0_1<=0]]] & ~ [p_1_1<=r_0_0]]] & ~ [[[[[1<=r_1_1 | p_0_2<=r_1_0] | ~ [EX [~ [p_0_0<=p_0_1]]]] & p_1_0<=p_1_1] | [~ [EG [1<=p_1_2]] & ~ [E [1<=p_1_2 U [~ [EX [1<=r_1_1]] & 1<=p_1_2]]]]]]]]]]]]]]]]

abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (p_1_1<=r_0_0)
states: 16
abstracting: (r_0_1<=0)
states: 12
abstracting: (r_1_0<=p_1_1)
states: 8
abstracting: (r_0_1<=0)
states: 12
.....
EG iterations: 5
abstracting: (r_1_1<=0)
states: 6
abstracting: (p_1_0<=p_0_0)
states: 16
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
..
EG iterations: 2
abstracting: (1<=p_1_1)
states: 6
abstracting: (1<=r_0_0)
states: 8
abstracting: (r_0_1<=0)
states: 12
abstracting: (r_0_0<=r_1_1)
states: 18
abstracting: (r_0_1<=0)
states: 12
abstracting: (r_0_1<=0)
states: 12
.....
EG iterations: 5
abstracting: (1<=p_1_1)
states: 6
abstracting: (1<=r_0_0)
states: 8
abstracting: (1<=p_1_1)
states: 6
abstracting: (1<=r_0_0)
states: 8

EG iterations: 0
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (p_1_1<=r_0_0)
states: 16
abstracting: (r_0_1<=0)
states: 12
abstracting: (r_1_0<=p_1_1)
states: 8
abstracting: (r_0_1<=0)
states: 12
.....
EG iterations: 5
abstracting: (r_1_1<=0)
states: 6
abstracting: (p_1_0<=p_0_0)
states: 16
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
..
EG iterations: 2
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (p_1_1<=r_0_0)
states: 16
abstracting: (r_0_1<=0)
states: 12
abstracting: (r_1_0<=p_1_1)
states: 8
abstracting: (r_0_1<=0)
states: 12
.....
EG iterations: 5
abstracting: (r_1_1<=0)
states: 6
abstracting: (p_1_0<=p_0_0)
states: 16
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=r_1_1)
states: 14
.abstracting: (1<=p_1_2)
states: 8
abstracting: (1<=p_1_2)
states: 8
.
EG iterations: 1
abstracting: (p_1_0<=p_1_1)
states: 18
abstracting: (p_0_0<=p_0_1)
states: 15
.abstracting: (p_0_2<=r_1_0)
states: 20
abstracting: (1<=r_1_1)
states: 14
..
EG iterations: 2
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: [[~ [[[E [EX [r_0_0<=1] U 1<=p_0_1] | EF [1<=p_1_2]] & AX [EF [~ [r_0_2<=0]]]]] | AX [A [[AG [p_1_2<=r_1_2] | [~ [1<=p_0_0] | [r_0_0<=p_1_2 | p_0_1<=p_1_2]]] U ~ [[AF [p_0_0<=p_1_1] & EX [1<=p_0_1]]]]]] & ~ [[[~ [E [~ [p_0_1<=0] U [p_0_1<=p_1_2 & 1<=r_0_1]]] & EG [AF [1<=r_1_2]]] & [EG [[EF [r_1_0<=p_0_0] | [1<=r_1_2 | r_0_2<=p_1_0]]] | AX [AG [p_0_2<=1]]]]]]
normalized: [~ [[[~ [E [~ [p_0_1<=0] U [p_0_1<=p_1_2 & 1<=r_0_1]]] & EG [~ [EG [~ [1<=r_1_2]]]]] & [~ [EX [E [true U ~ [p_0_2<=1]]]] | EG [[[1<=r_1_2 | r_0_2<=p_1_0] | E [true U r_1_0<=p_0_0]]]]]] & [~ [EX [~ [[~ [EG [[EX [1<=p_0_1] & ~ [EG [~ [p_0_0<=p_1_1]]]]]] & ~ [E [[EX [1<=p_0_1] & ~ [EG [~ [p_0_0<=p_1_1]]]] U [~ [[[[r_0_0<=p_1_2 | p_0_1<=p_1_2] | ~ [1<=p_0_0]] | ~ [E [true U ~ [p_1_2<=r_1_2]]]]] & [EX [1<=p_0_1] & ~ [EG [~ [p_0_0<=p_1_1]]]]]]]]]]] | ~ [[~ [EX [~ [E [true U ~ [r_0_2<=0]]]]] & [E [true U 1<=p_1_2] | E [EX [r_0_0<=1] U 1<=p_0_1]]]]]]

abstracting: (1<=p_0_1)
states: 6
abstracting: (r_0_0<=1)
states: 20
.abstracting: (1<=p_1_2)
states: 8
abstracting: (r_0_2<=0)
states: 12
.abstracting: (p_0_0<=p_1_1)
states: 14
....
EG iterations: 4
abstracting: (1<=p_0_1)
states: 6
.abstracting: (p_1_2<=r_1_2)
states: 12
abstracting: (1<=p_0_0)
states: 8
abstracting: (p_0_1<=p_1_2)
states: 16
abstracting: (r_0_0<=p_1_2)
states: 15
abstracting: (p_0_0<=p_1_1)
states: 14
....
EG iterations: 4
abstracting: (1<=p_0_1)
states: 6
.abstracting: (p_0_0<=p_1_1)
states: 14
....
EG iterations: 4
abstracting: (1<=p_0_1)
states: 6
......
EG iterations: 5
.abstracting: (r_1_0<=p_0_0)
states: 12
abstracting: (r_0_2<=p_1_0)
states: 14
abstracting: (1<=r_1_2)
states: 12

EG iterations: 0
abstracting: (p_0_2<=1)
states: 20
.abstracting: (1<=r_1_2)
states: 12
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=r_0_1)
states: 8
abstracting: (p_0_1<=p_1_2)
states: 16
abstracting: (p_0_1<=0)
states: 14
-> the formula is TRUE

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

MC time: 0m 0.002sec

totally nodes used: 1831 (1.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2945 4534 7479
used/not used/entry size/cache size: 5737 67103127 16 1024MB
basic ops cache: hits/miss/sum: 2704 4020 6724
used/not used/entry size/cache size: 7269 16769947 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: 410 286 696
used/not used/entry size/cache size: 286 8388322 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 67107049
1 1799
2 16
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.637sec


BK_STOP 1678940423272

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


iterations count:56 (7), effective:12 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:37 (4), effective:9 (1)

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

iterations count:27 (3), effective:7 (0)

iterations count:29 (3), effective:7 (0)

iterations count:26 (3), effective:5 (0)

iterations count:25 (3), effective:7 (0)

iterations count:14 (1), effective:2 (0)

iterations count:14 (1), effective:2 (0)

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

iterations count:14 (1), effective:2 (0)

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

iterations count:32 (4), effective:9 (1)

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

iterations count:15 (1), effective:3 (0)

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

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

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

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

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

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

iterations count:27 (3), effective:6 (0)

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

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

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

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

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

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

iterations count:29 (3), effective:8 (1)

iterations count:32 (4), effective:9 (1)

iterations count:32 (4), effective:9 (1)

iterations count:32 (4), effective:9 (1)

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

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

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

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

iterations count:28 (3), effective:7 (0)

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

iterations count:28 (3), effective:7 (0)

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

iterations count:28 (3), effective:7 (0)

iterations count:24 (3), effective:4 (0)

iterations count:24 (3), effective:4 (0)

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

iterations count:24 (3), effective:4 (0)

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

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

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

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

iterations count:24 (3), effective:4 (0)

iterations count:24 (3), effective:4 (0)

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

iterations count:24 (3), effective:4 (0)

iterations count:24 (3), effective:4 (0)

iterations count:24 (3), effective:4 (0)

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

iterations count:24 (3), effective:4 (0)

iterations count:26 (3), effective:5 (0)

iterations count:13 (1), effective:2 (0)

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

iterations count:13 (1), effective:2 (0)

iterations count:27 (3), effective:7 (0)

iterations count:11 (1), effective:2 (0)

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

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