About the Execution of Marcie for AutoFlight-PT-01a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.647 | 4920.00 | 5040.00 | 0.00 | FTFFTFTTTFTTTFFF | 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.r001-oct2-167813588600369.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-01a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588600369
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 8.7K Mar 5 18:22 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 AutoFlight-PT-01a-CTLCardinality-00
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-01
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-02
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-03
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-04
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-05
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-06
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-07
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-08
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-09
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-10
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-11
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-12
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-13
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-14
FORMULA_NAME AutoFlight-PT-01a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678391615902
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=AutoFlight-PT-01a
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: AutoFlight_PT_01a
(NrP: 32 NrTr: 30 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 3.026sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 150 (1.5e+02) #states 253
starting MCC model checker
--------------------------
checking: EG [1<=p20]
normalized: EG [1<=p20]
abstracting: (1<=p20)
states: 12
......
EG iterations: 6
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [~ [p18<=0]]
normalized: EG [~ [p18<=0]]
abstracting: (p18<=0)
states: 241
......
EG iterations: 6
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[EX [EF [EF [p7<=p14]]] & AX [1<=p25]]]
normalized: E [true U [~ [EX [~ [1<=p25]]] & EX [E [true U E [true U p7<=p14]]]]]
abstracting: (p7<=p14)
states: 13
.abstracting: (1<=p25)
states: 18
.-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [EF [A [p26<=0 U p0<=p12]]]
normalized: ~ [E [true U [~ [EG [~ [p0<=p12]]] & ~ [E [~ [p0<=p12] U [~ [p26<=0] & ~ [p0<=p12]]]]]]]
abstracting: (p0<=p12)
states: 252
abstracting: (p26<=0)
states: 235
abstracting: (p0<=p12)
states: 252
abstracting: (p0<=p12)
states: 252
..
EG iterations: 2
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [A [p30<=p6 U EF [p23<=p15]]]
normalized: ~ [EX [~ [[~ [EG [~ [E [true U p23<=p15]]]] & ~ [E [~ [E [true U p23<=p15]] U [~ [p30<=p6] & ~ [E [true U p23<=p15]]]]]]]]]
abstracting: (p23<=p15)
states: 79
abstracting: (p30<=p6)
states: 241
abstracting: (p23<=p15)
states: 79
abstracting: (p23<=p15)
states: 79
.
EG iterations: 1
.-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [AF [~ [EG [p9<=p2]]] U AG [[EF [1<=p28] & E [[EF [p1<=0] | ~ [p26<=1]] U EX [1<=p28]]]]]
normalized: [~ [EG [E [true U ~ [[E [[~ [p26<=1] | E [true U p1<=0]] U EX [1<=p28]] & E [true U 1<=p28]]]]]] & ~ [E [E [true U ~ [[E [[~ [p26<=1] | E [true U p1<=0]] U EX [1<=p28]] & E [true U 1<=p28]]]] U [EG [EG [p9<=p2]] & E [true U ~ [[E [[~ [p26<=1] | E [true U p1<=0]] U EX [1<=p28]] & E [true U 1<=p28]]]]]]]]
abstracting: (1<=p28)
states: 18
abstracting: (1<=p28)
states: 18
.abstracting: (p1<=0)
states: 159
abstracting: (p26<=1)
states: 253
abstracting: (p9<=p2)
states: 159
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p28)
states: 18
abstracting: (1<=p28)
states: 18
.abstracting: (p1<=0)
states: 159
abstracting: (p26<=1)
states: 253
abstracting: (1<=p28)
states: 18
abstracting: (1<=p28)
states: 18
.abstracting: (p1<=0)
states: 159
abstracting: (p26<=1)
states: 253
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EG [[[p4<=0 & A [1<=p20 U [~ [p4<=1] | ~ [[1<=p26 | p19<=1]]]]] | AG [[[p28<=0 | p26<=1] | AG [AG [1<=p3]]]]]]
normalized: EG [[[[~ [EG [~ [[~ [[1<=p26 | p19<=1]] | ~ [p4<=1]]]]] & ~ [E [~ [[~ [[1<=p26 | p19<=1]] | ~ [p4<=1]]] U [~ [1<=p20] & ~ [[~ [[1<=p26 | p19<=1]] | ~ [p4<=1]]]]]]] & p4<=0] | ~ [E [true U ~ [[~ [E [true U E [true U ~ [1<=p3]]]] | [p28<=0 | p26<=1]]]]]]]
abstracting: (p26<=1)
states: 253
abstracting: (p28<=0)
states: 235
abstracting: (1<=p3)
states: 94
abstracting: (p4<=0)
states: 161
abstracting: (p4<=1)
states: 253
abstracting: (p19<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (1<=p20)
states: 12
abstracting: (p4<=1)
states: 253
abstracting: (p19<=1)
states: 253
abstracting: (1<=p26)
states: 18
abstracting: (p4<=1)
states: 253
abstracting: (p19<=1)
states: 253
abstracting: (1<=p26)
states: 18
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EF [~ [[A [[p23<=0 & p5<=0] U [p7<=1 | p14<=p8]] & [~ [EF [p20<=1]] & A [p19<=p12 U 1<=p3]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [p19<=p12] & ~ [1<=p3]]]]] & ~ [E [true U p20<=1]]] & [~ [EG [~ [[p7<=1 | p14<=p8]]]] & ~ [E [~ [[p7<=1 | p14<=p8]] U [~ [[p23<=0 & p5<=0]] & ~ [[p7<=1 | p14<=p8]]]]]]]]]]
abstracting: (p14<=p8)
states: 247
abstracting: (p7<=1)
states: 253
abstracting: (p5<=0)
states: 185
abstracting: (p23<=0)
states: 67
abstracting: (p14<=p8)
states: 247
abstracting: (p7<=1)
states: 253
abstracting: (p14<=p8)
states: 247
abstracting: (p7<=1)
states: 253
.
EG iterations: 1
abstracting: (p20<=1)
states: 253
abstracting: (1<=p3)
states: 94
abstracting: (p19<=p12)
states: 241
abstracting: (1<=p3)
states: 94
abstracting: (1<=p3)
states: 94
..........
EG iterations: 10
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [[[p23<=1 | ~ [EF [~ [[p29<=1 | p26<=p20]]]]] | [EF [~ [A [p11<=1 U 1<=p25]]] & [EX [AG [p12<=p14]] & 1<=p26]]]]
normalized: EX [[[[EX [~ [E [true U ~ [p12<=p14]]]] & 1<=p26] & E [true U ~ [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [p11<=1] & ~ [1<=p25]]]]]]]] | [~ [E [true U ~ [[p29<=1 | p26<=p20]]]] | p23<=1]]]
abstracting: (p23<=1)
states: 253
abstracting: (p26<=p20)
states: 235
abstracting: (p29<=1)
states: 253
abstracting: (1<=p25)
states: 18
abstracting: (p11<=1)
states: 253
abstracting: (1<=p25)
states: 18
abstracting: (1<=p25)
states: 18
.
EG iterations: 1
abstracting: (1<=p26)
states: 18
abstracting: (p12<=p14)
states: 241
..-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [E [[[[~ [EG [1<=p12]] | EF [p30<=1]] | [[AX [p5<=0] & [1<=p15 & 1<=p7]] | [E [p12<=0 U p26<=0] & 1<=p8]]] | ~ [EG [EX [p0<=p2]]]] U p9<=1]]
normalized: ~ [EX [~ [E [[~ [EG [EX [p0<=p2]]] | [[[E [p12<=0 U p26<=0] & 1<=p8] | [[1<=p15 & 1<=p7] & ~ [EX [~ [p5<=0]]]]] | [E [true U p30<=1] | ~ [EG [1<=p12]]]]] U p9<=1]]]]
abstracting: (p9<=1)
states: 253
abstracting: (1<=p12)
states: 12
......
EG iterations: 6
abstracting: (p30<=1)
states: 253
abstracting: (p5<=0)
states: 185
.abstracting: (1<=p7)
states: 252
abstracting: (1<=p15)
states: 12
abstracting: (1<=p8)
states: 126
abstracting: (p26<=0)
states: 235
abstracting: (p12<=0)
states: 241
abstracting: (p0<=p2)
states: 252
..........
EG iterations: 9
.-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [~ [AG [AF [~ [[p24<=p6 | 1<=p14]]]]] & [~ [AF [AG [[~ [p3<=1] & ~ [1<=p24]]]]] & EG [AF [[p16<=0 | [p30<=p12 | [p11<=p2 | 1<=p28]]]]]]]
normalized: [[EG [~ [EG [~ [[[[p11<=p2 | 1<=p28] | p30<=p12] | p16<=0]]]]] & EG [E [true U ~ [[~ [1<=p24] & ~ [p3<=1]]]]]] & E [true U EG [[p24<=p6 | 1<=p14]]]]
abstracting: (1<=p14)
states: 12
abstracting: (p24<=p6)
states: 241
.
EG iterations: 1
abstracting: (p3<=1)
states: 253
abstracting: (1<=p24)
states: 18
EG iterations: 0
abstracting: (p16<=0)
states: 235
abstracting: (p30<=p12)
states: 235
abstracting: (1<=p28)
states: 18
abstracting: (p11<=p2)
states: 241
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [[[[1<=p2 & [[[1<=p26 & A [1<=p19 U 1<=p0]] | p26<=p0] | [[[p6<=p29 & p24<=1] & EX [p9<=p18]] & EG [1<=p3]]]] | EX [1<=p29]] | EG [[AG [p27<=0] & p22<=0]]]]
normalized: EX [[EG [[~ [E [true U ~ [p27<=0]]] & p22<=0]] | [EX [1<=p29] | [[[EG [1<=p3] & [EX [p9<=p18] & [p6<=p29 & p24<=1]]] | [[[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p19] & ~ [1<=p0]]]]] & 1<=p26] | p26<=p0]] & 1<=p2]]]]
abstracting: (1<=p2)
states: 64
abstracting: (p26<=p0)
states: 235
abstracting: (1<=p26)
states: 18
abstracting: (1<=p0)
states: 1
abstracting: (1<=p19)
states: 12
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (p24<=1)
states: 253
abstracting: (p6<=p29)
states: 223
abstracting: (p9<=p18)
states: 133
.abstracting: (1<=p3)
states: 94
..........
EG iterations: 10
abstracting: (1<=p29)
states: 162
.abstracting: (p22<=0)
states: 235
abstracting: (p27<=0)
states: 235
.
EG iterations: 1
.-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: ~ [AG [[EF [[[p25<=0 & ~ [1<=p27]] | 1<=p1]] | [[E [[1<=p8 | p10<=1] U [1<=p6 | p30<=1]] | [AX [1<=p17] & AX [p11<=p13]]] | A [[~ [1<=p21] | EF [p8<=p10]] U [[1<=p8 & p4<=p28] & ~ [p17<=1]]]]]]]
normalized: E [true U ~ [[[[~ [EG [~ [[~ [p17<=1] & [1<=p8 & p4<=p28]]]]] & ~ [E [~ [[~ [p17<=1] & [1<=p8 & p4<=p28]]] U [~ [[E [true U p8<=p10] | ~ [1<=p21]]] & ~ [[~ [p17<=1] & [1<=p8 & p4<=p28]]]]]]] | [[~ [EX [~ [p11<=p13]]] & ~ [EX [~ [1<=p17]]]] | E [[1<=p8 | p10<=1] U [1<=p6 | p30<=1]]]] | E [true U [[~ [1<=p27] & p25<=0] | 1<=p1]]]]]
abstracting: (1<=p1)
states: 94
abstracting: (p25<=0)
states: 235
abstracting: (1<=p27)
states: 18
abstracting: (p30<=1)
states: 253
abstracting: (1<=p6)
states: 92
abstracting: (p10<=1)
states: 253
abstracting: (1<=p8)
states: 126
abstracting: (1<=p17)
states: 174
.abstracting: (p11<=p13)
states: 241
.abstracting: (p4<=p28)
states: 167
abstracting: (1<=p8)
states: 126
abstracting: (p17<=1)
states: 253
abstracting: (1<=p21)
states: 12
abstracting: (p8<=p10)
states: 253
abstracting: (p4<=p28)
states: 167
abstracting: (1<=p8)
states: 126
abstracting: (p17<=1)
states: 253
abstracting: (p4<=p28)
states: 167
abstracting: (1<=p8)
states: 126
abstracting: (p17<=1)
states: 253
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [[~ [EG [EG [[p8<=p28 | [1<=p28 | p7<=p9]]]]] | ~ [[[[AF [AX [1<=p6]] & ~ [EF [p22<=p21]]] & AG [p14<=p14]] | E [EF [~ [1<=p30]] U [p18<=1 & [p23<=1 & AF [p18<=1]]]]]]] | A [[EF [AX [AX [p22<=0]]] | EG [p15<=p8]] U [AX [AX [~ [p11<=1]]] | 1<=p30]]]
normalized: [[~ [EG [~ [[~ [EX [EX [p11<=1]]] | 1<=p30]]]] & ~ [E [~ [[~ [EX [EX [p11<=1]]] | 1<=p30]] U [~ [[EG [p15<=p8] | E [true U ~ [EX [EX [~ [p22<=0]]]]]]] & ~ [[~ [EX [EX [p11<=1]]] | 1<=p30]]]]]] | [~ [[E [E [true U ~ [1<=p30]] U [[~ [EG [~ [p18<=1]]] & p23<=1] & p18<=1]] | [~ [E [true U ~ [p14<=p14]]] & [~ [E [true U p22<=p21]] & ~ [EG [EX [~ [1<=p6]]]]]]]] | ~ [EG [EG [[[1<=p28 | p7<=p9] | p8<=p28]]]]]]
abstracting: (p8<=p28)
states: 136
abstracting: (p7<=p9)
states: 127
abstracting: (1<=p28)
states: 18
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (1<=p6)
states: 92
..........
EG iterations: 9
abstracting: (p22<=p21)
states: 235
abstracting: (p14<=p14)
states: 253
abstracting: (p18<=1)
states: 253
abstracting: (p23<=1)
states: 253
abstracting: (p18<=1)
states: 253
.
EG iterations: 1
abstracting: (1<=p30)
states: 18
abstracting: (1<=p30)
states: 18
abstracting: (p11<=1)
states: 253
..abstracting: (p22<=0)
states: 235
..abstracting: (p15<=p8)
states: 247
.
EG iterations: 1
abstracting: (1<=p30)
states: 18
abstracting: (p11<=1)
states: 253
..abstracting: (1<=p30)
states: 18
abstracting: (p11<=1)
states: 253
................
EG iterations: 14
-> the formula is TRUE
FORMULA AutoFlight-PT-01a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: [~ [A [~ [AG [[AX [p16<=1] & p14<=p17]]] U EG [[EF [p23<=p26] | AG [p3<=0]]]]] & [E [~ [[AG [[p0<=0 & 1<=p31]] | AF [AF [p17<=1]]]] U [1<=p7 | [[AG [p17<=p23] | p14<=p17] | ~ [AX [p20<=p12]]]]] | AG [A [[[EF [p30<=0] & EF [1<=p10]] | ~ [p15<=p2]] U [~ [p13<=p29] & E [p27<=1 U p19<=p20]]]]]]
normalized: [[~ [E [true U ~ [[~ [EG [~ [[E [p27<=1 U p19<=p20] & ~ [p13<=p29]]]]] & ~ [E [~ [[E [p27<=1 U p19<=p20] & ~ [p13<=p29]]] U [~ [[~ [p15<=p2] | [E [true U 1<=p10] & E [true U p30<=0]]]] & ~ [[E [p27<=1 U p19<=p20] & ~ [p13<=p29]]]]]]]]]] | E [~ [[~ [EG [EG [~ [p17<=1]]]] | ~ [E [true U ~ [[p0<=0 & 1<=p31]]]]]] U [[EX [~ [p20<=p12]] | [~ [E [true U ~ [p17<=p23]]] | p14<=p17]] | 1<=p7]]] & ~ [[~ [EG [~ [EG [[~ [E [true U ~ [p3<=0]]] | E [true U p23<=p26]]]]]] & ~ [E [~ [EG [[~ [E [true U ~ [p3<=0]]] | E [true U p23<=p26]]]] U [~ [E [true U ~ [[~ [EX [~ [p16<=1]]] & p14<=p17]]]] & ~ [EG [[~ [E [true U ~ [p3<=0]]] | E [true U p23<=p26]]]]]]]]]]
abstracting: (p23<=p26)
states: 85
abstracting: (p3<=0)
states: 159
EG iterations: 0
abstracting: (p14<=p17)
states: 241
abstracting: (p16<=1)
states: 253
.abstracting: (p23<=p26)
states: 85
abstracting: (p3<=0)
states: 159
EG iterations: 0
abstracting: (p23<=p26)
states: 85
abstracting: (p3<=0)
states: 159
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p7)
states: 252
abstracting: (p14<=p17)
states: 241
abstracting: (p17<=p23)
states: 187
abstracting: (p20<=p12)
states: 241
.abstracting: (1<=p31)
states: 234
abstracting: (p0<=0)
states: 252
abstracting: (p17<=1)
states: 253
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p13<=p29)
states: 253
abstracting: (p19<=p20)
states: 241
abstracting: (p27<=1)
states: 253
abstracting: (p30<=0)
states: 235
abstracting: (1<=p10)
states: 252
abstracting: (p15<=p2)
states: 241
abstracting: (p13<=p29)
states: 253
abstracting: (p19<=p20)
states: 241
abstracting: (p27<=1)
states: 253
abstracting: (p13<=p29)
states: 253
abstracting: (p19<=p20)
states: 241
abstracting: (p27<=1)
states: 253
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: A [[[~ [[p26<=p21 | [A [p0<=1 U p30<=0] & AG [1<=p12]]]] & AF [[[AG [1<=p22] & ~ [p10<=p18]] | [1<=p28 | ~ [1<=p6]]]]] | E [A [[[p26<=1 | 1<=p7] & [p9<=p19 & p27<=1]] U ~ [p15<=p18]] U ~ [AX [AG [p28<=1]]]]] U ~ [[A [A [AX [p19<=p4] U EX [p12<=1]] U [~ [1<=p10] & ~ [E [p21<=p20 U 1<=p26]]]] | [AG [[E [p14<=p21 U p1<=0] | A [p29<=1 U p6<=p10]]] | [[~ [p13<=p4] & EF [p18<=p18]] & [p14<=0 | [~ [p10<=p27] | 1<=p23]]]]]]]
normalized: [~ [EG [[[[[[~ [p10<=p27] | 1<=p23] | p14<=0] & [E [true U p18<=p18] & ~ [p13<=p4]]] | ~ [E [true U ~ [[[~ [EG [~ [p6<=p10]]] & ~ [E [~ [p6<=p10] U [~ [p29<=1] & ~ [p6<=p10]]]]] | E [p14<=p21 U p1<=0]]]]]] | [~ [EG [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]] & ~ [E [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]] U [~ [[~ [EG [~ [EX [p12<=1]]]] & ~ [E [~ [EX [p12<=1]] U [EX [~ [p19<=p4]] & ~ [EX [p12<=1]]]]]]] & ~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]]]]]]] & ~ [E [[[[[[~ [p10<=p27] | 1<=p23] | p14<=0] & [E [true U p18<=p18] & ~ [p13<=p4]]] | ~ [E [true U ~ [[[~ [EG [~ [p6<=p10]]] & ~ [E [~ [p6<=p10] U [~ [p29<=1] & ~ [p6<=p10]]]]] | E [p14<=p21 U p1<=0]]]]]] | [~ [EG [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]] & ~ [E [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]] U [~ [[~ [EG [~ [EX [p12<=1]]]] & ~ [E [~ [EX [p12<=1]] U [EX [~ [p19<=p4]] & ~ [EX [p12<=1]]]]]]] & ~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]]]]] U [~ [[E [[~ [EG [p15<=p18]] & ~ [E [p15<=p18 U [~ [[[p9<=p19 & p27<=1] & [p26<=1 | 1<=p7]]] & p15<=p18]]]] U EX [E [true U ~ [p28<=1]]]] | [~ [EG [~ [[[~ [1<=p6] | 1<=p28] | [~ [p10<=p18] & ~ [E [true U ~ [1<=p22]]]]]]]] & ~ [[[~ [E [true U ~ [1<=p12]]] & [~ [EG [~ [p30<=0]]] & ~ [E [~ [p30<=0] U [~ [p0<=1] & ~ [p30<=0]]]]]] | p26<=p21]]]]] & [[[[[~ [p10<=p27] | 1<=p23] | p14<=0] & [E [true U p18<=p18] & ~ [p13<=p4]]] | ~ [E [true U ~ [[[~ [EG [~ [p6<=p10]]] & ~ [E [~ [p6<=p10] U [~ [p29<=1] & ~ [p6<=p10]]]]] | E [p14<=p21 U p1<=0]]]]]] | [~ [EG [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]] & ~ [E [~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]] U [~ [[~ [EG [~ [EX [p12<=1]]]] & ~ [E [~ [EX [p12<=1]] U [EX [~ [p19<=p4]] & ~ [EX [p12<=1]]]]]]] & ~ [[~ [E [p21<=p20 U 1<=p26]] & ~ [1<=p10]]]]]]]]]]]]
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (p12<=1)
states: 253
.abstracting: (p19<=p4)
states: 247
.abstracting: (p12<=1)
states: 253
.abstracting: (p12<=1)
states: 253
..
EG iterations: 1
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
EG iterations: 0
abstracting: (p1<=0)
states: 159
abstracting: (p14<=p21)
states: 241
abstracting: (p6<=p10)
states: 253
abstracting: (p29<=1)
states: 253
abstracting: (p6<=p10)
states: 253
abstracting: (p6<=p10)
states: 253
.
EG iterations: 1
abstracting: (p13<=p4)
states: 245
abstracting: (p18<=p18)
states: 253
abstracting: (p14<=0)
states: 241
abstracting: (1<=p23)
states: 186
abstracting: (p10<=p27)
states: 19
abstracting: (p26<=p21)
states: 235
abstracting: (p30<=0)
states: 235
abstracting: (p0<=1)
states: 253
abstracting: (p30<=0)
states: 235
abstracting: (p30<=0)
states: 235
.......
EG iterations: 7
abstracting: (1<=p12)
states: 12
abstracting: (1<=p22)
states: 18
abstracting: (p10<=p18)
states: 13
abstracting: (1<=p28)
states: 18
abstracting: (1<=p6)
states: 92
.......
EG iterations: 7
abstracting: (p28<=1)
states: 253
.abstracting: (p15<=p18)
states: 241
abstracting: (1<=p7)
states: 252
abstracting: (p26<=1)
states: 253
abstracting: (p27<=1)
states: 253
abstracting: (p9<=p19)
states: 133
abstracting: (p15<=p18)
states: 241
abstracting: (p15<=p18)
states: 241
.......
EG iterations: 7
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (p12<=1)
states: 253
.abstracting: (p19<=p4)
states: 247
.abstracting: (p12<=1)
states: 253
.abstracting: (p12<=1)
states: 253
..
EG iterations: 1
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
EG iterations: 0
abstracting: (p1<=0)
states: 159
abstracting: (p14<=p21)
states: 241
abstracting: (p6<=p10)
states: 253
abstracting: (p29<=1)
states: 253
abstracting: (p6<=p10)
states: 253
abstracting: (p6<=p10)
states: 253
.
EG iterations: 1
abstracting: (p13<=p4)
states: 245
abstracting: (p18<=p18)
states: 253
abstracting: (p14<=0)
states: 241
abstracting: (1<=p23)
states: 186
abstracting: (p10<=p27)
states: 19
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (p12<=1)
states: 253
.abstracting: (p19<=p4)
states: 247
.abstracting: (p12<=1)
states: 253
.abstracting: (p12<=1)
states: 253
..
EG iterations: 1
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
abstracting: (1<=p10)
states: 252
abstracting: (1<=p26)
states: 18
abstracting: (p21<=p20)
states: 241
EG iterations: 0
abstracting: (p1<=0)
states: 159
abstracting: (p14<=p21)
states: 241
abstracting: (p6<=p10)
states: 253
abstracting: (p29<=1)
states: 253
abstracting: (p6<=p10)
states: 253
abstracting: (p6<=p10)
states: 253
.
EG iterations: 1
abstracting: (p13<=p4)
states: 245
abstracting: (p18<=p18)
states: 253
abstracting: (p14<=0)
states: 241
abstracting: (1<=p23)
states: 186
abstracting: (p10<=p27)
states: 19
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-01a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
totally nodes used: 41336 (4.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 51708 110707 162415
used/not used/entry size/cache size: 150130 66958734 16 1024MB
basic ops cache: hits/miss/sum: 17961 37467 55428
used/not used/entry size/cache size: 70057 16707159 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: 998 1715 2713
used/not used/entry size/cache size: 1715 8386893 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 67068124
1 40157
2 570
3 13
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.865sec
BK_STOP 1678391620822
--------------------
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:284 (9), effective:41 (1)
initing FirstDep: 0m 0.000sec
iterations count:166 (5), effective:23 (0)
iterations count:30 (1), effective:0 (0)
iterations count:366 (12), effective:58 (1)
iterations count:30 (1), effective:0 (0)
iterations count:111 (3), effective:16 (0)
iterations count:111 (3), effective:16 (0)
iterations count:111 (3), effective:16 (0)
iterations count:188 (6), effective:24 (0)
iterations count:125 (4), effective:15 (0)
iterations count:186 (6), effective:23 (0)
iterations count:167 (5), effective:24 (0)
iterations count:188 (6), effective:24 (0)
iterations count:125 (4), effective:15 (0)
iterations count:186 (6), effective:23 (0)
iterations count:167 (5), effective:24 (0)
iterations count:61 (2), effective:5 (0)
iterations count:188 (6), effective:24 (0)
iterations count:125 (4), effective:15 (0)
iterations count:186 (6), effective:23 (0)
iterations count:167 (5), effective:24 (0)
iterations count:38 (1), effective:2 (0)
iterations count:30 (1), effective:0 (0)
iterations count:32 (1), effective:1 (0)
iterations count:30 (1), effective:0 (0)
iterations count:103 (3), effective:13 (0)
iterations count:30 (1), effective:0 (0)
iterations count:36 (1), effective:2 (0)
iterations count:181 (6), effective:24 (0)
iterations count:30 (1), effective:0 (0)
iterations count:56 (1), effective:2 (0)
iterations count:30 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:30 (1), effective:0 (0)
iterations count:45 (1), effective:1 (0)
iterations count:186 (6), effective:23 (0)
iterations count:40 (1), effective:4 (0)
iterations count:30 (1), effective:0 (0)
iterations count:30 (1), effective:0 (0)
iterations count:58 (1), effective:3 (0)
iterations count:32 (1), effective:1 (0)
iterations count:30 (1), effective:0 (0)
iterations count:77 (2), effective:10 (0)
iterations count:85 (2), effective:15 (0)
iterations count:151 (5), effective:17 (0)
iterations count:190 (6), effective:24 (0)
iterations count:85 (2), effective:15 (0)
iterations count:151 (5), effective:17 (0)
iterations count:85 (2), effective:15 (0)
iterations count:151 (5), effective:17 (0)
iterations count:139 (4), effective:18 (0)
iterations count:164 (5), effective:23 (0)
iterations count:30 (1), effective:0 (0)
iterations count:45 (1), effective:1 (0)
iterations count:32 (1), effective:1 (0)
iterations count:54 (1), effective:1 (0)
iterations count:45 (1), effective:1 (0)
iterations count:45 (1), effective:1 (0)
iterations count:30 (1), effective:0 (0)
iterations count:129 (4), effective:19 (0)
iterations count:129 (4), effective:19 (0)
iterations count:174 (5), effective:26 (0)
iterations count:129 (4), effective:19 (0)
iterations count:118 (3), effective:13 (0)
iterations count:30 (1), effective:0 (0)
iterations count:42 (1), effective:1 (0)
iterations count:58 (1), effective:3 (0)
iterations count:171 (5), effective:20 (0)
iterations count:129 (4), effective:19 (0)
iterations count:129 (4), effective:19 (0)
iterations count:174 (5), effective:26 (0)
iterations count:129 (4), effective:19 (0)
iterations count:118 (3), effective:13 (0)
iterations count:30 (1), effective:0 (0)
iterations count:56 (1), effective:2 (0)
iterations count:129 (4), effective:19 (0)
iterations count:129 (4), effective:19 (0)
iterations count:174 (5), effective:26 (0)
iterations count:129 (4), effective:19 (0)
iterations count:118 (3), effective:13 (0)
iterations count:30 (1), effective:0 (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="AutoFlight-PT-01a"
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 AutoFlight-PT-01a, 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 r001-oct2-167813588600369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01a.tgz
mv AutoFlight-PT-01a 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 ;