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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 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.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 12K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 15:32 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 64K 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-R015C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678942454584

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-R015C002
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_R015C002
(NrP: 60 NrTr: 32 NrArc: 150)

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

net check time: 0m 0.000sec

init dd package: 0m 2.870sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 171 (1.7e+02) #states 278,528 (5)



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

checking: AG [EG [AF [1<=p_1_10]]]
normalized: ~ [E [true U ~ [EG [~ [EG [~ [1<=p_1_10]]]]]]]

abstracting: (1<=p_1_10)
states: 98,304 (4)
........................................................
EG iterations: 56
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.100sec

checking: EF [AX [AF [~ [E [p_0_14<=1 U r_1_3<=0]]]]]
normalized: E [true U ~ [EX [EG [E [p_0_14<=1 U r_1_3<=0]]]]]

abstracting: (r_1_3<=0)
states: 40,960 (4)
abstracting: (p_0_14<=1)
states: 278,528 (5)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: ~ [[EG [~ [AG [~ [AG [1<=r_0_3]]]]] | ~ [AF [~ [AG [AG [p_0_9<=p_1_6]]]]]]]
normalized: ~ [[EG [~ [E [true U E [true U ~ [p_0_9<=p_1_6]]]]] | EG [E [true U ~ [E [true U ~ [1<=r_0_3]]]]]]]

abstracting: (1<=r_0_3)
states: 131,072 (5)
.
EG iterations: 1
abstracting: (p_0_9<=p_1_6)
states: 221,184 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [EF [AG [AG [[p_1_7<=p_0_11 & p_1_13<=p_0_13]]]]]
normalized: EX [E [true U ~ [E [true U E [true U ~ [[p_1_7<=p_0_11 & p_1_13<=p_0_13]]]]]]]

abstracting: (p_1_13<=p_0_13)
states: 155,648 (5)
abstracting: (p_1_7<=p_0_11)
states: 204,800 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AX [[EF [~ [1<=p_0_10]] & EG [EX [~ [A [p_1_10<=0 U r_0_12<=p_1_6]]]]]]
normalized: ~ [EX [~ [[EG [EX [~ [[~ [EG [~ [r_0_12<=p_1_6]]] & ~ [E [~ [r_0_12<=p_1_6] U [~ [p_1_10<=0] & ~ [r_0_12<=p_1_6]]]]]]]] & E [true U ~ [1<=p_0_10]]]]]]

abstracting: (1<=p_0_10)
states: 49,152 (4)
abstracting: (r_0_12<=p_1_6)
states: 180,224 (5)
abstracting: (p_1_10<=0)
states: 180,224 (5)
abstracting: (r_0_12<=p_1_6)
states: 180,224 (5)
abstracting: (r_0_12<=p_1_6)
states: 180,224 (5)
........................................................................................................
EG iterations: 104
............................................................................................
EG iterations: 91
.-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

checking: EG [E [r_1_11<=p_1_5 U AX [EF [[p_0_11<=r_0_2 | p_1_5<=1]]]]]
normalized: EG [E [r_1_11<=p_1_5 U ~ [EX [~ [E [true U [p_0_11<=r_0_2 | p_1_5<=1]]]]]]]

abstracting: (p_1_5<=1)
states: 278,528 (5)
abstracting: (p_0_11<=r_0_2)
states: 258,048 (5)
.abstracting: (r_1_11<=p_1_5)
states: 135,168 (5)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: A [EX [~ [[1<=p_0_13 | p_1_7<=1]]] U EG [A [r_1_7<=0 U [AF [r_1_3<=p_0_13] | AF [p_1_2<=p_1_12]]]]]
normalized: [~ [EG [~ [EG [[~ [EG [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]] & ~ [E [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]] U [~ [r_1_7<=0] & ~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]] & ~ [E [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]] U [~ [r_1_7<=0] & ~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]]]]]] U [~ [EX [~ [[1<=p_0_13 | p_1_7<=1]]]] & ~ [EG [[~ [EG [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]] & ~ [E [~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]] U [~ [r_1_7<=0] & ~ [[~ [EG [~ [p_1_2<=p_1_12]]] | ~ [EG [~ [r_1_3<=p_0_13]]]]]]]]]]]]]]]

abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_7<=0)
states: 73,728 (4)
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
.
EG iterations: 1

EG iterations: 0
abstracting: (p_1_7<=1)
states: 278,528 (5)
abstracting: (1<=p_0_13)
states: 24,576 (4)
.abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_7<=0)
states: 73,728 (4)
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
.
EG iterations: 1

EG iterations: 0
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_7<=0)
states: 73,728 (4)
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (r_1_3<=p_0_13)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p_1_2<=p_1_12)
states: 262,144 (5)
...............................
EG iterations: 31
.
EG iterations: 1

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

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

MC time: 0m 0.092sec

checking: [~ [EX [[~ [[1<=r_0_7 & 1<=r_1_0]] | ~ [EG [[p_0_4<=1 | 1<=r_1_4]]]]]] | E [r_1_10<=p_0_11 U 1<=p_1_7]]
normalized: [E [r_1_10<=p_0_11 U 1<=p_1_7] | ~ [EX [[~ [EG [[p_0_4<=1 | 1<=r_1_4]]] | ~ [[1<=r_0_7 & 1<=r_1_0]]]]]]

abstracting: (1<=r_1_0)
states: 262,144 (5)
abstracting: (1<=r_0_7)
states: 131,072 (5)
abstracting: (1<=r_1_4)
states: 229,376 (5)
abstracting: (p_0_4<=1)
states: 278,528 (5)

EG iterations: 0
.abstracting: (1<=p_1_7)
states: 73,728 (4)
abstracting: (r_1_10<=p_0_11)
states: 139,264 (5)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [[EF [EX [[[r_1_10<=0 & r_0_10<=r_0_3] | r_0_12<=p_1_0]]] & A [AX [p_0_12<=p_0_0] U ~ [AF [AG [1<=p_1_7]]]]]]
normalized: E [true U [[~ [EG [~ [EG [E [true U ~ [1<=p_1_7]]]]]] & ~ [E [~ [EG [E [true U ~ [1<=p_1_7]]]] U [EX [~ [p_0_12<=p_0_0]] & ~ [EG [E [true U ~ [1<=p_1_7]]]]]]]] & E [true U EX [[[r_1_10<=0 & r_0_10<=r_0_3] | r_0_12<=p_1_0]]]]]

abstracting: (r_0_12<=p_1_0)
states: 155,648 (5)
abstracting: (r_0_10<=r_0_3)
states: 208,896 (5)
abstracting: (r_1_10<=0)
states: 98,304 (4)
.abstracting: (1<=p_1_7)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
abstracting: (p_0_12<=p_0_0)
states: 262,144 (5)
.abstracting: (1<=p_1_7)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
abstracting: (1<=p_1_7)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

checking: ~ [AX [[EX [EG [AX [p_0_9<=0]]] | [~ [EF [[r_0_12<=1 & p_1_3<=0]]] & [EX [AX [1<=p_1_7]] & [~ [[1<=r_0_13 | p_1_0<=1]] | E [p_0_4<=r_0_6 U p_0_11<=0]]]]]]]
normalized: EX [~ [[[[[E [p_0_4<=r_0_6 U p_0_11<=0] | ~ [[1<=r_0_13 | p_1_0<=1]]] & EX [~ [EX [~ [1<=p_1_7]]]]] & ~ [E [true U [r_0_12<=1 & p_1_3<=0]]]] | EX [EG [~ [EX [~ [p_0_9<=0]]]]]]]]

abstracting: (p_0_9<=0)
states: 221,184 (5)
................................................
EG iterations: 47
.abstracting: (p_1_3<=0)
states: 237,568 (5)
abstracting: (r_0_12<=1)
states: 278,528 (5)
abstracting: (1<=p_1_7)
states: 73,728 (4)
..abstracting: (p_1_0<=1)
states: 278,528 (5)
abstracting: (1<=r_0_13)
states: 131,072 (5)
abstracting: (p_0_11<=0)
states: 237,568 (5)
abstracting: (p_0_4<=r_0_6)
states: 225,280 (5)
.-> the formula is FALSE

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

MC time: 0m 0.041sec

checking: ~ [A [[[[~ [EF [1<=p_0_5]] & [[1<=r_1_11 & 1<=r_1_2] | EG [1<=r_1_4]]] | p_0_8<=p_1_7] | ~ [AX [AG [p_1_11<=0]]]] U EX [~ [[A [1<=p_0_7 U p_0_1<=1] | ~ [r_1_7<=1]]]]]]
normalized: ~ [[~ [EG [~ [EX [~ [[~ [r_1_7<=1] | [~ [EG [~ [p_0_1<=1]]] & ~ [E [~ [p_0_1<=1] U [~ [1<=p_0_7] & ~ [p_0_1<=1]]]]]]]]]]] & ~ [E [~ [EX [~ [[~ [r_1_7<=1] | [~ [EG [~ [p_0_1<=1]]] & ~ [E [~ [p_0_1<=1] U [~ [1<=p_0_7] & ~ [p_0_1<=1]]]]]]]]] U [~ [[EX [E [true U ~ [p_1_11<=0]]] | [[[EG [1<=r_1_4] | [1<=r_1_11 & 1<=r_1_2]] & ~ [E [true U 1<=p_0_5]]] | p_0_8<=p_1_7]]] & ~ [EX [~ [[~ [r_1_7<=1] | [~ [EG [~ [p_0_1<=1]]] & ~ [E [~ [p_0_1<=1] U [~ [1<=p_0_7] & ~ [p_0_1<=1]]]]]]]]]]]]]]

abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (p_0_1<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (r_1_7<=1)
states: 278,528 (5)
.abstracting: (p_0_8<=p_1_7)
states: 212,992 (5)
abstracting: (1<=p_0_5)
states: 90,112 (4)
abstracting: (1<=r_1_2)
states: 245,760 (5)
abstracting: (1<=r_1_11)
states: 172,032 (5)
abstracting: (1<=r_1_4)
states: 229,376 (5)
..............................................................
EG iterations: 62
abstracting: (p_1_11<=0)
states: 172,032 (5)
.abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (p_0_1<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (r_1_7<=1)
states: 278,528 (5)
.abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (1<=p_0_7)
states: 73,728 (4)
abstracting: (p_0_1<=1)
states: 278,528 (5)
abstracting: (p_0_1<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (r_1_7<=1)
states: 278,528 (5)
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.051sec

checking: ~ [[AX [A [[[~ [1<=r_0_11] | EX [p_0_6<=p_0_0]] | EG [r_0_13<=r_0_0]] U [EG [1<=p_1_9] & ~ [[1<=r_0_14 | p_1_6<=p_1_9]]]]] & EX [EX [EX [[r_0_14<=1 & p_1_3<=r_1_13]]]]]]
normalized: ~ [[EX [EX [EX [[r_0_14<=1 & p_1_3<=r_1_13]]]] & ~ [EX [~ [[~ [EG [~ [[~ [[1<=r_0_14 | p_1_6<=p_1_9]] & EG [1<=p_1_9]]]]] & ~ [E [~ [[~ [[1<=r_0_14 | p_1_6<=p_1_9]] & EG [1<=p_1_9]]] U [~ [[EG [r_0_13<=r_0_0] | [EX [p_0_6<=p_0_0] | ~ [1<=r_0_11]]]] & ~ [[~ [[1<=r_0_14 | p_1_6<=p_1_9]] & EG [1<=p_1_9]]]]]]]]]]]]

abstracting: (1<=p_1_9)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (p_1_6<=p_1_9)
states: 245,760 (5)
abstracting: (1<=r_0_14)
states: 131,072 (5)
abstracting: (1<=r_0_11)
states: 131,072 (5)
abstracting: (p_0_6<=p_0_0)
states: 237,568 (5)
.abstracting: (r_0_13<=r_0_0)
states: 208,896 (5)
.................................
EG iterations: 33
abstracting: (1<=p_1_9)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (p_1_6<=p_1_9)
states: 245,760 (5)
abstracting: (1<=r_0_14)
states: 131,072 (5)
abstracting: (1<=p_1_9)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (p_1_6<=p_1_9)
states: 245,760 (5)
abstracting: (1<=r_0_14)
states: 131,072 (5)

EG iterations: 0
.abstracting: (p_1_3<=r_1_13)
states: 258,048 (5)
abstracting: (r_0_14<=1)
states: 278,528 (5)
...-> the formula is TRUE

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

MC time: 0m 0.141sec

checking: AG [~ [[[[~ [[[r_0_5<=r_1_2 | r_1_3<=p_1_6] | ~ [r_0_14<=0]]] & [p_0_5<=r_1_1 & AG [1<=r_1_1]]] | ~ [AX [EF [r_0_3<=0]]]] & ~ [[[EX [r_1_14<=0] | ~ [1<=p_0_8]] | ~ [EG [1<=r_0_10]]]]]]]
normalized: ~ [E [true U [~ [[~ [EG [1<=r_0_10]] | [~ [1<=p_0_8] | EX [r_1_14<=0]]]] & [EX [~ [E [true U r_0_3<=0]]] | [[p_0_5<=r_1_1 & ~ [E [true U ~ [1<=r_1_1]]]] & ~ [[~ [r_0_14<=0] | [r_0_5<=r_1_2 | r_1_3<=p_1_6]]]]]]]]

abstracting: (r_1_3<=p_1_6)
states: 86,016 (4)
abstracting: (r_0_5<=r_1_2)
states: 262,144 (5)
abstracting: (r_0_14<=0)
states: 147,456 (5)
abstracting: (1<=r_1_1)
states: 253,952 (5)
abstracting: (p_0_5<=r_1_1)
states: 278,528 (5)
abstracting: (r_0_3<=0)
states: 147,456 (5)
.abstracting: (r_1_14<=0)
states: 131,072 (5)
.abstracting: (1<=p_0_8)
states: 65,536 (4)
abstracting: (1<=r_0_10)
states: 131,072 (5)
..........................................................................................................................
EG iterations: 122
-> the formula is TRUE

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

MC time: 0m 0.111sec

checking: AF [E [[E [E [r_1_11<=1 U p_0_7<=1] U EG [1<=r_0_7]] | [[[EF [p_0_1<=r_1_0] | [1<=p_0_4 & p_1_10<=p_1_7]] & ~ [A [p_0_7<=p_0_1 U 1<=r_1_3]]] | ~ [EX [1<=p_1_0]]]] U EG [1<=p_0_8]]]
normalized: ~ [EG [~ [E [[[~ [EX [1<=p_1_0]] | [~ [[~ [EG [~ [1<=r_1_3]]] & ~ [E [~ [1<=r_1_3] U [~ [p_0_7<=p_0_1] & ~ [1<=r_1_3]]]]]] & [[1<=p_0_4 & p_1_10<=p_1_7] | E [true U p_0_1<=r_1_0]]]] | E [E [r_1_11<=1 U p_0_7<=1] U EG [1<=r_0_7]]] U EG [1<=p_0_8]]]]]

abstracting: (1<=p_0_8)
states: 65,536 (4)
...............................................
EG iterations: 47
abstracting: (1<=r_0_7)
states: 131,072 (5)
......................................................................................
EG iterations: 86
abstracting: (p_0_7<=1)
states: 278,528 (5)
abstracting: (r_1_11<=1)
states: 278,528 (5)
abstracting: (p_0_1<=r_1_0)
states: 278,528 (5)
abstracting: (p_1_10<=p_1_7)
states: 217,088 (5)
abstracting: (1<=p_0_4)
states: 98,304 (4)
abstracting: (1<=r_1_3)
states: 237,568 (5)
abstracting: (p_0_7<=p_0_1)
states: 241,664 (5)
abstracting: (1<=r_1_3)
states: 237,568 (5)
abstracting: (1<=r_1_3)
states: 237,568 (5)
....................................................................
EG iterations: 68
abstracting: (1<=p_1_0)
states: 16,384 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: EG [E [~ [[[[[r_0_10<=r_0_12 & p_0_11<=r_0_14] & r_0_0<=p_1_7] & [p_0_7<=r_0_5 & AF [r_1_10<=p_1_9]]] & EF [E [p_1_14<=0 U r_0_9<=r_0_2]]]] U r_0_9<=0]]
normalized: EG [E [~ [[E [true U E [p_1_14<=0 U r_0_9<=r_0_2]] & [[p_0_7<=r_0_5 & ~ [EG [~ [r_1_10<=p_1_9]]]] & [r_0_0<=p_1_7 & [r_0_10<=r_0_12 & p_0_11<=r_0_14]]]]] U r_0_9<=0]]

abstracting: (r_0_9<=0)
states: 147,456 (5)
abstracting: (p_0_11<=r_0_14)
states: 253,952 (5)
abstracting: (r_0_10<=r_0_12)
states: 208,896 (5)
abstracting: (r_0_0<=p_1_7)
states: 180,224 (5)
abstracting: (r_1_10<=p_1_9)
states: 143,360 (5)
...............................................
EG iterations: 47
abstracting: (p_0_7<=r_0_5)
states: 241,664 (5)
abstracting: (r_0_9<=r_0_2)
states: 208,896 (5)
abstracting: (p_1_14<=0)
states: 147,456 (5)
..............................................................................
EG iterations: 78
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.286sec

checking: ~ [[AG [~ [AF [[[1<=p_0_5 & r_0_6<=r_0_9] & p_1_12<=r_0_14]]]] | [~ [AG [[[r_1_14<=0 & EG [1<=p_0_0]] & p_1_13<=r_0_1]]] & [AF [[[[p_1_8<=1 | p_0_6<=p_0_3] | r_0_2<=p_1_5] & r_1_14<=r_1_11]] & ~ [AG [A [p_0_2<=p_1_0 U p_0_6<=1]]]]]]]
normalized: ~ [[[E [true U ~ [[[r_1_14<=0 & EG [1<=p_0_0]] & p_1_13<=r_0_1]]] & [E [true U ~ [[~ [EG [~ [p_0_6<=1]]] & ~ [E [~ [p_0_6<=1] U [~ [p_0_2<=p_1_0] & ~ [p_0_6<=1]]]]]]] & ~ [EG [~ [[r_1_14<=r_1_11 & [r_0_2<=p_1_5 | [p_1_8<=1 | p_0_6<=p_0_3]]]]]]]] | ~ [E [true U ~ [EG [~ [[[1<=p_0_5 & r_0_6<=r_0_9] & p_1_12<=r_0_14]]]]]]]]

abstracting: (p_1_12<=r_0_14)
states: 221,184 (5)
abstracting: (r_0_6<=r_0_9)
states: 208,896 (5)
abstracting: (1<=p_0_5)
states: 90,112 (4)
.................................................................................
EG iterations: 81
abstracting: (p_0_6<=p_0_3)
states: 237,568 (5)
abstracting: (p_1_8<=1)
states: 278,528 (5)
abstracting: (r_0_2<=p_1_5)
states: 172,032 (5)
abstracting: (r_1_14<=r_1_11)
states: 225,280 (5)
.......................................................................................................................................
EG iterations: 135
abstracting: (p_0_6<=1)
states: 278,528 (5)
abstracting: (p_0_2<=p_1_0)
states: 163,840 (5)
abstracting: (p_0_6<=1)
states: 278,528 (5)
abstracting: (p_0_6<=1)
states: 278,528 (5)
.
EG iterations: 1
abstracting: (p_1_13<=r_0_1)
states: 212,992 (5)
abstracting: (1<=p_0_0)
states: 131,072 (5)
...............................................................................
EG iterations: 79
abstracting: (r_1_14<=0)
states: 131,072 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.288sec

totally nodes used: 2041366 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 888775 2984440 3873215
used/not used/entry size/cache size: 4472829 62636035 16 1024MB
basic ops cache: hits/miss/sum: 219327 737398 956725
used/not used/entry size/cache size: 1548136 15229080 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: 1337 3964 5301
used/not used/entry size/cache size: 3964 8384644 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 65212903
1 1765568
2 116660
3 12530
4 1129
5 72
6 2
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.371sec


BK_STOP 1678942461003

--------------------
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:914 (28), effective:240 (7)

initing FirstDep: 0m 0.000sec


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

iterations count:334 (10), effective:90 (2)

iterations count:400 (12), effective:115 (3)

iterations count:307 (9), effective:82 (2)

iterations count:228 (7), effective:65 (2)

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

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

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

iterations count:397 (12), effective:121 (3)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:633 (19), effective:176 (5)

iterations count:440 (13), effective:119 (3)

iterations count:307 (9), effective:82 (2)

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

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

iterations count:257 (8), effective:55 (1)

iterations count:97 (3), effective:18 (0)

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

iterations count:190 (5), effective:48 (1)

iterations count:226 (7), effective:60 (1)

iterations count:72 (2), effective:13 (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-R015C002"
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-R015C002, 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-167889192600745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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