About the Execution of Marcie for Parking-PT-416
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10114.063 | 3600000.00 | 3600138.00 | 0.00 | F?????TT???T???? | 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.r257-smll-167863532700425.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 Parking-PT-416, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532700425
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K 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 Parking-PT-416-CTLCardinality-00
FORMULA_NAME Parking-PT-416-CTLCardinality-01
FORMULA_NAME Parking-PT-416-CTLCardinality-02
FORMULA_NAME Parking-PT-416-CTLCardinality-03
FORMULA_NAME Parking-PT-416-CTLCardinality-04
FORMULA_NAME Parking-PT-416-CTLCardinality-05
FORMULA_NAME Parking-PT-416-CTLCardinality-06
FORMULA_NAME Parking-PT-416-CTLCardinality-07
FORMULA_NAME Parking-PT-416-CTLCardinality-08
FORMULA_NAME Parking-PT-416-CTLCardinality-09
FORMULA_NAME Parking-PT-416-CTLCardinality-10
FORMULA_NAME Parking-PT-416-CTLCardinality-11
FORMULA_NAME Parking-PT-416-CTLCardinality-12
FORMULA_NAME Parking-PT-416-CTLCardinality-13
FORMULA_NAME Parking-PT-416-CTLCardinality-14
FORMULA_NAME Parking-PT-416-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678842111215
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=Parking-PT-416
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: Parking_PT_416
(NrP: 305 NrTr: 433 NrArc: 1289)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec
net check time: 0m 0.000sec
init dd package: 0m 3.513sec
RS generation: 0m20.962sec
-> reachability set: #nodes 110854 (1.1e+05) #states 8,440,470,781,232,316,153,857 (21)
starting MCC model checker
--------------------------
checking: EG [AF [EG [~ [EX [p80<=1]]]]]
normalized: EG [~ [EG [~ [EG [~ [EX [p80<=1]]]]]]]
abstracting: (p80<=1)
states: 8,440,470,781,232,316,153,857 (21)
..
EG iterations: 1
......
before gc: list nodes free: 172790
after gc: idd nodes used:1850846, unused:62149154; list nodes free:281043503
.
before gc: list nodes free: 1367234
after gc: idd nodes used:2465457, unused:61534543; list nodes free:280345875
MC time: 3m44.135sec
checking: ~ [EF [EF [~ [EF [p94<=1]]]]]
normalized: ~ [E [true U E [true U ~ [E [true U p94<=1]]]]]
abstracting: (p94<=1)
states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.732sec
checking: EG [p71<=p233]
normalized: EG [p71<=p233]
abstracting: (p71<=p233)
states: 8,280,169,656,095,690,719,233 (21)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Parking-PT-416-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.806sec
checking: AG [EG [AF [EX [[p156<=1 | p122<=0]]]]]
normalized: ~ [E [true U ~ [EG [~ [EG [~ [EX [[p156<=1 | p122<=0]]]]]]]]]
abstracting: (p122<=0)
states: 8,269,380,157,288,417,853,441 (21)
abstracting: (p156<=1)
states: 8,440,470,781,232,316,153,857 (21)
..
EG iterations: 1
.....
before gc: list nodes free: 2632259
after gc: idd nodes used:1474361, unused:62525639; list nodes free:284853760
.
before gc: list nodes free: 1726562
after gc: idd nodes used:1914606, unused:62085394; list nodes free:282847170
MC time: 3m58.740sec
checking: EX [[~ [AX [p297<=1]] | EX [EG [[[p234<=1 | p118<=0] & [p275<=0 | p172<=0]]]]]]
normalized: EX [[EX [EG [[[p275<=0 | p172<=0] & [p234<=1 | p118<=0]]]] | EX [~ [p297<=1]]]]
abstracting: (p297<=1)
states: 8,440,470,781,232,316,153,857 (21)
.abstracting: (p118<=0)
states: 1,254,664,575,588,587,536,385 (21)
abstracting: (p234<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (p172<=0)
states: 4,220,235,390,616,158,076,929 (21)
abstracting: (p275<=0)
states: 8,269,380,157,288,417,853,441 (21)
.
EG iterations: 1
..-> the formula is TRUE
FORMULA Parking-PT-416-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.761sec
checking: AG [EF [[~ [[[p191<=1 & [1<=p5 | p282<=p135]] | EX [1<=p237]]] & ~ [EX [AG [1<=p140]]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [EX [~ [E [true U ~ [1<=p140]]]]] & ~ [[EX [1<=p237] | [p191<=1 & [1<=p5 | p282<=p135]]]]]]]]]
abstracting: (p282<=p135)
states: 1,288,574,428,982,873,686,017 (21)
abstracting: (1<=p5)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (p191<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=p237)
states: 4,220,235,390,616,158,076,928 (21)
.abstracting: (1<=p140)
states: 228,120,831,925,197,733,888 (20)
.-> the formula is FALSE
FORMULA Parking-PT-416-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33.524sec
checking: AF [AG [[[1<=p254 | AG [[p119<=1 | 1<=p102]]] | [EX [[p72<=0 | 1<=p90]] & [AG [p138<=p167] | EG [1<=p205]]]]]]
normalized: ~ [EG [E [true U ~ [[[[EG [1<=p205] | ~ [E [true U ~ [p138<=p167]]]] & EX [[p72<=0 | 1<=p90]]] | [1<=p254 | ~ [E [true U ~ [[p119<=1 | 1<=p102]]]]]]]]]]
abstracting: (1<=p102)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (p119<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=p254)
states: 171,090,623,943,898,300,416 (20)
abstracting: (1<=p90)
states: 8,212,349,949,307,118,419,968 (21)
abstracting: (p72<=0)
states: 1,140,604,159,625,988,669,441 (21)
.abstracting: (p138<=p167)
states: 8,383,440,573,251,016,720,385 (21)
before gc: list nodes free: 435761
after gc: idd nodes used:1384612, unused:62615388; list nodes free:285196978
MC time: 4m13.084sec
checking: ~ [EX [A [[~ [[A [p56<=p89 U 1<=p261] & [p149<=0 & 1<=p80]]] & EG [~ [p5<=p147]]] U AG [EG [p12<=1]]]]]
normalized: ~ [EX [[~ [EG [E [true U ~ [EG [p12<=1]]]]] & ~ [E [E [true U ~ [EG [p12<=1]]] U [~ [[EG [~ [p5<=p147]] & ~ [[[p149<=0 & 1<=p80] & [~ [EG [~ [1<=p261]]] & ~ [E [~ [1<=p261] U [~ [p56<=p89] & ~ [1<=p261]]]]]]]]] & E [true U ~ [EG [p12<=1]]]]]]]]]
abstracting: (p12<=1)
states: 8,440,470,781,232,316,153,857 (21)
EG iterations: 0
abstracting: (1<=p261)
states: 171,090,623,943,898,300,416 (20)
abstracting: (p56<=p89)
states: 1,482,785,407,513,785,270,273 (21)
abstracting: (1<=p261)
states: 171,090,623,943,898,300,416 (20)
abstracting: (1<=p261)
states: 171,090,623,943,898,300,416 (20)
.
EG iterations: 1
abstracting: (1<=p80)
states: 228,120,831,925,197,733,888 (20)
abstracting: (p149<=0)
states: 8,212,349,949,307,118,419,969 (21)
abstracting: (p5<=p147)
states: 4,334,295,806,578,756,943,873 (21)
.........
before gc: list nodes free: 963156
after gc: idd nodes used:2256380, unused:61743620; list nodes free:285357791
.MC time: 3m52.160sec
checking: AG [EF [[EG [~ [1<=p193]] & [p201<=p160 & [[~ [p265<=p177] & ~ [p91<=p65]] | ~ [p43<=p95]]]]]]
normalized: ~ [E [true U ~ [E [true U [[p201<=p160 & [~ [p43<=p95] | [~ [p91<=p65] & ~ [p265<=p177]]]] & EG [~ [1<=p193]]]]]]]
abstracting: (1<=p193)
states: 114,060,415,962,598,866,944 (20)
....
before gc: list nodes free: 113819
after gc: idd nodes used:1310284, unused:62689716; list nodes free:289775949
.......
before gc: list nodes free: 2378979
after gc: idd nodes used:2579760, unused:61420240; list nodes free:283913855
MC time: 3m32.211sec
checking: EX [A [~ [[p217<=0 & ~ [AX [p204<=1]]]] U ~ [[p79<=1 | A [[p155<=p237 & p191<=1] U [p178<=0 & p56<=p132]]]]]]
normalized: EX [[~ [EG [[p79<=1 | [~ [EG [~ [[p178<=0 & p56<=p132]]]] & ~ [E [~ [[p178<=0 & p56<=p132]] U [~ [[p155<=p237 & p191<=1]] & ~ [[p178<=0 & p56<=p132]]]]]]]]] & ~ [E [[p79<=1 | [~ [EG [~ [[p178<=0 & p56<=p132]]]] & ~ [E [~ [[p178<=0 & p56<=p132]] U [~ [[p155<=p237 & p191<=1]] & ~ [[p178<=0 & p56<=p132]]]]]]] U [[p217<=0 & EX [~ [p204<=1]]] & [p79<=1 | [~ [EG [~ [[p178<=0 & p56<=p132]]]] & ~ [E [~ [[p178<=0 & p56<=p132]] U [~ [[p155<=p237 & p191<=1]] & ~ [[p178<=0 & p56<=p132]]]]]]]]]]]]
abstracting: (p56<=p132)
states: 1,448,875,554,119,499,120,641 (21)
abstracting: (p178<=0)
states: 4,220,235,390,616,158,076,929 (21)
abstracting: (p191<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (p155<=p237)
states: 8,326,410,365,269,717,286,913 (21)
abstracting: (p56<=p132)
states: 1,448,875,554,119,499,120,641 (21)
abstracting: (p178<=0)
states: 4,220,235,390,616,158,076,929 (21)
MC time: 3m15.047sec
checking: AF [~ [EG [A [[E [p157<=1 U 1<=p187] | [1<=p65 & p94<=0]] U [[1<=p242 | p95<=1] & A [1<=p208 U p82<=p31]]]]]]
normalized: ~ [EG [EG [[~ [EG [~ [[[~ [EG [~ [p82<=p31]]] & ~ [E [~ [p82<=p31] U [~ [1<=p208] & ~ [p82<=p31]]]]] & [1<=p242 | p95<=1]]]]] & ~ [E [~ [[[~ [EG [~ [p82<=p31]]] & ~ [E [~ [p82<=p31] U [~ [1<=p208] & ~ [p82<=p31]]]]] & [1<=p242 | p95<=1]]] U [~ [[[1<=p65 & p94<=0] | E [p157<=1 U 1<=p187]]] & ~ [[[~ [EG [~ [p82<=p31]]] & ~ [E [~ [p82<=p31] U [~ [1<=p208] & ~ [p82<=p31]]]]] & [1<=p242 | p95<=1]]]]]]]]]]
abstracting: (p95<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=p242)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (p82<=p31)
states: 8,326,410,365,269,717,286,913 (21)
abstracting: (1<=p208)
states: 114,060,415,962,598,866,944 (20)
abstracting: (p82<=p31)
states: 8,326,410,365,269,717,286,913 (21)
abstracting: (p82<=p31)
states: 8,326,410,365,269,717,286,913 (21)
.......
before gc: list nodes free: 4769265
after gc: idd nodes used:2213057, unused:61786943; list nodes free:285721894
.MC time: 2m59.033sec
checking: AX [A [[[EG [[1<=p60 & 1<=p82]] | [AF [1<=p278] | A [1<=p16 U p210<=p282]]] | [~ [[AF [p106<=1] & AG [p29<=1]]] | ~ [[~ [p259<=p261] | ~ [p107<=p141]]]]] U 1<=p13]]
normalized: ~ [EX [~ [[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [[[~ [[~ [E [true U ~ [p29<=1]]] & ~ [EG [~ [p106<=1]]]]] | ~ [[~ [p259<=p261] | ~ [p107<=p141]]]] | [[[~ [EG [~ [p210<=p282]]] & ~ [E [~ [p210<=p282] U [~ [1<=p16] & ~ [p210<=p282]]]]] | ~ [EG [~ [1<=p278]]]] | EG [[1<=p60 & 1<=p82]]]]] & ~ [1<=p13]]]]]]]]
abstracting: (1<=p13)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (1<=p82)
states: 228,120,831,925,197,733,888 (20)
abstracting: (1<=p60)
states: 114,060,415,962,598,866,944 (20)
.
EG iterations: 1
abstracting: (1<=p278)
states: 114,060,415,962,598,866,944 (20)
..........
before gc: list nodes free: 6976778
after gc: idd nodes used:2464470, unused:61535530; list nodes free:284593257
.MC time: 2m44.184sec
checking: AX [[EF [AG [E [p76<=p288 U 1<=p164]]] & [~ [AF [[[1<=p261 & p101<=0] & ~ [1<=p185]]]] | [EX [~ [[p132<=p183 | p9<=1]]] & ~ [[EF [p184<=p105] | ~ [p168<=p0]]]]]]]
normalized: ~ [EX [~ [[[[EX [~ [[p132<=p183 | p9<=1]]] & ~ [[E [true U p184<=p105] | ~ [p168<=p0]]]] | EG [~ [[~ [1<=p185] & [1<=p261 & p101<=0]]]]] & E [true U ~ [E [true U ~ [E [p76<=p288 U 1<=p164]]]]]]]]]
abstracting: (1<=p164)
states: 2,509,329,151,177,175,072,768 (21)
abstracting: (p76<=p288)
states: 8,218,515,377,196,988,628,993 (21)
MC time: 2m30.005sec
checking: EG [[[AF [AF [EF [p261<=1]]] & [[[~ [E [p77<=p90 U p18<=0]] & [~ [1<=p225] & [1<=p75 | p262<=0]]] | [p47<=0 | p87<=1]] & [p257<=1 | EX [[p35<=0 | 1<=p178]]]]] & EX [p24<=p172]]]
normalized: EG [[EX [p24<=p172] & [[[p257<=1 | EX [[p35<=0 | 1<=p178]]] & [[p47<=0 | p87<=1] | [[[1<=p75 | p262<=0] & ~ [1<=p225]] & ~ [E [p77<=p90 U p18<=0]]]]] & ~ [EG [EG [~ [E [true U p261<=1]]]]]]]]
abstracting: (p261<=1)
states: 8,440,470,781,232,316,153,857 (21)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p18<=0)
states: 4,220,235,390,616,158,076,929 (21)
abstracting: (p77<=p90)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=p225)
states: 228,120,831,925,197,733,888 (20)
abstracting: (p262<=0)
states: 8,269,380,157,288,417,853,441 (21)
abstracting: (1<=p75)
states: 228,120,831,925,197,733,888 (20)
abstracting: (p87<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (p47<=0)
states: 8,212,349,949,307,118,419,969 (21)
abstracting: (1<=p178)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (p35<=0)
states: 4,220,235,390,616,158,076,929 (21)
before gc: list nodes free: 6495533
after gc: idd nodes used:2310409, unused:61689591; list nodes free:285280705
.abstracting: (p257<=1)
states: 8,440,470,781,232,316,153,857 (21)
abstracting: (p24<=p172)
states: 6,330,353,085,924,237,115,393 (21)
....MC time: 2m17.106sec
checking: A [EF [A [[A [p30<=p241 U p219<=0] & [AX [p142<=0] & [p128<=p113 & p278<=p178]]] U p30<=p203]] U [~ [p5<=p15] & [EF [AF [~ [p242<=0]]] | ~ [AX [AX [1<=p58]]]]]]
normalized: [~ [EG [~ [[[EX [EX [~ [1<=p58]]] | E [true U ~ [EG [p242<=0]]]] & ~ [p5<=p15]]]]] & ~ [E [~ [[[EX [EX [~ [1<=p58]]] | E [true U ~ [EG [p242<=0]]]] & ~ [p5<=p15]]] U [~ [E [true U [~ [EG [~ [p30<=p203]]] & ~ [E [~ [p30<=p203] U [~ [[[[p128<=p113 & p278<=p178] & ~ [EX [~ [p142<=0]]]] & [~ [EG [~ [p219<=0]]] & ~ [E [~ [p219<=0] U [~ [p30<=p241] & ~ [p219<=0]]]]]]] & ~ [p30<=p203]]]]]]] & ~ [[[EX [EX [~ [1<=p58]]] | E [true U ~ [EG [p242<=0]]]] & ~ [p5<=p15]]]]]]]
abstracting: (p5<=p15)
states: 6,330,353,085,924,237,115,393 (21)
abstracting: (p242<=0)
states: 4,220,235,390,616,158,076,929 (21)
........
before gc: list nodes free: 5148229
after gc: idd nodes used:3068678, unused:60931322; list nodes free:281822378
.MC time: 2m 6.346sec
checking: [EG [A [AG [~ [E [1<=p268 U p172<=p112]]] U EG [[[1<=p44 | 1<=p38] | [p218<=p74 & p207<=0]]]]] & ~ [E [AG [[[EF [p122<=p70] | [p297<=p297 & p111<=p109]] & [E [1<=p164 U 1<=p30] & AG [p292<=p169]]]] U [~ [AF [p2<=p42]] | EG [[[p157<=1 & p31<=0] | AX [1<=p240]]]]]]]
normalized: [~ [E [~ [E [true U ~ [[[~ [E [true U ~ [p292<=p169]]] & E [1<=p164 U 1<=p30]] & [[p297<=p297 & p111<=p109] | E [true U p122<=p70]]]]]] U [EG [[~ [EX [~ [1<=p240]]] | [p157<=1 & p31<=0]]] | EG [~ [p2<=p42]]]]] & EG [[~ [EG [~ [EG [[[p218<=p74 & p207<=0] | [1<=p44 | 1<=p38]]]]]] & ~ [E [~ [EG [[[p218<=p74 & p207<=0] | [1<=p44 | 1<=p38]]]] U [E [true U E [1<=p268 U p172<=p112]] & ~ [EG [[[p218<=p74 & p207<=0] | [1<=p44 | 1<=p38]]]]]]]]]]
abstracting: (1<=p38)
states: 4,220,235,390,616,158,076,928 (21)
abstracting: (1<=p44)
states: 171,090,623,943,898,300,416 (20)
abstracting: (p207<=0)
states: 8,326,410,365,269,717,286,913 (21)
abstracting: (p218<=p74)
states: 8,218,515,377,196,988,628,993 (21)
......
before gc: list nodes free: 4477228
after gc: idd nodes used:3500180, unused:60499820; list nodes free:279928742
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6109600 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16179032 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.001sec
iterations count:13242 (30), effective:631 (1)
initing FirstDep: 0m 0.001sec
net_ddint.h:600: Timeout: after 223 sec
iterations count:433 (1), effective:0 (0)
net_ddint.h:600: Timeout: after 237 sec
iterations count:581 (1), effective:3 (0)
iterations count:433 (1), effective:0 (0)
sat_reach.icc:155: Timeout: after 252 sec
iterations count:919 (2), effective:13 (0)
net_ddint.h:600: Timeout: after 231 sec
net_ddint.h:600: Timeout: after 211 sec
sat_reach.icc:155: Timeout: after 194 sec
iterations count:437 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 178 sec
net_ddint.h:600: Timeout: after 163 sec
sat_reach.icc:155: Timeout: after 149 sec
iterations count:433 (1), effective:0 (0)
iterations count:434 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 136 sec
net_ddint.h:600: Timeout: after 125 sec
net_ddint.h:600: Timeout: after 114 sec
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="Parking-PT-416"
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 Parking-PT-416, 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 r257-smll-167863532700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-416.tgz
mv Parking-PT-416 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 ;