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

About the Execution of Marcie for StigmergyElection-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10630.292 591256.00 591051.00 20.00 FTTFTTFTFFTTTFTT 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.r449-smll-167912641900681.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 StigmergyElection-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641900681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 50M 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 StigmergyElection-PT-10a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679425890479

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=StigmergyElection-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: StigmergyElection_PT_10a
(NrP: 142 NrTr: 50162 NrArc: 999212)

parse formulas
formulas created successfully
place and transition orderings generation:0m27.483sec

net check time: 0m 0.163sec

init dd package: 0m 3.365sec


RS generation: 0m51.605sec


-> reachability set: #nodes 230207 (2.3e+05) #states 10,873,289 (7)



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

checking: EF [~ [p119<=0]]
normalized: E [true U ~ [p119<=0]]

abstracting: (p119<=0)
states: 10,611,145 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.776sec

checking: A [p127<=0 U AG [AX [1<=p93]]]
normalized: [~ [E [E [true U EX [~ [1<=p93]]] U [E [true U EX [~ [1<=p93]]] & ~ [p127<=0]]]] & ~ [EG [E [true U EX [~ [1<=p93]]]]]]

abstracting: (1<=p93)
states: 1
.
EG iterations: 0
abstracting: (p127<=0)
states: 8,920,164 (6)
abstracting: (1<=p93)
states: 1
.abstracting: (1<=p93)
states: 1
.-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.478sec

checking: EX [~ [E [[AF [~ [p31<=1]] & [~ [EX [p31<=0]] | A [p20<=1 U p8<=p55]]] U EG [~ [[p55<=1 & 1<=p64]]]]]]
normalized: EX [~ [E [[~ [EG [p31<=1]] & [~ [EX [p31<=0]] | [~ [E [~ [p8<=p55] U [~ [p8<=p55] & ~ [p20<=1]]]] & ~ [EG [~ [p8<=p55]]]]]] U EG [~ [[p55<=1 & 1<=p64]]]]]]

abstracting: (1<=p64)
states: 1
abstracting: (p55<=1)
states: 10,873,289 (7)
.
EG iterations: 1
abstracting: (p8<=p55)
states: 10,873,288 (7)
.
EG iterations: 1
abstracting: (p20<=1)
states: 10,873,289 (7)
abstracting: (p8<=p55)
states: 10,873,288 (7)
abstracting: (p8<=p55)
states: 10,873,288 (7)
abstracting: (p31<=0)
states: 8,920,164 (6)
.abstracting: (p31<=1)
states: 10,873,289 (7)

EG iterations: 0
.-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.333sec

checking: AX [[[AF [~ [[~ [p64<=1] | ~ [1<=p79]]]] & [p125<=0 | [[1<=p134 & 1<=p91] | ~ [p3<=0]]]] | 1<=p4]]
normalized: ~ [EX [~ [[[~ [EG [[~ [1<=p79] | ~ [p64<=1]]]] & [[~ [p3<=0] | [1<=p134 & 1<=p91]] | p125<=0]] | 1<=p4]]]]

abstracting: (1<=p4)
states: 1,953,125 (6)
abstracting: (p125<=0)
states: 10,853,606 (7)
abstracting: (1<=p91)
states: 262,144 (5)
abstracting: (1<=p134)
states: 1
abstracting: (p3<=0)
states: 8,920,164 (6)
abstracting: (p64<=1)
states: 10,873,289 (7)
abstracting: (1<=p79)
states: 1
..
EG iterations: 2
.-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.855sec

checking: EF [A [[AX [[EF [p116<=p80] & AG [p83<=p124]]] & ~ [EF [EX [1<=p123]]]] U [~ [EG [p4<=1]] & p85<=0]]]
normalized: E [true U [~ [EG [~ [[p85<=0 & ~ [EG [p4<=1]]]]]] & ~ [E [~ [[p85<=0 & ~ [EG [p4<=1]]]] U [~ [[p85<=0 & ~ [EG [p4<=1]]]] & ~ [[~ [EX [~ [[E [true U p116<=p80] & ~ [E [true U ~ [p83<=p124]]]]]]] & ~ [E [true U EX [1<=p123]]]]]]]]]]

abstracting: (1<=p123)
states: 1
.abstracting: (p83<=p124)
states: 10,860,167 (7)
abstracting: (p116<=p80)
states: 8,920,164 (6)
.abstracting: (p4<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (p85<=0)
states: 8,920,164 (6)
abstracting: (p4<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (p85<=0)
states: 8,920,164 (6)
abstracting: (p4<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (p85<=0)
states: 8,920,164 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.701sec

checking: AX [EG [[[A [EG [1<=p63] U [1<=p28 | 1<=p135]] & AF [EG [p119<=p21]]] | [EX [1<=p39] & AG [E [1<=p139 U 1<=p48]]]]]]
normalized: ~ [EX [~ [EG [[[[~ [E [~ [[1<=p28 | 1<=p135]] U [~ [[1<=p28 | 1<=p135]] & ~ [EG [1<=p63]]]]] & ~ [EG [~ [[1<=p28 | 1<=p135]]]]] & ~ [EG [~ [EG [p119<=p21]]]]] | [~ [E [true U ~ [E [1<=p139 U 1<=p48]]]] & EX [1<=p39]]]]]]]

abstracting: (1<=p39)
states: 1
.abstracting: (1<=p48)
states: 262,144 (5)
abstracting: (1<=p139)
states: 19,683 (4)
abstracting: (p119<=p21)
states: 10,676,681 (7)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p135)
states: 1
abstracting: (1<=p28)
states: 19,683 (4)
..
EG iterations: 2
abstracting: (1<=p63)
states: 262,144 (5)
..
EG iterations: 2
abstracting: (1<=p135)
states: 1
abstracting: (1<=p28)
states: 19,683 (4)
abstracting: (1<=p135)
states: 1
abstracting: (1<=p28)
states: 19,683 (4)
....................
EG iterations: 20
.-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.973sec

checking: AG [EX [[E [[~ [p41<=p90] & [p74<=1 | p0<=p128]] U p122<=0] | p96<=p18]]]
normalized: ~ [E [true U ~ [EX [[p96<=p18 | E [[[p74<=1 | p0<=p128] & ~ [p41<=p90]] U p122<=0]]]]]]

abstracting: (p122<=0)
states: 10,873,288 (7)
abstracting: (p41<=p90)
states: 10,853,606 (7)
abstracting: (p0<=p128)
states: 10,873,288 (7)
abstracting: (p74<=1)
states: 10,873,289 (7)
abstracting: (p96<=p18)
states: 9,028,928 (6)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.309sec

checking: EX [[EG [[[AX [1<=p83] & [[1<=p35 | p139<=0] | AG [p30<=p138]]] | ~ [p70<=1]]] | EF [A [A [1<=p104 U p89<=p81] U EG [1<=p64]]]]]
normalized: EX [[EG [[[~ [EX [~ [1<=p83]]] & [~ [E [true U ~ [p30<=p138]]] | [1<=p35 | p139<=0]]] | ~ [p70<=1]]] | E [true U [~ [E [~ [EG [1<=p64]] U [~ [EG [1<=p64]] & ~ [[~ [E [~ [p89<=p81] U [~ [1<=p104] & ~ [p89<=p81]]]] & ~ [EG [~ [p89<=p81]]]]]]]] & ~ [EG [~ [EG [1<=p64]]]]]]]]

abstracting: (1<=p64)
states: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p89<=p81)
states: 10,611,145 (7)
.
EG iterations: 1
abstracting: (p89<=p81)
states: 10,611,145 (7)
abstracting: (1<=p104)
states: 262,144 (5)
abstracting: (p89<=p81)
states: 10,611,145 (7)
abstracting: (1<=p64)
states: 1
.
EG iterations: 1
abstracting: (1<=p64)
states: 1
.
EG iterations: 1
abstracting: (p70<=1)
states: 10,873,289 (7)
abstracting: (p139<=0)
states: 10,853,606 (7)
abstracting: (1<=p35)
states: 262,144 (5)
abstracting: (p30<=p138)
states: 9,310,789 (6)
abstracting: (1<=p83)
states: 19,683 (4)
...
EG iterations: 2
.-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.163sec

checking: [E [~ [[~ [[[1<=p108 & p8<=p22] & [1<=p141 | 1<=p27]]] & ~ [AF [[p139<=p16 | p61<=1]]]]] U 1<=p20] & EG [AX [A [1<=p86 U EX [p107<=p24]]]]]
normalized: [EG [~ [EX [~ [[~ [E [~ [EX [p107<=p24]] U [~ [EX [p107<=p24]] & ~ [1<=p86]]]] & ~ [EG [~ [EX [p107<=p24]]]]]]]]] & E [~ [[EG [~ [[p139<=p16 | p61<=1]]] & ~ [[[1<=p108 & p8<=p22] & [1<=p141 | 1<=p27]]]]] U 1<=p20]]

abstracting: (1<=p20)
states: 262,144 (5)
abstracting: (1<=p27)
states: 19,683 (4)
abstracting: (1<=p141)
states: 10,873,288 (7)
abstracting: (p8<=p22)
states: 10,873,288 (7)
abstracting: (1<=p108)
states: 1
abstracting: (p61<=1)
states: 10,873,289 (7)
abstracting: (p139<=p16)
states: 10,853,606 (7)
.
EG iterations: 1
abstracting: (p107<=p24)
states: 10,873,288 (7)
...
EG iterations: 2
abstracting: (1<=p86)
states: 1,953,125 (6)
abstracting: (p107<=p24)
states: 10,873,288 (7)
.abstracting: (p107<=p24)
states: 10,873,288 (7)
...
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.138sec

checking: EG [[A [A [~ [EG [p124<=p104]] U ~ [[p75<=0 | 1<=p19]]] U AX [[[1<=p71 | 1<=p139] & [p91<=0 & 1<=p133]]]] | E [[AG [[1<=p123 & p14<=p135]] & p110<=p119] U [p45<=0 & AF [p43<=0]]]]]
normalized: EG [[[~ [E [EX [~ [[[1<=p71 | 1<=p139] & [p91<=0 & 1<=p133]]]] U [EX [~ [[[1<=p71 | 1<=p139] & [p91<=0 & 1<=p133]]]] & ~ [[~ [EG [[p75<=0 | 1<=p19]]] & ~ [E [[p75<=0 | 1<=p19] U [EG [p124<=p104] & [p75<=0 | 1<=p19]]]]]]]]] & ~ [EG [EX [~ [[[1<=p71 | 1<=p139] & [p91<=0 & 1<=p133]]]]]]] | E [[p110<=p119 & ~ [E [true U ~ [[1<=p123 & p14<=p135]]]]] U [p45<=0 & ~ [EG [~ [p43<=0]]]]]]]

abstracting: (p43<=0)
states: 8,920,164 (6)
.
EG iterations: 1
abstracting: (p45<=0)
states: 8,920,164 (6)
abstracting: (p14<=p135)
states: 10,853,606 (7)
abstracting: (1<=p123)
states: 1
abstracting: (p110<=p119)
states: 8,703,839 (6)
abstracting: (1<=p133)
states: 262,144 (5)
abstracting: (p91<=0)
states: 10,611,145 (7)
abstracting: (1<=p139)
states: 19,683 (4)
abstracting: (1<=p71)
states: 1,953,125 (6)
.
EG iterations: 0
abstracting: (1<=p19)
states: 262,144 (5)
abstracting: (p75<=0)
states: 10,611,145 (7)
abstracting: (p124<=p104)
states: 8,703,839 (6)
......................
EG iterations: 22
abstracting: (1<=p19)
states: 262,144 (5)
abstracting: (p75<=0)
states: 10,611,145 (7)
abstracting: (1<=p19)
states: 262,144 (5)
abstracting: (p75<=0)
states: 10,611,145 (7)
.
EG iterations: 1
abstracting: (1<=p133)
states: 262,144 (5)
abstracting: (p91<=0)
states: 10,611,145 (7)
abstracting: (1<=p139)
states: 19,683 (4)
abstracting: (1<=p71)
states: 1,953,125 (6)
.abstracting: (1<=p133)
states: 262,144 (5)
abstracting: (p91<=0)
states: 10,611,145 (7)
abstracting: (1<=p139)
states: 19,683 (4)
abstracting: (1<=p71)
states: 1,953,125 (6)
...
EG iterations: 2
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.888sec

checking: ~ [E [[AX [[AF [p6<=0] | [AG [p70<=p32] & AG [p57<=1]]]] | [[AX [~ [p66<=0]] | [p101<=0 | [EX [1<=p22] & AG [p47<=p23]]]] & EX [EG [1<=p39]]]] U [EG [~ [EG [p33<=p55]]] & [[~ [p132<=0] | [[[1<=p35 & 1<=p104] & [p62<=p131 & 1<=p112]] & p0<=1]] & ~ [[E [1<=p12 U p92<=p34] | EG [p140<=0]]]]]]]
normalized: ~ [E [[~ [EX [~ [[~ [EG [~ [p6<=0]]] | [~ [E [true U ~ [p70<=p32]]] & ~ [E [true U ~ [p57<=1]]]]]]]] | [[~ [EX [p66<=0]] | [p101<=0 | [~ [E [true U ~ [p47<=p23]]] & EX [1<=p22]]]] & EX [EG [1<=p39]]]] U [[~ [[E [1<=p12 U p92<=p34] | EG [p140<=0]]] & [[[[p62<=p131 & 1<=p112] & [1<=p35 & 1<=p104]] & p0<=1] | ~ [p132<=0]]] & EG [~ [EG [p33<=p55]]]]]]

abstracting: (p33<=p55)
states: 10,611,145 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p132<=0)
states: 10,611,145 (7)
abstracting: (p0<=1)
states: 10,873,289 (7)
abstracting: (1<=p104)
states: 262,144 (5)
abstracting: (1<=p35)
states: 262,144 (5)
abstracting: (1<=p112)
states: 19,683 (4)
abstracting: (p62<=p131)
states: 10,676,681 (7)
abstracting: (p140<=0)
states: 10,853,606 (7)
..
EG iterations: 2
abstracting: (p92<=p34)
states: 10,873,288 (7)
abstracting: (1<=p12)
states: 2,234,986 (6)
abstracting: (1<=p39)
states: 1
..
EG iterations: 2
.abstracting: (1<=p22)
states: 1
.abstracting: (p47<=p23)
states: 10,611,145 (7)
abstracting: (p101<=0)
states: 8,920,164 (6)
abstracting: (p66<=0)
states: 10,873,288 (7)
.abstracting: (p57<=1)
states: 10,873,289 (7)
abstracting: (p70<=p32)
states: 10,853,606 (7)
abstracting: (p6<=0)
states: 10,611,145 (7)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.078sec

checking: [[A [A [~ [EG [1<=p4]] U E [[p110<=0 & 1<=p15] U EG [p94<=p8]]] U EF [AF [AF [p87<=p122]]]] | AF [p82<=p21]] & E [[[EF [EF [p9<=0]] | A [EG [p80<=1] U AX [p106<=0]]] | E [[[[1<=p66 | p2<=p115] | [p129<=p88 & 1<=p17]] & [[p128<=0 & 1<=p66] & ~ [p54<=1]]] U EG [1<=p8]]] U EG [p111<=p97]]]
normalized: [E [[E [[[~ [p54<=1] & [p128<=0 & 1<=p66]] & [[p129<=p88 & 1<=p17] | [1<=p66 | p2<=p115]]] U EG [1<=p8]] | [[~ [EG [EX [~ [p106<=0]]]] & ~ [E [EX [~ [p106<=0]] U [~ [EG [p80<=1]] & EX [~ [p106<=0]]]]]] | E [true U E [true U p9<=0]]]] U EG [p111<=p97]] & [~ [EG [~ [p82<=p21]]] | [~ [EG [~ [E [true U ~ [EG [EG [~ [p87<=p122]]]]]]]] & ~ [E [~ [E [true U ~ [EG [EG [~ [p87<=p122]]]]]] U [~ [[~ [EG [~ [E [[p110<=0 & 1<=p15] U EG [p94<=p8]]]]] & ~ [E [~ [E [[p110<=0 & 1<=p15] U EG [p94<=p8]]] U [EG [1<=p4] & ~ [E [[p110<=0 & 1<=p15] U EG [p94<=p8]]]]]]]] & ~ [E [true U ~ [EG [EG [~ [p87<=p122]]]]]]]]]]]]

abstracting: (p87<=p122)
states: 8,920,164 (6)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p94<=p8)
states: 10,873,288 (7)
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,953,125 (6)
abstracting: (p110<=0)
states: 8,638,303 (6)
abstracting: (1<=p4)
states: 1,953,125 (6)
..
EG iterations: 2
abstracting: (p94<=p8)
states: 10,873,288 (7)
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,953,125 (6)
abstracting: (p110<=0)
states: 8,638,303 (6)
abstracting: (p94<=p8)
states: 10,873,288 (7)
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,953,125 (6)
abstracting: (p110<=0)
states: 8,638,303 (6)
..
EG iterations: 2
abstracting: (p87<=p122)
states: 8,920,164 (6)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p87<=p122)
states: 8,920,164 (6)
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p82<=p21)
states: 8,703,839 (6)
.
EG iterations: 1
abstracting: (p111<=p97)
states: 10,860,167 (7)
..................
EG iterations: 18
abstracting: (p9<=0)
states: 10,873,288 (7)
abstracting: (p106<=0)
states: 10,873,288 (7)
.abstracting: (p80<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (p106<=0)
states: 10,873,288 (7)
.abstracting: (p106<=0)
states: 10,873,288 (7)
..
EG iterations: 1
abstracting: (1<=p8)
states: 1
.
EG iterations: 1
abstracting: (p2<=p115)
states: 9,310,789 (6)
abstracting: (1<=p66)
states: 1
abstracting: (1<=p17)
states: 1,953,125 (6)
abstracting: (p129<=p88)
states: 9,310,789 (6)
abstracting: (1<=p66)
states: 1
abstracting: (p128<=0)
states: 8,920,164 (6)
abstracting: (p54<=1)
states: 10,873,289 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.900sec

checking: [~ [A [~ [AF [EG [1<=p51]]] U ~ [AF [p102<=p70]]]] & E [E [AX [~ [E [1<=p45 U p121<=p66]]] U [A [[p67<=p125 | 1<=p85] U EF [p85<=1]] | p101<=1]] U [AG [[[[p65<=0 & p59<=1] | [1<=p21 | 1<=p46]] | AG [p14<=1]]] & [~ [[[1<=p15 | A [p123<=1 U p98<=p67]] & ~ [[1<=p118 & p75<=p87]]]] & p103<=0]]]]
normalized: [E [E [~ [EX [E [1<=p45 U p121<=p66]]] U [p101<=1 | [~ [EG [~ [E [true U p85<=1]]]] & ~ [E [~ [E [true U p85<=1]] U [~ [[p67<=p125 | 1<=p85]] & ~ [E [true U p85<=1]]]]]]]] U [[p103<=0 & ~ [[~ [[1<=p118 & p75<=p87]] & [1<=p15 | [~ [EG [~ [p98<=p67]]] & ~ [E [~ [p98<=p67] U [~ [p123<=1] & ~ [p98<=p67]]]]]]]]] & ~ [E [true U ~ [[~ [E [true U ~ [p14<=1]]] | [[1<=p21 | 1<=p46] | [p65<=0 & p59<=1]]]]]]]] & ~ [[~ [EG [~ [EG [~ [p102<=p70]]]]] & ~ [E [~ [EG [~ [p102<=p70]]] U [~ [EG [~ [EG [1<=p51]]]] & ~ [EG [~ [p102<=p70]]]]]]]]]

abstracting: (p102<=p70)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (1<=p51)
states: 1
..
EG iterations: 2

EG iterations: 0
abstracting: (p102<=p70)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (p102<=p70)
states: 8,920,164 (6)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p59<=1)
states: 10,873,289 (7)
abstracting: (p65<=0)
states: 10,873,288 (7)
abstracting: (1<=p46)
states: 1,953,125 (6)
abstracting: (1<=p21)
states: 262,144 (5)
abstracting: (p14<=1)
states: 10,873,289 (7)
abstracting: (p98<=p67)
states: 10,853,606 (7)
abstracting: (p123<=1)
states: 10,873,289 (7)
abstracting: (p98<=p67)
states: 10,853,606 (7)
abstracting: (p98<=p67)
states: 10,853,606 (7)
....................
EG iterations: 20
abstracting: (1<=p15)
states: 1,953,125 (6)
abstracting: (p75<=p87)
states: 10,611,145 (7)
abstracting: (1<=p118)
states: 262,144 (5)
abstracting: (p103<=0)
states: 10,611,145 (7)
abstracting: (p85<=1)
states: 10,873,289 (7)
abstracting: (1<=p85)
states: 1,953,125 (6)
abstracting: (p67<=p125)
states: 10,873,288 (7)
abstracting: (p85<=1)
states: 10,873,289 (7)
abstracting: (p85<=1)
states: 10,873,289 (7)
.
EG iterations: 1
abstracting: (p101<=1)
states: 10,873,289 (7)
abstracting: (p121<=p66)
states: 10,873,288 (7)
abstracting: (1<=p45)
states: 1,953,125 (6)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.009sec

checking: [AG [[[AG [~ [p23<=1]] & AX [[[p78<=0 | p25<=p130] | [p94<=1 | p126<=p17]]]] | ~ [1<=p110]]] | EF [EX [[[[[1<=p60 | p42<=p7] & [p107<=p21 | p138<=p112]] & ~ [[1<=p100 | p33<=p113]]] | [~ [[p67<=p105 | p36<=p47]] & [p4<=p103 | p11<=p69]]]]]]
normalized: [~ [E [true U ~ [[[~ [E [true U p23<=1]] & ~ [EX [~ [[[p94<=1 | p126<=p17] | [p78<=0 | p25<=p130]]]]]] | ~ [1<=p110]]]]] | E [true U EX [[[[[p107<=p21 | p138<=p112] & [1<=p60 | p42<=p7]] & ~ [[1<=p100 | p33<=p113]]] | [~ [[p67<=p105 | p36<=p47]] & [p4<=p103 | p11<=p69]]]]]]

abstracting: (p11<=p69)
states: 10,873,288 (7)
abstracting: (p4<=p103)
states: 8,920,164 (6)
abstracting: (p36<=p47)
states: 10,873,288 (7)
abstracting: (p67<=p105)
states: 10,873,288 (7)
abstracting: (p33<=p113)
states: 10,611,145 (7)
abstracting: (1<=p100)
states: 1,953,125 (6)
abstracting: (p42<=p7)
states: 10,853,606 (7)
abstracting: (1<=p60)
states: 1,953,125 (6)
abstracting: (p138<=p112)
states: 8,644,864 (6)
abstracting: (p107<=p21)
states: 10,873,288 (7)
.abstracting: (1<=p110)
states: 2,234,986 (6)
abstracting: (p25<=p130)
states: 10,873,288 (7)
abstracting: (p78<=0)
states: 10,873,288 (7)
abstracting: (p126<=p17)
states: 10,853,606 (7)
abstracting: (p94<=1)
states: 10,873,289 (7)
.abstracting: (p23<=1)
states: 10,873,289 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.865sec

checking: [EF [EG [[[~ [EX [1<=p109]] & [[p120<=1 & p141<=0] | [1<=p79 & 1<=p10]]] | ~ [[AG [p31<=p110] | EF [1<=p13]]]]]] | ~ [A [[[~ [p124<=p50] | [EX [1<=p71] | EG [p10<=1]]] | [[[EF [1<=p42] | [p50<=p11 | p31<=0]] | EG [p101<=p135]] | [AF [p48<=1] | AX [p134<=p85]]]] U ~ [[AF [1<=p115] & [AX [1<=p86] & A [p89<=p14 U p16<=p5]]]]]]]
normalized: [E [true U EG [[[[[1<=p79 & 1<=p10] | [p120<=1 & p141<=0]] & ~ [EX [1<=p109]]] | ~ [[E [true U 1<=p13] | ~ [E [true U ~ [p31<=p110]]]]]]]] | ~ [[~ [EG [[~ [EG [~ [1<=p115]]] & [[~ [E [~ [p16<=p5] U [~ [p16<=p5] & ~ [p89<=p14]]]] & ~ [EG [~ [p16<=p5]]]] & ~ [EX [~ [1<=p86]]]]]]] & ~ [E [[~ [EG [~ [1<=p115]]] & [[~ [E [~ [p16<=p5] U [~ [p16<=p5] & ~ [p89<=p14]]]] & ~ [EG [~ [p16<=p5]]]] & ~ [EX [~ [1<=p86]]]]] U [~ [[[[[E [true U 1<=p42] | [p50<=p11 | p31<=0]] | EG [p101<=p135]] | [~ [EX [~ [p134<=p85]]] | ~ [EG [~ [p48<=1]]]]] | [[EX [1<=p71] | EG [p10<=1]] | ~ [p124<=p50]]]] & [~ [EG [~ [1<=p115]]] & [[~ [E [~ [p16<=p5] U [~ [p16<=p5] & ~ [p89<=p14]]]] & ~ [EG [~ [p16<=p5]]]] & ~ [EX [~ [1<=p86]]]]]]]]]]]

abstracting: (1<=p86)
states: 1,953,125 (6)
.abstracting: (p16<=p5)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (p89<=p14)
states: 10,611,145 (7)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (1<=p115)
states: 1,953,125 (6)
..
EG iterations: 2
abstracting: (p124<=p50)
states: 8,638,304 (6)
abstracting: (p10<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (1<=p71)
states: 1,953,125 (6)
.abstracting: (p48<=1)
states: 10,873,289 (7)
.
EG iterations: 1
abstracting: (p134<=p85)
states: 10,873,288 (7)
.abstracting: (p101<=p135)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (p31<=0)
states: 8,920,164 (6)
abstracting: (p50<=p11)
states: 10,873,288 (7)
abstracting: (1<=p42)
states: 19,683 (4)

before gc: list nodes free: 666374

after gc: idd nodes used:1908908, unused:62091092; list nodes free:295695990
abstracting: (1<=p86)
states: 1,953,125 (6)
.abstracting: (p16<=p5)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (p89<=p14)
states: 10,611,145 (7)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (1<=p115)
states: 1,953,125 (6)
..
EG iterations: 2
abstracting: (1<=p86)
states: 1,953,125 (6)
.abstracting: (p16<=p5)
states: 8,920,164 (6)
..
EG iterations: 2
abstracting: (p89<=p14)
states: 10,611,145 (7)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (p16<=p5)
states: 8,920,164 (6)
abstracting: (1<=p115)
states: 1,953,125 (6)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p31<=p110)
states: 9,310,789 (6)
abstracting: (1<=p13)
states: 19,683 (4)
abstracting: (1<=p109)
states: 1
.abstracting: (p141<=0)
states: 1
abstracting: (p120<=1)
states: 10,873,289 (7)
abstracting: (1<=p10)
states: 1
abstracting: (1<=p79)
states: 1
..
EG iterations: 2
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.306sec

checking: [EX [[[[[[[1<=p123 | p3<=0] & EF [p47<=1]] & ~ [[1<=p110 & p70<=p22]]] | [[AX [1<=p54] & ~ [p128<=p138]] | E [p56<=1 U 1<=p38]]] & [[~ [EF [1<=p93]] & E [p101<=p121 U 1<=p112]] & ~ [EG [p70<=1]]]] & AX [p8<=p27]]] & E [1<=p82 U [~ [1<=p36] | [[[[[p37<=p89 & 1<=p37] | [p107<=p49 | 1<=p58]] | [[p120<=p113 & p59<=p41] & EX [p64<=p29]]] & [EG [p126<=1] | E [p71<=1 U p56<=1]]] | 1<=p88]]]]
normalized: [E [1<=p82 U [[[[EG [p126<=1] | E [p71<=1 U p56<=1]] & [[EX [p64<=p29] & [p120<=p113 & p59<=p41]] | [[p107<=p49 | 1<=p58] | [p37<=p89 & 1<=p37]]]] | 1<=p88] | ~ [1<=p36]]] & EX [[~ [EX [~ [p8<=p27]]] & [[~ [EG [p70<=1]] & [E [p101<=p121 U 1<=p112] & ~ [E [true U 1<=p93]]]] & [[E [p56<=1 U 1<=p38] | [~ [p128<=p138] & ~ [EX [~ [1<=p54]]]]] | [~ [[1<=p110 & p70<=p22]] & [E [true U p47<=1] & [1<=p123 | p3<=0]]]]]]]]

abstracting: (p3<=0)
states: 8,920,164 (6)
abstracting: (1<=p123)
states: 1
abstracting: (p47<=1)
states: 10,873,289 (7)
abstracting: (p70<=p22)
states: 10,853,606 (7)
abstracting: (1<=p110)
states: 2,234,986 (6)
abstracting: (1<=p54)
states: 2,234,986 (6)
.abstracting: (p128<=p138)
states: 8,920,164 (6)
abstracting: (1<=p38)
states: 1
abstracting: (p56<=1)
states: 10,873,289 (7)
abstracting: (1<=p93)
states: 1
abstracting: (1<=p112)
states: 19,683 (4)
abstracting: (p101<=p121)
states: 8,920,164 (6)
abstracting: (p70<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (p8<=p27)
states: 10,873,288 (7)
..abstracting: (1<=p36)
states: 1
abstracting: (1<=p88)
states: 1,953,125 (6)
abstracting: (1<=p37)
states: 1
abstracting: (p37<=p89)
states: 10,873,288 (7)
abstracting: (1<=p58)
states: 1,953,125 (6)
abstracting: (p107<=p49)
states: 10,873,288 (7)
abstracting: (p59<=p41)
states: 8,920,164 (6)
abstracting: (p120<=p113)
states: 10,873,288 (7)
abstracting: (p64<=p29)
states: 10,873,288 (7)
.abstracting: (p56<=1)
states: 10,873,289 (7)
abstracting: (p71<=1)
states: 10,873,289 (7)
abstracting: (p126<=1)
states: 10,873,289 (7)

EG iterations: 0
abstracting: (1<=p82)
states: 2,234,986 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.835sec

totally nodes used: 84655403 (8.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 161521850 648796558 810318408
used/not used/entry size/cache size: 55604516 11504348 16 1024MB
basic ops cache: hits/miss/sum: 24555916 76282987 100838903
used/not used/entry size/cache size: 12877756 3899460 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: 731054 2630677 3361731
used/not used/entry size/cache size: 682455 7706153 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 49811127
1 13138175
2 3249539
3 742643
4 141603
5 22399
6 2967
7 374
8 32
9 4
>= 10 1

Total processing time: 9m51.153sec


BK_STOP 1679426481735

--------------------
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.450sec

165328 165419 165555 165748 165847 166005 166087 166158 166314 166538 166827 167025 167313 167399 167634 167940 168176 168184 168541 168758 168776 169065 169066 169251 169541 169590 170110 170714 170738 171251 171263 171891 171936 172380 172887 172904 173375 173380 173888 173926 174438 174497 175048 175575 175598 176221 176261 176788 176828 177382 177420 177970 177996 178594 178673 179123 179184 179681 179772 180241 180268 180761 180810 181319 181380 181841 181882 182397 182402 182329 182353 182452 183525 183614 184734 184846 185904 185940 187136 187162 188297 188321 188393 189479 189545 190703 190713 191802 191819 191938 192898 192937 193970 194007 195113 195131 195117 196066 196111 197209 197226 197261 198230 198271 199374 199379 199362 199484 199528 199815 201627 201775 203793 203836 204137 205979 206015 206249 208139 208305 210344 210368 210488 212494 212540 212904 214838 214864 214928 216710 216797 218904 218917 218980 221032 221047 221248 223360 223378 223388 225160 225175 225408 227488 227505 227564 229488 229503 229644 231817 231822 231805 231408
iterations count:15383642 (306), effective:1784 (0)

initing FirstDep: 0m 0.440sec

223787 226597 228018
iterations count:350982 (6), effective:121 (0)

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

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

iterations count:50173 (1), effective:1 (0)
218940 222664 225587
iterations count:351087 (6), effective:121 (0)

iterations count:50162 (1), effective:0 (0)
218940 222664 225587
iterations count:351080 (6), effective:121 (0)

iterations count:50195 (1), effective:2 (0)

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

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

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

iterations count:50163 (1), effective:1 (0)
226689
iterations count:180331 (3), effective:23 (0)

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

iterations count:50163 (1), effective:1 (0)
230208 230207 230207
iterations count:376400 (7), effective:121 (0)
218940 222664 225587
iterations count:351270 (7), effective:122 (0)
218940 222664 225587
iterations count:351295 (7), effective:124 (0)
240926 244306 237618
iterations count:376224 (7), effective:121 (0)

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

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

iterations count:50162 (1), effective:0 (0)
238207 236863 232255
iterations count:325276 (6), effective:114 (0)

iterations count:50240 (1), effective:2 (0)

iterations count:50162 (1), effective:0 (0)
230709 231106 230462
iterations count:376783 (7), effective:121 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:50327 (1), effective:3 (0)

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

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

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

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

iterations count:50162 (1), effective:0 (0)
234280 237632 234034
iterations count:376434 (7), effective:123 (0)
230218 230207 230207
iterations count:379707 (7), effective:120 (0)

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

iterations count:82231 (1), effective:13 (0)

iterations count:50194 (1), effective:1 (0)
218940 222664 225587
iterations count:351294 (7), effective:123 (0)

iterations count:50195 (1), effective:2 (0)

iterations count:50377 (1), effective:3 (0)

iterations count:50162 (1), effective:0 (0)
218940 222664 225587
iterations count:351254 (7), effective:121 (0)
218940 222664 225587
iterations count:351102 (6), effective:121 (0)

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

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

iterations count:50162 (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="StigmergyElection-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 StigmergyElection-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 r449-smll-167912641900681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-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 '' 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 ;