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.r161-tall-167838845200473.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 FlexibleBarrier-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845200473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:35 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.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 64K 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 FlexibleBarrier-PT-08a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679855762703

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=FlexibleBarrier-PT-08a
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: FlexibleBarrier_PT_08a
(NrP: 99 NrTr: 236 NrArc: 985)

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

net check time: 0m 0.000sec

init dd package: 0m 2.839sec


RS generation: 0m 0.789sec


-> reachability set: #nodes 15370 (1.5e+04) #states 429,981,697 (8)



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

checking: AX [EF [EX [AG [EG [p23<=1]]]]]
normalized: ~ [EX [~ [E [true U EX [~ [E [true U ~ [EG [p23<=1]]]]]]]]]

abstracting: (p23<=1)
states: 429,981,697 (8)

EG iterations: 0
..-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.817sec

checking: ~ [EF [AG [~ [EX [~ [p11<=p31]]]]]]
normalized: ~ [E [true U ~ [E [true U EX [~ [p11<=p31]]]]]]

abstracting: (p11<=p31)
states: 397,135,873 (8)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.685sec

checking: EF [EG [[p12<=0 & 1<=p74]]]
normalized: E [true U EG [[p12<=0 & 1<=p74]]]

abstracting: (1<=p74)
states: 35,831,808 (7)
abstracting: (p12<=0)
states: 394,149,889 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.643sec

checking: [EF [A [~ [AX [p31<=0]] U EG [EF [p78<=1]]]] & EX [~ [AG [p30<=0]]]]
normalized: [EX [E [true U ~ [p30<=0]]] & E [true U [~ [EG [~ [EG [E [true U p78<=1]]]]] & ~ [E [~ [EG [E [true U p78<=1]]] U [~ [EX [~ [p31<=0]]] & ~ [EG [E [true U p78<=1]]]]]]]]]

abstracting: (p78<=1)
states: 429,981,697 (8)

EG iterations: 0
abstracting: (p31<=0)
states: 394,149,889 (8)
.abstracting: (p78<=1)
states: 429,981,697 (8)

EG iterations: 0
abstracting: (p78<=1)
states: 429,981,697 (8)

EG iterations: 0
.
EG iterations: 1
abstracting: (p30<=0)
states: 394,149,889 (8)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.718sec

checking: ~ [E [p90<=p24 U AG [1<=p37]]]
normalized: ~ [E [p90<=p24 U ~ [E [true U ~ [1<=p37]]]]]

abstracting: (1<=p37)
states: 35,831,808 (7)
abstracting: (p90<=p24)
states: 397,135,873 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [AX [~ [A [AX [1<=p60] U [E [1<=p19 U 1<=p86] & A [p56<=1 U 1<=p76]]]]]]
normalized: ~ [E [true U EX [[~ [EG [~ [[[~ [EG [~ [1<=p76]]] & ~ [E [~ [1<=p76] U [~ [p56<=1] & ~ [1<=p76]]]]] & E [1<=p19 U 1<=p86]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p76]]] & ~ [E [~ [1<=p76] U [~ [p56<=1] & ~ [1<=p76]]]]] & E [1<=p19 U 1<=p86]]] U [EX [~ [1<=p60]] & ~ [[[~ [EG [~ [1<=p76]]] & ~ [E [~ [1<=p76] U [~ [p56<=1] & ~ [1<=p76]]]]] & E [1<=p19 U 1<=p86]]]]]]]]]]

abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p56<=1)
states: 429,981,697 (8)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (1<=p60)
states: 35,831,808 (7)
.abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p56<=1)
states: 429,981,697 (8)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (1<=p86)
states: 35,831,808 (7)
abstracting: (1<=p19)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (p56<=1)
states: 429,981,697 (8)
abstracting: (1<=p76)
states: 35,831,808 (7)
abstracting: (1<=p76)
states: 35,831,808 (7)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.742sec

checking: ~ [AG [EF [[[AG [p40<=p88] & [E [p8<=0 U p87<=p94] | [1<=p98 | p70<=1]]] | [~ [AG [p92<=p52]] | AX [p2<=p36]]]]]]
normalized: E [true U ~ [E [true U [[[E [p8<=0 U p87<=p94] | [1<=p98 | p70<=1]] & ~ [E [true U ~ [p40<=p88]]]] | [~ [EX [~ [p2<=p36]]] | E [true U ~ [p92<=p52]]]]]]]

abstracting: (p92<=p52)
states: 397,135,873 (8)
abstracting: (p2<=p36)
states: 397,135,873 (8)
.abstracting: (p40<=p88)
states: 397,135,873 (8)
abstracting: (p70<=1)
states: 429,981,697 (8)
abstracting: (1<=p98)
states: 429,981,696 (8)
abstracting: (p87<=p94)
states: 394,149,889 (8)
abstracting: (p8<=0)
states: 394,149,889 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.172sec

checking: EX [[AX [[EG [~ [1<=p39]] & p72<=1]] & E [AG [[AX [p49<=0] | [p29<=p81 & p22<=0]]] U [~ [p39<=1] & [[~ [1<=p18] | ~ [p65<=1]] & EF [p81<=p90]]]]]]
normalized: EX [[E [~ [E [true U ~ [[[p29<=p81 & p22<=0] | ~ [EX [~ [p49<=0]]]]]]] U [[E [true U p81<=p90] & [~ [p65<=1] | ~ [1<=p18]]] & ~ [p39<=1]]] & ~ [EX [~ [[p72<=1 & EG [~ [1<=p39]]]]]]]]

abstracting: (1<=p39)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (p72<=1)
states: 429,981,697 (8)
.abstracting: (p39<=1)
states: 429,981,697 (8)
abstracting: (1<=p18)
states: 35,831,808 (7)
abstracting: (p65<=1)
states: 429,981,697 (8)
abstracting: (p81<=p90)
states: 397,135,873 (8)
abstracting: (p49<=0)
states: 394,149,889 (8)
.abstracting: (p22<=0)
states: 394,149,889 (8)
abstracting: (p29<=p81)
states: 397,135,873 (8)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.645sec

checking: AG [E [[EX [1<=p29] & AX [~ [[p75<=p82 | p20<=p29]]]] U A [E [[p59<=1 | p64<=0] U [p73<=1 & p6<=1]] U AF [AG [p95<=p74]]]]]
normalized: ~ [E [true U ~ [E [[~ [EX [[p75<=p82 | p20<=p29]]] & EX [1<=p29]] U [~ [EG [EG [E [true U ~ [p95<=p74]]]]] & ~ [E [EG [E [true U ~ [p95<=p74]]] U [~ [E [[p59<=1 | p64<=0] U [p73<=1 & p6<=1]]] & EG [E [true U ~ [p95<=p74]]]]]]]]]]]

abstracting: (p95<=p74)
states: 397,135,873 (8)

EG iterations: 0
abstracting: (p6<=1)
states: 429,981,697 (8)
abstracting: (p73<=1)
states: 429,981,697 (8)
abstracting: (p64<=0)
states: 394,149,889 (8)
abstracting: (p59<=1)
states: 429,981,697 (8)
abstracting: (p95<=p74)
states: 397,135,873 (8)

EG iterations: 0
abstracting: (p95<=p74)
states: 397,135,873 (8)

EG iterations: 0

EG iterations: 0
abstracting: (1<=p29)
states: 35,831,808 (7)
.abstracting: (p20<=p29)
states: 397,135,873 (8)
abstracting: (p75<=p82)
states: 394,149,889 (8)
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.515sec

checking: ~ [A [[[A [~ [p57<=p6] U p24<=p57] | A [p64<=p82 U EX [p40<=1]]] | [EF [A [p74<=p97 U p18<=1]] & p87<=0]] U ~ [AG [~ [AG [p65<=1]]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [E [true U ~ [p65<=1]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [p65<=1]]]]] U [~ [[[p87<=0 & E [true U [~ [EG [~ [p18<=1]]] & ~ [E [~ [p18<=1] U [~ [p74<=p97] & ~ [p18<=1]]]]]]] | [[~ [EG [~ [EX [p40<=1]]]] & ~ [E [~ [EX [p40<=1]] U [~ [p64<=p82] & ~ [EX [p40<=1]]]]]] | [~ [EG [~ [p24<=p57]]] & ~ [E [~ [p24<=p57] U [p57<=p6 & ~ [p24<=p57]]]]]]]] & ~ [E [true U ~ [E [true U ~ [p65<=1]]]]]]]]]]

abstracting: (p65<=1)
states: 429,981,697 (8)
abstracting: (p24<=p57)
states: 397,135,873 (8)
abstracting: (p57<=p6)
states: 397,135,873 (8)
abstracting: (p24<=p57)
states: 397,135,873 (8)
abstracting: (p24<=p57)
states: 397,135,873 (8)
.
EG iterations: 1
abstracting: (p40<=1)
states: 429,981,697 (8)
.abstracting: (p64<=p82)
states: 397,135,873 (8)
abstracting: (p40<=1)
states: 429,981,697 (8)
.abstracting: (p40<=1)
states: 429,981,697 (8)
..
EG iterations: 1
abstracting: (p18<=1)
states: 429,981,697 (8)
abstracting: (p74<=p97)
states: 429,981,697 (8)
abstracting: (p18<=1)
states: 429,981,697 (8)
abstracting: (p18<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (p87<=0)
states: 394,149,889 (8)
abstracting: (p65<=1)
states: 429,981,697 (8)
abstracting: (p65<=1)
states: 429,981,697 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.259sec

checking: EF [[A [[A [~ [p26<=p12] U AX [p35<=p51]] | p16<=0] U ~ [[[[1<=p68 | p93<=p78] | ~ [1<=p15]] & p6<=1]]] | [p83<=0 & ~ [[AX [[1<=p32 | p98<=1]] | [AX [p93<=1] | AX [p78<=1]]]]]]]
normalized: E [true U [[p83<=0 & ~ [[[~ [EX [~ [p78<=1]]] | ~ [EX [~ [p93<=1]]]] | ~ [EX [~ [[1<=p32 | p98<=1]]]]]]] | [~ [EG [[p6<=1 & [~ [1<=p15] | [1<=p68 | p93<=p78]]]]] & ~ [E [[p6<=1 & [~ [1<=p15] | [1<=p68 | p93<=p78]]] U [~ [[p16<=0 | [~ [EG [EX [~ [p35<=p51]]]] & ~ [E [EX [~ [p35<=p51]] U [p26<=p12 & EX [~ [p35<=p51]]]]]]]] & [p6<=1 & [~ [1<=p15] | [1<=p68 | p93<=p78]]]]]]]]]

abstracting: (p93<=p78)
states: 397,135,873 (8)
abstracting: (1<=p68)
states: 35,831,808 (7)
abstracting: (1<=p15)
states: 35,831,808 (7)
abstracting: (p6<=1)
states: 429,981,697 (8)
abstracting: (p35<=p51)
states: 397,135,873 (8)
.abstracting: (p26<=p12)
states: 397,135,873 (8)
abstracting: (p35<=p51)
states: 397,135,873 (8)
.abstracting: (p35<=p51)
states: 397,135,873 (8)
..
EG iterations: 1
abstracting: (p16<=0)
states: 394,149,889 (8)
abstracting: (p93<=p78)
states: 397,135,873 (8)
abstracting: (1<=p68)
states: 35,831,808 (7)
abstracting: (1<=p15)
states: 35,831,808 (7)
abstracting: (p6<=1)
states: 429,981,697 (8)
abstracting: (p93<=p78)
states: 397,135,873 (8)
abstracting: (1<=p68)
states: 35,831,808 (7)
abstracting: (1<=p15)
states: 35,831,808 (7)
abstracting: (p6<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (p98<=1)
states: 429,981,697 (8)
abstracting: (1<=p32)
states: 35,831,808 (7)
.abstracting: (p93<=1)
states: 429,981,697 (8)
.abstracting: (p78<=1)
states: 429,981,697 (8)
.abstracting: (p83<=0)
states: 394,149,889 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.831sec

checking: EF [EG [[E [[[p48<=p15 | p82<=1] & [p33<=p94 & 1<=p28]] U [[1<=p63 & p69<=0] | ~ [p53<=0]]] & [[AG [1<=p66] | ~ [[1<=p2 | p34<=p63]]] & [[~ [p84<=0] | EX [1<=p66]] & p93<=0]]]]]
normalized: E [true U EG [[[[p93<=0 & [EX [1<=p66] | ~ [p84<=0]]] & [~ [[1<=p2 | p34<=p63]] | ~ [E [true U ~ [1<=p66]]]]] & E [[[p33<=p94 & 1<=p28] & [p48<=p15 | p82<=1]] U [~ [p53<=0] | [1<=p63 & p69<=0]]]]]]

abstracting: (p69<=0)
states: 394,149,889 (8)
abstracting: (1<=p63)
states: 35,831,808 (7)
abstracting: (p53<=0)
states: 394,149,889 (8)
abstracting: (p82<=1)
states: 429,981,697 (8)
abstracting: (p48<=p15)
states: 397,135,873 (8)
abstracting: (1<=p28)
states: 35,831,808 (7)
abstracting: (p33<=p94)
states: 397,135,873 (8)
abstracting: (1<=p66)
states: 35,831,808 (7)
abstracting: (p34<=p63)
states: 397,135,873 (8)
abstracting: (1<=p2)
states: 35,831,808 (7)
abstracting: (p84<=0)
states: 394,149,889 (8)
abstracting: (1<=p66)
states: 35,831,808 (7)
.abstracting: (p93<=0)
states: 394,149,889 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.260sec

checking: [[~ [AF [~ [AF [p94<=0]]]] | EX [~ [E [EX [1<=p57] U EG [p46<=p26]]]]] & E [AG [AX [[[p23<=1 & p40<=p40] | ~ [1<=p84]]]] U ~ [[[[E [p75<=1 U 1<=p24] | [1<=p31 & p54<=p19]] | AF [p9<=p73]] & [p25<=p32 & AF [p20<=p87]]]]]]
normalized: [E [~ [E [true U EX [~ [[~ [1<=p84] | [p23<=1 & p40<=p40]]]]]] U ~ [[[p25<=p32 & ~ [EG [~ [p20<=p87]]]] & [~ [EG [~ [p9<=p73]]] | [[1<=p31 & p54<=p19] | E [p75<=1 U 1<=p24]]]]]] & [EX [~ [E [EX [1<=p57] U EG [p46<=p26]]]] | EG [~ [EG [~ [p94<=0]]]]]]

abstracting: (p94<=0)
states: 394,149,889 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p46<=p26)
states: 397,135,873 (8)
.
EG iterations: 1
abstracting: (1<=p57)
states: 35,831,808 (7)
..abstracting: (1<=p24)
states: 35,831,808 (7)
abstracting: (p75<=1)
states: 429,981,697 (8)
abstracting: (p54<=p19)
states: 397,135,873 (8)
abstracting: (1<=p31)
states: 35,831,808 (7)
abstracting: (p9<=p73)
states: 397,135,873 (8)
.
EG iterations: 1
abstracting: (p20<=p87)
states: 397,135,873 (8)
.
EG iterations: 1
abstracting: (p25<=p32)
states: 394,149,889 (8)
abstracting: (p40<=p40)
states: 429,981,697 (8)
abstracting: (p23<=1)
states: 429,981,697 (8)
abstracting: (1<=p84)
states: 35,831,808 (7)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.560sec

checking: E [[AF [[[[AX [p73<=p20] | ~ [p6<=p62]] | EF [p3<=p28]] & EG [[p8<=0 & p60<=p84]]]] & A [[p66<=1 & EF [~ [p61<=0]]] U EF [p84<=1]]] U AF [~ [[EG [EF [1<=p54]] & [~ [AF [1<=p28]] & [AF [p51<=p84] & [p22<=1 & p38<=p91]]]]]]]
normalized: E [[[~ [EG [~ [E [true U p84<=1]]]] & ~ [E [~ [E [true U p84<=1]] U [~ [[p66<=1 & E [true U ~ [p61<=0]]]] & ~ [E [true U p84<=1]]]]]] & ~ [EG [~ [[EG [[p8<=0 & p60<=p84]] & [E [true U p3<=p28] | [~ [p6<=p62] | ~ [EX [~ [p73<=p20]]]]]]]]]] U ~ [EG [[[[[p22<=1 & p38<=p91] & ~ [EG [~ [p51<=p84]]]] & EG [~ [1<=p28]]] & EG [E [true U 1<=p54]]]]]]

abstracting: (1<=p54)
states: 35,831,808 (7)

EG iterations: 0
abstracting: (1<=p28)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (p51<=p84)
states: 397,135,873 (8)
.
EG iterations: 1
abstracting: (p38<=p91)
states: 397,135,873 (8)
abstracting: (p22<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (p73<=p20)
states: 397,135,873 (8)
.abstracting: (p6<=p62)
states: 397,135,873 (8)
abstracting: (p3<=p28)
states: 397,135,873 (8)
abstracting: (p60<=p84)
states: 397,135,873 (8)
abstracting: (p8<=0)
states: 394,149,889 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (p61<=0)
states: 394,149,889 (8)
abstracting: (p66<=1)
states: 429,981,697 (8)
abstracting: (p84<=1)
states: 429,981,697 (8)
abstracting: (p84<=1)
states: 429,981,697 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.055sec

checking: AG [[[[[~ [[[1<=p3 & p14<=p93] & 1<=p65]] & [[[p3<=1 & p16<=1] | AF [1<=p30]] | p80<=0]] | AF [[[p60<=p54 | p75<=p14] | [p10<=1 | p79<=p87]]]] | EX [[p27<=0 & EG [p48<=p82]]]] | [[~ [AX [~ [p8<=1]]] | [AF [p77<=0] & EG [AF [p36<=p41]]]] & EF [A [EG [p6<=1] U AG [1<=p53]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[1<=p65 & [1<=p3 & p14<=p93]]] & [p80<=0 | [~ [EG [~ [1<=p30]]] | [p3<=1 & p16<=1]]]] | ~ [EG [~ [[[p10<=1 | p79<=p87] | [p60<=p54 | p75<=p14]]]]]] | EX [[p27<=0 & EG [p48<=p82]]]] | [[[EG [~ [EG [~ [p36<=p41]]]] & ~ [EG [~ [p77<=0]]]] | EX [p8<=1]] & E [true U [~ [EG [E [true U ~ [1<=p53]]]] & ~ [E [E [true U ~ [1<=p53]] U [E [true U ~ [1<=p53]] & ~ [EG [p6<=1]]]]]]]]]]]]

abstracting: (p6<=1)
states: 429,981,697 (8)

EG iterations: 0
abstracting: (1<=p53)
states: 35,831,808 (7)
abstracting: (1<=p53)
states: 35,831,808 (7)
abstracting: (1<=p53)
states: 35,831,808 (7)

EG iterations: 0
abstracting: (p8<=1)
states: 429,981,697 (8)
.abstracting: (p77<=0)
states: 394,149,889 (8)
.
EG iterations: 1
abstracting: (p36<=p41)
states: 397,135,873 (8)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p48<=p82)
states: 397,135,873 (8)
..
EG iterations: 2
abstracting: (p27<=0)
states: 394,149,889 (8)
.abstracting: (p75<=p14)
states: 397,135,873 (8)
abstracting: (p60<=p54)
states: 394,149,889 (8)
abstracting: (p79<=p87)
states: 397,135,873 (8)
abstracting: (p10<=1)
states: 429,981,697 (8)
.
EG iterations: 1
abstracting: (p16<=1)
states: 429,981,697 (8)
abstracting: (p3<=1)
states: 429,981,697 (8)
abstracting: (1<=p30)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (p80<=0)
states: 394,149,889 (8)
abstracting: (p14<=p93)
states: 397,135,873 (8)
abstracting: (1<=p3)
states: 35,831,808 (7)
abstracting: (1<=p65)
states: 35,831,808 (7)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.275sec

checking: [[A [A [[[~ [p86<=1] & [p49<=0 & 1<=p82]] | [[p10<=0 | p84<=p93] | [p23<=p9 & 1<=p17]]] U AG [EF [p95<=0]]] U [1<=p87 | 1<=p49]] | E [EG [~ [1<=p89]] U ~ [[AG [E [p58<=p55 U p35<=p84]] & [[E [1<=p54 U p12<=0] | p19<=p87] | p76<=1]]]]] & EF [~ [AG [A [p40<=1 U [1<=p27 | p89<=0]]]]]]
normalized: [E [true U E [true U ~ [[~ [EG [~ [[1<=p27 | p89<=0]]]] & ~ [E [~ [[1<=p27 | p89<=0]] U [~ [p40<=1] & ~ [[1<=p27 | p89<=0]]]]]]]]] & [E [EG [~ [1<=p89]] U ~ [[[p76<=1 | [p19<=p87 | E [1<=p54 U p12<=0]]] & ~ [E [true U ~ [E [p58<=p55 U p35<=p84]]]]]]] | [~ [EG [~ [[1<=p87 | 1<=p49]]]] & ~ [E [~ [[1<=p87 | 1<=p49]] U [~ [[~ [EG [E [true U ~ [E [true U p95<=0]]]]] & ~ [E [E [true U ~ [E [true U p95<=0]]] U [~ [[[[p23<=p9 & 1<=p17] | [p10<=0 | p84<=p93]] | [[p49<=0 & 1<=p82] & ~ [p86<=1]]]] & E [true U ~ [E [true U p95<=0]]]]]]]] & ~ [[1<=p87 | 1<=p49]]]]]]]]

abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (p86<=1)
states: 429,981,697 (8)
abstracting: (1<=p82)
states: 35,831,808 (7)
abstracting: (p49<=0)
states: 394,149,889 (8)
abstracting: (p84<=p93)
states: 397,135,873 (8)
abstracting: (p10<=0)
states: 394,149,889 (8)
abstracting: (1<=p17)
states: 35,831,808 (7)
abstracting: (p23<=p9)
states: 397,135,873 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
abstracting: (p95<=0)
states: 394,149,889 (8)
.
EG iterations: 1
abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (1<=p87)
states: 35,831,808 (7)
abstracting: (1<=p49)
states: 35,831,808 (7)
abstracting: (1<=p87)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (p35<=p84)
states: 397,135,873 (8)
abstracting: (p58<=p55)
states: 394,149,889 (8)
abstracting: (p12<=0)
states: 394,149,889 (8)
abstracting: (1<=p54)
states: 35,831,808 (7)
abstracting: (p19<=p87)
states: 397,135,873 (8)
abstracting: (p76<=1)
states: 429,981,697 (8)
abstracting: (1<=p89)
states: 35,831,808 (7)
.
EG iterations: 1
abstracting: (p89<=0)
states: 394,149,889 (8)
abstracting: (1<=p27)
states: 35,831,808 (7)
abstracting: (p40<=1)
states: 429,981,697 (8)
abstracting: (p89<=0)
states: 394,149,889 (8)
abstracting: (1<=p27)
states: 35,831,808 (7)
abstracting: (p89<=0)
states: 394,149,889 (8)
abstracting: (1<=p27)
states: 35,831,808 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-08a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.769sec

totally nodes used: 6203150 (6.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28909337 62727891 91637228
used/not used/entry size/cache size: 42480313 24628551 16 1024MB
basic ops cache: hits/miss/sum: 1815280 3837869 5653149
used/not used/entry size/cache size: 4835676 11941540 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: 199437 403020 602457
used/not used/entry size/cache size: 393522 7995086 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 61603387
1 4901329
2 521469
3 72860
4 8875
5 867
6 71
7 6
8 0
9 0
>= 10 0

Total processing time: 0m28.060sec


BK_STOP 1679855790812

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:5567 (23), effective:166 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:806 (3), effective:12 (0)

iterations count:1888 (8), effective:35 (0)

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

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

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

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

iterations count:1141 (4), effective:23 (0)

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

iterations count:556 (2), effective:11 (0)

iterations count:556 (2), effective:11 (0)

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

iterations count:556 (2), effective:11 (0)

iterations count:1849 (7), effective:37 (0)

iterations count:845 (3), effective:13 (0)

iterations count:1299 (5), effective:24 (0)

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

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

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

iterations count:2277 (9), effective:50 (0)

iterations count:879 (3), effective:13 (0)

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

iterations count:879 (3), effective:13 (0)

iterations count:879 (3), effective:13 (0)

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

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

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

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

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

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

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

iterations count:2468 (10), effective:62 (0)

iterations count:1502 (6), effective:36 (0)

iterations count:1469 (6), effective:31 (0)

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

iterations count:3133 (13), effective:69 (0)

iterations count:392 (1), effective:5 (0)

iterations count:888 (3), effective:12 (0)

iterations count:1347 (5), effective:28 (0)

iterations count:1263 (5), effective:23 (0)

iterations count:511 (2), effective:7 (0)

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

iterations count:1448 (6), effective:23 (0)

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

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

iterations count:1641 (6), effective:37 (0)

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

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

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

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

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

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

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

iterations count:2609 (11), effective:57 (0)

iterations count:641 (2), effective:12 (0)

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

iterations count:826 (3), effective:13 (0)

iterations count:236 (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="FlexibleBarrier-PT-08a"
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 FlexibleBarrier-PT-08a, 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 r161-tall-167838845200473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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