About the Execution of Marcie for CircularTrains-PT-024
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5546.968 | 7448.00 | 7070.00 | 0.00 | FTFFFFFFFTTTFFTT | 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.r065-smll-167814393000153.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 CircularTrains-PT-024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 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 19K 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 CircularTrains-PT-024-CTLCardinality-00
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-09
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678270170090
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=CircularTrains-PT-024
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: CircularTrains_PT_024
(NrP: 48 NrTr: 24 NrArc: 96)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.640sec
RS generation: 0m 0.011sec
-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)
starting MCC model checker
--------------------------
checking: EG [1<=Section_3]
normalized: EG [1<=Section_3]
abstracting: (1<=Section_3)
states: 34,016 (4)
......................................................................................
EG iterations: 86
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: EG [~ [AG [Section_18<=1]]]
normalized: EG [E [true U ~ [Section_18<=1]]]
abstracting: (Section_18<=1)
states: 86,515 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AX [EF [~ [AF [AX [1<=F16]]]]]]
normalized: EX [~ [E [true U EG [EX [~ [1<=F16]]]]]]
abstracting: (1<=F16)
states: 34,016 (4)
..
EG iterations: 1
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [AG [1<=Section_24]]
normalized: E [true U ~ [E [true U ~ [1<=Section_24]]]]
abstracting: (1<=Section_24)
states: 34,016 (4)
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [AX [~ [AF [Section_22<=F13]]]]
normalized: E [true U ~ [EX [~ [EG [~ [Section_22<=F13]]]]]]
abstracting: (Section_22<=F13)
states: 75,279 (4)
.......................................
EG iterations: 39
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: EG [EF [EG [~ [AG [Section_22<=Section_19]]]]]
normalized: EG [E [true U EG [E [true U ~ [Section_22<=Section_19]]]]]
abstracting: (Section_22<=Section_19)
states: 72,021 (4)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [AG [[AF [~ [1<=F6]] | ~ [F19<=1]]]]
normalized: ~ [E [true U E [true U ~ [[~ [F19<=1] | ~ [EG [1<=F6]]]]]]]
abstracting: (1<=F6)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (F19<=1)
states: 86,515 (4)
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.156sec
checking: ~ [A [EF [[~ [Section_18<=1] | [[Section_20<=1 | 1<=Section_10] | ~ [Section_15<=0]]]] U AX [1<=Section_9]]]
normalized: ~ [[~ [EG [EX [~ [1<=Section_9]]]] & ~ [E [EX [~ [1<=Section_9]] U [~ [E [true U [[~ [Section_15<=0] | [Section_20<=1 | 1<=Section_10]] | ~ [Section_18<=1]]]] & EX [~ [1<=Section_9]]]]]]]
abstracting: (1<=Section_9)
states: 34,016 (4)
.abstracting: (Section_18<=1)
states: 86,515 (4)
abstracting: (1<=Section_10)
states: 18,483 (4)
abstracting: (Section_20<=1)
states: 86,515 (4)
abstracting: (Section_15<=0)
states: 52,499 (4)
abstracting: (1<=Section_9)
states: 34,016 (4)
.abstracting: (1<=Section_9)
states: 34,016 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EF [~ [E [EF [AX [F23<=Section_22]] U AF [[[Section_3<=F20 | Section_8<=1] | EG [F16<=F11]]]]]]
normalized: E [true U ~ [E [E [true U ~ [EX [~ [F23<=Section_22]]]] U ~ [EG [~ [[EG [F16<=F11] | [Section_3<=F20 | Section_8<=1]]]]]]]]
abstracting: (Section_8<=1)
states: 86,515 (4)
abstracting: (Section_3<=F20)
states: 82,502 (4)
abstracting: (F16<=F11)
states: 80,826 (4)
......................................
EG iterations: 38
.
EG iterations: 1
abstracting: (F23<=Section_22)
states: 19,522 (4)
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: [~ [AG [[F17<=0 | [A [EX [Section_14<=0] U EF [1<=F22]] | Section_9<=1]]]] | E [[EX [F22<=1] & EX [Section_3<=0]] U EG [EF [F20<=1]]]]
normalized: [E [[EX [Section_3<=0] & EX [F22<=1]] U EG [E [true U F20<=1]]] | E [true U ~ [[F17<=0 | [Section_9<=1 | [~ [EG [~ [E [true U 1<=F22]]]] & ~ [E [~ [E [true U 1<=F22]] U [~ [EX [Section_14<=0]] & ~ [E [true U 1<=F22]]]]]]]]]]]
abstracting: (1<=F22)
states: 34,016 (4)
abstracting: (Section_14<=0)
states: 52,499 (4)
.abstracting: (1<=F22)
states: 34,016 (4)
abstracting: (1<=F22)
states: 34,016 (4)
.
EG iterations: 1
abstracting: (Section_9<=1)
states: 86,515 (4)
abstracting: (F17<=0)
states: 12,275 (4)
abstracting: (F20<=1)
states: 55,757 (4)
EG iterations: 0
abstracting: (F22<=1)
states: 86,515 (4)
.abstracting: (Section_3<=0)
states: 52,499 (4)
.-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [AF [~ [[EF [[1<=F21 & Section_11<=1]] & [EX [F12<=Section_16] & EF [Section_3<=1]]]]] & AG [EX [E [[EG [F2<=1] & AG [1<=F11]] U F19<=Section_1]]]]
normalized: [~ [E [true U ~ [EX [E [[~ [E [true U ~ [1<=F11]]] & EG [F2<=1]] U F19<=Section_1]]]]] & ~ [EG [[[E [true U Section_3<=1] & EX [F12<=Section_16]] & E [true U [1<=F21 & Section_11<=1]]]]]]
abstracting: (Section_11<=1)
states: 86,515 (4)
abstracting: (1<=F21)
states: 34,016 (4)
abstracting: (F12<=Section_16)
states: 59,746 (4)
.abstracting: (Section_3<=1)
states: 86,515 (4)
..
EG iterations: 2
abstracting: (F19<=Section_1)
states: 59,746 (4)
abstracting: (F2<=1)
states: 55,757 (4)
.
EG iterations: 1
abstracting: (1<=F11)
states: 74,240 (4)
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: EF [A [[~ [[E [Section_19<=0 U 1<=Section_24] | [EG [1<=Section_6] | 1<=Section_4]]] & ~ [E [EF [1<=Section_1] U [F23<=Section_8 & F5<=Section_24]]]] U ~ [EG [EF [Section_15<=1]]]]]
normalized: E [true U [~ [EG [EG [E [true U Section_15<=1]]]] & ~ [E [EG [E [true U Section_15<=1]] U [~ [[~ [E [E [true U 1<=Section_1] U [F23<=Section_8 & F5<=Section_24]]] & ~ [[[1<=Section_4 | EG [1<=Section_6]] | E [Section_19<=0 U 1<=Section_24]]]]] & EG [E [true U Section_15<=1]]]]]]]
abstracting: (Section_15<=1)
states: 86,515 (4)
EG iterations: 0
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (Section_19<=0)
states: 68,032 (4)
abstracting: (1<=Section_6)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (1<=Section_4)
states: 18,483 (4)
abstracting: (F5<=Section_24)
states: 28,799 (4)
abstracting: (F23<=Section_8)
states: 28,799 (4)
abstracting: (1<=Section_1)
states: 18,483 (4)
abstracting: (Section_15<=1)
states: 86,515 (4)
EG iterations: 0
abstracting: (Section_15<=1)
states: 86,515 (4)
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.195sec
checking: [AF [EF [EG [~ [A [1<=F3 U 1<=Section_24]]]]] & ~ [EG [[~ [A [F10<=Section_5 U F7<=Section_14]] | [[[EX [F12<=F15] | A [F22<=1 U F10<=1]] & ~ [[1<=Section_17 | 1<=F16]]] | AG [AF [Section_18<=1]]]]]]]
normalized: [~ [EG [[[~ [E [true U EG [~ [Section_18<=1]]]] | [~ [[1<=Section_17 | 1<=F16]] & [[~ [EG [~ [F10<=1]]] & ~ [E [~ [F10<=1] U [~ [F22<=1] & ~ [F10<=1]]]]] | EX [F12<=F15]]]] | ~ [[~ [EG [~ [F7<=Section_14]]] & ~ [E [~ [F7<=Section_14] U [~ [F10<=Section_5] & ~ [F7<=Section_14]]]]]]]]] & ~ [EG [~ [E [true U EG [~ [[~ [EG [~ [1<=Section_24]]] & ~ [E [~ [1<=Section_24] U [~ [1<=F3] & ~ [1<=Section_24]]]]]]]]]]]]
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=F3)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
...............................................................................
EG iterations: 79
EG iterations: 0
abstracting: (F7<=Section_14)
states: 66,993 (4)
abstracting: (F10<=Section_5)
states: 66,993 (4)
abstracting: (F7<=Section_14)
states: 66,993 (4)
abstracting: (F7<=Section_14)
states: 66,993 (4)
...................................................
EG iterations: 51
abstracting: (F12<=F15)
states: 64,774 (4)
.abstracting: (F10<=1)
states: 86,515 (4)
abstracting: (F22<=1)
states: 86,515 (4)
abstracting: (F10<=1)
states: 86,515 (4)
abstracting: (F10<=1)
states: 86,515 (4)
.
EG iterations: 1
abstracting: (1<=F16)
states: 34,016 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (Section_18<=1)
states: 86,515 (4)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.242sec
checking: AX [[E [[A [~ [Section_10<=Section_21] U ~ [Section_22<=F4]] | ~ [[EG [F9<=1] & EF [Section_5<=F24]]]] U [1<=Section_22 & [[[F10<=1 & Section_4<=0] | ~ [Section_9<=F21]] | AG [F7<=1]]]] & [[~ [F8<=1] & ~ [F14<=F15]] | A [~ [[[Section_15<=0 & 1<=Section_4] & F20<=0]] U F22<=1]]]]
normalized: ~ [EX [~ [[[[~ [EG [~ [F22<=1]]] & ~ [E [~ [F22<=1] U [[F20<=0 & [Section_15<=0 & 1<=Section_4]] & ~ [F22<=1]]]]] | [~ [F14<=F15] & ~ [F8<=1]]] & E [[~ [[E [true U Section_5<=F24] & EG [F9<=1]]] | [~ [EG [Section_22<=F4]] & ~ [E [Section_22<=F4 U [Section_10<=Section_21 & Section_22<=F4]]]]] U [1<=Section_22 & [~ [E [true U ~ [F7<=1]]] | [~ [Section_9<=F21] | [F10<=1 & Section_4<=0]]]]]]]]]
abstracting: (Section_4<=0)
states: 68,032 (4)
abstracting: (F10<=1)
states: 86,515 (4)
abstracting: (Section_9<=F21)
states: 66,993 (4)
abstracting: (F7<=1)
states: 86,515 (4)
abstracting: (1<=Section_22)
states: 18,483 (4)
abstracting: (Section_22<=F4)
states: 75,279 (4)
abstracting: (Section_10<=Section_21)
states: 75,279 (4)
abstracting: (Section_22<=F4)
states: 75,279 (4)
abstracting: (Section_22<=F4)
states: 75,279 (4)
.
EG iterations: 1
abstracting: (F9<=1)
states: 86,515 (4)
EG iterations: 0
abstracting: (Section_5<=F24)
states: 66,993 (4)
abstracting: (F8<=1)
states: 55,757 (4)
abstracting: (F14<=F15)
states: 26,769 (4)
abstracting: (F22<=1)
states: 86,515 (4)
abstracting: (1<=Section_4)
states: 18,483 (4)
abstracting: (Section_15<=0)
states: 52,499 (4)
abstracting: (F20<=0)
states: 12,275 (4)
abstracting: (F22<=1)
states: 86,515 (4)
abstracting: (F22<=1)
states: 86,515 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: A [[1<=F23 & EX [[[[[F1<=Section_4 | 1<=F5] & EX [Section_14<=0]] | ~ [A [Section_4<=0 U 1<=Section_4]]] & [EX [F17<=Section_15] | 1<=Section_20]]]] U A [AF [[[AF [Section_13<=F22] & ~ [F11<=Section_24]] | [[1<=F16 | F7<=1] & AF [F6<=Section_9]]]] U EG [AF [[1<=F15 & Section_1<=1]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]] U [EG [~ [[[~ [EG [~ [F6<=Section_9]]] & [1<=F16 | F7<=1]] | [~ [F11<=Section_24] & ~ [EG [~ [Section_13<=F22]]]]]]] & ~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]] U [EG [~ [[[~ [EG [~ [F6<=Section_9]]] & [1<=F16 | F7<=1]] | [~ [F11<=Section_24] & ~ [EG [~ [Section_13<=F22]]]]]]] & ~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]]]]] U [~ [[1<=F23 & EX [[[1<=Section_20 | EX [F17<=Section_15]] & [~ [[~ [EG [~ [1<=Section_4]]] & ~ [E [~ [1<=Section_4] U [~ [Section_4<=0] & ~ [1<=Section_4]]]]]] | [EX [Section_14<=0] & [F1<=Section_4 | 1<=F5]]]]]]] & ~ [[~ [EG [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]] U [EG [~ [[[~ [EG [~ [F6<=Section_9]]] & [1<=F16 | F7<=1]] | [~ [F11<=Section_24] & ~ [EG [~ [Section_13<=F22]]]]]]] & ~ [EG [~ [EG [~ [[1<=F15 & Section_1<=1]]]]]]]]]]]]]]]
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_13<=F22)
states: 75,279 (4)
....................................
EG iterations: 36
abstracting: (F11<=Section_24)
states: 28,799 (4)
abstracting: (F7<=1)
states: 86,515 (4)
abstracting: (1<=F16)
states: 34,016 (4)
abstracting: (F6<=Section_9)
states: 66,993 (4)
..................................................................
EG iterations: 66
.
EG iterations: 1
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=F5)
states: 74,240 (4)
abstracting: (F1<=Section_4)
states: 59,746 (4)
abstracting: (Section_14<=0)
states: 52,499 (4)
.abstracting: (1<=Section_4)
states: 18,483 (4)
abstracting: (Section_4<=0)
states: 68,032 (4)
abstracting: (1<=Section_4)
states: 18,483 (4)
abstracting: (1<=Section_4)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (F17<=Section_15)
states: 30,027 (4)
.abstracting: (1<=Section_20)
states: 34,016 (4)
.abstracting: (1<=F23)
states: 74,240 (4)
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_13<=F22)
states: 75,279 (4)
....................................
EG iterations: 36
abstracting: (F11<=Section_24)
states: 28,799 (4)
abstracting: (F7<=1)
states: 86,515 (4)
abstracting: (1<=F16)
states: 34,016 (4)
abstracting: (F6<=Section_9)
states: 66,993 (4)
..................................................................
EG iterations: 66
.
EG iterations: 1
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_13<=F22)
states: 75,279 (4)
....................................
EG iterations: 36
abstracting: (F11<=Section_24)
states: 28,799 (4)
abstracting: (F7<=1)
states: 86,515 (4)
abstracting: (1<=F16)
states: 34,016 (4)
abstracting: (F6<=Section_9)
states: 66,993 (4)
..................................................................
EG iterations: 66
.
EG iterations: 1
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (Section_1<=1)
states: 86,515 (4)
abstracting: (1<=F15)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.572sec
checking: A [[[A [[~ [[Section_20<=F9 | Section_11<=0]] | AG [1<=Section_7]] U EG [[F5<=0 | Section_2<=Section_20]]] | [~ [[A [Section_7<=1 U 1<=Section_17] & [[F19<=1 & F14<=Section_24] | 1<=F9]]] | E [[Section_14<=1 | ~ [1<=F24]] U [EG [Section_4<=F10] & E [F12<=1 U Section_7<=1]]]]] & F23<=1] U A [[AX [[~ [Section_3<=0] & [F15<=Section_14 & Section_24<=F19]]] | ~ [1<=Section_18]] U ~ [1<=Section_24]]]
normalized: [~ [EG [~ [[~ [EG [1<=Section_24]] & ~ [E [1<=Section_24 U [1<=Section_24 & ~ [[~ [1<=Section_18] | ~ [EX [~ [[[F15<=Section_14 & Section_24<=F19] & ~ [Section_3<=0]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [1<=Section_24]] & ~ [E [1<=Section_24 U [1<=Section_24 & ~ [[~ [1<=Section_18] | ~ [EX [~ [[[F15<=Section_14 & Section_24<=F19] & ~ [Section_3<=0]]]]]]]]]]]] U [~ [[F23<=1 & [[E [[Section_14<=1 | ~ [1<=F24]] U [E [F12<=1 U Section_7<=1] & EG [Section_4<=F10]]] | ~ [[[1<=F9 | [F19<=1 & F14<=Section_24]] & [~ [EG [~ [1<=Section_17]]] & ~ [E [~ [1<=Section_17] U [~ [Section_7<=1] & ~ [1<=Section_17]]]]]]]] | [~ [EG [~ [EG [[F5<=0 | Section_2<=Section_20]]]]] & ~ [E [~ [EG [[F5<=0 | Section_2<=Section_20]]] U [~ [[~ [E [true U ~ [1<=Section_7]]] | ~ [[Section_20<=F9 | Section_11<=0]]]] & ~ [EG [[F5<=0 | Section_2<=Section_20]]]]]]]]]] & ~ [[~ [EG [1<=Section_24]] & ~ [E [1<=Section_24 U [1<=Section_24 & ~ [[~ [1<=Section_18] | ~ [EX [~ [[[F15<=Section_14 & Section_24<=F19] & ~ [Section_3<=0]]]]]]]]]]]]]]]]
abstracting: (Section_3<=0)
states: 52,499 (4)
abstracting: (Section_24<=F19)
states: 66,993 (4)
abstracting: (F15<=Section_14)
states: 66,993 (4)
.abstracting: (1<=Section_18)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (Section_2<=Section_20)
states: 64,774 (4)
abstracting: (F5<=0)
states: 12,275 (4)
.
EG iterations: 1
abstracting: (Section_11<=0)
states: 52,499 (4)
abstracting: (Section_20<=F9)
states: 66,993 (4)
abstracting: (1<=Section_7)
states: 18,483 (4)
abstracting: (Section_2<=Section_20)
states: 64,774 (4)
abstracting: (F5<=0)
states: 12,275 (4)
.
EG iterations: 1
abstracting: (Section_2<=Section_20)
states: 64,774 (4)
abstracting: (F5<=0)
states: 12,275 (4)
.
EG iterations: 1
...............................................
EG iterations: 47
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (Section_7<=1)
states: 86,515 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
abstracting: (1<=Section_17)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (F14<=Section_24)
states: 28,799 (4)
abstracting: (F19<=1)
states: 86,515 (4)
abstracting: (1<=F9)
states: 34,016 (4)
abstracting: (Section_4<=F10)
states: 75,279 (4)
.
EG iterations: 1
abstracting: (Section_7<=1)
states: 86,515 (4)
abstracting: (F12<=1)
states: 86,515 (4)
abstracting: (1<=F24)
states: 34,016 (4)
abstracting: (Section_14<=1)
states: 86,515 (4)
abstracting: (F23<=1)
states: 55,757 (4)
abstracting: (Section_3<=0)
states: 52,499 (4)
abstracting: (Section_24<=F19)
states: 66,993 (4)
abstracting: (F15<=Section_14)
states: 66,993 (4)
.abstracting: (1<=Section_18)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (Section_3<=0)
states: 52,499 (4)
abstracting: (Section_24<=F19)
states: 66,993 (4)
abstracting: (F15<=Section_14)
states: 66,993 (4)
.abstracting: (1<=Section_18)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
abstracting: (1<=Section_24)
states: 34,016 (4)
......................................................................................
EG iterations: 86
......................................................................................
EG iterations: 86
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.201sec
totally nodes used: 1533705 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 721476 2698035 3419511
used/not used/entry size/cache size: 3969877 63138987 16 1024MB
basic ops cache: hits/miss/sum: 171061 498194 669255
used/not used/entry size/cache size: 1003053 15774163 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: 6125 19601 25726
used/not used/entry size/cache size: 19591 8369017 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 65726376
1 1268033
2 93939
3 15860
4 2567
5 381
6 315
7 299
8 228
9 113
>= 10 753
Total processing time: 0m 7.375sec
BK_STOP 1678270177538
--------------------
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:464 (19), effective:96 (4)
initing FirstDep: 0m 0.000sec
iterations count:57 (2), effective:11 (0)
iterations count:76 (3), effective:11 (0)
iterations count:134 (5), effective:24 (1)
iterations count:24 (1), effective:0 (0)
iterations count:24 (1), effective:0 (0)
iterations count:151 (6), effective:35 (1)
iterations count:24 (1), effective:0 (0)
iterations count:101 (4), effective:13 (0)
iterations count:101 (4), effective:13 (0)
iterations count:101 (4), effective:13 (0)
iterations count:57 (2), effective:11 (0)
iterations count:24 (1), effective:0 (0)
iterations count:98 (4), effective:12 (0)
iterations count:24 (1), effective:0 (0)
iterations count:174 (7), effective:25 (1)
iterations count:24 (1), effective:0 (0)
iterations count:328 (13), effective:71 (2)
iterations count:24 (1), effective:0 (0)
iterations count:58 (2), effective:5 (0)
iterations count:113 (4), effective:23 (0)
iterations count:189 (7), effective:36 (1)
iterations count:24 (1), effective:0 (0)
iterations count:24 (1), effective:0 (0)
iterations count:24 (1), effective:0 (0)
iterations count:68 (2), effective:2 (0)
iterations count:33 (1), effective:3 (0)
iterations count:27 (1), effective:1 (0)
iterations count:54 (2), effective:10 (0)
iterations count:24 (1), effective:0 (0)
iterations count:63 (2), effective:13 (0)
iterations count:27 (1), effective:1 (0)
iterations count:24 (1), effective:0 (0)
iterations count:24 (1), effective:0 (0)
iterations count:26 (1), effective:1 (0)
iterations count:63 (2), effective:13 (0)
iterations count:63 (2), effective:13 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-024"
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 CircularTrains-PT-024, 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 r065-smll-167814393000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-024.tgz
mv CircularTrains-PT-024 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 ;