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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:19 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:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 15:21 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 107K 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-R003C015-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940732438

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-R003C015
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_R003C015
(NrP: 90 NrTr: 60 NrArc: 264)

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

net check time: 0m 0.000sec

init dd package: 0m 2.816sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 586 (5.9e+02) #states 578,878,464 (8)



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

checking: AX [~ [AF [r_7_2<=1]]]
normalized: ~ [EX [~ [EG [~ [r_7_2<=1]]]]]

abstracting: (r_7_2<=1)
states: 578,878,464 (8)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: ~ [A [~ [AF [EX [r_7_2<=0]]] U ~ [AF [AG [r_3_2<=0]]]]]
normalized: ~ [[~ [EG [~ [EG [E [true U ~ [r_3_2<=0]]]]]] & ~ [E [~ [EG [E [true U ~ [r_3_2<=0]]]] U [~ [EG [~ [EX [r_7_2<=0]]]] & ~ [EG [E [true U ~ [r_3_2<=0]]]]]]]]]

abstracting: (r_3_2<=0)
states: 295,706,624 (8)
........................
EG iterations: 24
abstracting: (r_7_2<=0)
states: 300,959,232 (8)
.........................
EG iterations: 24
abstracting: (r_3_2<=0)
states: 295,706,624 (8)
........................
EG iterations: 24
abstracting: (r_3_2<=0)
states: 295,706,624 (8)
........................
EG iterations: 24
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.362sec

checking: ~ [AG [AF [~ [[[E [p_2_2<=0 U p_14_0<=1] | AX [1<=r_4_2]] | AX [r_11_1<=1]]]]]]
normalized: E [true U EG [[[E [p_2_2<=0 U p_14_0<=1] | ~ [EX [~ [1<=r_4_2]]]] | ~ [EX [~ [r_11_1<=1]]]]]]

abstracting: (r_11_1<=1)
states: 578,878,464 (8)
.abstracting: (1<=r_4_2)
states: 275,520,512 (8)
.abstracting: (p_14_0<=1)
states: 578,878,464 (8)
abstracting: (p_2_2<=0)
states: 480,975,872 (8)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: ~ [A [r_14_1<=1 U E [AF [p_8_2<=0] U AG [[AG [r_1_0<=r_4_1] | ~ [p_2_0<=r_10_2]]]]]]
normalized: ~ [[~ [EG [~ [E [~ [EG [~ [p_8_2<=0]]] U ~ [E [true U ~ [[~ [E [true U ~ [r_1_0<=r_4_1]]] | ~ [p_2_0<=r_10_2]]]]]]]]] & ~ [E [~ [E [~ [EG [~ [p_8_2<=0]]] U ~ [E [true U ~ [[~ [E [true U ~ [r_1_0<=r_4_1]]] | ~ [p_2_0<=r_10_2]]]]]]] U [~ [E [~ [EG [~ [p_8_2<=0]]] U ~ [E [true U ~ [[~ [E [true U ~ [r_1_0<=r_4_1]]] | ~ [p_2_0<=r_10_2]]]]]]] & ~ [r_14_1<=1]]]]]]

abstracting: (r_14_1<=1)
states: 578,878,464 (8)
abstracting: (p_2_0<=r_10_2)
states: 455,973,888 (8)
abstracting: (r_1_0<=r_4_1)
states: 428,858,880 (8)
abstracting: (p_8_2<=0)
states: 500,849,664 (8)
........................
EG iterations: 24
abstracting: (p_2_0<=r_10_2)
states: 455,973,888 (8)
abstracting: (r_1_0<=r_4_1)
states: 428,858,880 (8)
abstracting: (p_8_2<=0)
states: 500,849,664 (8)
........................
EG iterations: 24
abstracting: (p_2_0<=r_10_2)
states: 455,973,888 (8)
abstracting: (r_1_0<=r_4_1)
states: 428,858,880 (8)
abstracting: (p_8_2<=0)
states: 500,849,664 (8)
........................
EG iterations: 24
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.145sec

checking: AX [[E [AF [[EX [1<=p_9_2] & AX [p_5_2<=r_2_1]]] U 1<=p_3_1] | EG [p_0_0<=p_14_2]]]
normalized: ~ [EX [~ [[EG [p_0_0<=p_14_2] | E [~ [EG [~ [[~ [EX [~ [p_5_2<=r_2_1]]] & EX [1<=p_9_2]]]]] U 1<=p_3_1]]]]]

abstracting: (1<=p_3_1)
states: 134,336,512 (8)
abstracting: (1<=p_9_2)
states: 221,420,544 (8)
.abstracting: (p_5_2<=r_2_1)
states: 456,612,864 (8)
.....................
EG iterations: 20
abstracting: (p_0_0<=p_14_2)
states: 389,685,248 (8)
.........................
EG iterations: 25
.-> the formula is TRUE

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

MC time: 0m 0.488sec

checking: EX [EF [AG [[r_13_2<=1 | [r_1_1<=r_6_2 & A [r_6_0<=r_12_0 U r_11_0<=r_14_0]]]]]]
normalized: EX [E [true U ~ [E [true U ~ [[r_13_2<=1 | [r_1_1<=r_6_2 & [~ [EG [~ [r_11_0<=r_14_0]]] & ~ [E [~ [r_11_0<=r_14_0] U [~ [r_11_0<=r_14_0] & ~ [r_6_0<=r_12_0]]]]]]]]]]]]

abstracting: (r_6_0<=r_12_0)
states: 441,138,176 (8)
abstracting: (r_11_0<=r_14_0)
states: 458,674,688 (8)
abstracting: (r_11_0<=r_14_0)
states: 458,674,688 (8)
abstracting: (r_11_0<=r_14_0)
states: 458,674,688 (8)
.............................
EG iterations: 29
abstracting: (r_1_1<=r_6_2)
states: 421,692,160 (8)
abstracting: (r_13_2<=1)
states: 578,878,464 (8)
.-> the formula is TRUE

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

MC time: 0m 0.126sec

checking: E [AG [~ [AF [~ [1<=r_3_1]]]] U AF [EX [[[[p_0_2<=r_8_1 & r_3_2<=0] | ~ [r_1_1<=r_12_2]] & EX [1<=p_6_1]]]]]
normalized: E [~ [E [true U ~ [EG [1<=r_3_1]]]] U ~ [EG [~ [EX [[EX [1<=p_6_1] & [~ [r_1_1<=r_12_2] | [p_0_2<=r_8_1 & r_3_2<=0]]]]]]]]

abstracting: (r_3_2<=0)
states: 295,706,624 (8)
abstracting: (p_0_2<=r_8_1)
states: 492,635,136 (8)
abstracting: (r_1_1<=r_12_2)
states: 432,433,920 (8)
abstracting: (1<=p_6_1)
states: 151,635,968 (8)
.......................
EG iterations: 21
abstracting: (1<=r_3_1)
states: 287,965,696 (8)
.......................
EG iterations: 23
-> the formula is FALSE

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

MC time: 0m 0.641sec

checking: E [~ [AG [AG [[EX [1<=p_8_1] & [p_13_0<=r_9_2 & r_0_1<=p_13_1]]]]] U AX [[AX [AX [r_6_1<=p_7_0]] & 1<=p_4_1]]]
normalized: E [E [true U E [true U ~ [[[p_13_0<=r_9_2 & r_0_1<=p_13_1] & EX [1<=p_8_1]]]]] U ~ [EX [~ [[~ [EX [EX [~ [r_6_1<=p_7_0]]]] & 1<=p_4_1]]]]]

abstracting: (1<=p_4_1)
states: 156,576,256 (8)
abstracting: (r_6_1<=p_7_0)
states: 335,016,960 (8)
...abstracting: (1<=p_8_1)
states: 151,635,968 (8)
.abstracting: (r_0_1<=p_13_1)
states: 371,594,496 (8)
abstracting: (p_13_0<=r_9_2)
states: 556,499,968 (8)
-> the formula is TRUE

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

MC time: 0m 0.169sec

checking: AF [AG [~ [[AG [EX [1<=p_2_2]] | [[[r_14_0<=p_1_0 | 1<=r_5_1] | EG [p_13_2<=p_5_0]] & ~ [p_6_2<=r_9_0]]]]]]
normalized: ~ [EG [E [true U [~ [E [true U ~ [EX [1<=p_2_2]]]] | [[EG [p_13_2<=p_5_0] | [r_14_0<=p_1_0 | 1<=r_5_1]] & ~ [p_6_2<=r_9_0]]]]]]

abstracting: (p_6_2<=r_9_0)
states: 540,017,664 (8)
abstracting: (1<=r_5_1)
states: 283,005,952 (8)
abstracting: (r_14_0<=p_1_0)
states: 291,220,480 (8)
abstracting: (p_13_2<=p_5_0)
states: 420,951,552 (8)
......................
EG iterations: 22
abstracting: (1<=p_2_2)
states: 97,902,592 (7)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.185sec

checking: EX [A [1<=r_5_2 U AG [[~ [AF [r_10_2<=p_2_2]] | [r_11_1<=r_5_1 | [p_4_2<=p_8_1 & 1<=p_5_1]]]]]]
normalized: EX [[~ [EG [E [true U ~ [[[[p_4_2<=p_8_1 & 1<=p_5_1] | r_11_1<=r_5_1] | EG [~ [r_10_2<=p_2_2]]]]]]] & ~ [E [E [true U ~ [[[[p_4_2<=p_8_1 & 1<=p_5_1] | r_11_1<=r_5_1] | EG [~ [r_10_2<=p_2_2]]]]] U [~ [1<=r_5_2] & E [true U ~ [[[[p_4_2<=p_8_1 & 1<=p_5_1] | r_11_1<=r_5_1] | EG [~ [r_10_2<=p_2_2]]]]]]]]]]

abstracting: (r_10_2<=p_2_2)
states: 343,457,792 (8)
...........................
EG iterations: 27
abstracting: (r_11_1<=r_5_1)
states: 440,339,456 (8)
abstracting: (1<=p_5_1)
states: 144,236,544 (8)
abstracting: (p_4_2<=p_8_1)
states: 521,953,280 (8)
abstracting: (1<=r_5_2)
states: 279,429,120 (8)
abstracting: (r_10_2<=p_2_2)
states: 343,457,792 (8)
...........................
EG iterations: 27
abstracting: (r_11_1<=r_5_1)
states: 440,339,456 (8)
abstracting: (1<=p_5_1)
states: 144,236,544 (8)
abstracting: (p_4_2<=p_8_1)
states: 521,953,280 (8)
abstracting: (r_10_2<=p_2_2)
states: 343,457,792 (8)
...........................
EG iterations: 27
abstracting: (r_11_1<=r_5_1)
states: 440,339,456 (8)
abstracting: (1<=p_5_1)
states: 144,236,544 (8)
abstracting: (p_4_2<=p_8_1)
states: 521,953,280 (8)
......................
EG iterations: 22
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.329sec

checking: AG [AF [E [AX [EF [1<=p_13_2]] U [EG [r_4_0<=p_14_0] & [1<=r_8_2 | A [r_4_2<=r_9_0 U r_2_1<=r_0_1]]]]]]
normalized: ~ [E [true U EG [~ [E [~ [EX [~ [E [true U 1<=p_13_2]]]] U [[[~ [EG [~ [r_2_1<=r_0_1]]] & ~ [E [~ [r_2_1<=r_0_1] U [~ [r_4_2<=r_9_0] & ~ [r_2_1<=r_0_1]]]]] | 1<=r_8_2] & EG [r_4_0<=p_14_0]]]]]]]

abstracting: (r_4_0<=p_14_0)
states: 429,820,928 (8)
.
EG iterations: 1
abstracting: (1<=r_8_2)
states: 279,429,120 (8)
abstracting: (r_2_1<=r_0_1)
states: 419,615,232 (8)
abstracting: (r_4_2<=r_9_0)
states: 435,301,888 (8)
abstracting: (r_2_1<=r_0_1)
states: 419,615,232 (8)
abstracting: (r_2_1<=r_0_1)
states: 419,615,232 (8)
.........................
EG iterations: 25
abstracting: (1<=p_13_2)
states: 180,807,168 (8)
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.271sec

checking: AG [E [r_12_0<=r_1_1 U [EG [EG [p_11_1<=p_5_1]] | [E [[r_1_2<=1 & p_3_1<=1] U ~ [r_3_0<=r_9_2]] | EX [r_13_1<=0]]]]]
normalized: ~ [E [true U ~ [E [r_12_0<=r_1_1 U [[EX [r_13_1<=0] | E [[r_1_2<=1 & p_3_1<=1] U ~ [r_3_0<=r_9_2]]] | EG [EG [p_11_1<=p_5_1]]]]]]]

abstracting: (p_11_1<=p_5_1)
states: 479,318,016 (8)
...................
EG iterations: 19
.
EG iterations: 1
abstracting: (r_3_0<=r_9_2)
states: 430,298,112 (8)
abstracting: (p_3_1<=1)
states: 578,878,464 (8)
abstracting: (r_1_2<=1)
states: 578,878,464 (8)
abstracting: (r_13_1<=0)
states: 328,206,848 (8)
.abstracting: (r_12_0<=r_1_1)
states: 439,838,208 (8)
-> the formula is FALSE

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

MC time: 0m 0.110sec

checking: A [[[p_14_0<=0 | ~ [EF [AF [p_3_2<=0]]]] | [p_14_0<=1 | [AG [~ [[p_13_2<=p_5_1 & 1<=r_7_0]]] | AF [r_0_2<=r_13_2]]]] U EF [~ [EG [[p_13_0<=1 | ~ [p_1_1<=0]]]]]]
normalized: [~ [EG [~ [E [true U ~ [EG [[~ [p_1_1<=0] | p_13_0<=1]]]]]]] & ~ [E [~ [E [true U ~ [EG [[~ [p_1_1<=0] | p_13_0<=1]]]]] U [~ [[[[~ [EG [~ [r_0_2<=r_13_2]]] | ~ [E [true U [p_13_2<=p_5_1 & 1<=r_7_0]]]] | p_14_0<=1] | [~ [E [true U ~ [EG [~ [p_3_2<=0]]]]] | p_14_0<=0]]] & ~ [E [true U ~ [EG [[~ [p_1_1<=0] | p_13_0<=1]]]]]]]]]

abstracting: (p_13_0<=1)
states: 578,878,464 (8)
abstracting: (p_1_1<=0)
states: 478,665,216 (8)

EG iterations: 0
abstracting: (p_14_0<=0)
states: 312,117,248 (8)
abstracting: (p_3_2<=0)
states: 365,109,248 (8)
...................
EG iterations: 19
abstracting: (p_14_0<=1)
states: 578,878,464 (8)
abstracting: (1<=r_7_0)
states: 278,227,968 (8)
abstracting: (p_13_2<=p_5_1)
states: 443,404,800 (8)
abstracting: (r_0_2<=r_13_2)
states: 440,312,064 (8)
...............................
EG iterations: 31
abstracting: (p_13_0<=1)
states: 578,878,464 (8)
abstracting: (p_1_1<=0)
states: 478,665,216 (8)

EG iterations: 0
abstracting: (p_13_0<=1)
states: 578,878,464 (8)
abstracting: (p_1_1<=0)
states: 478,665,216 (8)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C015-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.367sec

checking: AG [[EX [[[[1<=r_14_2 & [1<=r_6_2 | r_11_0<=p_11_0]] & [[p_7_2<=0 | r_5_0<=p_1_2] | [p_6_1<=1 | r_14_1<=1]]] & EX [EF [r_10_0<=0]]]] | [r_3_0<=1 & EF [EX [AG [1<=r_0_2]]]]]]
normalized: ~ [E [true U ~ [[EX [[[[[p_7_2<=0 | r_5_0<=p_1_2] | [p_6_1<=1 | r_14_1<=1]] & [[1<=r_6_2 | r_11_0<=p_11_0] & 1<=r_14_2]] & EX [E [true U r_10_0<=0]]]] | [r_3_0<=1 & E [true U EX [~ [E [true U ~ [1<=r_0_2]]]]]]]]]]

abstracting: (1<=r_0_2)
states: 229,758,464 (8)
.abstracting: (r_3_0<=1)
states: 578,878,464 (8)
abstracting: (r_10_0<=0)
states: 295,630,336 (8)
.abstracting: (1<=r_14_2)
states: 410,565,632 (8)
abstracting: (r_11_0<=p_11_0)
states: 306,291,712 (8)
abstracting: (1<=r_6_2)
states: 277,919,232 (8)
abstracting: (r_14_1<=1)
states: 578,878,464 (8)
abstracting: (p_6_1<=1)
states: 578,878,464 (8)
abstracting: (r_5_0<=p_1_2)
states: 385,478,656 (8)
abstracting: (p_7_2<=0)
states: 355,948,032 (8)
.-> the formula is FALSE

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

MC time: 0m 0.096sec

checking: E [[AX [[[r_9_2<=0 & AX [r_5_0<=0]] & ~ [[AX [p_6_2<=0] | p_12_1<=r_12_2]]]] | [AX [~ [[~ [r_2_1<=p_3_1] | [p_0_2<=r_1_2 | r_14_2<=r_1_2]]]] | EF [~ [EG [r_10_0<=0]]]]] U ~ [EF [[[A [r_13_1<=1 U p_1_2<=1] & 1<=r_6_0] | E [[1<=r_9_1 | r_2_0<=r_1_1] U EG [p_1_2<=0]]]]]]
normalized: E [[~ [EX [~ [[[~ [EX [~ [r_5_0<=0]]] & r_9_2<=0] & ~ [[~ [EX [~ [p_6_2<=0]]] | p_12_1<=r_12_2]]]]]] | [E [true U ~ [EG [r_10_0<=0]]] | ~ [EX [[~ [r_2_1<=p_3_1] | [p_0_2<=r_1_2 | r_14_2<=r_1_2]]]]]] U ~ [E [true U [[1<=r_6_0 & [~ [E [~ [p_1_2<=1] U [~ [r_13_1<=1] & ~ [p_1_2<=1]]]] & ~ [EG [~ [p_1_2<=1]]]]] | E [[1<=r_9_1 | r_2_0<=r_1_1] U EG [p_1_2<=0]]]]]]

abstracting: (p_1_2<=0)
states: 398,071,296 (8)
.....................
EG iterations: 21
abstracting: (r_2_0<=r_1_1)
states: 443,394,560 (8)
abstracting: (1<=r_9_1)
states: 278,065,664 (8)
abstracting: (p_1_2<=1)
states: 578,878,464 (8)
.
EG iterations: 1
abstracting: (p_1_2<=1)
states: 578,878,464 (8)
abstracting: (r_13_1<=1)
states: 578,878,464 (8)
abstracting: (p_1_2<=1)
states: 578,878,464 (8)
abstracting: (1<=r_6_0)
states: 278,227,968 (8)
abstracting: (r_14_2<=r_1_2)
states: 381,224,448 (8)
abstracting: (p_0_2<=r_1_2)
states: 529,927,168 (8)
abstracting: (r_2_1<=p_3_1)
states: 308,766,720 (8)
.abstracting: (r_10_0<=0)
states: 295,630,336 (8)
.....................
EG iterations: 21
abstracting: (p_12_1<=r_12_2)
states: 488,100,864 (8)
abstracting: (p_6_2<=0)
states: 500,849,664 (8)
.abstracting: (r_9_2<=0)
states: 303,357,952 (8)
abstracting: (r_5_0<=0)
states: 299,162,624 (8)
..-> the formula is TRUE

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

MC time: 0m 0.315sec

checking: EG [[[[[AF [r_13_2<=1] | [[AF [1<=r_8_0] & r_14_1<=1] & [A [p_10_2<=1 U r_14_0<=r_2_0] | ~ [r_9_2<=1]]]] & [[AG [p_1_2<=1] & [r_11_1<=1 | 1<=r_8_0]] & [[1<=r_14_0 | ~ [r_13_1<=p_3_1]] & [[p_11_0<=p_6_0 & r_11_0<=r_5_1] & 1<=r_3_1]]]] & [[[p_8_0<=r_6_2 | ~ [1<=r_3_2]] | AX [~ [p_9_1<=p_2_2]]] | E [r_14_1<=1 U EX [1<=p_12_0]]]] & AG [~ [AG [[r_12_1<=r_6_0 | p_9_1<=0]]]]]]
normalized: EG [[~ [E [true U ~ [E [true U ~ [[r_12_1<=r_6_0 | p_9_1<=0]]]]]] & [[[~ [EX [p_9_1<=p_2_2]] | [~ [1<=r_3_2] | p_8_0<=r_6_2]] | E [r_14_1<=1 U EX [1<=p_12_0]]] & [[[[~ [r_13_1<=p_3_1] | 1<=r_14_0] & [[p_11_0<=p_6_0 & r_11_0<=r_5_1] & 1<=r_3_1]] & [[r_11_1<=1 | 1<=r_8_0] & ~ [E [true U ~ [p_1_2<=1]]]]] & [~ [EG [~ [r_13_2<=1]]] | [[r_14_1<=1 & ~ [EG [~ [1<=r_8_0]]]] & [~ [r_9_2<=1] | [~ [EG [~ [r_14_0<=r_2_0]]] & ~ [E [~ [r_14_0<=r_2_0] U [~ [p_10_2<=1] & ~ [r_14_0<=r_2_0]]]]]]]]]]]]

abstracting: (r_14_0<=r_2_0)
states: 413,723,648 (8)
abstracting: (p_10_2<=1)
states: 578,878,464 (8)
abstracting: (r_14_0<=r_2_0)
states: 413,723,648 (8)
abstracting: (r_14_0<=r_2_0)
states: 413,723,648 (8)
.........................
EG iterations: 25
abstracting: (r_9_2<=1)
states: 578,878,464 (8)
abstracting: (1<=r_8_0)
states: 279,715,840 (8)
.......................
EG iterations: 23
abstracting: (r_14_1<=1)
states: 578,878,464 (8)
abstracting: (r_13_2<=1)
states: 578,878,464 (8)
.
EG iterations: 1
abstracting: (p_1_2<=1)
states: 578,878,464 (8)
abstracting: (1<=r_8_0)
states: 279,715,840 (8)
abstracting: (r_11_1<=1)
states: 578,878,464 (8)
abstracting: (1<=r_3_1)
states: 287,965,696 (8)
abstracting: (r_11_0<=r_5_1)
states: 439,156,736 (8)
abstracting: (p_11_0<=p_6_0)
states: 537,508,864 (8)
abstracting: (1<=r_14_0)
states: 312,117,248 (8)
abstracting: (r_13_1<=p_3_1)
states: 386,347,520 (8)
abstracting: (1<=p_12_0)
states: 240,407,552 (8)
.abstracting: (r_14_1<=1)
states: 578,878,464 (8)
abstracting: (p_8_0<=r_6_2)
states: 461,301,248 (8)
abstracting: (1<=r_3_2)
states: 283,171,840 (8)
abstracting: (p_9_1<=p_2_2)
states: 458,398,720 (8)
.abstracting: (p_9_1<=0)
states: 434,641,920 (8)
abstracting: (r_12_1<=r_6_0)
states: 420,301,824 (8)
....................
EG iterations: 20
-> the formula is FALSE

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

MC time: 0m 0.346sec

totally nodes used: 5632801 (5.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1829009 7795690 9624699
used/not used/entry size/cache size: 11766337 55342527 16 1024MB
basic ops cache: hits/miss/sum: 478480 1792349 2270829
used/not used/entry size/cache size: 3200740 13576476 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: 4317 23078 27395
used/not used/entry size/cache size: 23059 8365549 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 62158936
1 4364453
2 499611
3 75409
4 9463
5 909
6 79
7 4
8 0
9 0
>= 10 0

Total processing time: 0m 8.933sec


BK_STOP 1678940741418

--------------------
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:459 (7), effective:90 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:197 (3), effective:20 (0)

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

iterations count:180 (3), effective:23 (0)

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

iterations count:580 (9), effective:99 (1)

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

iterations count:608 (10), effective:101 (1)

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

iterations count:315 (5), effective:42 (0)

iterations count:404 (6), effective:58 (0)

iterations count:404 (6), effective:58 (0)

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

iterations count:404 (6), effective:58 (0)

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

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

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

iterations count:272 (4), effective:36 (0)

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

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

iterations count:613 (10), effective:97 (1)

iterations count:97 (1), effective:10 (0)

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

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

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

iterations count:726 (12), effective:117 (1)

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

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

iterations count:244 (4), effective:32 (0)

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

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

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

iterations count:276 (4), effective:36 (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-R003C015"
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-R003C015, 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-167889192500697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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