About the Execution of Marcie for DLCround-PT-07a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5875.432 | 215465.00 | 215060.00 | 0.00 | FFTTFFTFTTFTTTTT | 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-167814469800681.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-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469800681
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.4K Feb 25 19:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 19:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:59 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.7K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 19:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 398K 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-07a-CTLCardinality-00
FORMULA_NAME DLCround-PT-07a-CTLCardinality-01
FORMULA_NAME DLCround-PT-07a-CTLCardinality-02
FORMULA_NAME DLCround-PT-07a-CTLCardinality-03
FORMULA_NAME DLCround-PT-07a-CTLCardinality-04
FORMULA_NAME DLCround-PT-07a-CTLCardinality-05
FORMULA_NAME DLCround-PT-07a-CTLCardinality-06
FORMULA_NAME DLCround-PT-07a-CTLCardinality-07
FORMULA_NAME DLCround-PT-07a-CTLCardinality-08
FORMULA_NAME DLCround-PT-07a-CTLCardinality-09
FORMULA_NAME DLCround-PT-07a-CTLCardinality-10
FORMULA_NAME DLCround-PT-07a-CTLCardinality-11
FORMULA_NAME DLCround-PT-07a-CTLCardinality-12
FORMULA_NAME DLCround-PT-07a-CTLCardinality-13
FORMULA_NAME DLCround-PT-07a-CTLCardinality-14
FORMULA_NAME DLCround-PT-07a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678275941399
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-07a
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_07a
(NrP: 229 NrTr: 1597 NrArc: 6125)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.027sec
net check time: 0m 0.000sec
init dd package: 0m 2.900sec
RS generation: 0m19.183sec
-> reachability set: #nodes 127851 (1.3e+05) #states 240,100,000,001 (11)
starting MCC model checker
--------------------------
checking: ~ [EX [EF [~ [AF [E [p132<=p220 U 1<=p216]]]]]]
normalized: ~ [EX [E [true U EG [~ [E [p132<=p220 U 1<=p216]]]]]]
abstracting: (1<=p216)
states: 240,100,000,000 (11)
abstracting: (p132<=p220)
states: 240,100,000,001 (11)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24.561sec
checking: ~ [AX [AG [[~ [A [1<=p122 U 1<=p178]] & p185<=1]]]]
normalized: EX [E [true U ~ [[p185<=1 & ~ [[~ [EG [~ [1<=p178]]] & ~ [E [~ [1<=p178] U [~ [1<=p122] & ~ [1<=p178]]]]]]]]]]
abstracting: (1<=p178)
states: 240,100,000,000 (11)
abstracting: (1<=p122)
states: 240,100,000,000 (11)
abstracting: (1<=p178)
states: 240,100,000,000 (11)
abstracting: (1<=p178)
states: 240,100,000,000 (11)
..
EG iterations: 2
abstracting: (p185<=1)
states: 240,100,000,001 (11)
.-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.131sec
checking: EF [A [p73<=p181 U EX [[AF [1<=p4] & p195<=p65]]]]
normalized: E [true U [~ [E [~ [EX [[p195<=p65 & ~ [EG [~ [1<=p4]]]]]] U [~ [EX [[p195<=p65 & ~ [EG [~ [1<=p4]]]]]] & ~ [p73<=p181]]]] & ~ [EG [~ [EX [[p195<=p65 & ~ [EG [~ [1<=p4]]]]]]]]]]
abstracting: (1<=p4)
states: 34,300,000,000 (10)
.
EG iterations: 1
abstracting: (p195<=p65)
states: 24,010,000,001 (10)
..
EG iterations: 1
abstracting: (p73<=p181)
states: 240,100,000,001 (11)
abstracting: (1<=p4)
states: 34,300,000,000 (10)
.
EG iterations: 1
abstracting: (p195<=p65)
states: 24,010,000,001 (10)
.abstracting: (1<=p4)
states: 34,300,000,000 (10)
.
EG iterations: 1
abstracting: (p195<=p65)
states: 24,010,000,001 (10)
.-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.973sec
checking: ~ [AF [AX [A [AG [p207<=p67] U [~ [p60<=p221] | ~ [p21<=p148]]]]]]
normalized: EG [EX [~ [[~ [EG [~ [[~ [p21<=p148] | ~ [p60<=p221]]]]] & ~ [E [~ [[~ [p21<=p148] | ~ [p60<=p221]]] U [E [true U ~ [p207<=p67]] & ~ [[~ [p21<=p148] | ~ [p60<=p221]]]]]]]]]]
abstracting: (p60<=p221)
states: 240,100,000,001 (11)
abstracting: (p21<=p148)
states: 240,100,000,001 (11)
abstracting: (p207<=p67)
states: 24,010,000,001 (10)
abstracting: (p60<=p221)
states: 240,100,000,001 (11)
abstracting: (p21<=p148)
states: 240,100,000,001 (11)
abstracting: (p60<=p221)
states: 240,100,000,001 (11)
abstracting: (p21<=p148)
states: 240,100,000,001 (11)
EG iterations: 0
.
EG iterations: 0
-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.288sec
checking: EX [~ [AX [EG [[A [p200<=1 U p87<=p199] | [p68<=p136 | p77<=p16]]]]]]
normalized: EX [EX [~ [EG [[[p68<=p136 | p77<=p16] | [~ [EG [~ [p87<=p199]]] & ~ [E [~ [p87<=p199] U [~ [p200<=1] & ~ [p87<=p199]]]]]]]]]]
abstracting: (p87<=p199)
states: 240,100,000,001 (11)
abstracting: (p200<=1)
states: 240,100,000,001 (11)
abstracting: (p87<=p199)
states: 240,100,000,001 (11)
abstracting: (p87<=p199)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p77<=p16)
states: 219,520,000,001 (11)
abstracting: (p68<=p136)
states: 240,100,000,001 (11)
EG iterations: 0
..-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.243sec
checking: ~ [[EG [~ [E [[AG [p98<=0] | [1<=p59 | 1<=p99]] U E [1<=p181 U p54<=0]]]] | AG [EF [[[EX [p189<=1] | ~ [p90<=1]] & EG [1<=p124]]]]]]
normalized: ~ [[~ [E [true U ~ [E [true U [EG [1<=p124] & [~ [p90<=1] | EX [p189<=1]]]]]]] | EG [~ [E [[[1<=p59 | 1<=p99] | ~ [E [true U ~ [p98<=0]]]] U E [1<=p181 U p54<=0]]]]]]
abstracting: (p54<=0)
states: 216,090,000,001 (11)
abstracting: (1<=p181)
states: 240,100,000,000 (11)
abstracting: (p98<=0)
states: 216,090,000,001 (11)
abstracting: (1<=p99)
states: 24,010,000,000 (10)
abstracting: (1<=p59)
states: 24,010,000,000 (10)
.
EG iterations: 1
abstracting: (p189<=1)
states: 240,100,000,001 (11)
.abstracting: (p90<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p124)
states: 240,100,000,000 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.837sec
checking: ~ [A [EF [~ [[~ [EG [p109<=1]] | [AF [p127<=p168] & EF [p77<=0]]]]] U [EF [AG [A [1<=p73 U 1<=p78]]] | AG [A [AF [1<=p132] U ~ [1<=p45]]]]]]
normalized: ~ [[~ [EG [~ [[~ [E [true U ~ [[~ [EG [1<=p45]] & ~ [E [1<=p45 U [1<=p45 & EG [~ [1<=p132]]]]]]]]] | E [true U ~ [E [true U ~ [[~ [EG [~ [1<=p78]]] & ~ [E [~ [1<=p78] U [~ [1<=p73] & ~ [1<=p78]]]]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[~ [EG [1<=p45]] & ~ [E [1<=p45 U [1<=p45 & EG [~ [1<=p132]]]]]]]]] | E [true U ~ [E [true U ~ [[~ [EG [~ [1<=p78]]] & ~ [E [~ [1<=p78] U [~ [1<=p73] & ~ [1<=p78]]]]]]]]]]] U [~ [E [true U ~ [[[E [true U p77<=0] & ~ [EG [~ [p127<=p168]]]] | ~ [EG [p109<=1]]]]]] & ~ [[~ [E [true U ~ [[~ [EG [1<=p45]] & ~ [E [1<=p45 U [1<=p45 & EG [~ [1<=p132]]]]]]]]] | E [true U ~ [E [true U ~ [[~ [EG [~ [1<=p78]]] & ~ [E [~ [1<=p78] U [~ [1<=p73] & ~ [1<=p78]]]]]]]]]]]]]]]]
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p73)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
..
EG iterations: 2
abstracting: (1<=p132)
states: 240,100,000,000 (11)
..
EG iterations: 2
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
.
EG iterations: 1
abstracting: (p109<=1)
states: 240,100,000,001 (11)
EG iterations: 0
abstracting: (p127<=p168)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p77<=0)
states: 216,090,000,001 (11)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p73)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
..
EG iterations: 2
abstracting: (1<=p132)
states: 240,100,000,000 (11)
..
EG iterations: 2
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
.
EG iterations: 1
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p73)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
abstracting: (1<=p78)
states: 24,010,000,000 (10)
..
EG iterations: 2
abstracting: (1<=p132)
states: 240,100,000,000 (11)
..
EG iterations: 2
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
abstracting: (1<=p45)
states: 24,010,000,000 (10)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.167sec
checking: EF [[[A [[AG [p165<=1] & A [1<=p75 U p90<=1]] U [AF [p214<=1] | 1<=p150]] & EG [EX [[p30<=p88 | p224<=0]]]] & ~ [p209<=p61]]]
normalized: E [true U [~ [p209<=p61] & [EG [EX [[p30<=p88 | p224<=0]]] & [~ [EG [~ [[1<=p150 | ~ [EG [~ [p214<=1]]]]]]] & ~ [E [~ [[1<=p150 | ~ [EG [~ [p214<=1]]]]] U [~ [[[~ [EG [~ [p90<=1]]] & ~ [E [~ [p90<=1] U [~ [1<=p75] & ~ [p90<=1]]]]] & ~ [E [true U ~ [p165<=1]]]]] & ~ [[1<=p150 | ~ [EG [~ [p214<=1]]]]]]]]]]]]
abstracting: (p214<=1)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p150)
states: 240,100,000,000 (11)
abstracting: (p165<=1)
states: 240,100,000,001 (11)
abstracting: (p90<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p75)
states: 24,010,000,000 (10)
abstracting: (p90<=1)
states: 240,100,000,001 (11)
abstracting: (p90<=1)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p214<=1)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p150)
states: 240,100,000,000 (11)
abstracting: (p214<=1)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p150)
states: 240,100,000,000 (11)
.
EG iterations: 1
abstracting: (p224<=0)
states: 1
abstracting: (p30<=p88)
states: 218,491,000,001 (11)
.
EG iterations: 0
abstracting: (p209<=p61)
states: 24,010,000,001 (10)
-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.517sec
checking: ~ [EX [E [[[AX [p113<=1] | p109<=0] | [~ [AG [p72<=p73]] & E [p160<=p175 U p177<=p158]]] U ~ [A [E [p115<=0 U 1<=p165] U EX [p204<=p192]]]]]]
normalized: ~ [EX [E [[[E [p160<=p175 U p177<=p158] & E [true U ~ [p72<=p73]]] | [p109<=0 | ~ [EX [~ [p113<=1]]]]] U ~ [[~ [EG [~ [EX [p204<=p192]]]] & ~ [E [~ [EX [p204<=p192]] U [~ [E [p115<=0 U 1<=p165]] & ~ [EX [p204<=p192]]]]]]]]]]
abstracting: (p204<=p192)
states: 240,100,000,001 (11)
.abstracting: (1<=p165)
states: 240,100,000,000 (11)
abstracting: (p115<=0)
states: 1
abstracting: (p204<=p192)
states: 240,100,000,001 (11)
.abstracting: (p204<=p192)
states: 240,100,000,001 (11)
..
EG iterations: 1
abstracting: (p113<=1)
states: 240,100,000,001 (11)
.abstracting: (p109<=0)
states: 1
abstracting: (p72<=p73)
states: 216,090,000,001 (11)
abstracting: (p177<=p158)
states: 240,100,000,001 (11)
abstracting: (p160<=p175)
states: 240,100,000,001 (11)
.-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.813sec
checking: ~ [[[[~ [AF [AF [p151<=p224]]] & EX [[1<=p148 & [p113<=0 & ~ [1<=p60]]]]] | AF [EF [EG [1<=p142]]]] & AG [[EX [AX [p40<=1]] | [~ [A [1<=p90 U p150<=p126]] | p0<=p137]]]]]
normalized: ~ [[~ [E [true U ~ [[[p0<=p137 | ~ [[~ [EG [~ [p150<=p126]]] & ~ [E [~ [p150<=p126] U [~ [1<=p90] & ~ [p150<=p126]]]]]]] | EX [~ [EX [~ [p40<=1]]]]]]]] & [~ [EG [~ [E [true U EG [1<=p142]]]]] | [EX [[1<=p148 & [p113<=0 & ~ [1<=p60]]]] & EG [EG [~ [p151<=p224]]]]]]]
abstracting: (p151<=p224)
states: 240,100,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p60)
states: 24,010,000,000 (10)
abstracting: (p113<=0)
states: 1
abstracting: (1<=p148)
states: 240,100,000,000 (11)
.abstracting: (1<=p142)
states: 240,100,000,000 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p40<=1)
states: 240,100,000,001 (11)
..abstracting: (p150<=p126)
states: 240,100,000,001 (11)
abstracting: (1<=p90)
states: 24,010,000,000 (10)
abstracting: (p150<=p126)
states: 240,100,000,001 (11)
abstracting: (p150<=p126)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p0<=p137)
states: 240,100,000,000 (11)
-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.240sec
checking: [AF [AX [A [[EX [1<=p220] & E [p141<=1 U p11<=p110]] U ~ [[1<=p220 & p62<=p15]]]]] | [AG [p59<=1] & AX [AF [~ [[~ [p122<=p150] | [p1<=1 & p210<=0]]]]]]]
normalized: [[~ [EX [EG [[[p1<=1 & p210<=0] | ~ [p122<=p150]]]]] & ~ [E [true U ~ [p59<=1]]]] | ~ [EG [EX [~ [[~ [EG [[1<=p220 & p62<=p15]]] & ~ [E [[1<=p220 & p62<=p15] U [~ [[E [p141<=1 U p11<=p110] & EX [1<=p220]]] & [1<=p220 & p62<=p15]]]]]]]]]]
abstracting: (p62<=p15)
states: 219,520,000,001 (11)
abstracting: (1<=p220)
states: 240,100,000,000 (11)
abstracting: (1<=p220)
states: 240,100,000,000 (11)
.abstracting: (p11<=p110)
states: 240,100,000,001 (11)
abstracting: (p141<=1)
states: 240,100,000,001 (11)
abstracting: (p62<=p15)
states: 219,520,000,001 (11)
abstracting: (1<=p220)
states: 240,100,000,000 (11)
abstracting: (p62<=p15)
states: 219,520,000,001 (11)
abstracting: (1<=p220)
states: 240,100,000,000 (11)
.
EG iterations: 1
.
EG iterations: 0
abstracting: (p59<=1)
states: 240,100,000,001 (11)
abstracting: (p122<=p150)
states: 240,100,000,001 (11)
abstracting: (p210<=0)
states: 1
abstracting: (p1<=1)
states: 240,100,000,001 (11)
..
EG iterations: 2
.-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.329sec
checking: AF [[p152<=p228 & [[EF [[[p201<=0 & p187<=0] & E [p118<=1 U 1<=p131]]] & ~ [[[A [1<=p24 U p9<=p70] | 1<=p185] & AF [p68<=p90]]]] & 1<=p120]]]
normalized: ~ [EG [~ [[p152<=p228 & [1<=p120 & [~ [[~ [EG [~ [p68<=p90]]] & [1<=p185 | [~ [EG [~ [p9<=p70]]] & ~ [E [~ [p9<=p70] U [~ [1<=p24] & ~ [p9<=p70]]]]]]]] & E [true U [E [p118<=1 U 1<=p131] & [p201<=0 & p187<=0]]]]]]]]]
abstracting: (p187<=0)
states: 1
abstracting: (p201<=0)
states: 1
abstracting: (1<=p131)
states: 240,100,000,000 (11)
abstracting: (p118<=1)
states: 240,100,000,001 (11)
abstracting: (p9<=p70)
states: 209,230,000,001 (11)
abstracting: (1<=p24)
states: 34,300,000,000 (10)
abstracting: (p9<=p70)
states: 209,230,000,001 (11)
abstracting: (p9<=p70)
states: 209,230,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p185)
states: 240,100,000,000 (11)
abstracting: (p68<=p90)
states: 218,491,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p120)
states: 240,100,000,000 (11)
abstracting: (p152<=p228)
states: 240,100,000,001 (11)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.323sec
checking: [EX [[[1<=p105 | [EF [AX [p189<=p56]] | AG [[1<=p13 | p49<=p68]]]] | p141<=1]] & EG [[EX [AX [[p79<=1 | p116<=1]]] & [p75<=p173 & AX [[~ [p201<=0] & EF [1<=p49]]]]]]]
normalized: [EG [[[p75<=p173 & ~ [EX [~ [[E [true U 1<=p49] & ~ [p201<=0]]]]]] & EX [~ [EX [~ [[p79<=1 | p116<=1]]]]]]] & EX [[p141<=1 | [1<=p105 | [~ [E [true U ~ [[1<=p13 | p49<=p68]]]] | E [true U ~ [EX [~ [p189<=p56]]]]]]]]]
abstracting: (p189<=p56)
states: 24,010,000,001 (10)
.abstracting: (p49<=p68)
states: 218,491,000,001 (11)
abstracting: (1<=p13)
states: 34,300,000,000 (10)
abstracting: (1<=p105)
states: 24,010,000,000 (10)
abstracting: (p141<=1)
states: 240,100,000,001 (11)
.abstracting: (p116<=1)
states: 240,100,000,001 (11)
abstracting: (p79<=1)
states: 240,100,000,001 (11)
..abstracting: (p201<=0)
states: 1
abstracting: (1<=p49)
states: 24,010,000,000 (10)
.abstracting: (p75<=p173)
states: 240,100,000,001 (11)
EG iterations: 0
-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.344sec
checking: EF [[[[EF [~ [[1<=p189 | p187<=p80]]] | A [[[p196<=1 & 1<=p217] & A [1<=p146 U 1<=p1]] U AX [p176<=p30]]] & [1<=p148 | A [EX [p224<=p140] U p152<=p116]]] & p120<=0]]
normalized: E [true U [p120<=0 & [[1<=p148 | [~ [EG [~ [p152<=p116]]] & ~ [E [~ [p152<=p116] U [~ [EX [p224<=p140]] & ~ [p152<=p116]]]]]] & [[~ [EG [EX [~ [p176<=p30]]]] & ~ [E [EX [~ [p176<=p30]] U [~ [[[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p146] & ~ [1<=p1]]]]] & [p196<=1 & 1<=p217]]] & EX [~ [p176<=p30]]]]]] | E [true U ~ [[1<=p189 | p187<=p80]]]]]]]
abstracting: (p187<=p80)
states: 24,010,000,001 (10)
abstracting: (1<=p189)
states: 240,100,000,000 (11)
abstracting: (p176<=p30)
states: 24,010,000,001 (10)
.abstracting: (1<=p217)
states: 240,100,000,000 (11)
abstracting: (p196<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p1)
states: 34,300,000,000 (10)
abstracting: (1<=p146)
states: 240,100,000,000 (11)
abstracting: (1<=p1)
states: 34,300,000,000 (10)
abstracting: (1<=p1)
states: 34,300,000,000 (10)
.
EG iterations: 1
abstracting: (p176<=p30)
states: 24,010,000,001 (10)
.abstracting: (p176<=p30)
states: 24,010,000,001 (10)
.
EG iterations: 0
abstracting: (p152<=p116)
states: 240,100,000,001 (11)
abstracting: (p224<=p140)
states: 240,100,000,001 (11)
.abstracting: (p152<=p116)
states: 240,100,000,001 (11)
abstracting: (p152<=p116)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p148)
states: 240,100,000,000 (11)
abstracting: (p120<=0)
states: 1
-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.987sec
checking: ~ [[[A [[p137<=p154 & ~ [[p221<=0 & EG [1<=p89]]]] U p87<=1] & A [1<=p51 U A [p125<=1 U AG [p185<=p163]]]] | E [~ [E [E [p143<=p80 U p74<=0] U ~ [AF [1<=p26]]]] U E [EF [EG [p179<=p21]] U ~ [EF [1<=p194]]]]]]
normalized: ~ [[E [~ [E [E [p143<=p80 U p74<=0] U EG [~ [1<=p26]]]] U E [E [true U EG [p179<=p21]] U ~ [E [true U 1<=p194]]]] | [[~ [EG [~ [[~ [EG [E [true U ~ [p185<=p163]]]] & ~ [E [E [true U ~ [p185<=p163]] U [~ [p125<=1] & E [true U ~ [p185<=p163]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [p185<=p163]]]] & ~ [E [E [true U ~ [p185<=p163]] U [~ [p125<=1] & E [true U ~ [p185<=p163]]]]]]] U [~ [1<=p51] & ~ [[~ [EG [E [true U ~ [p185<=p163]]]] & ~ [E [E [true U ~ [p185<=p163]] U [~ [p125<=1] & E [true U ~ [p185<=p163]]]]]]]]]]] & [~ [EG [~ [p87<=1]]] & ~ [E [~ [p87<=1] U [~ [[p137<=p154 & ~ [[p221<=0 & EG [1<=p89]]]]] & ~ [p87<=1]]]]]]]]
abstracting: (p87<=1)
states: 240,100,000,001 (11)
abstracting: (1<=p89)
states: 24,010,000,000 (10)
.
EG iterations: 1
abstracting: (p221<=0)
states: 1
abstracting: (p137<=p154)
states: 240,100,000,001 (11)
abstracting: (p87<=1)
states: 240,100,000,001 (11)
abstracting: (p87<=1)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p125<=1)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (1<=p51)
states: 24,010,000,000 (10)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p125<=1)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
.
EG iterations: 1
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p125<=1)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
abstracting: (p185<=p163)
states: 240,100,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p194)
states: 240,100,000,000 (11)
abstracting: (p179<=p21)
states: 34,300,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p26)
states: 34,300,000,000 (10)
.
EG iterations: 1
abstracting: (p74<=0)
states: 216,090,000,001 (11)
abstracting: (p143<=p80)
states: 24,010,000,001 (10)
-> the formula is FALSE
FORMULA DLCround-PT-07a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m45.688sec
checking: EF [[[EF [[p191<=1 & AG [p217<=1]]] | ~ [[EF [A [p223<=0 U p24<=p47]] | [[AF [p37<=0] | p12<=0] | p13<=0]]]] & [[[A [~ [1<=p122] U EF [p223<=p27]] | [[EF [1<=p104] & [p110<=p53 & p130<=p79]] | [AG [1<=p150] | [1<=p98 | p84<=p15]]]] | AF [A [1<=p135 U p62<=p178]]] & [E [EF [p182<=0] U [[p184<=p26 & 1<=p189] & [p21<=p19 | p29<=p170]]] | p98<=p35]]]]
normalized: E [true U [[[p98<=p35 | E [E [true U p182<=0] U [[p21<=p19 | p29<=p170] & [p184<=p26 & 1<=p189]]]] & [~ [EG [~ [[~ [EG [~ [p62<=p178]]] & ~ [E [~ [p62<=p178] U [~ [1<=p135] & ~ [p62<=p178]]]]]]]] | [[[[1<=p98 | p84<=p15] | ~ [E [true U ~ [1<=p150]]]] | [[p110<=p53 & p130<=p79] & E [true U 1<=p104]]] | [~ [EG [~ [E [true U p223<=p27]]]] & ~ [E [~ [E [true U p223<=p27]] U [1<=p122 & ~ [E [true U p223<=p27]]]]]]]]] & [~ [[[p13<=0 | [p12<=0 | ~ [EG [~ [p37<=0]]]]] | E [true U [~ [EG [~ [p24<=p47]]] & ~ [E [~ [p24<=p47] U [~ [p223<=0] & ~ [p24<=p47]]]]]]]] | E [true U [p191<=1 & ~ [E [true U ~ [p217<=1]]]]]]]]
abstracting: (p217<=1)
states: 240,100,000,001 (11)
abstracting: (p191<=1)
states: 240,100,000,001 (11)
abstracting: (p24<=p47)
states: 209,230,000,001 (11)
abstracting: (p223<=0)
states: 1
abstracting: (p24<=p47)
states: 209,230,000,001 (11)
abstracting: (p24<=p47)
states: 209,230,000,001 (11)
.
EG iterations: 1
abstracting: (p37<=0)
states: 216,090,000,001 (11)
.
EG iterations: 1
abstracting: (p12<=0)
states: 205,800,000,001 (11)
abstracting: (p13<=0)
states: 205,800,000,001 (11)
abstracting: (p223<=p27)
states: 34,300,000,001 (10)
abstracting: (1<=p122)
states: 240,100,000,000 (11)
abstracting: (p223<=p27)
states: 34,300,000,001 (10)
abstracting: (p223<=p27)
states: 34,300,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p104)
states: 24,010,000,000 (10)
abstracting: (p130<=p79)
states: 24,010,000,001 (10)
abstracting: (p110<=p53)
states: 24,010,000,001 (10)
abstracting: (1<=p150)
states: 240,100,000,000 (11)
abstracting: (p84<=p15)
states: 219,520,000,001 (11)
abstracting: (1<=p98)
states: 24,010,000,000 (10)
abstracting: (p62<=p178)
states: 240,100,000,001 (11)
abstracting: (1<=p135)
states: 240,100,000,000 (11)
abstracting: (p62<=p178)
states: 240,100,000,001 (11)
abstracting: (p62<=p178)
states: 240,100,000,001 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p189)
states: 240,100,000,000 (11)
abstracting: (p184<=p26)
states: 34,300,000,001 (10)
abstracting: (p29<=p170)
states: 240,100,000,001 (11)
abstracting: (p21<=p19)
states: 205,800,000,001 (11)
abstracting: (p182<=0)
states: 1
abstracting: (p98<=p35)
states: 218,491,000,001 (11)
-> the formula is TRUE
FORMULA DLCround-PT-07a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m53.356sec
totally nodes used: 5558240 (5.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 83487768 457976876 541464644
used/not used/entry size/cache size: 66960832 148032 16 1024MB
basic ops cache: hits/miss/sum: 2790677 8795668 11586345
used/not used/entry size/cache size: 8577879 8199337 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: 193094 1020489 1213583
used/not used/entry size/cache size: 962794 7425814 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 61827325
1 5018367
2 250253
3 12332
4 564
5 23
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 3m35.415sec
BK_STOP 1678276156864
--------------------
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.012sec
iterations count:52246 (32), effective:97 (0)
initing FirstDep: 0m 0.010sec
iterations count:3160 (1), effective:1 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:6944 (4), effective:20 (0)
iterations count:3820 (2), effective:2 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1664 (1), effective:1 (0)
iterations count:9075 (5), effective:10 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:2702 (1), effective:1 (0)
iterations count:2457 (1), effective:1 (0)
iterations count:4028 (2), effective:10 (0)
iterations count:2414 (1), effective:1 (0)
iterations count:2702 (1), effective:1 (0)
iterations count:2457 (1), effective:1 (0)
iterations count:4028 (2), effective:10 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:2702 (1), effective:1 (0)
iterations count:2457 (1), effective:1 (0)
iterations count:4028 (2), effective:10 (0)
iterations count:3218 (2), effective:2 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:8825 (5), effective:10 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1832 (1), effective:1 (0)
iterations count:6804 (4), effective:12 (0)
iterations count:6101 (3), effective:10 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1810 (1), effective:1 (0)
iterations count:3160 (1), effective:1 (0)
iterations count:1803 (1), effective:6 (0)
iterations count:1855 (1), effective:1 (0)
iterations count:2039 (1), effective:1 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:3001 (1), effective:9 (0)
iterations count:3479 (2), effective:6 (0)
iterations count:3479 (2), effective:6 (0)
iterations count:3479 (2), effective:6 (0)
iterations count:8692 (5), effective:10 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:1597 (1), effective:0 (0)
iterations count:2038 (1), effective:10 (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-07a"
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-07a, 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-167814469800681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07a.tgz
mv DLCround-PT-07a 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 ;