fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r385-oct2-167903709600025
Last Updated
May 14, 2023

About the Execution of Marcie for ShieldIIPs-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10258.607 3600000.00 3600147.00 0.00 ???T?T?FTF?T??TT 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.r385-oct2-167903709600025.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 ShieldIIPs-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903709600025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679039989212

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=ShieldIIPs-PT-002B
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: ShieldIIPs_PT_002B
(NrP: 123 NrTr: 121 NrArc: 362)

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

net check time: 0m 0.000sec

init dd package: 0m 4.149sec


RS generation: 0m29.825sec


-> reachability set: #nodes 342878 (3.4e+05) #states 258,774,624,175 (11)



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

checking: EG [AF [p52<=1]]
normalized: EG [~ [EG [~ [p52<=1]]]]

abstracting: (p52<=1)
states: 258,774,624,175 (11)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.834sec

checking: AX [AG [p74<=1]]
normalized: ~ [EX [E [true U ~ [p74<=1]]]]

abstracting: (p74<=1)
states: 258,774,624,175 (11)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [[1<=p25 | AX [1<=p86]]]]
normalized: ~ [E [true U ~ [E [true U [1<=p25 | ~ [EX [~ [1<=p86]]]]]]]]

abstracting: (1<=p86)
states: 86,258,028,508 (10)
.abstracting: (1<=p25)
states: 91,130,901,690 (10)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.572sec

checking: AF [AX [EX [[p64<=p89 & AX [1<=p112]]]]]
normalized: ~ [EG [EX [~ [EX [[p64<=p89 & ~ [EX [~ [1<=p112]]]]]]]]]

abstracting: (1<=p112)
states: 134,379 (5)
.abstracting: (p64<=p89)
states: 258,774,623,608 (11)
.............................................................................................................................
EG iterations: 123
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.150sec

checking: E [~ [1<=p91] U EX [[~ [p55<=p103] & AF [AX [p79<=0]]]]]
normalized: E [~ [1<=p91] U EX [[~ [EG [EX [~ [p79<=0]]]] & ~ [p55<=p103]]]]

abstracting: (p55<=p103)
states: 229,894,820,941 (11)
abstracting: (p79<=0)
states: 186,826,064,779 (11)
....................
before gc: list nodes free: 970275

after gc: idd nodes used:957140, unused:63042860; list nodes free:293455629
..............................................................................
before gc: list nodes free: 541908

after gc: idd nodes used:3734817, unused:60265183; list nodes free:286989971
........................................................MC time: 4m51.009sec

checking: ~ [AG [EF [[EX [~ [1<=p78]] | [p66<=p1 & AF [p120<=p89]]]]]]
normalized: E [true U ~ [E [true U [[p66<=p1 & ~ [EG [~ [p120<=p89]]]] | EX [~ [1<=p78]]]]]]

abstracting: (1<=p78)
states: 76,133,504,454 (10)

before gc: list nodes free: 1167500

after gc: idd nodes used:1045910, unused:62954090; list nodes free:299238768
.abstracting: (p120<=p89)
states: 234,961,265,002 (11)
.................................................
before gc: list nodes free: 2924786

after gc: idd nodes used:4084666, unused:59915334; list nodes free:285331977
.........MC time: 4m26.017sec

checking: ~ [EG [[EX [[A [p8<=p16 U p80<=p87] & AF [p85<=1]]] | p9<=0]]]
normalized: ~ [EG [[p9<=0 | EX [[[~ [EG [~ [p80<=p87]]] & ~ [E [~ [p80<=p87] U [~ [p8<=p16] & ~ [p80<=p87]]]]] & ~ [EG [~ [p85<=1]]]]]]]]

abstracting: (p85<=1)
states: 258,774,624,175 (11)
.
EG iterations: 1
abstracting: (p80<=p87)
states: 208,494,566,187 (11)
abstracting: (p8<=p16)
states: 258,774,560,591 (11)
abstracting: (p80<=p87)
states: 208,494,566,187 (11)
abstracting: (p80<=p87)
states: 208,494,566,187 (11)
...............................................
before gc: list nodes free: 2347753

after gc: idd nodes used:2761832, unused:61238168; list nodes free:291411867
.....................................................................................
before gc: list nodes free: 3417678

after gc: idd nodes used:2433203, unused:61566797; list nodes free:292845168
MC time: 4m 4.063sec

checking: ~ [AX [[AG [EF [EX [p116<=p91]]] & EX [[[[1<=p83 & 1<=p38] & p54<=0] | E [p89<=1 U p36<=0]]]]]]
normalized: EX [~ [[EX [[E [p89<=1 U p36<=0] | [p54<=0 & [1<=p83 & 1<=p38]]]] & ~ [E [true U ~ [E [true U EX [p116<=p91]]]]]]]]

abstracting: (p116<=p91)
states: 233,829,685,390 (11)
.abstracting: (1<=p38)
states: 177,995,359 (8)
abstracting: (1<=p83)
states: 84,730,145,910 (10)
abstracting: (p54<=0)
states: 230,428,470,661 (11)
abstracting: (p36<=0)
states: 225,786,409,848 (11)
abstracting: (p89<=1)
states: 258,774,624,175 (11)
..-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.041sec

checking: AG [[~ [[p26<=p80 & [EF [AG [p18<=0]] | 1<=p12]]] | ~ [[1<=p12 & [EG [~ [1<=p16]] & AX [AG [p88<=p108]]]]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p12 & [~ [EX [E [true U ~ [p88<=p108]]]] & EG [~ [1<=p16]]]]] | ~ [[p26<=p80 & [1<=p12 | E [true U ~ [E [true U ~ [p18<=0]]]]]]]]]]]

abstracting: (p18<=0)
states: 219,263,880,373 (11)
abstracting: (1<=p12)
states: 126,250,192 (8)
abstracting: (p26<=p80)
states: 197,970,344,449 (11)
abstracting: (1<=p16)
states: 36,254,072,908 (10)
..................................
before gc: list nodes free: 6948103

after gc: idd nodes used:1873648, unused:62126352; list nodes free:295648045
..........................................MC time: 3m57.021sec

checking: EF [[[~ [[AG [[1<=p106 | p36<=0]] | AX [~ [1<=p43]]]] & [p29<=0 | AF [A [p101<=0 U p64<=p69]]]] & ~ [p95<=p22]]]
normalized: E [true U [~ [p95<=p22] & [[p29<=0 | ~ [EG [~ [[~ [EG [~ [p64<=p69]]] & ~ [E [~ [p64<=p69] U [~ [p101<=0] & ~ [p64<=p69]]]]]]]]] & ~ [[~ [EX [1<=p43]] | ~ [E [true U ~ [[1<=p106 | p36<=0]]]]]]]]]

abstracting: (p36<=0)
states: 225,786,409,848 (11)
abstracting: (1<=p106)
states: 32,226,942,834 (10)
abstracting: (1<=p43)
states: 2,149,576 (6)
.abstracting: (p64<=p69)
states: 258,774,623,608 (11)
abstracting: (p101<=0)
states: 174,511,402,159 (11)
abstracting: (p64<=p69)
states: 258,774,623,608 (11)
abstracting: (p64<=p69)
states: 258,774,623,608 (11)
.....................
EG iterations: 21
.
EG iterations: 1
abstracting: (p29<=0)
states: 258,596,628,816 (11)
abstracting: (p95<=p22)
states: 234,665,680,693 (11)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.832sec

checking: AG [A [EF [~ [[[p44<=p71 | p2<=1] | EX [p55<=p47]]]] U [~ [[p44<=p117 | ~ [p20<=0]]] & ~ [p91<=p35]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [p91<=p35] & ~ [[p44<=p117 | ~ [p20<=0]]]]]]] & ~ [E [~ [[~ [p91<=p35] & ~ [[p44<=p117 | ~ [p20<=0]]]]] U [~ [E [true U ~ [[EX [p55<=p47] | [p44<=p71 | p2<=1]]]]] & ~ [[~ [p91<=p35] & ~ [[p44<=p117 | ~ [p20<=0]]]]]]]]]]]]

abstracting: (p20<=0)
states: 186,264,316,579 (11)
abstracting: (p44<=p117)
states: 230,923,095,385 (11)
abstracting: (p91<=p35)
states: 232,699,457,398 (11)
abstracting: (p2<=1)
states: 258,774,624,175 (11)
abstracting: (p44<=p71)
states: 227,539,715,383 (11)
abstracting: (p55<=p47)
states: 229,664,565,427 (11)

before gc: list nodes free: 4648823

after gc: idd nodes used:1898503, unused:62101497; list nodes free:295594210
.abstracting: (p20<=0)
states: 186,264,316,579 (11)
abstracting: (p44<=p117)
states: 230,923,095,385 (11)
abstracting: (p91<=p35)
states: 232,699,457,398 (11)
abstracting: (p20<=0)
states: 186,264,316,579 (11)
abstracting: (p44<=p117)
states: 230,923,095,385 (11)
abstracting: (p91<=p35)
states: 232,699,457,398 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.014sec

checking: [E [1<=p20 U [[1<=p42 | EX [~ [A [p16<=p95 U 1<=p56]]]] & [p28<=0 | [EF [~ [1<=p85]] | [p121<=1 & ~ [1<=p63]]]]]] & E [p84<=0 U EF [EX [AG [p22<=0]]]]]
normalized: [E [p84<=0 U E [true U EX [~ [E [true U ~ [p22<=0]]]]]] & E [1<=p20 U [[p28<=0 | [[p121<=1 & ~ [1<=p63]] | E [true U ~ [1<=p85]]]] & [1<=p42 | EX [~ [[~ [EG [~ [1<=p56]]] & ~ [E [~ [1<=p56] U [~ [p16<=p95] & ~ [1<=p56]]]]]]]]]]]

abstracting: (1<=p56)
states: 33,162,441,864 (10)
abstracting: (p16<=p95)
states: 227,173,200,142 (11)
abstracting: (1<=p56)
states: 33,162,441,864 (10)
abstracting: (1<=p56)
states: 33,162,441,864 (10)
....................................................
before gc: list nodes free: 5834286

after gc: idd nodes used:3344554, unused:60655446; list nodes free:288978984
.......MC time: 4m14.004sec

checking: ~ [E [AF [EG [A [p42<=1 U p110<=0]]] U [[~ [[~ [AX [p43<=0]] & AF [p62<=p65]]] | AG [A [p12<=p71 U p69<=0]]] & [AG [~ [E [p34<=1 U p17<=p83]]] & 1<=p68]]]]
normalized: ~ [E [~ [EG [~ [EG [[~ [EG [~ [p110<=0]]] & ~ [E [~ [p110<=0] U [~ [p42<=1] & ~ [p110<=0]]]]]]]]] U [[1<=p68 & ~ [E [true U E [p34<=1 U p17<=p83]]]] & [~ [E [true U ~ [[~ [EG [~ [p69<=0]]] & ~ [E [~ [p69<=0] U [~ [p12<=p71] & ~ [p69<=0]]]]]]]] | ~ [[~ [EG [~ [p62<=p65]]] & EX [~ [p43<=0]]]]]]]]

abstracting: (p43<=0)
states: 258,772,474,599 (11)
.abstracting: (p62<=p65)
states: 230,426,317,252 (11)
.......................................
before gc: list nodes free: 5313029

after gc: idd nodes used:2720491, unused:61279509; list nodes free:291849522
...........................................MC time: 3m45.004sec

checking: AG [[AX [EF [AX [1<=p111]]] & ~ [[EX [[EX [p29<=p43] | AX [p60<=p54]]] & [[[AF [1<=p99] | [1<=p63 | 1<=p75]] & ~ [[p109<=p4 | p41<=p9]]] & 1<=p35]]]]]
normalized: ~ [E [true U ~ [[~ [[[1<=p35 & [~ [[p109<=p4 | p41<=p9]] & [[1<=p63 | 1<=p75] | ~ [EG [~ [1<=p99]]]]]] & EX [[~ [EX [~ [p60<=p54]]] | EX [p29<=p43]]]]] & ~ [EX [~ [E [true U ~ [EX [~ [1<=p111]]]]]]]]]]]

abstracting: (1<=p111)
states: 133,812 (5)

before gc: list nodes free: 7882545

after gc: idd nodes used:2139374, unused:61860626; list nodes free:294523589
..abstracting: (p29<=p43)
states: 258,597,154,288 (11)
.abstracting: (p60<=p54)
states: 235,091,781,235 (11)
..abstracting: (1<=p99)
states: 84,155,171,508 (10)
.......................................
before gc: list nodes free: 5058127

after gc: idd nodes used:7294641, unused:56705359; list nodes free:270500107
.MC time: 3m20.548sec

checking: AG [[[[[AF [AX [p38<=1]] | ~ [p64<=p20]] & p25<=1] & [[~ [[~ [p122<=p103] & E [1<=p21 U p9<=0]]] | [[EF [p15<=p94] | [p51<=p110 & p7<=p95]] | p101<=p6]] & [[[[p2<=1 | p78<=p35] | ~ [1<=p2]] & p92<=p51] | ~ [AF [p4<=p84]]]]] & p17<=1]]
normalized: ~ [E [true U ~ [[p17<=1 & [[[EG [~ [p4<=p84]] | [p92<=p51 & [~ [1<=p2] | [p2<=1 | p78<=p35]]]] & [[p101<=p6 | [[p51<=p110 & p7<=p95] | E [true U p15<=p94]]] | ~ [[E [1<=p21 U p9<=0] & ~ [p122<=p103]]]]] & [p25<=1 & [~ [p64<=p20] | ~ [EG [EX [~ [p38<=1]]]]]]]]]]]

abstracting: (p38<=1)
states: 258,774,624,175 (11)
..
EG iterations: 1
abstracting: (p64<=p20)
states: 258,774,623,608 (11)
abstracting: (p25<=1)
states: 258,774,624,175 (11)
abstracting: (p122<=p103)
states: 258,774,489,796 (11)
abstracting: (p9<=0)
states: 258,774,497,007 (11)
abstracting: (1<=p21)
states: 76,337,759,508 (10)
abstracting: (p15<=p94)
states: 178,227,905,008 (11)
abstracting: (p7<=p95)
states: 258,774,611,911 (11)
abstracting: (p51<=p110)
states: 231,510,538,207 (11)
abstracting: (p101<=p6)
states: 174,511,404,063 (11)
abstracting: (p78<=p35)
states: 191,645,354,413 (11)
abstracting: (p2<=1)
states: 258,774,624,175 (11)
abstracting: (1<=p2)
states: 83,889,712,759 (10)
abstracting: (p92<=p51)
states: 230,468,352,697 (11)
abstracting: (p4<=p84)
states: 198,600,486,937 (11)
....................................................................
before gc: list nodes free: 3378771

after gc: idd nodes used:8156157, unused:55843843; list nodes free:265989709
.MC time: 2m58.353sec

checking: [AX [[~ [[EG [AG [1<=p91]] | [E [p40<=p21 U p89<=p39] | [[p35<=1 | p69<=1] & p98<=p68]]]] & ~ [AX [AF [p95<=1]]]]] | [[E [~ [[~ [AG [p16<=p57]] | A [1<=p8 U p34<=p33]]] U [[[1<=p39 & EG [p13<=1]] & EX [1<=p112]] & ~ [[EF [1<=p97] | A [p116<=0 U p74<=0]]]]] & EG [[AG [[p75<=p1 & p81<=1]] | ~ [EF [1<=p101]]]]] | E [E [EG [[1<=p29 | p6<=p87]] U p120<=p92] U 1<=p103]]]
normalized: [[E [E [EG [[1<=p29 | p6<=p87]] U p120<=p92] U 1<=p103] | [EG [[~ [E [true U 1<=p101]] | ~ [E [true U ~ [[p75<=p1 & p81<=1]]]]]] & E [~ [[[~ [EG [~ [p34<=p33]]] & ~ [E [~ [p34<=p33] U [~ [1<=p8] & ~ [p34<=p33]]]]] | E [true U ~ [p16<=p57]]]] U [~ [[[~ [EG [~ [p74<=0]]] & ~ [E [~ [p74<=0] U [~ [p116<=0] & ~ [p74<=0]]]]] | E [true U 1<=p97]]] & [EX [1<=p112] & [1<=p39 & EG [p13<=1]]]]]]] | ~ [EX [~ [[EX [EG [~ [p95<=1]]] & ~ [[[[p98<=p68 & [p35<=1 | p69<=1]] | E [p40<=p21 U p89<=p39]] | EG [~ [E [true U ~ [1<=p91]]]]]]]]]]]

abstracting: (1<=p91)
states: 29,553,938,811 (10)
.
EG iterations: 1
abstracting: (p89<=p39)
states: 225,700,057,612 (11)
abstracting: (p40<=p21)
states: 200,525,500,603 (11)
abstracting: (p69<=1)
states: 258,774,624,175 (11)
abstracting: (p35<=1)
states: 258,774,624,175 (11)
abstracting: (p98<=p68)
states: 258,221,932,195 (11)
abstracting: (p95<=1)
states: 258,774,624,175 (11)
.
EG iterations: 1
..abstracting: (p13<=1)
states: 258,774,624,175 (11)

EG iterations: 0
abstracting: (1<=p39)
states: 572,803,480 (8)
abstracting: (1<=p112)
states: 134,379 (5)
.abstracting: (1<=p97)
states: 1,308,618,342 (9)
abstracting: (p74<=0)
states: 168,571,200,835 (11)
abstracting: (p116<=0)
states: 230,332,905,703 (11)
abstracting: (p74<=0)
states: 168,571,200,835 (11)
abstracting: (p74<=0)
states: 168,571,200,835 (11)
..................................
before gc: list nodes free: 4565804

after gc: idd nodes used:6581818, unused:57418182; list nodes free:274197708
MC time: 2m48.320sec

checking: E [~ [1<=p91] U EX [[~ [p55<=p103] & AF [AX [p79<=0]]]]]
normalized: E [~ [1<=p91] U EX [[~ [EG [EX [~ [p79<=0]]]] & ~ [p55<=p103]]]]

abstracting: (p55<=p103)
states: 229,894,820,941 (11)
abstracting: (p79<=0)
states: 186,826,064,779 (11)
........................................................................................
before gc: list nodes free: 1829591

after gc: idd nodes used:6920382, unused:57079618; list nodes free:272738932
...........................................................
before gc: list nodes free: 1280004

after gc: idd nodes used:6288321, unused:57711679; list nodes free:275517847
........................................................................................................................
EG iterations: 266
.abstracting: (1<=p91)
states: 29,553,938,811 (10)

before gc: list nodes free: 3821864

after gc: idd nodes used:2971069, unused:61028931; list nodes free:290805937
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 5967992 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16177308 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

452514
iterations count:146139 (1207), effective:12892 (106)

initing FirstDep: 0m 0.000sec


iterations count:3955 (32), effective:223 (1)

net_ddint.h:600: Timeout: after 290 sec


net_ddint.h:600: Timeout: after 265 sec


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

net_ddint.h:600: Timeout: after 243 sec


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

iterations count:32964 (272), effective:2690 (22)

iterations count:1480 (12), effective:107 (0)

iterations count:4713 (38), effective:383 (3)

iterations count:18729 (154), effective:1533 (12)

net_ddint.h:600: Timeout: after 236 sec


iterations count:3572 (29), effective:286 (2)

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

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

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

iterations count:8933 (73), effective:685 (5)

net_ddint.h:600: Timeout: after 253 sec


net_ddint.h:600: Timeout: after 224 sec


iterations count:33584 (277), effective:2715 (22)

ctl_mc.icc:221: Timeout: after 199 sec


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

iterations count:3287 (27), effective:256 (2)

ctl_mc.icc:221: Timeout: after 177 sec


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

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

iterations count:144 (1), effective:7 (0)

iterations count:4851 (40), effective:392 (3)

net_ddint.h:600: Timeout: after 157 sec


iterations count:4317 (35), effective:330 (2)

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="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, 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 r385-oct2-167903709600025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;