About the Execution of Marcie for DiscoveryGPU-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11223.892 | 1442183.00 | 1442070.00 | 0.00 | FFFFTFTTTTTFTFFF | 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.r129-smll-167819404000345.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 DiscoveryGPU-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819404000345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:35 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.3K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 36K 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 DiscoveryGPU-PT-10a-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679953090408
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=DiscoveryGPU-PT-10a
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: DiscoveryGPU_PT_10a
(NrP: 103 NrTr: 141 NrArc: 453)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.378sec
RS generation: 0m 2.547sec
-> reachability set: #nodes 45394 (4.5e+04) #states 25,937,424,602 (10)
starting MCC model checker
--------------------------
checking: AG [AF [~ [1<=p56]]]
normalized: ~ [E [true U EG [1<=p56]]]
abstracting: (1<=p56)
states: 2,357,947,691 (9)
.............................
EG iterations: 29
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m51.014sec
checking: AF [AG [~ [EX [1<=p0]]]]
normalized: ~ [EG [E [true U EX [1<=p0]]]]
abstracting: (1<=p0)
states: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: EG [p40<=p20]
normalized: EG [p40<=p20]
abstracting: (p40<=p20)
states: 23,793,835,792 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.864sec
checking: AF [AF [AF [EG [[1<=p15 & p33<=p78]]]]]
normalized: ~ [EG [EG [EG [~ [EG [[1<=p15 & p33<=p78]]]]]]]
abstracting: (p33<=p78)
states: 23,793,835,792 (10)
abstracting: (1<=p15)
states: 2,357,947,691 (9)
............................
EG iterations: 28
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m49.537sec
checking: ~ [EF [~ [[[A [p41<=p14 U p6<=0] & AX [1<=p86]] | 1<=p6]]]]
normalized: ~ [E [true U ~ [[1<=p6 | [~ [EX [~ [1<=p86]]] & [~ [EG [~ [p6<=0]]] & ~ [E [~ [p6<=0] U [~ [p41<=p14] & ~ [p6<=0]]]]]]]]]]
abstracting: (p6<=0)
states: 23,579,476,911 (10)
abstracting: (p41<=p14)
states: 23,793,835,792 (10)
abstracting: (p6<=0)
states: 23,579,476,911 (10)
abstracting: (p6<=0)
states: 23,579,476,911 (10)
.............................
EG iterations: 29
abstracting: (1<=p86)
states: 2,357,947,691 (9)
.abstracting: (1<=p6)
states: 2,357,947,691 (9)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 8.209sec
checking: [~ [EX [EG [AX [[p36<=1 | p26<=p89]]]]] & AG [EG [p62<=p24]]]
normalized: [~ [E [true U ~ [EG [p62<=p24]]]] & ~ [EX [EG [~ [EX [~ [[p36<=1 | p26<=p89]]]]]]]]
abstracting: (p26<=p89)
states: 23,793,835,792 (10)
abstracting: (p36<=1)
states: 25,937,424,602 (10)
.
EG iterations: 0
.abstracting: (p62<=p24)
states: 23,793,835,792 (10)
.............................
EG iterations: 29
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m41.241sec
checking: EF [A [A [EX [p79<=1] U [p7<=1 | ~ [p97<=0]]] U E [AF [1<=p24] U AG [~ [p66<=p46]]]]]
normalized: E [true U [~ [EG [~ [E [~ [EG [~ [1<=p24]]] U ~ [E [true U p66<=p46]]]]]] & ~ [E [~ [E [~ [EG [~ [1<=p24]]] U ~ [E [true U p66<=p46]]]] U [~ [[~ [EG [~ [[p7<=1 | ~ [p97<=0]]]]] & ~ [E [~ [[p7<=1 | ~ [p97<=0]]] U [~ [EX [p79<=1]] & ~ [[p7<=1 | ~ [p97<=0]]]]]]]] & ~ [E [~ [EG [~ [1<=p24]]] U ~ [E [true U p66<=p46]]]]]]]]]
abstracting: (p66<=p46)
states: 23,793,835,792 (10)
abstracting: (1<=p24)
states: 2,357,947,691 (9)
.............................
EG iterations: 29
abstracting: (p97<=0)
states: 23,579,476,911 (10)
abstracting: (p7<=1)
states: 25,937,424,602 (10)
abstracting: (p79<=1)
states: 25,937,424,602 (10)
.abstracting: (p97<=0)
states: 23,579,476,911 (10)
abstracting: (p7<=1)
states: 25,937,424,602 (10)
abstracting: (p97<=0)
states: 23,579,476,911 (10)
abstracting: (p7<=1)
states: 25,937,424,602 (10)
.
EG iterations: 1
abstracting: (p66<=p46)
states: 23,793,835,792 (10)
abstracting: (1<=p24)
states: 2,357,947,691 (9)
.............................
EG iterations: 29
abstracting: (p66<=p46)
states: 23,793,835,792 (10)
abstracting: (1<=p24)
states: 2,357,947,691 (9)
.............................
EG iterations: 29
EG iterations: 0
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m55.557sec
checking: EF [EX [[[EG [p98<=p57] & [[p51<=1 & p82<=1] | [EF [1<=p89] & AG [p10<=0]]]] & ~ [p51<=0]]]]
normalized: E [true U EX [[~ [p51<=0] & [[[~ [E [true U ~ [p10<=0]]] & E [true U 1<=p89]] | [p51<=1 & p82<=1]] & EG [p98<=p57]]]]]
abstracting: (p98<=p57)
states: 23,793,835,792 (10)
..............................
EG iterations: 30
abstracting: (p82<=1)
states: 25,937,424,602 (10)
abstracting: (p51<=1)
states: 25,937,424,602 (10)
abstracting: (1<=p89)
states: 2,357,947,691 (9)
abstracting: (p10<=0)
states: 23,579,476,911 (10)
abstracting: (p51<=0)
states: 23,579,476,911 (10)
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m41.998sec
checking: ~ [[AF [AF [[EF [p13<=0] & E [1<=p38 U 1<=p56]]]] | [EF [1<=p61] | [~ [EX [EG [p37<=1]]] | EG [[p82<=p42 & AG [1<=p101]]]]]]]
normalized: ~ [[~ [EG [EG [~ [[E [true U p13<=0] & E [1<=p38 U 1<=p56]]]]]] | [[EG [[p82<=p42 & ~ [E [true U ~ [1<=p101]]]]] | ~ [EX [EG [p37<=1]]]] | E [true U 1<=p61]]]]
abstracting: (1<=p61)
states: 2,357,947,691 (9)
abstracting: (p37<=1)
states: 25,937,424,602 (10)
EG iterations: 0
.abstracting: (1<=p101)
states: 25,937,424,601 (10)
abstracting: (p82<=p42)
states: 23,793,835,792 (10)
...........................
EG iterations: 27
abstracting: (1<=p56)
states: 2,357,947,691 (9)
abstracting: (1<=p38)
states: 2,357,947,691 (9)
abstracting: (p13<=0)
states: 23,579,476,911 (10)
.............................
EG iterations: 29
.
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m40.380sec
checking: A [[~ [[p21<=0 & 1<=p51]] | ~ [[AX [p95<=1] | 1<=p22]]] U [E [p24<=1 U AG [EG [p67<=p75]]] & p3<=p88]]
normalized: [~ [EG [~ [[p3<=p88 & E [p24<=1 U ~ [E [true U ~ [EG [p67<=p75]]]]]]]]] & ~ [E [~ [[p3<=p88 & E [p24<=1 U ~ [E [true U ~ [EG [p67<=p75]]]]]]] U [~ [[p3<=p88 & E [p24<=1 U ~ [E [true U ~ [EG [p67<=p75]]]]]]] & ~ [[~ [[1<=p22 | ~ [EX [~ [p95<=1]]]]] | ~ [[p21<=0 & 1<=p51]]]]]]]]
abstracting: (1<=p51)
states: 2,357,947,691 (9)
abstracting: (p21<=0)
states: 23,579,476,911 (10)
abstracting: (p95<=1)
states: 25,937,424,602 (10)
.abstracting: (1<=p22)
states: 2,357,947,691 (9)
abstracting: (p67<=p75)
states: 23,793,835,792 (10)
before gc: list nodes free: 192576
after gc: idd nodes used:656442, unused:63343558; list nodes free:348938733
.
EG iterations: 1
abstracting: (p24<=1)
states: 25,937,424,602 (10)
abstracting: (p3<=p88)
states: 23,793,835,792 (10)
abstracting: (p67<=p75)
states: 23,793,835,792 (10)
.
EG iterations: 1
abstracting: (p24<=1)
states: 25,937,424,602 (10)
abstracting: (p3<=p88)
states: 23,793,835,792 (10)
abstracting: (p67<=p75)
states: 23,793,835,792 (10)
.
EG iterations: 1
abstracting: (p24<=1)
states: 25,937,424,602 (10)
abstracting: (p3<=p88)
states: 23,793,835,792 (10)
.............................
EG iterations: 29
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 3.409sec
checking: [AG [~ [E [AG [p15<=1] U AX [p68<=p19]]]] | [AF [~ [[~ [AX [p68<=1]] | E [1<=p9 U A [p91<=p36 U 1<=p8]]]]] | A [p36<=0 U AX [EF [~ [p69<=1]]]]]]
normalized: [[[~ [EG [EX [~ [E [true U ~ [p69<=1]]]]]] & ~ [E [EX [~ [E [true U ~ [p69<=1]]]] U [~ [p36<=0] & EX [~ [E [true U ~ [p69<=1]]]]]]]] | ~ [EG [[E [1<=p9 U [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [p91<=p36] & ~ [1<=p8]]]]]] | EX [~ [p68<=1]]]]]] | ~ [E [true U E [~ [E [true U ~ [p15<=1]]] U ~ [EX [~ [p68<=p19]]]]]]]
abstracting: (p68<=p19)
states: 23,793,835,792 (10)
.abstracting: (p15<=1)
states: 25,937,424,602 (10)
abstracting: (p68<=1)
states: 25,937,424,602 (10)
.abstracting: (1<=p8)
states: 2,357,947,691 (9)
abstracting: (p91<=p36)
states: 23,793,835,792 (10)
abstracting: (1<=p8)
states: 2,357,947,691 (9)
abstracting: (1<=p8)
states: 2,357,947,691 (9)
..............................
EG iterations: 30
abstracting: (1<=p9)
states: 2,357,947,691 (9)
.
EG iterations: 1
abstracting: (p69<=1)
states: 25,937,424,602 (10)
.abstracting: (p36<=0)
states: 23,579,476,911 (10)
abstracting: (p69<=1)
states: 25,937,424,602 (10)
.abstracting: (p69<=1)
states: 25,937,424,602 (10)
................................
EG iterations: 31
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m56.333sec
checking: ~ [AF [[[~ [AX [AF [1<=p50]]] | [[AF [1<=p98] | p44<=p68] & ~ [A [p39<=1 U p63<=1]]]] | [A [AX [p52<=p61] U AX [p31<=1]] | E [[1<=p19 & p65<=1] U ~ [[p72<=p94 & p57<=p71]]]]]]]
normalized: EG [~ [[[E [[1<=p19 & p65<=1] U ~ [[p72<=p94 & p57<=p71]]] | [~ [EG [EX [~ [p31<=1]]]] & ~ [E [EX [~ [p31<=1]] U [EX [~ [p52<=p61]] & EX [~ [p31<=1]]]]]]] | [[~ [[~ [EG [~ [p63<=1]]] & ~ [E [~ [p63<=1] U [~ [p39<=1] & ~ [p63<=1]]]]]] & [p44<=p68 | ~ [EG [~ [1<=p98]]]]] | EX [EG [~ [1<=p50]]]]]]]
abstracting: (1<=p50)
states: 2,357,947,691 (9)
..
EG iterations: 2
.abstracting: (1<=p98)
states: 2,357,947,691 (9)
..............................
EG iterations: 30
abstracting: (p44<=p68)
states: 23,793,835,792 (10)
abstracting: (p63<=1)
states: 25,937,424,602 (10)
abstracting: (p39<=1)
states: 25,937,424,602 (10)
abstracting: (p63<=1)
states: 25,937,424,602 (10)
abstracting: (p63<=1)
states: 25,937,424,602 (10)
.
EG iterations: 1
abstracting: (p31<=1)
states: 25,937,424,602 (10)
.abstracting: (p52<=p61)
states: 23,793,835,792 (10)
.abstracting: (p31<=1)
states: 25,937,424,602 (10)
.abstracting: (p31<=1)
states: 25,937,424,602 (10)
..
EG iterations: 1
abstracting: (p57<=p71)
states: 23,793,835,792 (10)
abstracting: (p72<=p94)
states: 23,793,835,792 (10)
abstracting: (p65<=1)
states: 25,937,424,602 (10)
abstracting: (1<=p19)
states: 2,357,947,691 (9)
before gc: list nodes free: 2071110
after gc: idd nodes used:563899, unused:63436101; list nodes free:366504905
.
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m20.860sec
checking: [E [~ [1<=p20] U E [[p44<=0 & ~ [[~ [p35<=1] & [p8<=p54 | p60<=p93]]]] U [[EF [p19<=0] & 1<=p15] | [AF [p78<=1] & AG [p89<=1]]]]] & AG [EF [EX [[[1<=p66 & p32<=p87] | AX [p45<=p93]]]]]]
normalized: [~ [E [true U ~ [E [true U EX [[~ [EX [~ [p45<=p93]]] | [1<=p66 & p32<=p87]]]]]]] & E [~ [1<=p20] U E [[p44<=0 & ~ [[[p8<=p54 | p60<=p93] & ~ [p35<=1]]]] U [[~ [E [true U ~ [p89<=1]]] & ~ [EG [~ [p78<=1]]]] | [1<=p15 & E [true U p19<=0]]]]]]
abstracting: (p19<=0)
states: 23,579,476,911 (10)
abstracting: (1<=p15)
states: 2,357,947,691 (9)
abstracting: (p78<=1)
states: 25,937,424,602 (10)
.
EG iterations: 1
abstracting: (p89<=1)
states: 25,937,424,602 (10)
abstracting: (p35<=1)
states: 25,937,424,602 (10)
abstracting: (p60<=p93)
states: 23,793,835,792 (10)
abstracting: (p8<=p54)
states: 23,793,835,792 (10)
abstracting: (p44<=0)
states: 23,579,476,911 (10)
abstracting: (1<=p20)
states: 2,357,947,691 (9)
abstracting: (p32<=p87)
states: 23,793,835,792 (10)
abstracting: (1<=p66)
states: 2,357,947,691 (9)
abstracting: (p45<=p93)
states: 23,793,835,792 (10)
..-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m48.544sec
checking: E [[AG [[[EF [1<=p62] & [1<=p83 & p40<=1]] | AX [EG [1<=p38]]]] & 1<=p82] U [p79<=p50 & [AG [E [p18<=0 U A [p26<=1 U p75<=1]]] | [EX [AG [p51<=0]] | AX [[A [p4<=1 U p20<=p83] & [p79<=0 & 1<=p5]]]]]]]
normalized: E [[1<=p82 & ~ [E [true U ~ [[~ [EX [~ [EG [1<=p38]]]] | [[1<=p83 & p40<=1] & E [true U 1<=p62]]]]]]] U [p79<=p50 & [[~ [EX [~ [[[p79<=0 & 1<=p5] & [~ [EG [~ [p20<=p83]]] & ~ [E [~ [p20<=p83] U [~ [p4<=1] & ~ [p20<=p83]]]]]]]]] | EX [~ [E [true U ~ [p51<=0]]]]] | ~ [E [true U ~ [E [p18<=0 U [~ [EG [~ [p75<=1]]] & ~ [E [~ [p75<=1] U [~ [p26<=1] & ~ [p75<=1]]]]]]]]]]]]
abstracting: (p75<=1)
states: 25,937,424,602 (10)
abstracting: (p26<=1)
states: 25,937,424,602 (10)
abstracting: (p75<=1)
states: 25,937,424,602 (10)
abstracting: (p75<=1)
states: 25,937,424,602 (10)
.
EG iterations: 1
abstracting: (p18<=0)
states: 23,579,476,911 (10)
abstracting: (p51<=0)
states: 23,579,476,911 (10)
.abstracting: (p20<=p83)
states: 23,793,835,792 (10)
abstracting: (p4<=1)
states: 25,937,424,602 (10)
abstracting: (p20<=p83)
states: 23,793,835,792 (10)
abstracting: (p20<=p83)
states: 23,793,835,792 (10)
............................
EG iterations: 28
abstracting: (1<=p5)
states: 2,357,947,691 (9)
abstracting: (p79<=0)
states: 23,579,476,911 (10)
.abstracting: (p79<=p50)
states: 23,793,835,792 (10)
abstracting: (1<=p62)
states: 2,357,947,691 (9)
abstracting: (p40<=1)
states: 25,937,424,602 (10)
abstracting: (1<=p83)
states: 2,357,947,691 (9)
abstracting: (1<=p38)
states: 2,357,947,691 (9)
.............................
EG iterations: 29
.abstracting: (1<=p82)
states: 2,357,947,691 (9)
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m52.275sec
checking: A [A [[[[AX [p94<=p24] | p3<=p30] & ~ [[p41<=1 | p28<=1]]] | [~ [[AF [p73<=1] & AX [p89<=p50]]] | [[EX [p21<=p73] & EX [p35<=p97]] & AX [p90<=0]]]] U A [~ [1<=p73] U ~ [p86<=0]]] U AG [~ [[AX [~ [p40<=0]] & 1<=p34]]]]
normalized: [~ [EG [E [true U [1<=p34 & ~ [EX [p40<=0]]]]]] & ~ [E [E [true U [1<=p34 & ~ [EX [p40<=0]]]] U [~ [[~ [EG [~ [[~ [EG [p86<=0]] & ~ [E [p86<=0 U [1<=p73 & p86<=0]]]]]]] & ~ [E [~ [[~ [EG [p86<=0]] & ~ [E [p86<=0 U [1<=p73 & p86<=0]]]]] U [~ [[[[~ [EX [~ [p90<=0]]] & [EX [p35<=p97] & EX [p21<=p73]]] | ~ [[~ [EX [~ [p89<=p50]]] & ~ [EG [~ [p73<=1]]]]]] | [~ [[p41<=1 | p28<=1]] & [p3<=p30 | ~ [EX [~ [p94<=p24]]]]]]] & ~ [[~ [EG [p86<=0]] & ~ [E [p86<=0 U [1<=p73 & p86<=0]]]]]]]]]] & E [true U [1<=p34 & ~ [EX [p40<=0]]]]]]]]
abstracting: (p40<=0)
states: 23,579,476,911 (10)
.abstracting: (1<=p34)
states: 2,357,947,691 (9)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (1<=p73)
states: 2,357,947,691 (9)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
.............................
EG iterations: 29
abstracting: (p94<=p24)
states: 23,793,835,792 (10)
.abstracting: (p3<=p30)
states: 23,793,835,792 (10)
abstracting: (p28<=1)
states: 25,937,424,602 (10)
abstracting: (p41<=1)
states: 25,937,424,602 (10)
abstracting: (p73<=1)
states: 25,937,424,602 (10)
.
EG iterations: 1
abstracting: (p89<=p50)
states: 23,793,835,792 (10)
.abstracting: (p21<=p73)
states: 23,793,835,792 (10)
.abstracting: (p35<=p97)
states: 23,793,835,792 (10)
.abstracting: (p90<=0)
states: 23,579,476,911 (10)
.abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (1<=p73)
states: 2,357,947,691 (9)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
.............................
EG iterations: 29
abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (1<=p73)
states: 2,357,947,691 (9)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
abstracting: (p86<=0)
states: 23,579,476,911 (10)
.............................
EG iterations: 29
..........................
EG iterations: 26
abstracting: (p40<=0)
states: 23,579,476,911 (10)
.abstracting: (1<=p34)
states: 2,357,947,691 (9)
abstracting: (p40<=0)
states: 23,579,476,911 (10)
.abstracting: (1<=p34)
states: 2,357,947,691 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m10.224sec
checking: [[AG [[~ [[AG [p88<=1] & [1<=p54 & p15<=p47]]] | [A [[1<=p14 & p87<=p84] U ~ [p53<=p66]] & [~ [p24<=0] & ~ [EF [p56<=p76]]]]]] & A [EF [E [[p89<=p32 & p17<=p23] U [1<=p81 & 1<=p49]]] U ~ [AG [AX [p45<=0]]]]] & AX [[p38<=p30 & [~ [[1<=p17 & E [p51<=p10 U 1<=p10]]] | EG [EF [p23<=1]]]]]]
normalized: [~ [EX [~ [[p38<=p30 & [EG [E [true U p23<=1]] | ~ [[1<=p17 & E [p51<=p10 U 1<=p10]]]]]]]] & [[~ [EG [~ [E [true U EX [~ [p45<=0]]]]]] & ~ [E [~ [E [true U EX [~ [p45<=0]]]] U [~ [E [true U E [[p89<=p32 & p17<=p23] U [1<=p81 & 1<=p49]]]] & ~ [E [true U EX [~ [p45<=0]]]]]]]] & ~ [E [true U ~ [[[[~ [E [true U p56<=p76]] & ~ [p24<=0]] & [~ [EG [p53<=p66]] & ~ [E [p53<=p66 U [p53<=p66 & ~ [[1<=p14 & p87<=p84]]]]]]] | ~ [[[1<=p54 & p15<=p47] & ~ [E [true U ~ [p88<=1]]]]]]]]]]]
abstracting: (p88<=1)
states: 25,937,424,602 (10)
abstracting: (p15<=p47)
states: 23,793,835,792 (10)
abstracting: (1<=p54)
states: 2,357,947,691 (9)
abstracting: (p87<=p84)
states: 23,579,476,911 (10)
abstracting: (1<=p14)
states: 2,357,947,691 (9)
abstracting: (p53<=p66)
states: 23,793,835,792 (10)
abstracting: (p53<=p66)
states: 23,793,835,792 (10)
abstracting: (p53<=p66)
states: 23,793,835,792 (10)
.
EG iterations: 1
abstracting: (p24<=0)
states: 23,579,476,911 (10)
abstracting: (p56<=p76)
states: 23,793,835,792 (10)
abstracting: (p45<=0)
states: 23,579,476,911 (10)
.abstracting: (1<=p49)
states: 2,357,947,691 (9)
abstracting: (1<=p81)
states: 2,357,947,691 (9)
abstracting: (p17<=p23)
states: 23,793,835,792 (10)
abstracting: (p89<=p32)
states: 23,793,835,792 (10)
abstracting: (p45<=0)
states: 23,579,476,911 (10)
.abstracting: (p45<=0)
states: 23,579,476,911 (10)
..
EG iterations: 1
abstracting: (1<=p10)
states: 2,357,947,691 (9)
abstracting: (p51<=p10)
states: 23,793,835,792 (10)
abstracting: (1<=p17)
states: 2,357,947,691 (9)
abstracting: (p23<=1)
states: 25,937,424,602 (10)
EG iterations: 0
abstracting: (p38<=p30)
states: 23,793,835,792 (10)
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m35.583sec
totally nodes used: 168774248 (1.7e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 379332262 1149633857 1528966119
used/not used/entry size/cache size: 66096474 1012390 16 1024MB
basic ops cache: hits/miss/sum: 146867283 407720582 554587865
used/not used/entry size/cache size: 16774411 2805 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: 575261 1169497 1744758
used/not used/entry size/cache size: 562912 7825696 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 36703260
1 21354185
2 6980747
3 1678921
4 327567
5 54749
6 8132
7 1107
8 172
9 23
>= 10 1
Total processing time: 24m 2.078sec
BK_STOP 1679954532591
--------------------
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.002sec
iterations count:4908 (34), effective:101 (0)
initing FirstDep: 0m 0.000sec
iterations count:404 (2), effective:5 (0)
iterations count:613 (4), effective:10 (0)
iterations count:220 (1), effective:3 (0)
iterations count:3159 (22), effective:74 (0)
iterations count:192 (1), effective:2 (0)
iterations count:192 (1), effective:2 (0)
iterations count:192 (1), effective:2 (0)
iterations count:262 (1), effective:3 (0)
iterations count:231 (1), effective:1 (0)
iterations count:809 (5), effective:15 (0)
iterations count:752 (5), effective:10 (0)
iterations count:141 (1), effective:0 (0)
iterations count:314 (2), effective:4 (0)
iterations count:143 (1), effective:1 (0)
iterations count:420 (2), effective:5 (0)
iterations count:413 (2), effective:5 (0)
iterations count:420 (2), effective:5 (0)
iterations count:413 (2), effective:5 (0)
iterations count:637 (4), effective:10 (0)
iterations count:420 (2), effective:5 (0)
iterations count:413 (2), effective:5 (0)
iterations count:1496 (10), effective:54 (0)
iterations count:141 (1), effective:0 (0)
iterations count:831 (5), effective:11 (0)
iterations count:148 (1), effective:1 (0)
iterations count:386 (2), effective:5 (0)
iterations count:685 (4), effective:13 (0)
iterations count:149 (1), effective:1 (0)
iterations count:141 (1), effective:0 (0)
iterations count:141 (1), effective:0 (0)
iterations count:384 (2), effective:13 (0)
iterations count:4406 (31), effective:101 (0)
iterations count:141 (1), effective:0 (0)
iterations count:726 (5), effective:10 (0)
iterations count:631 (4), effective:9 (0)
iterations count:602 (4), effective:9 (0)
iterations count:141 (1), effective:0 (0)
iterations count:615 (4), effective:8 (0)
iterations count:615 (4), effective:8 (0)
iterations count:4010 (28), effective:94 (0)
iterations count:615 (4), effective:8 (0)
iterations count:144 (1), effective:1 (0)
iterations count:142 (1), effective:1 (0)
iterations count:554 (3), effective:8 (0)
iterations count:447 (3), effective:6 (0)
iterations count:1157 (8), effective:20 (0)
iterations count:252 (1), effective:5 (0)
iterations count:447 (3), effective:6 (0)
iterations count:141 (1), effective:0 (0)
iterations count:447 (3), effective:6 (0)
iterations count:231 (1), effective:1 (0)
iterations count:141 (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="DiscoveryGPU-PT-10a"
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 DiscoveryGPU-PT-10a, 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 r129-smll-167819404000345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a 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 ;