About the Execution of Marcie for ResAllocation-PT-R010C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.088 | 5080.00 | 5019.00 | 60.00 | TFFFTTTFFFTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r321-tall-167889192600737.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-R010C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192600737
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 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.3K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:29 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 43K 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-R010C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678942393597
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-R010C002
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_R010C002
(NrP: 40 NrTr: 22 NrArc: 100)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.883sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 116 (1.2e+02) #states 6,144 (3)
starting MCC model checker
--------------------------
checking: EG [1<=r_0_9]
normalized: EG [1<=r_0_9]
abstracting: (1<=r_0_9)
states: 2,816 (3)
............................................................................................
EG iterations: 92
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: ~ [AX [~ [AF [[r_1_5<=0 | [EF [r_1_8<=1] & AG [1<=p_1_4]]]]]]]
normalized: EX [~ [EG [~ [[[E [true U r_1_8<=1] & ~ [E [true U ~ [1<=p_1_4]]]] | r_1_5<=0]]]]]
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (r_1_8<=1)
states: 6,144 (3)
..................
EG iterations: 18
.-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: ~ [AX [EG [A [[~ [r_1_8<=r_0_4] & ~ [1<=r_1_3]] U 1<=r_1_0]]]]
normalized: EX [~ [EG [[~ [EG [~ [1<=r_1_0]]] & ~ [E [~ [1<=r_1_0] U [~ [[~ [1<=r_1_3] & ~ [r_1_8<=r_0_4]]] & ~ [1<=r_1_0]]]]]]]]
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (r_1_8<=r_0_4)
states: 4,224 (3)
abstracting: (1<=r_1_3)
states: 4,864 (3)
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (1<=r_1_0)
states: 5,632 (3)
...............................................
EG iterations: 47
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AX [AX [AG [[A [1<=p_0_4 U p_1_1<=p_1_9] | ~ [[1<=p_0_6 & 1<=r_1_0]]]]]]
normalized: ~ [EX [EX [E [true U ~ [[~ [[1<=p_0_6 & 1<=r_1_0]] | [~ [EG [~ [p_1_1<=p_1_9]]] & ~ [E [~ [p_1_1<=p_1_9] U [~ [1<=p_0_4] & ~ [p_1_1<=p_1_9]]]]]]]]]]]
abstracting: (p_1_1<=p_1_9)
states: 5,760 (3)
abstracting: (1<=p_0_4)
states: 1,792 (3)
abstracting: (p_1_1<=p_1_9)
states: 5,760 (3)
abstracting: (p_1_1<=p_1_9)
states: 5,760 (3)
................
EG iterations: 16
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
..-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [[p_0_8<=r_1_0 & E [EX [AG [1<=r_1_9]] U ~ [[E [r_1_4<=r_0_9 U 1<=r_1_2] | EX [p_1_1<=0]]]]]]]
normalized: ~ [E [true U [E [EX [~ [E [true U ~ [1<=r_1_9]]]] U ~ [[EX [p_1_1<=0] | E [r_1_4<=r_0_9 U 1<=r_1_2]]]] & p_0_8<=r_1_0]]]
abstracting: (p_0_8<=r_1_0)
states: 6,144 (3)
abstracting: (1<=r_1_2)
states: 5,120 (3)
abstracting: (r_1_4<=r_0_9)
states: 3,584 (3)
abstracting: (p_1_1<=0)
states: 5,376 (3)
.abstracting: (1<=r_1_9)
states: 3,328 (3)
.-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: A [~ [1<=r_0_2] U ~ [EF [[~ [[p_1_9<=p_0_1 & 1<=r_0_5]] & ~ [[[p_1_7<=0 & p_1_7<=1] & EX [1<=r_1_3]]]]]]]
normalized: [~ [EG [E [true U [~ [[EX [1<=r_1_3] & [p_1_7<=0 & p_1_7<=1]]] & ~ [[p_1_9<=p_0_1 & 1<=r_0_5]]]]]] & ~ [E [E [true U [~ [[EX [1<=r_1_3] & [p_1_7<=0 & p_1_7<=1]]] & ~ [[p_1_9<=p_0_1 & 1<=r_0_5]]]] U [E [true U [~ [[EX [1<=r_1_3] & [p_1_7<=0 & p_1_7<=1]]] & ~ [[p_1_9<=p_0_1 & 1<=r_0_5]]]] & 1<=r_0_2]]]]
abstracting: (1<=r_0_2)
states: 2,816 (3)
abstracting: (1<=r_0_5)
states: 2,816 (3)
abstracting: (p_1_9<=p_0_1)
states: 4,480 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
abstracting: (p_1_7<=0)
states: 3,840 (3)
abstracting: (1<=r_1_3)
states: 4,864 (3)
.abstracting: (1<=r_0_5)
states: 2,816 (3)
abstracting: (p_1_9<=p_0_1)
states: 4,480 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
abstracting: (p_1_7<=0)
states: 3,840 (3)
abstracting: (1<=r_1_3)
states: 4,864 (3)
.abstracting: (1<=r_0_5)
states: 2,816 (3)
abstracting: (p_1_9<=p_0_1)
states: 4,480 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
abstracting: (p_1_7<=0)
states: 3,840 (3)
abstracting: (1<=r_1_3)
states: 4,864 (3)
.
EG iterations: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AF [[~ [[r_1_7<=0 & ~ [E [[r_0_1<=0 | p_1_3<=p_1_2] U [r_0_8<=1 | 1<=r_0_8]]]]] & AF [1<=r_0_5]]]
normalized: ~ [EG [~ [[~ [EG [~ [1<=r_0_5]]] & ~ [[~ [E [[r_0_1<=0 | p_1_3<=p_1_2] U [r_0_8<=1 | 1<=r_0_8]]] & r_1_7<=0]]]]]]
abstracting: (r_1_7<=0)
states: 2,304 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (p_1_3<=p_1_2)
states: 5,376 (3)
abstracting: (r_0_1<=0)
states: 3,328 (3)
abstracting: (1<=r_0_5)
states: 2,816 (3)
...................
EG iterations: 19
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EG [~ [[E [r_0_7<=1 U [~ [[r_1_8<=r_0_5 & r_1_5<=1]] & [~ [p_0_1<=r_0_3] | [r_1_9<=1 | 1<=r_1_1]]]] & AG [~ [AG [r_0_9<=0]]]]]]
normalized: EG [~ [[~ [E [true U ~ [E [true U ~ [r_0_9<=0]]]]] & E [r_0_7<=1 U [[[r_1_9<=1 | 1<=r_1_1] | ~ [p_0_1<=r_0_3]] & ~ [[r_1_8<=r_0_5 & r_1_5<=1]]]]]]]
abstracting: (r_1_5<=1)
states: 6,144 (3)
abstracting: (r_1_8<=r_0_5)
states: 4,224 (3)
abstracting: (p_0_1<=r_0_3)
states: 4,736 (3)
abstracting: (1<=r_1_1)
states: 5,376 (3)
abstracting: (r_1_9<=1)
states: 6,144 (3)
abstracting: (r_0_7<=1)
states: 6,144 (3)
abstracting: (r_0_9<=0)
states: 3,328 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: [~ [AG [1<=r_1_0]] | EG [[~ [E [1<=p_0_6 U [AF [p_0_6<=p_0_5] | [1<=p_0_5 | 1<=p_0_0]]]] & EG [[~ [[r_1_8<=0 & p_1_7<=1]] & 1<=r_0_8]]]]]
normalized: [EG [[EG [[~ [[r_1_8<=0 & p_1_7<=1]] & 1<=r_0_8]] & ~ [E [1<=p_0_6 U [[1<=p_0_5 | 1<=p_0_0] | ~ [EG [~ [p_0_6<=p_0_5]]]]]]]] | E [true U ~ [1<=r_1_0]]]
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (p_0_6<=p_0_5)
states: 5,504 (3)
.............................
EG iterations: 29
abstracting: (1<=p_0_0)
states: 2,816 (3)
abstracting: (1<=p_0_5)
states: 1,536 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
abstracting: (r_1_8<=0)
states: 2,560 (3)
...........................................................................
EG iterations: 75
.
EG iterations: 1
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: EG [[[AG [[[1<=p_0_7 | AX [p_1_1<=0]] | [[1<=r_0_0 & p_0_1<=0] & ~ [r_1_6<=r_0_7]]]] | [~ [[r_0_0<=0 | r_1_4<=r_1_6]] | r_0_9<=r_1_1]] & p_0_1<=1]]
normalized: EG [[[~ [E [true U ~ [[[~ [r_1_6<=r_0_7] & [1<=r_0_0 & p_0_1<=0]] | [~ [EX [~ [p_1_1<=0]]] | 1<=p_0_7]]]]] | [~ [[r_0_0<=0 | r_1_4<=r_1_6]] | r_0_9<=r_1_1]] & p_0_1<=1]]
abstracting: (p_0_1<=1)
states: 6,144 (3)
abstracting: (r_0_9<=r_1_1)
states: 5,760 (3)
abstracting: (r_1_4<=r_1_6)
states: 4,864 (3)
abstracting: (r_0_0<=0)
states: 3,328 (3)
abstracting: (1<=p_0_7)
states: 1,024 (3)
abstracting: (p_1_1<=0)
states: 5,376 (3)
.abstracting: (p_0_1<=0)
states: 3,584 (3)
abstracting: (1<=r_0_0)
states: 2,816 (3)
abstracting: (r_1_6<=r_0_7)
states: 3,840 (3)
..............
EG iterations: 14
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [EX [r_1_4<=r_1_0] U [r_0_2<=r_0_1 & [~ [[E [AF [1<=r_0_1] U [1<=p_0_6 | p_1_6<=1]] | r_0_5<=r_1_2]] & ~ [[AX [r_1_9<=0] & AX [E [1<=r_0_1 U p_1_2<=0]]]]]]]
normalized: [~ [EG [~ [[[~ [[~ [EX [~ [E [1<=r_0_1 U p_1_2<=0]]]] & ~ [EX [~ [r_1_9<=0]]]]] & ~ [[E [~ [EG [~ [1<=r_0_1]]] U [1<=p_0_6 | p_1_6<=1]] | r_0_5<=r_1_2]]] & r_0_2<=r_0_1]]]] & ~ [E [~ [[[~ [[~ [EX [~ [E [1<=r_0_1 U p_1_2<=0]]]] & ~ [EX [~ [r_1_9<=0]]]]] & ~ [[E [~ [EG [~ [1<=r_0_1]]] U [1<=p_0_6 | p_1_6<=1]] | r_0_5<=r_1_2]]] & r_0_2<=r_0_1]] U [~ [EX [r_1_4<=r_1_0]] & ~ [[[~ [[~ [EX [~ [E [1<=r_0_1 U p_1_2<=0]]]] & ~ [EX [~ [r_1_9<=0]]]]] & ~ [[E [~ [EG [~ [1<=r_0_1]]] U [1<=p_0_6 | p_1_6<=1]] | r_0_5<=r_1_2]]] & r_0_2<=r_0_1]]]]]]
abstracting: (r_0_2<=r_0_1)
states: 4,608 (3)
abstracting: (r_0_5<=r_1_2)
states: 5,632 (3)
abstracting: (p_1_6<=1)
states: 6,144 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.......................
EG iterations: 23
abstracting: (r_1_9<=0)
states: 2,816 (3)
.abstracting: (p_1_2<=0)
states: 5,120 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.abstracting: (r_1_4<=r_1_0)
states: 5,888 (3)
.abstracting: (r_0_2<=r_0_1)
states: 4,608 (3)
abstracting: (r_0_5<=r_1_2)
states: 5,632 (3)
abstracting: (p_1_6<=1)
states: 6,144 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.......................
EG iterations: 23
abstracting: (r_1_9<=0)
states: 2,816 (3)
.abstracting: (p_1_2<=0)
states: 5,120 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.abstracting: (r_0_2<=r_0_1)
states: 4,608 (3)
abstracting: (r_0_5<=r_1_2)
states: 5,632 (3)
abstracting: (p_1_6<=1)
states: 6,144 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.......................
EG iterations: 23
abstracting: (r_1_9<=0)
states: 2,816 (3)
.abstracting: (p_1_2<=0)
states: 5,120 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
.
EG iterations: 0
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: E [~ [[AX [[r_0_4<=0 | r_0_1<=0]] & [[EG [r_1_5<=0] | [r_1_8<=r_1_1 & p_0_5<=1]] | ~ [EX [r_1_4<=r_1_3]]]]] U [[EX [r_0_5<=1] & ~ [AF [1<=r_0_9]]] & A [[A [[1<=r_0_4 & 1<=p_1_7] U AF [1<=p_1_1]] | EX [EF [p_1_0<=r_0_9]]] U ~ [1<=p_0_7]]]]
normalized: E [~ [[[~ [EX [r_1_4<=r_1_3]] | [[r_1_8<=r_1_1 & p_0_5<=1] | EG [r_1_5<=0]]] & ~ [EX [~ [[r_0_4<=0 | r_0_1<=0]]]]]] U [[~ [EG [1<=p_0_7]] & ~ [E [1<=p_0_7 U [~ [[EX [E [true U p_1_0<=r_0_9]] | [~ [EG [EG [~ [1<=p_1_1]]]] & ~ [E [EG [~ [1<=p_1_1]] U [~ [[1<=r_0_4 & 1<=p_1_7]] & EG [~ [1<=p_1_1]]]]]]]] & 1<=p_0_7]]]] & [EG [~ [1<=r_0_9]] & EX [r_0_5<=1]]]]
abstracting: (r_0_5<=1)
states: 6,144 (3)
.abstracting: (1<=r_0_9)
states: 2,816 (3)
...............................................
EG iterations: 47
abstracting: (1<=p_0_7)
states: 1,024 (3)
abstracting: (1<=p_1_1)
states: 768
.
EG iterations: 1
abstracting: (1<=p_1_7)
states: 2,304 (3)
abstracting: (1<=r_0_4)
states: 2,816 (3)
abstracting: (1<=p_1_1)
states: 768
.
EG iterations: 1
abstracting: (1<=p_1_1)
states: 768
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_1_0<=r_0_9)
states: 5,888 (3)
.abstracting: (1<=p_0_7)
states: 1,024 (3)
abstracting: (1<=p_0_7)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (r_0_1<=0)
states: 3,328 (3)
abstracting: (r_0_4<=0)
states: 3,328 (3)
.abstracting: (r_1_5<=0)
states: 1,792 (3)
.................
EG iterations: 17
abstracting: (p_0_5<=1)
states: 6,144 (3)
abstracting: (r_1_8<=r_1_1)
states: 5,760 (3)
abstracting: (r_1_4<=r_1_3)
states: 5,504 (3)
.-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: ~ [A [~ [[[~ [[r_1_2<=p_0_9 | r_1_9<=p_0_4]] & ~ [AG [p_1_4<=0]]] & AG [~ [[1<=r_1_0 | 1<=p_0_5]]]]] U A [~ [[[[r_1_5<=p_0_8 & 1<=r_1_6] | [r_0_8<=1 & r_0_3<=0]] & AX [r_0_5<=0]]] U [~ [r_1_7<=r_1_0] | [~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]] & ~ [E [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]] U [[~ [EX [~ [r_0_5<=0]]] & [[r_0_8<=1 & r_0_3<=0] | [r_1_5<=p_0_8 & 1<=r_1_6]]] & ~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]] & ~ [E [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]] U [[~ [EX [~ [r_0_5<=0]]] & [[r_0_8<=1 & r_0_3<=0] | [r_1_5<=p_0_8 & 1<=r_1_6]]] & ~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]]]]] U [[~ [E [true U [1<=r_1_0 | 1<=p_0_5]]] & [E [true U ~ [p_1_4<=0]] & ~ [[r_1_2<=p_0_9 | r_1_9<=p_0_4]]]] & ~ [[~ [EG [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]] & ~ [E [~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]] U [[~ [EX [~ [r_0_5<=0]]] & [[r_0_8<=1 & r_0_3<=0] | [r_1_5<=p_0_8 & 1<=r_1_6]]] & ~ [[[~ [[p_1_2<=r_0_1 & p_1_2<=p_1_7]] & 1<=p_1_4] | ~ [r_1_7<=r_1_0]]]]]]]]]]]]]
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (1<=r_1_6)
states: 4,096 (3)
abstracting: (r_1_5<=p_0_8)
states: 2,560 (3)
abstracting: (r_0_3<=0)
states: 3,328 (3)
abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (r_0_5<=0)
states: 3,328 (3)
.abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
...............................
EG iterations: 31
abstracting: (r_1_9<=p_0_4)
states: 3,840 (3)
abstracting: (r_1_2<=p_0_9)
states: 1,536 (3)
abstracting: (p_1_4<=0)
states: 4,608 (3)
abstracting: (1<=p_0_5)
states: 1,536 (3)
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (1<=r_1_6)
states: 4,096 (3)
abstracting: (r_1_5<=p_0_8)
states: 2,560 (3)
abstracting: (r_0_3<=0)
states: 3,328 (3)
abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (r_0_5<=0)
states: 3,328 (3)
.abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
...............................
EG iterations: 31
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (1<=r_1_6)
states: 4,096 (3)
abstracting: (r_1_5<=p_0_8)
states: 2,560 (3)
abstracting: (r_0_3<=0)
states: 3,328 (3)
abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (r_0_5<=0)
states: 3,328 (3)
.abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
abstracting: (r_1_7<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_1_2<=p_1_7)
states: 5,632 (3)
abstracting: (p_1_2<=r_0_1)
states: 5,504 (3)
...............................
EG iterations: 31
...............................
EG iterations: 31
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: [[AF [E [[EF [1<=p_1_7] | r_1_3<=p_0_2] U ~ [[[p_0_0<=p_0_9 & 1<=p_1_5] & AX [r_0_9<=p_1_9]]]]] & E [AG [r_0_2<=1] U A [[AX [p_0_3<=r_1_9] | ~ [[p_1_9<=r_1_4 | r_1_3<=p_1_7]]] U EG [AX [1<=p_0_1]]]]] | [EX [EF [~ [AF [p_1_6<=0]]]] & AX [[~ [[[A [1<=p_0_8 U r_1_0<=0] & A [r_0_0<=1 U r_1_0<=1]] & EG [1<=r_0_6]]] | [A [[r_0_7<=p_0_8 | p_1_4<=p_1_9] U E [p_0_3<=0 U r_0_5<=1]] | EF [1<=r_1_8]]]]]]
normalized: [[E [~ [E [true U ~ [r_0_2<=1]]] U [~ [EG [~ [EG [~ [EX [~ [1<=p_0_1]]]]]]] & ~ [E [~ [EG [~ [EX [~ [1<=p_0_1]]]]] U [~ [[~ [[p_1_9<=r_1_4 | r_1_3<=p_1_7]] | ~ [EX [~ [p_0_3<=r_1_9]]]]] & ~ [EG [~ [EX [~ [1<=p_0_1]]]]]]]]]] & ~ [EG [~ [E [[E [true U 1<=p_1_7] | r_1_3<=p_0_2] U ~ [[~ [EX [~ [r_0_9<=p_1_9]]] & [p_0_0<=p_0_9 & 1<=p_1_5]]]]]]]] | [~ [EX [~ [[[E [true U 1<=r_1_8] | [~ [EG [~ [E [p_0_3<=0 U r_0_5<=1]]]] & ~ [E [~ [E [p_0_3<=0 U r_0_5<=1]] U [~ [[r_0_7<=p_0_8 | p_1_4<=p_1_9]] & ~ [E [p_0_3<=0 U r_0_5<=1]]]]]]] | ~ [[EG [1<=r_0_6] & [[~ [EG [~ [r_1_0<=1]]] & ~ [E [~ [r_1_0<=1] U [~ [r_0_0<=1] & ~ [r_1_0<=1]]]]] & [~ [EG [~ [r_1_0<=0]]] & ~ [E [~ [r_1_0<=0] U [~ [1<=p_0_8] & ~ [r_1_0<=0]]]]]]]]]]]] & EX [E [true U EG [~ [p_1_6<=0]]]]]]
abstracting: (p_1_6<=0)
states: 4,096 (3)
.................
EG iterations: 17
.abstracting: (r_1_0<=0)
states: 512
abstracting: (1<=p_0_8)
states: 768
abstracting: (r_1_0<=0)
states: 512
abstracting: (r_1_0<=0)
states: 512
.
EG iterations: 1
abstracting: (r_1_0<=1)
states: 6,144 (3)
abstracting: (r_0_0<=1)
states: 6,144 (3)
abstracting: (r_1_0<=1)
states: 6,144 (3)
abstracting: (r_1_0<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=r_0_6)
states: 2,816 (3)
..................................................
EG iterations: 50
abstracting: (r_0_5<=1)
states: 6,144 (3)
abstracting: (p_0_3<=0)
states: 4,096 (3)
abstracting: (p_1_4<=p_1_9)
states: 5,376 (3)
abstracting: (r_0_7<=p_0_8)
states: 3,712 (3)
abstracting: (r_0_5<=1)
states: 6,144 (3)
abstracting: (p_0_3<=0)
states: 4,096 (3)
abstracting: (r_0_5<=1)
states: 6,144 (3)
abstracting: (p_0_3<=0)
states: 4,096 (3)
.
EG iterations: 1
abstracting: (1<=r_1_8)
states: 3,584 (3)
.abstracting: (1<=p_1_5)
states: 1,792 (3)
abstracting: (p_0_0<=p_0_9)
states: 3,584 (3)
abstracting: (r_0_9<=p_1_9)
states: 3,328 (3)
.abstracting: (r_1_3<=p_0_2)
states: 3,328 (3)
abstracting: (1<=p_1_7)
states: 2,304 (3)
.
EG iterations: 1
abstracting: (1<=p_0_1)
states: 2,560 (3)
..................
EG iterations: 17
abstracting: (p_0_3<=r_1_9)
states: 5,248 (3)
.abstracting: (r_1_3<=p_1_7)
states: 2,944 (3)
abstracting: (p_1_9<=r_1_4)
states: 5,376 (3)
abstracting: (1<=p_0_1)
states: 2,560 (3)
..................
EG iterations: 17
abstracting: (1<=p_0_1)
states: 2,560 (3)
..................
EG iterations: 17
.............................................
EG iterations: 45
abstracting: (r_0_2<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: [[AF [AF [[AG [p_0_9<=1] & AF [r_1_2<=1]]]] | [EX [[EF [A [p_0_7<=p_1_7 U 1<=p_0_9]] & A [~ [r_1_9<=0] U AF [p_0_0<=0]]]] & AF [EG [[[1<=p_1_4 & r_0_8<=1] & EF [p_0_9<=1]]]]]] & [AX [A [[p_0_0<=r_1_0 | [~ [r_1_5<=r_0_4] | p_0_6<=0]] U [E [1<=r_0_8 U 1<=r_0_1] & [[1<=r_0_6 & p_1_6<=0] | [1<=r_0_2 | 1<=r_0_8]]]]] | [E [~ [[A [1<=p_0_1 U r_1_5<=r_1_0] | r_0_0<=0]] U r_0_9<=r_1_1] | AG [~ [r_1_1<=p_1_9]]]]]
normalized: [[[~ [E [true U r_1_1<=p_1_9]] | E [~ [[[~ [EG [~ [r_1_5<=r_1_0]]] & ~ [E [~ [r_1_5<=r_1_0] U [~ [1<=p_0_1] & ~ [r_1_5<=r_1_0]]]]] | r_0_0<=0]] U r_0_9<=r_1_1]] | ~ [EX [~ [[~ [EG [~ [[[[1<=r_0_2 | 1<=r_0_8] | [1<=r_0_6 & p_1_6<=0]] & E [1<=r_0_8 U 1<=r_0_1]]]]] & ~ [E [~ [[[[1<=r_0_2 | 1<=r_0_8] | [1<=r_0_6 & p_1_6<=0]] & E [1<=r_0_8 U 1<=r_0_1]]] U [~ [[[~ [r_1_5<=r_0_4] | p_0_6<=0] | p_0_0<=r_1_0]] & ~ [[[[1<=r_0_2 | 1<=r_0_8] | [1<=r_0_6 & p_1_6<=0]] & E [1<=r_0_8 U 1<=r_0_1]]]]]]]]]]] & [[~ [EG [~ [EG [[E [true U p_0_9<=1] & [1<=p_1_4 & r_0_8<=1]]]]]] & EX [[[~ [EG [EG [~ [p_0_0<=0]]]] & ~ [E [EG [~ [p_0_0<=0]] U [EG [~ [p_0_0<=0]] & r_1_9<=0]]]] & E [true U [~ [EG [~ [1<=p_0_9]]] & ~ [E [~ [1<=p_0_9] U [~ [p_0_7<=p_1_7] & ~ [1<=p_0_9]]]]]]]]] | ~ [EG [EG [~ [[~ [EG [~ [r_1_2<=1]]] & ~ [E [true U ~ [p_0_9<=1]]]]]]]]]]
abstracting: (p_0_9<=1)
states: 6,144 (3)
abstracting: (r_1_2<=1)
states: 6,144 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p_0_9)
states: 512
abstracting: (p_0_7<=p_1_7)
states: 5,120 (3)
abstracting: (1<=p_0_9)
states: 512
abstracting: (1<=p_0_9)
states: 512
.
EG iterations: 1
abstracting: (r_1_9<=0)
states: 2,816 (3)
abstracting: (p_0_0<=0)
states: 3,328 (3)
.............................
EG iterations: 29
abstracting: (p_0_0<=0)
states: 3,328 (3)
.............................
EG iterations: 29
abstracting: (p_0_0<=0)
states: 3,328 (3)
.............................
EG iterations: 29
.
EG iterations: 1
.abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (p_0_9<=1)
states: 6,144 (3)
...................
EG iterations: 19
..................................
EG iterations: 34
abstracting: (1<=r_0_1)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (p_1_6<=0)
states: 4,096 (3)
abstracting: (1<=r_0_6)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (1<=r_0_2)
states: 2,816 (3)
abstracting: (p_0_0<=r_1_0)
states: 6,144 (3)
abstracting: (p_0_6<=0)
states: 4,864 (3)
abstracting: (r_1_5<=r_0_4)
states: 3,840 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (p_1_6<=0)
states: 4,096 (3)
abstracting: (1<=r_0_6)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (1<=r_0_2)
states: 2,816 (3)
abstracting: (1<=r_0_1)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (p_1_6<=0)
states: 4,096 (3)
abstracting: (1<=r_0_6)
states: 2,816 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
abstracting: (1<=r_0_2)
states: 2,816 (3)
.....
EG iterations: 5
.abstracting: (r_0_9<=r_1_1)
states: 5,760 (3)
abstracting: (r_0_0<=0)
states: 3,328 (3)
abstracting: (r_1_5<=r_1_0)
states: 5,888 (3)
abstracting: (1<=p_0_1)
states: 2,560 (3)
abstracting: (r_1_5<=r_1_0)
states: 5,888 (3)
abstracting: (r_1_5<=r_1_0)
states: 5,888 (3)
................
EG iterations: 16
abstracting: (r_1_1<=p_1_9)
states: 3,200 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: A [EX [AG [AX [A [p_0_4<=1 U p_1_9<=0]]]] U [[~ [A [1<=r_1_5 U [~ [1<=r_1_7] | EF [1<=p_1_6]]]] & ~ [AX [1<=p_0_6]]] | [AG [[[1<=p_0_3 | [r_0_0<=p_0_2 & r_0_9<=r_0_0]] | A [r_0_9<=r_0_4 U r_0_9<=r_0_4]]] & [[[A [1<=r_0_9 U p_1_2<=p_0_5] & AF [p_0_9<=0]] | [AG [p_1_7<=r_1_3] | p_0_3<=1]] | [[[[1<=r_1_1 | r_0_6<=p_1_4] | p_0_4<=r_1_5] | [~ [1<=p_1_4] & A [r_1_1<=r_0_4 U r_1_5<=0]]] & E [[p_0_9<=p_1_6 & p_0_4<=0] U [1<=p_1_1 & r_1_3<=1]]]]]]]
normalized: [~ [EG [~ [[[[[E [[p_0_9<=p_1_6 & p_0_4<=0] U [1<=p_1_1 & r_1_3<=1]] & [[[~ [EG [~ [r_1_5<=0]]] & ~ [E [~ [r_1_5<=0] U [~ [r_1_1<=r_0_4] & ~ [r_1_5<=0]]]]] & ~ [1<=p_1_4]] | [[1<=r_1_1 | r_0_6<=p_1_4] | p_0_4<=r_1_5]]] | [[~ [E [true U ~ [p_1_7<=r_1_3]]] | p_0_3<=1] | [~ [EG [~ [p_0_9<=0]]] & [~ [EG [~ [p_1_2<=p_0_5]]] & ~ [E [~ [p_1_2<=p_0_5] U [~ [1<=r_0_9] & ~ [p_1_2<=p_0_5]]]]]]]] & ~ [E [true U ~ [[[~ [EG [~ [r_0_9<=r_0_4]]] & ~ [E [~ [r_0_9<=r_0_4] U [~ [r_0_9<=r_0_4] & ~ [r_0_9<=r_0_4]]]]] | [1<=p_0_3 | [r_0_0<=p_0_2 & r_0_9<=r_0_0]]]]]]] | [EX [~ [1<=p_0_6]] & ~ [[~ [EG [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]] & ~ [E [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]] U [~ [1<=r_1_5] & ~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]]]]]]]]]] & ~ [E [~ [[[[[E [[p_0_9<=p_1_6 & p_0_4<=0] U [1<=p_1_1 & r_1_3<=1]] & [[[~ [EG [~ [r_1_5<=0]]] & ~ [E [~ [r_1_5<=0] U [~ [r_1_1<=r_0_4] & ~ [r_1_5<=0]]]]] & ~ [1<=p_1_4]] | [[1<=r_1_1 | r_0_6<=p_1_4] | p_0_4<=r_1_5]]] | [[~ [E [true U ~ [p_1_7<=r_1_3]]] | p_0_3<=1] | [~ [EG [~ [p_0_9<=0]]] & [~ [EG [~ [p_1_2<=p_0_5]]] & ~ [E [~ [p_1_2<=p_0_5] U [~ [1<=r_0_9] & ~ [p_1_2<=p_0_5]]]]]]]] & ~ [E [true U ~ [[[~ [EG [~ [r_0_9<=r_0_4]]] & ~ [E [~ [r_0_9<=r_0_4] U [~ [r_0_9<=r_0_4] & ~ [r_0_9<=r_0_4]]]]] | [1<=p_0_3 | [r_0_0<=p_0_2 & r_0_9<=r_0_0]]]]]]] | [EX [~ [1<=p_0_6]] & ~ [[~ [EG [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]] & ~ [E [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]] U [~ [1<=r_1_5] & ~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]]]]]]]] U [~ [EX [~ [E [true U EX [~ [[~ [EG [~ [p_1_9<=0]]] & ~ [E [~ [p_1_9<=0] U [~ [p_0_4<=1] & ~ [p_1_9<=0]]]]]]]]]]] & ~ [[[[[E [[p_0_9<=p_1_6 & p_0_4<=0] U [1<=p_1_1 & r_1_3<=1]] & [[[~ [EG [~ [r_1_5<=0]]] & ~ [E [~ [r_1_5<=0] U [~ [r_1_1<=r_0_4] & ~ [r_1_5<=0]]]]] & ~ [1<=p_1_4]] | [[1<=r_1_1 | r_0_6<=p_1_4] | p_0_4<=r_1_5]]] | [[~ [E [true U ~ [p_1_7<=r_1_3]]] | p_0_3<=1] | [~ [EG [~ [p_0_9<=0]]] & [~ [EG [~ [p_1_2<=p_0_5]]] & ~ [E [~ [p_1_2<=p_0_5] U [~ [1<=r_0_9] & ~ [p_1_2<=p_0_5]]]]]]]] & ~ [E [true U ~ [[[~ [EG [~ [r_0_9<=r_0_4]]] & ~ [E [~ [r_0_9<=r_0_4] U [~ [r_0_9<=r_0_4] & ~ [r_0_9<=r_0_4]]]]] | [1<=p_0_3 | [r_0_0<=p_0_2 & r_0_9<=r_0_0]]]]]]] | [EX [~ [1<=p_0_6]] & ~ [[~ [EG [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]] & ~ [E [~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]] U [~ [1<=r_1_5] & ~ [[E [true U 1<=p_1_6] | ~ [1<=r_1_7]]]]]]]]]]]]]]]
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_5)
states: 4,352 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 1,280 (3)
.abstracting: (r_0_9<=r_0_0)
states: 4,608 (3)
abstracting: (r_0_0<=p_0_2)
states: 4,480 (3)
abstracting: (1<=p_0_3)
states: 2,048 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (1<=r_0_9)
states: 2,816 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
.
EG iterations: 1
abstracting: (p_0_9<=0)
states: 5,632 (3)
...............................................
EG iterations: 47
abstracting: (p_0_3<=1)
states: 6,144 (3)
abstracting: (p_1_7<=r_1_3)
states: 5,504 (3)
abstracting: (p_0_4<=r_1_5)
states: 5,888 (3)
abstracting: (r_0_6<=p_1_4)
states: 4,096 (3)
abstracting: (1<=r_1_1)
states: 5,376 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_1<=r_0_4)
states: 3,200 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
.....................
EG iterations: 21
abstracting: (r_1_3<=1)
states: 6,144 (3)
abstracting: (1<=p_1_1)
states: 768
abstracting: (p_0_4<=0)
states: 4,352 (3)
abstracting: (p_0_9<=p_1_6)
states: 5,632 (3)
abstracting: (p_1_9<=0)
states: 3,328 (3)
abstracting: (p_0_4<=1)
states: 6,144 (3)
abstracting: (p_1_9<=0)
states: 3,328 (3)
abstracting: (p_1_9<=0)
states: 3,328 (3)
.............................
EG iterations: 29
..abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_5)
states: 4,352 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 1,280 (3)
.abstracting: (r_0_9<=r_0_0)
states: 4,608 (3)
abstracting: (r_0_0<=p_0_2)
states: 4,480 (3)
abstracting: (1<=p_0_3)
states: 2,048 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (1<=r_0_9)
states: 2,816 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
.
EG iterations: 1
abstracting: (p_0_9<=0)
states: 5,632 (3)
...............................................
EG iterations: 47
abstracting: (p_0_3<=1)
states: 6,144 (3)
abstracting: (p_1_7<=r_1_3)
states: 5,504 (3)
abstracting: (p_0_4<=r_1_5)
states: 5,888 (3)
abstracting: (r_0_6<=p_1_4)
states: 4,096 (3)
abstracting: (1<=r_1_1)
states: 5,376 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_1<=r_0_4)
states: 3,200 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
.....................
EG iterations: 21
abstracting: (r_1_3<=1)
states: 6,144 (3)
abstracting: (1<=p_1_1)
states: 768
abstracting: (p_0_4<=0)
states: 4,352 (3)
abstracting: (p_0_9<=p_1_6)
states: 5,632 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_5)
states: 4,352 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (1<=r_1_7)
states: 3,840 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (1<=p_0_6)
states: 1,280 (3)
.abstracting: (r_0_9<=r_0_0)
states: 4,608 (3)
abstracting: (r_0_0<=p_0_2)
states: 4,480 (3)
abstracting: (1<=p_0_3)
states: 2,048 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
abstracting: (r_0_9<=r_0_4)
states: 4,608 (3)
..........................
EG iterations: 26
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (1<=r_0_9)
states: 2,816 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
.
EG iterations: 1
abstracting: (p_0_9<=0)
states: 5,632 (3)
...............................................
EG iterations: 47
abstracting: (p_0_3<=1)
states: 6,144 (3)
abstracting: (p_1_7<=r_1_3)
states: 5,504 (3)
abstracting: (p_0_4<=r_1_5)
states: 5,888 (3)
abstracting: (r_0_6<=p_1_4)
states: 4,096 (3)
abstracting: (1<=r_1_1)
states: 5,376 (3)
abstracting: (1<=p_1_4)
states: 1,536 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_1<=r_0_4)
states: 3,200 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
abstracting: (r_1_5<=0)
states: 1,792 (3)
.....................
EG iterations: 21
abstracting: (r_1_3<=1)
states: 6,144 (3)
abstracting: (1<=p_1_1)
states: 768
abstracting: (p_0_4<=0)
states: 4,352 (3)
abstracting: (p_0_9<=p_1_6)
states: 5,632 (3)
.............................................
EG iterations: 45
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
totally nodes used: 389653 (3.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 193681 605575 799256
used/not used/entry size/cache size: 907054 66201810 16 1024MB
basic ops cache: hits/miss/sum: 71610 214453 286063
used/not used/entry size/cache size: 453743 16323473 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: 1169 2632 3801
used/not used/entry size/cache size: 2631 8385977 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 66736078
1 357204
2 14365
3 1152
4 62
5 3
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.033sec
BK_STOP 1678942398677
--------------------
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:434 (19), effective:110 (5)
initing FirstDep: 0m 0.000sec
iterations count:36 (1), effective:5 (0)
iterations count:22 (1), effective:0 (0)
iterations count:29 (1), effective:2 (0)
iterations count:22 (1), effective:0 (0)
iterations count:30 (1), effective:3 (0)
iterations count:27 (1), effective:2 (0)
iterations count:22 (1), effective:0 (0)
iterations count:579 (26), effective:174 (7)
iterations count:266 (12), effective:69 (3)
iterations count:266 (12), effective:69 (3)
iterations count:58 (2), effective:11 (0)
iterations count:266 (12), effective:69 (3)
iterations count:22 (1), effective:0 (0)
iterations count:112 (5), effective:29 (1)
iterations count:53 (2), effective:11 (0)
iterations count:188 (8), effective:56 (2)
iterations count:235 (10), effective:65 (2)
iterations count:22 (1), effective:0 (0)
iterations count:195 (8), effective:54 (2)
iterations count:22 (1), effective:0 (0)
iterations count:25 (1), effective:1 (0)
iterations count:22 (1), effective:0 (0)
iterations count:25 (1), effective:1 (0)
iterations count:664 (30), effective:203 (9)
iterations count:22 (1), effective:0 (0)
iterations count:25 (1), effective:1 (0)
iterations count:52 (2), effective:8 (0)
iterations count:49 (2), effective:9 (0)
iterations count:153 (6), effective:33 (1)
iterations count:84 (3), effective:19 (0)
iterations count:316 (14), effective:93 (4)
iterations count:102 (4), effective:27 (1)
iterations count:24 (1), effective:1 (0)
iterations count:316 (14), effective:93 (4)
iterations count:316 (14), effective:93 (4)
iterations count:146 (6), effective:40 (1)
iterations count:25 (1), effective:2 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:49 (2), effective:9 (0)
iterations count:45 (2), effective:9 (0)
iterations count:50 (2), effective:9 (0)
iterations count:85 (3), effective:21 (0)
iterations count:428 (19), effective:127 (5)
iterations count:155 (7), effective:44 (2)
iterations count:219 (9), effective:65 (2)
iterations count:138 (6), effective:37 (1)
iterations count:22 (1), effective:0 (0)
iterations count:51 (2), effective:8 (0)
iterations count:51 (2), effective:8 (0)
iterations count:51 (2), effective:8 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:27 (1), effective:2 (0)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:22 (1), effective:0 (0)
iterations count:175 (7), effective:49 (2)
iterations count:26 (1), effective:1 (0)
iterations count:140 (6), effective:38 (1)
iterations count:74 (3), effective:17 (0)
iterations count:51 (2), effective:9 (0)
iterations count:141 (6), effective:36 (1)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:22 (1), effective:0 (0)
iterations count:175 (7), effective:49 (2)
iterations count:26 (1), effective:1 (0)
iterations count:140 (6), effective:38 (1)
iterations count:74 (3), effective:17 (0)
iterations count:51 (2), effective:9 (0)
iterations count:27 (1), effective:2 (0)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:60 (2), effective:14 (0)
iterations count:22 (1), effective:0 (0)
iterations count:175 (7), effective:49 (2)
iterations count:26 (1), effective:1 (0)
iterations count:140 (6), effective:38 (1)
iterations count:74 (3), effective:17 (0)
iterations count:51 (2), effective:9 (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-R010C002"
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-R010C002, 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-167889192600737"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 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 '
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 ;