About the Execution of Marcie for DLCround-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5487.388 | 14647.00 | 14060.00 | 0.00 | FFFTTFFFFFTFFTFF | 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.r097-tall-167814469800633.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 DLCround-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469800633
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 200K 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 DLCround-PT-04a-CTLCardinality-00
FORMULA_NAME DLCround-PT-04a-CTLCardinality-01
FORMULA_NAME DLCround-PT-04a-CTLCardinality-02
FORMULA_NAME DLCround-PT-04a-CTLCardinality-03
FORMULA_NAME DLCround-PT-04a-CTLCardinality-04
FORMULA_NAME DLCround-PT-04a-CTLCardinality-05
FORMULA_NAME DLCround-PT-04a-CTLCardinality-06
FORMULA_NAME DLCround-PT-04a-CTLCardinality-07
FORMULA_NAME DLCround-PT-04a-CTLCardinality-08
FORMULA_NAME DLCround-PT-04a-CTLCardinality-09
FORMULA_NAME DLCround-PT-04a-CTLCardinality-10
FORMULA_NAME DLCround-PT-04a-CTLCardinality-11
FORMULA_NAME DLCround-PT-04a-CTLCardinality-12
FORMULA_NAME DLCround-PT-04a-CTLCardinality-13
FORMULA_NAME DLCround-PT-04a-CTLCardinality-14
FORMULA_NAME DLCround-PT-04a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678272587169
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=DLCround-PT-04a
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: DLCround_PT_04a
(NrP: 139 NrTr: 823 NrArc: 3074)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec
net check time: 0m 0.000sec
init dd package: 0m 2.820sec
RS generation: 0m 0.700sec
-> reachability set: #nodes 11497 (1.1e+04) #states 240,100,001 (8)
starting MCC model checker
--------------------------
checking: AF [AG [p123<=1]]
normalized: ~ [EG [E [true U ~ [p123<=1]]]]
abstracting: (p123<=1)
states: 240,100,001 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.702sec
checking: EG [p131<=0]
normalized: EG [p131<=0]
abstracting: (p131<=0)
states: 1
..
EG iterations: 2
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [AF [AG [p116<=p28]]]
normalized: E [true U ~ [EG [E [true U ~ [p116<=p28]]]]]
abstracting: (p116<=p28)
states: 34,300,001 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.100sec
checking: [EF [p130<=0] & AG [EX [~ [AF [[1<=p59 | 1<=p50]]]]]]
normalized: [~ [E [true U ~ [EX [EG [~ [[1<=p59 | 1<=p50]]]]]]] & E [true U p130<=0]]
abstracting: (p130<=0)
states: 1
abstracting: (1<=p50)
states: 24,010,000 (7)
abstracting: (1<=p59)
states: 24,010,000 (7)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.168sec
checking: AF [AF [A [AF [EG [1<=p84]] U EX [A [1<=p106 U p98<=p16]]]]]
normalized: ~ [EG [EG [~ [[~ [E [~ [EX [[~ [EG [~ [p98<=p16]]] & ~ [E [~ [p98<=p16] U [~ [p98<=p16] & ~ [1<=p106]]]]]]] U [EG [~ [EG [1<=p84]]] & ~ [EX [[~ [EG [~ [p98<=p16]]] & ~ [E [~ [p98<=p16] U [~ [p98<=p16] & ~ [1<=p106]]]]]]]]]] & ~ [EG [~ [EX [[~ [EG [~ [p98<=p16]]] & ~ [E [~ [p98<=p16] U [~ [p98<=p16] & ~ [1<=p106]]]]]]]]]]]]]]
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
.
EG iterations: 1
.abstracting: (1<=p84)
states: 240,100,000 (8)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
abstracting: (p98<=p16)
states: 34,300,001 (7)
.
EG iterations: 1
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.192sec
checking: [EG [p65<=p109] & EF [EX [~ [[~ [p128<=0] | [p22<=0 & p48<=p36]]]]]]
normalized: [EG [p65<=p109] & E [true U EX [~ [[[p22<=0 & p48<=p36] | ~ [p128<=0]]]]]]
abstracting: (p128<=0)
states: 1
abstracting: (p48<=p36)
states: 218,491,001 (8)
abstracting: (p22<=0)
states: 205,800,001 (8)
.abstracting: (p65<=p109)
states: 240,100,001 (8)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AX [[AX [EF [~ [EF [p63<=p17]]]] | EG [AG [[EG [p132<=0] & [p60<=p112 & p69<=0]]]]]]
normalized: ~ [EX [~ [[~ [EX [~ [E [true U ~ [E [true U p63<=p17]]]]]] | EG [~ [E [true U ~ [[EG [p132<=0] & [p60<=p112 & p69<=0]]]]]]]]]]
abstracting: (p69<=0)
states: 216,090,001 (8)
abstracting: (p60<=p112)
states: 240,100,001 (8)
abstracting: (p132<=0)
states: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p63<=p17)
states: 219,520,001 (8)
..-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: AG [A [~ [[AG [~ [p23<=0]] & EX [EF [p116<=p7]]]] U [p22<=p135 & AG [EF [p110<=p41]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [E [true U ~ [E [true U p110<=p41]]]] & p22<=p135]]]] & ~ [E [~ [[~ [E [true U ~ [E [true U p110<=p41]]]] & p22<=p135]] U [[EX [E [true U p116<=p7]] & ~ [E [true U p23<=0]]] & ~ [[~ [E [true U ~ [E [true U p110<=p41]]]] & p22<=p135]]]]]]]]]
abstracting: (p22<=p135)
states: 240,100,001 (8)
abstracting: (p110<=p41)
states: 24,010,001 (7)
abstracting: (p23<=0)
states: 205,800,001 (8)
abstracting: (p116<=p7)
states: 34,300,001 (7)
.abstracting: (p22<=p135)
states: 240,100,001 (8)
abstracting: (p110<=p41)
states: 24,010,001 (7)
abstracting: (p22<=p135)
states: 240,100,001 (8)
abstracting: (p110<=p41)
states: 24,010,001 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.893sec
checking: EG [AF [~ [[[A [1<=p131 U p120<=p79] | p59<=p31] & AG [[p9<=p126 | p97<=1]]]]]]
normalized: EG [~ [EG [[~ [E [true U ~ [[p9<=p126 | p97<=1]]]] & [p59<=p31 | [~ [EG [~ [p120<=p79]]] & ~ [E [~ [p120<=p79] U [~ [1<=p131] & ~ [p120<=p79]]]]]]]]]]
abstracting: (p120<=p79)
states: 240,100,001 (8)
abstracting: (1<=p131)
states: 240,100,000 (8)
abstracting: (p120<=p79)
states: 240,100,001 (8)
abstracting: (p120<=p79)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (p59<=p31)
states: 218,491,001 (8)
abstracting: (p97<=1)
states: 240,100,001 (8)
abstracting: (p9<=p126)
states: 240,100,001 (8)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AF [AG [[E [p78<=p51 U AX [1<=p106]] | E [[EF [1<=p29] & [1<=p123 & p56<=1]] U [[p21<=1 | p28<=0] & [p50<=1 | p131<=0]]]]]]
normalized: ~ [EG [E [true U ~ [[E [[[1<=p123 & p56<=1] & E [true U 1<=p29]] U [[p50<=1 | p131<=0] & [p21<=1 | p28<=0]]] | E [p78<=p51 U ~ [EX [~ [1<=p106]]]]]]]]]
abstracting: (1<=p106)
states: 240,100,000 (8)
.abstracting: (p78<=p51)
states: 218,491,001 (8)
abstracting: (p28<=0)
states: 205,800,001 (8)
abstracting: (p21<=1)
states: 240,100,001 (8)
abstracting: (p131<=0)
states: 1
abstracting: (p50<=1)
states: 240,100,001 (8)
abstracting: (1<=p29)
states: 24,010,000 (7)
abstracting: (p56<=1)
states: 240,100,001 (8)
abstracting: (1<=p123)
states: 240,100,000 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.301sec
checking: EG [[EX [1<=p31] & [[AX [EF [1<=p30]] & [[EX [p24<=p69] | EX [p13<=p30]] | [A [p89<=1 U p117<=p71] & EF [1<=p134]]]] | 1<=p131]]]
normalized: EG [[[1<=p131 | [[[E [true U 1<=p134] & [~ [EG [~ [p117<=p71]]] & ~ [E [~ [p117<=p71] U [~ [p89<=1] & ~ [p117<=p71]]]]]] | [EX [p13<=p30] | EX [p24<=p69]]] & ~ [EX [~ [E [true U 1<=p30]]]]]] & EX [1<=p31]]]
abstracting: (1<=p31)
states: 24,010,000 (7)
.abstracting: (1<=p30)
states: 24,010,000 (7)
.abstracting: (p24<=p69)
states: 209,230,001 (8)
.abstracting: (p13<=p30)
states: 209,230,001 (8)
.abstracting: (p117<=p71)
states: 24,010,001 (7)
abstracting: (p89<=1)
states: 240,100,001 (8)
abstracting: (p117<=p71)
states: 24,010,001 (7)
abstracting: (p117<=p71)
states: 24,010,001 (7)
.
EG iterations: 1
abstracting: (1<=p134)
states: 240,100,000 (8)
abstracting: (1<=p131)
states: 240,100,000 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.066sec
checking: AF [[[EG [[p25<=p96 | [~ [p40<=p76] | [1<=p42 & 1<=p9]]]] & AF [[~ [[p133<=0 | p86<=0]] & ~ [EX [p116<=p25]]]]] | [~ [[AX [[p43<=p56 | 1<=p80]] & [[~ [1<=p97] | [1<=p34 | p3<=0]] | [p45<=p105 & EG [p116<=0]]]]] | [p32<=1 & ~ [AG [p105<=p105]]]]]]
normalized: ~ [EG [~ [[[[p32<=1 & E [true U ~ [p105<=p105]]] | ~ [[[[p45<=p105 & EG [p116<=0]] | [[1<=p34 | p3<=0] | ~ [1<=p97]]] & ~ [EX [~ [[p43<=p56 | 1<=p80]]]]]]] | [~ [EG [~ [[~ [EX [p116<=p25]] & ~ [[p133<=0 | p86<=0]]]]]] & EG [[p25<=p96 | [[1<=p42 & 1<=p9] | ~ [p40<=p76]]]]]]]]]
abstracting: (p40<=p76)
states: 218,491,001 (8)
abstracting: (1<=p9)
states: 34,300,000 (7)
abstracting: (1<=p42)
states: 24,010,000 (7)
abstracting: (p25<=p96)
states: 240,100,001 (8)
EG iterations: 0
abstracting: (p86<=0)
states: 1
abstracting: (p133<=0)
states: 1
abstracting: (p116<=p25)
states: 34,300,001 (7)
..
EG iterations: 1
abstracting: (1<=p80)
states: 240,100,000 (8)
abstracting: (p43<=p56)
states: 218,491,001 (8)
.abstracting: (1<=p97)
states: 240,100,000 (8)
abstracting: (p3<=0)
states: 205,800,001 (8)
abstracting: (1<=p34)
states: 24,010,000 (7)
abstracting: (p116<=0)
states: 1
..
EG iterations: 2
abstracting: (p45<=p105)
states: 240,100,001 (8)
abstracting: (p105<=p105)
states: 240,100,001 (8)
abstracting: (p32<=1)
states: 240,100,001 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.473sec
checking: EF [[[[A [~ [E [p61<=0 U 1<=p117]] U ~ [[p79<=0 | 1<=p56]]] & ~ [[[AF [p54<=1] & [p39<=p63 & p80<=p73]] | p64<=p52]]] | 1<=p89] & [EG [p118<=p61] & [[EG [p58<=p42] | [p27<=p136 | [~ [1<=p6] | [p119<=p137 & p128<=1]]]] & ~ [EF [~ [p43<=p22]]]]]]]
normalized: E [true U [[[~ [E [true U ~ [p43<=p22]]] & [[p27<=p136 | [[p119<=p137 & p128<=1] | ~ [1<=p6]]] | EG [p58<=p42]]] & EG [p118<=p61]] & [1<=p89 | [~ [[p64<=p52 | [[p39<=p63 & p80<=p73] & ~ [EG [~ [p54<=1]]]]]] & [~ [EG [[p79<=0 | 1<=p56]]] & ~ [E [[p79<=0 | 1<=p56] U [E [p61<=0 U 1<=p117] & [p79<=0 | 1<=p56]]]]]]]]]
abstracting: (1<=p56)
states: 24,010,000 (7)
abstracting: (p79<=0)
states: 1
abstracting: (1<=p117)
states: 240,100,000 (8)
abstracting: (p61<=0)
states: 216,090,001 (8)
abstracting: (1<=p56)
states: 24,010,000 (7)
abstracting: (p79<=0)
states: 1
abstracting: (1<=p56)
states: 24,010,000 (7)
abstracting: (p79<=0)
states: 1
..
EG iterations: 2
abstracting: (p54<=1)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (p80<=p73)
states: 24,010,001 (7)
abstracting: (p39<=p63)
states: 218,491,001 (8)
abstracting: (p64<=p52)
states: 218,491,001 (8)
abstracting: (1<=p89)
states: 240,100,000 (8)
abstracting: (p118<=p61)
states: 24,010,001 (7)
..
EG iterations: 2
abstracting: (p58<=p42)
states: 218,491,001 (8)
..
EG iterations: 2
abstracting: (1<=p6)
states: 34,300,000 (7)
abstracting: (p128<=1)
states: 240,100,001 (8)
abstracting: (p119<=p137)
states: 240,100,001 (8)
abstracting: (p27<=p136)
states: 240,100,001 (8)
abstracting: (p43<=p22)
states: 219,520,001 (8)
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.646sec
checking: [[~ [AX [[[1<=p126 | 1<=p97] | E [p55<=1 U p49<=0]]]] & A [[EX [AX [p103<=p58]] | AG [[[1<=p85 & 1<=p111] & [p20<=0 | p137<=0]]]] U ~ [AG [[[p58<=0 & 1<=p15] | ~ [p127<=0]]]]]] & E [A [[EX [~ [p86<=p4]] | EF [p18<=p102]] U [p93<=1 | [A [p5<=p6 U p82<=1] | ~ [[p82<=0 | 1<=p72]]]]] U [~ [EX [~ [[p73<=0 | p63<=p55]]]] & p90<=1]]]
normalized: [E [[~ [EG [~ [[p93<=1 | [~ [[p82<=0 | 1<=p72]] | [~ [EG [~ [p82<=1]]] & ~ [E [~ [p82<=1] U [~ [p5<=p6] & ~ [p82<=1]]]]]]]]]] & ~ [E [~ [[p93<=1 | [~ [[p82<=0 | 1<=p72]] | [~ [EG [~ [p82<=1]]] & ~ [E [~ [p82<=1] U [~ [p5<=p6] & ~ [p82<=1]]]]]]]] U [~ [[E [true U p18<=p102] | EX [~ [p86<=p4]]]] & ~ [[p93<=1 | [~ [[p82<=0 | 1<=p72]] | [~ [EG [~ [p82<=1]]] & ~ [E [~ [p82<=1] U [~ [p5<=p6] & ~ [p82<=1]]]]]]]]]]]] U [p90<=1 & ~ [EX [~ [[p73<=0 | p63<=p55]]]]]] & [[~ [EG [~ [E [true U ~ [[~ [p127<=0] | [p58<=0 & 1<=p15]]]]]]] & ~ [E [~ [E [true U ~ [[~ [p127<=0] | [p58<=0 & 1<=p15]]]]] U [~ [[~ [E [true U ~ [[[p20<=0 | p137<=0] & [1<=p85 & 1<=p111]]]]] | EX [~ [EX [~ [p103<=p58]]]]]] & ~ [E [true U ~ [[~ [p127<=0] | [p58<=0 & 1<=p15]]]]]]]]] & EX [~ [[E [p55<=1 U p49<=0] | [1<=p126 | 1<=p97]]]]]]
abstracting: (1<=p97)
states: 240,100,000 (8)
abstracting: (1<=p126)
states: 240,100,000 (8)
abstracting: (p49<=0)
states: 216,090,001 (8)
abstracting: (p55<=1)
states: 240,100,001 (8)
.abstracting: (1<=p15)
states: 34,300,000 (7)
abstracting: (p58<=0)
states: 216,090,001 (8)
abstracting: (p127<=0)
states: 1
abstracting: (p103<=p58)
states: 24,010,001 (7)
..abstracting: (1<=p111)
states: 240,100,000 (8)
abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (p137<=0)
states: 1
abstracting: (p20<=0)
states: 205,800,001 (8)
abstracting: (1<=p15)
states: 34,300,000 (7)
abstracting: (p58<=0)
states: 216,090,001 (8)
abstracting: (p127<=0)
states: 1
abstracting: (1<=p15)
states: 34,300,000 (7)
abstracting: (p58<=0)
states: 216,090,001 (8)
abstracting: (p127<=0)
states: 1
.
EG iterations: 1
abstracting: (p63<=p55)
states: 218,491,001 (8)
abstracting: (p73<=0)
states: 216,090,001 (8)
.abstracting: (p90<=1)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p5<=p6)
states: 205,800,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p72)
states: 24,010,000 (7)
abstracting: (p82<=0)
states: 1
abstracting: (p93<=1)
states: 240,100,001 (8)
abstracting: (p86<=p4)
states: 34,300,001 (7)
.abstracting: (p18<=p102)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p5<=p6)
states: 205,800,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p72)
states: 24,010,000 (7)
abstracting: (p82<=0)
states: 1
abstracting: (p93<=1)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p5<=p6)
states: 205,800,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
abstracting: (p82<=1)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p72)
states: 24,010,000 (7)
abstracting: (p82<=0)
states: 1
abstracting: (p93<=1)
states: 240,100,001 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.132sec
checking: [[[~ [AF [1<=p50]] | EF [[EX [p70<=p23] & EF [E [p59<=0 U 1<=p19]]]]] & [[[E [EX [p66<=p33] U ~ [AG [1<=p52]]] | ~ [[EG [p78<=1] & EX [p123<=p115]]]] | A [[AG [p59<=0] & AF [p24<=p85]] U [[p75<=p4 & [1<=p63 & 1<=p87]] | AG [1<=p40]]]] | ~ [E [EG [1<=p1] U 1<=p32]]]] & AG [[[~ [AX [~ [1<=p77]]] & AG [[[p3<=0 | p127<=p126] | [1<=p129 & p66<=p70]]]] | EF [AF [~ [p57<=1]]]]]]
normalized: [~ [E [true U ~ [[E [true U ~ [EG [p57<=1]]] | [~ [E [true U ~ [[[1<=p129 & p66<=p70] | [p3<=0 | p127<=p126]]]]] & EX [1<=p77]]]]]] & [[~ [E [EG [1<=p1] U 1<=p32]] | [[~ [EG [~ [[~ [E [true U ~ [1<=p40]]] | [p75<=p4 & [1<=p63 & 1<=p87]]]]]] & ~ [E [~ [[~ [E [true U ~ [1<=p40]]] | [p75<=p4 & [1<=p63 & 1<=p87]]]] U [~ [[~ [EG [~ [p24<=p85]]] & ~ [E [true U ~ [p59<=0]]]]] & ~ [[~ [E [true U ~ [1<=p40]]] | [p75<=p4 & [1<=p63 & 1<=p87]]]]]]]] | [~ [[EX [p123<=p115] & EG [p78<=1]]] | E [EX [p66<=p33] U E [true U ~ [1<=p52]]]]]] & [E [true U [E [true U E [p59<=0 U 1<=p19]] & EX [p70<=p23]]] | EG [~ [1<=p50]]]]]
abstracting: (1<=p50)
states: 24,010,000 (7)
.
EG iterations: 1
abstracting: (p70<=p23)
states: 219,520,001 (8)
.abstracting: (1<=p19)
states: 34,300,000 (7)
abstracting: (p59<=0)
states: 216,090,001 (8)
abstracting: (1<=p52)
states: 24,010,000 (7)
abstracting: (p66<=p33)
states: 218,491,001 (8)
.abstracting: (p78<=1)
states: 240,100,001 (8)
EG iterations: 0
abstracting: (p123<=p115)
states: 240,100,001 (8)
.abstracting: (1<=p87)
states: 240,100,000 (8)
abstracting: (1<=p63)
states: 24,010,000 (7)
abstracting: (p75<=p4)
states: 219,520,001 (8)
abstracting: (1<=p40)
states: 24,010,000 (7)
abstracting: (p59<=0)
states: 216,090,001 (8)
abstracting: (p24<=p85)
states: 240,100,001 (8)
.
EG iterations: 1
abstracting: (1<=p87)
states: 240,100,000 (8)
abstracting: (1<=p63)
states: 24,010,000 (7)
abstracting: (p75<=p4)
states: 219,520,001 (8)
abstracting: (1<=p40)
states: 24,010,000 (7)
abstracting: (1<=p87)
states: 240,100,000 (8)
abstracting: (1<=p63)
states: 24,010,000 (7)
abstracting: (p75<=p4)
states: 219,520,001 (8)
abstracting: (1<=p40)
states: 24,010,000 (7)
.
EG iterations: 1
abstracting: (1<=p32)
states: 24,010,000 (7)
abstracting: (1<=p1)
states: 34,300,000 (7)
.
EG iterations: 1
abstracting: (1<=p77)
states: 24,010,000 (7)
.abstracting: (p127<=p126)
states: 240,100,001 (8)
abstracting: (p3<=0)
states: 205,800,001 (8)
abstracting: (p66<=p70)
states: 218,491,001 (8)
abstracting: (1<=p129)
states: 240,100,000 (8)
abstracting: (p57<=1)
states: 240,100,001 (8)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.091sec
checking: [[~ [[A [~ [[EG [p49<=1] | [p81<=p40 & p138<=0]]] U E [p62<=0 U [p68<=1 | p76<=1]]] | AG [[E [1<=p100 U p71<=p5] & ~ [[p10<=1 | 1<=p57]]]]]] | AG [[[p1<=1 | p38<=p52] | AX [[~ [p36<=p98] & ~ [p130<=p106]]]]]] | [[[[~ [AX [[p97<=p45 & 1<=p134]]] & EX [[~ [1<=p5] | ~ [1<=p89]]]] & [~ [A [[1<=p103 & 1<=p100] U [p46<=p0 & p90<=0]]] & AF [[A [p50<=1 U p91<=p17] & AX [1<=p76]]]]] & ~ [AF [EF [~ [p107<=p122]]]]] | ~ [AG [[[E [1<=p15 U p6<=p119] & [p1<=0 & AG [p57<=1]]] | AX [EG [p17<=1]]]]]]]
normalized: [[E [true U ~ [[~ [EX [~ [EG [p17<=1]]]] | [[p1<=0 & ~ [E [true U ~ [p57<=1]]]] & E [1<=p15 U p6<=p119]]]]] | [EG [~ [E [true U ~ [p107<=p122]]]] & [[~ [EG [~ [[~ [EX [~ [1<=p76]]] & [~ [EG [~ [p91<=p17]]] & ~ [E [~ [p91<=p17] U [~ [p50<=1] & ~ [p91<=p17]]]]]]]]] & ~ [[~ [EG [~ [[p46<=p0 & p90<=0]]]] & ~ [E [~ [[p46<=p0 & p90<=0]] U [~ [[1<=p103 & 1<=p100]] & ~ [[p46<=p0 & p90<=0]]]]]]]] & [EX [[~ [1<=p89] | ~ [1<=p5]]] & EX [~ [[p97<=p45 & 1<=p134]]]]]]] | [~ [E [true U ~ [[~ [EX [~ [[~ [p130<=p106] & ~ [p36<=p98]]]]] | [p1<=1 | p38<=p52]]]]] | ~ [[~ [E [true U ~ [[~ [[p10<=1 | 1<=p57]] & E [1<=p100 U p71<=p5]]]]] | [~ [EG [~ [E [p62<=0 U [p68<=1 | p76<=1]]]]] & ~ [E [~ [E [p62<=0 U [p68<=1 | p76<=1]]] U [[[p81<=p40 & p138<=0] | EG [p49<=1]] & ~ [E [p62<=0 U [p68<=1 | p76<=1]]]]]]]]]]]
abstracting: (p76<=1)
states: 240,100,001 (8)
abstracting: (p68<=1)
states: 240,100,001 (8)
abstracting: (p62<=0)
states: 216,090,001 (8)
abstracting: (p49<=1)
states: 240,100,001 (8)
EG iterations: 0
abstracting: (p138<=0)
states: 1
abstracting: (p81<=p40)
states: 24,010,001 (7)
abstracting: (p76<=1)
states: 240,100,001 (8)
abstracting: (p68<=1)
states: 240,100,001 (8)
abstracting: (p62<=0)
states: 216,090,001 (8)
abstracting: (p76<=1)
states: 240,100,001 (8)
abstracting: (p68<=1)
states: 240,100,001 (8)
abstracting: (p62<=0)
states: 216,090,001 (8)
.
EG iterations: 1
abstracting: (p71<=p5)
states: 219,520,001 (8)
abstracting: (1<=p100)
states: 240,100,000 (8)
abstracting: (1<=p57)
states: 24,010,000 (7)
abstracting: (p10<=1)
states: 240,100,001 (8)
abstracting: (p38<=p52)
states: 218,491,001 (8)
abstracting: (p1<=1)
states: 240,100,001 (8)
abstracting: (p36<=p98)
states: 240,100,001 (8)
abstracting: (p130<=p106)
states: 240,100,001 (8)
.abstracting: (1<=p134)
states: 240,100,000 (8)
abstracting: (p97<=p45)
states: 24,010,001 (7)
.abstracting: (1<=p5)
states: 34,300,000 (7)
abstracting: (1<=p89)
states: 240,100,000 (8)
.abstracting: (p90<=0)
states: 1
abstracting: (p46<=p0)
states: 216,090,001 (8)
abstracting: (1<=p100)
states: 240,100,000 (8)
abstracting: (1<=p103)
states: 240,100,000 (8)
abstracting: (p90<=0)
states: 1
abstracting: (p46<=p0)
states: 216,090,001 (8)
abstracting: (p90<=0)
states: 1
abstracting: (p46<=p0)
states: 216,090,001 (8)
.
EG iterations: 1
abstracting: (p91<=p17)
states: 34,300,001 (7)
abstracting: (p50<=1)
states: 240,100,001 (8)
abstracting: (p91<=p17)
states: 34,300,001 (7)
abstracting: (p91<=p17)
states: 34,300,001 (7)
.
EG iterations: 1
abstracting: (1<=p76)
states: 24,010,000 (7)
.
EG iterations: 0
abstracting: (p107<=p122)
states: 240,100,001 (8)
EG iterations: 0
abstracting: (p6<=p119)
states: 240,100,001 (8)
abstracting: (1<=p15)
states: 34,300,000 (7)
abstracting: (p57<=1)
states: 240,100,001 (8)
abstracting: (p1<=0)
states: 205,800,001 (8)
abstracting: (p17<=1)
states: 240,100,001 (8)
EG iterations: 0
.-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.273sec
totally nodes used: 635105 (6.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7337715 32365686 39703401
used/not used/entry size/cache size: 25587745 41521119 16 1024MB
basic ops cache: hits/miss/sum: 378922 1024462 1403384
used/not used/entry size/cache size: 1486093 15291123 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: 38389 152415 190804
used/not used/entry size/cache size: 151284 8237324 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 66485937
1 611295
2 11107
3 505
4 19
5 1
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m14.599sec
BK_STOP 1678272601816
--------------------
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.003sec
iterations count:17669 (21), effective:70 (0)
initing FirstDep: 0m 0.003sec
iterations count:2114 (2), effective:2 (0)
iterations count:823 (1), effective:0 (0)
iterations count:6931 (8), effective:19 (0)
iterations count:823 (1), effective:0 (0)
iterations count:1484 (1), effective:6 (0)
iterations count:1297 (1), effective:9 (0)
iterations count:854 (1), effective:1 (0)
iterations count:966 (1), effective:6 (0)
iterations count:1297 (1), effective:9 (0)
iterations count:1297 (1), effective:9 (0)
iterations count:823 (1), effective:0 (0)
iterations count:2918 (3), effective:10 (0)
iterations count:823 (1), effective:0 (0)
iterations count:2934 (3), effective:10 (0)
iterations count:1615 (1), effective:1 (0)
iterations count:1615 (1), effective:1 (0)
iterations count:823 (1), effective:0 (0)
iterations count:2059 (2), effective:11 (0)
iterations count:920 (1), effective:1 (0)
iterations count:823 (1), effective:0 (0)
iterations count:1571 (1), effective:6 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:2414 (2), effective:10 (0)
iterations count:2028 (2), effective:7 (0)
iterations count:1236 (1), effective:6 (0)
iterations count:823 (1), effective:0 (0)
iterations count:866 (1), effective:1 (0)
iterations count:823 (1), effective:0 (0)
iterations count:833 (1), effective:1 (0)
iterations count:4833 (5), effective:10 (0)
iterations count:833 (1), effective:1 (0)
iterations count:823 (1), effective:0 (0)
iterations count:833 (1), effective:1 (0)
iterations count:2164 (2), effective:9 (0)
iterations count:2901 (3), effective:6 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:971 (1), effective:6 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (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="DLCround-PT-04a"
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 DLCround-PT-04a, 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 r097-tall-167814469800633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-04a.tgz
mv DLCround-PT-04a 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 ;