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.r129-smll-167819404300449.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 DoubleExponent-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819404300449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 DoubleExponent-PT-002-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680000646323

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=DoubleExponent-PT-002
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: DoubleExponent_PT_002
(NrP: 110 NrTr: 98 NrArc: 276)

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

net check time: 0m 0.000sec

init dd package: 0m 3.489sec


RS generation: 0m 0.525sec


-> reachability set: #nodes 3013 (3.0e+03) #states 3,708 (3)



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

checking: ~ [AF [1<=p52]]
normalized: EG [~ [1<=p52]]

abstracting: (1<=p52)
states: 184
...
EG iterations: 3
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.154sec

checking: E [p48<=0 U ~ [p83<=0]]
normalized: E [p48<=0 U ~ [p83<=0]]

abstracting: (p83<=0)
states: 1,240 (3)
abstracting: (p48<=0)
states: 3,567 (3)
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [~ [AX [EG [E [p47<=0 U p19<=p87]]]]]
normalized: E [true U EX [~ [EG [E [p47<=0 U p19<=p87]]]]]

abstracting: (p19<=p87)
states: 3,704 (3)
abstracting: (p47<=0)
states: 3,665 (3)

EG iterations: 0
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AX [E [p48<=0 U ~ [EF [A [1<=p30 U p33<=p3]]]]]
normalized: ~ [EX [~ [E [p48<=0 U ~ [E [true U [~ [EG [~ [p33<=p3]]] & ~ [E [~ [p33<=p3] U [~ [1<=p30] & ~ [p33<=p3]]]]]]]]]]]

abstracting: (p33<=p3)
states: 3,567 (3)
abstracting: (1<=p30)
states: 67
abstracting: (p33<=p3)
states: 3,567 (3)
abstracting: (p33<=p3)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (p48<=0)
states: 3,567 (3)
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [~ [[AX [1<=p48] & EG [~ [[~ [p49<=p76] & ~ [1<=p68]]]]]]]
normalized: EG [~ [[EG [~ [[~ [1<=p68] & ~ [p49<=p76]]]] & ~ [EX [~ [1<=p48]]]]]]

abstracting: (1<=p48)
states: 141
.abstracting: (p49<=p76)
states: 3,702 (3)
abstracting: (1<=p68)
states: 16
......
EG iterations: 6
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 886
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.473sec

checking: EG [~ [EX [AG [[[1<=p32 & p22<=p89] & A [p1<=p47 U 1<=p13]]]]]]
normalized: EG [~ [EX [~ [E [true U ~ [[[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [1<=p13] & ~ [p1<=p47]]]]] & [1<=p32 & p22<=p89]]]]]]]]

abstracting: (p22<=p89)
states: 3,634 (3)
abstracting: (1<=p32)
states: 141
abstracting: (p1<=p47)
states: 3,707 (3)
abstracting: (1<=p13)
states: 3,533 (3)
abstracting: (1<=p13)
states: 3,533 (3)
abstracting: (1<=p13)
states: 3,533 (3)
....
EG iterations: 4
.
EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AF [[EG [[[1<=p17 & AF [1<=p59]] & [p10<=1 & ~ [p83<=p3]]]] & p39<=p108]]
normalized: ~ [EG [~ [[p39<=p108 & EG [[[p10<=1 & ~ [p83<=p3]] & [1<=p17 & ~ [EG [~ [1<=p59]]]]]]]]]]

abstracting: (1<=p59)
states: 1,488 (3)
............
EG iterations: 12
abstracting: (1<=p17)
states: 4
abstracting: (p83<=p3)
states: 1,240 (3)
abstracting: (p10<=1)
states: 1,532 (3)
.
EG iterations: 1
abstracting: (p39<=p108)
states: 3,706 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [A [p37<=p2 U [~ [EG [[p95<=1 | p45<=p109]]] & A [~ [EX [p43<=1]] U A [p91<=1 U p41<=p75]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[~ [EG [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]] & ~ [E [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]] U [EX [p43<=1] & ~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]]]] & ~ [EG [[p95<=1 | p45<=p109]]]]]]] & ~ [E [~ [[[~ [EG [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]] & ~ [E [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]] U [EX [p43<=1] & ~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]]]] & ~ [EG [[p95<=1 | p45<=p109]]]]] U [~ [p37<=p2] & ~ [[[~ [EG [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]] & ~ [E [~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]] U [EX [p43<=1] & ~ [[~ [EG [~ [p41<=p75]]] & ~ [E [~ [p41<=p75] U [~ [p91<=1] & ~ [p41<=p75]]]]]]]]]] & ~ [EG [[p95<=1 | p45<=p109]]]]]]]]]]]]

abstracting: (p45<=p109)
states: 3,705 (3)
abstracting: (p95<=1)
states: 3,708 (3)

EG iterations: 0
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p43<=1)
states: 3,708 (3)
.abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p37<=p2)
states: 3,671 (3)
abstracting: (p45<=p109)
states: 3,705 (3)
abstracting: (p95<=1)
states: 3,708 (3)

EG iterations: 0
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p43<=1)
states: 3,708 (3)
.abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p45<=p109)
states: 3,705 (3)
abstracting: (p95<=1)
states: 3,708 (3)

EG iterations: 0
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p43<=1)
states: 3,708 (3)
.abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p91<=1)
states: 3,708 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
abstracting: (p41<=p75)
states: 3,677 (3)
..
EG iterations: 2
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

checking: AF [EG [[AG [[[p9<=0 & p51<=p50] & [p26<=p52 | p35<=p52]]] & ~ [EG [[p44<=1 & p78<=1]]]]]]
normalized: ~ [EG [~ [EG [[~ [EG [[p44<=1 & p78<=1]]] & ~ [E [true U ~ [[[p26<=p52 | p35<=p52] & [p9<=0 & p51<=p50]]]]]]]]]]

abstracting: (p51<=p50)
states: 3,524 (3)
abstracting: (p9<=0)
states: 903
abstracting: (p35<=p52)
states: 3,567 (3)
abstracting: (p26<=p52)
states: 3,604 (3)
abstracting: (p78<=1)
states: 3,708 (3)
abstracting: (p44<=1)
states: 3,708 (3)

EG iterations: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: ~ [[A [1<=p49 U EG [AF [~ [p98<=0]]]] & AF [~ [[[EG [p84<=1] & [~ [p68<=p98] & AX [p77<=p58]]] & ~ [[EX [p20<=0] | p87<=p89]]]]]]]
normalized: ~ [[~ [EG [[~ [[p87<=p89 | EX [p20<=0]]] & [[~ [EX [~ [p77<=p58]]] & ~ [p68<=p98]] & EG [p84<=1]]]]] & [~ [EG [~ [EG [~ [EG [p98<=0]]]]]] & ~ [E [~ [EG [~ [EG [p98<=0]]]] U [~ [1<=p49] & ~ [EG [~ [EG [p98<=0]]]]]]]]]]

abstracting: (p98<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6
abstracting: (1<=p49)
states: 6
abstracting: (p98<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6
abstracting: (p98<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6

EG iterations: 0
abstracting: (p84<=1)
states: 3,708 (3)

EG iterations: 0
abstracting: (p68<=p98)
states: 3,692 (3)
abstracting: (p77<=p58)
states: 3,708 (3)
.abstracting: (p20<=0)
states: 3,704 (3)
.abstracting: (p87<=p89)
states: 3,704 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.158sec

checking: EG [[AF [[EX [EG [p25<=p91]] & 1<=p79]] | EG [[[[[1<=p64 & p18<=p17] & AX [1<=p106]] | [1<=p68 | AF [p13<=1]]] & A [p55<=p19 U 1<=p66]]]]]
normalized: EG [[EG [[[~ [EG [~ [1<=p66]]] & ~ [E [~ [1<=p66] U [~ [p55<=p19] & ~ [1<=p66]]]]] & [[1<=p68 | ~ [EG [~ [p13<=1]]]] | [~ [EX [~ [1<=p106]]] & [1<=p64 & p18<=p17]]]]] | ~ [EG [~ [[1<=p79 & EX [EG [p25<=p91]]]]]]]]

abstracting: (p25<=p91)
states: 3,707 (3)
.......
EG iterations: 7
.abstracting: (1<=p79)
states: 40
..
EG iterations: 2
abstracting: (p18<=p17)
states: 3,704 (3)
abstracting: (1<=p64)
states: 16
abstracting: (1<=p106)
states: 535
.abstracting: (p13<=1)
states: 957
.....
EG iterations: 5
abstracting: (1<=p68)
states: 16
abstracting: (1<=p66)
states: 16
abstracting: (p55<=p19)
states: 735
abstracting: (1<=p66)
states: 16
abstracting: (1<=p66)
states: 16
.............
EG iterations: 13
.
EG iterations: 1
...
EG iterations: 3
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.325sec

checking: A [p3<=1 U A [[~ [E [[p36<=0 | p9<=1] U EG [p40<=p66]]] | [[[[p85<=0 | p98<=p63] | EF [p27<=1]] | EX [p22<=p96]] | [EF [p16<=p63] | p61<=1]]] U A [p95<=1 U ~ [AX [p102<=1]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]] U [~ [[[[p61<=1 | E [true U p16<=p63]] | [EX [p22<=p96] | [E [true U p27<=1] | [p85<=0 | p98<=p63]]]] | ~ [E [[p36<=0 | p9<=1] U EG [p40<=p66]]]]] & ~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]] U [~ [[[[p61<=1 | E [true U p16<=p63]] | [EX [p22<=p96] | [E [true U p27<=1] | [p85<=0 | p98<=p63]]]] | ~ [E [[p36<=0 | p9<=1] U EG [p40<=p66]]]]] & ~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]]]]] U [~ [p3<=1] & ~ [[~ [EG [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]] U [~ [[[[p61<=1 | E [true U p16<=p63]] | [EX [p22<=p96] | [E [true U p27<=1] | [p85<=0 | p98<=p63]]]] | ~ [E [[p36<=0 | p9<=1] U EG [p40<=p66]]]]] & ~ [[~ [EG [~ [EX [~ [p102<=1]]]]] & ~ [E [~ [EX [~ [p102<=1]]] U [~ [p95<=1] & ~ [EX [~ [p102<=1]]]]]]]]]]]]]]]]]

abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p40<=p66)
states: 3,671 (3)
.
EG iterations: 1
abstracting: (p9<=1)
states: 3,129 (3)
abstracting: (p36<=0)
states: 3,211 (3)
abstracting: (p98<=p63)
states: 3,628 (3)
abstracting: (p85<=0)
states: 3,704 (3)
abstracting: (p27<=1)
states: 3,708 (3)
abstracting: (p22<=p96)
states: 3,634 (3)
.abstracting: (p16<=p63)
states: 3,704 (3)
abstracting: (p61<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0

EG iterations: 0
abstracting: (p3<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p40<=p66)
states: 3,671 (3)
.
EG iterations: 1
abstracting: (p9<=1)
states: 3,129 (3)
abstracting: (p36<=0)
states: 3,211 (3)
abstracting: (p98<=p63)
states: 3,628 (3)
abstracting: (p85<=0)
states: 3,704 (3)
abstracting: (p27<=1)
states: 3,708 (3)
abstracting: (p22<=p96)
states: 3,634 (3)
.abstracting: (p16<=p63)
states: 3,704 (3)
abstracting: (p61<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0

EG iterations: 0
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p40<=p66)
states: 3,671 (3)
.
EG iterations: 1
abstracting: (p9<=1)
states: 3,129 (3)
abstracting: (p36<=0)
states: 3,211 (3)
abstracting: (p98<=p63)
states: 3,628 (3)
abstracting: (p85<=0)
states: 3,704 (3)
abstracting: (p27<=1)
states: 3,708 (3)
abstracting: (p22<=p96)
states: 3,634 (3)
.abstracting: (p16<=p63)
states: 3,704 (3)
abstracting: (p61<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p95<=1)
states: 3,708 (3)
abstracting: (p102<=1)
states: 3,708 (3)
.abstracting: (p102<=1)
states: 3,708 (3)
.
EG iterations: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AF [~ [[[EX [[[p87<=1 & p81<=p101] & [p16<=p66 & p91<=p57]]] | [[AX [p40<=0] & [[p3<=0 | p103<=p105] & [1<=p34 & p68<=1]]] | EF [[p109<=0 & p22<=1]]]] & AF [p110<=p79]]]]
normalized: ~ [EG [[~ [EG [~ [p110<=p79]]] & [[E [true U [p109<=0 & p22<=1]] | [[[1<=p34 & p68<=1] & [p3<=0 | p103<=p105]] & ~ [EX [~ [p40<=0]]]]] | EX [[[p16<=p66 & p91<=p57] & [p87<=1 & p81<=p101]]]]]]]

abstracting: (p81<=p101)
states: 3,668 (3)
abstracting: (p87<=1)
states: 3,708 (3)
abstracting: (p91<=p57)
states: 3,708 (3)
abstracting: (p16<=p66)
states: 3,704 (3)
.abstracting: (p40<=0)
states: 3,671 (3)
.abstracting: (p103<=p105)
states: 3,608 (3)
abstracting: (p3<=0)
states: 3,707 (3)
abstracting: (p68<=1)
states: 3,708 (3)
abstracting: (1<=p34)
states: 141
abstracting: (p22<=1)
states: 3,708 (3)
abstracting: (p109<=0)
states: 155
abstracting: (p110<=p79)
states: 157
..
EG iterations: 2
...............
EG iterations: 15
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: AG [[[[[EG [[1<=p35 | p91<=0]] | [AF [1<=p2] | AX [p19<=p89]]] & p64<=1] | [[[EF [p60<=0] & EX [p110<=p30]] | E [AF [p49<=0] U p31<=p103]] | EF [E [1<=p8 U 1<=p99]]]] & EG [E [[EX [p72<=p19] | ~ [p30<=1]] U p44<=0]]]]
normalized: ~ [E [true U ~ [[EG [E [[~ [p30<=1] | EX [p72<=p19]] U p44<=0]] & [[E [true U E [1<=p8 U 1<=p99]] | [E [~ [EG [~ [p49<=0]]] U p31<=p103] | [EX [p110<=p30] & E [true U p60<=0]]]] | [p64<=1 & [[~ [EX [~ [p19<=p89]]] | ~ [EG [~ [1<=p2]]]] | EG [[1<=p35 | p91<=0]]]]]]]]]

abstracting: (p91<=0)
states: 3,698 (3)
abstracting: (1<=p35)
states: 141
..
EG iterations: 2
abstracting: (1<=p2)
states: 1
..
EG iterations: 2
abstracting: (p19<=p89)
states: 3,704 (3)
.abstracting: (p64<=1)
states: 3,708 (3)
abstracting: (p60<=0)
states: 1,908 (3)
abstracting: (p110<=p30)
states: 157
.abstracting: (p31<=p103)
states: 3,463 (3)
abstracting: (p49<=0)
states: 3,702 (3)
..
EG iterations: 2
abstracting: (1<=p99)
states: 145
abstracting: (1<=p8)
states: 3,060 (3)
abstracting: (p44<=0)
states: 3,665 (3)
abstracting: (p72<=p19)
states: 3,707 (3)
.abstracting: (p30<=1)
states: 3,708 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.338sec

checking: [[A [E [AG [EG [p73<=1]] U [1<=p73 | p88<=1]] U 1<=p76] & AX [EF [EG [[p41<=1 | p101<=p67]]]]] & E [EX [E [[1<=p62 | p68<=1] U [[p12<=p69 | p68<=p12] & EF [1<=p105]]]] U [[[1<=p57 & ~ [EG [p62<=0]]] | p66<=0] & EG [EX [~ [p39<=0]]]]]]
normalized: [E [EX [E [[1<=p62 | p68<=1] U [E [true U 1<=p105] & [p12<=p69 | p68<=p12]]]] U [EG [EX [~ [p39<=0]]] & [p66<=0 | [1<=p57 & ~ [EG [p62<=0]]]]]] & [~ [EX [~ [E [true U EG [[p41<=1 | p101<=p67]]]]]] & [~ [EG [~ [1<=p76]]] & ~ [E [~ [1<=p76] U [~ [E [~ [E [true U ~ [EG [p73<=1]]]] U [1<=p73 | p88<=1]]] & ~ [1<=p76]]]]]]]

abstracting: (1<=p76)
states: 12
abstracting: (p88<=1)
states: 3,708 (3)
abstracting: (1<=p73)
states: 16
abstracting: (p73<=1)
states: 3,708 (3)

EG iterations: 0
abstracting: (1<=p76)
states: 12
abstracting: (1<=p76)
states: 12
..
EG iterations: 2
abstracting: (p101<=p67)
states: 3,563 (3)
abstracting: (p41<=1)
states: 3,708 (3)

EG iterations: 0
.abstracting: (p62<=0)
states: 3,704 (3)
.........
EG iterations: 9
abstracting: (1<=p57)
states: 3,654 (3)
abstracting: (p66<=0)
states: 3,692 (3)
abstracting: (p39<=0)
states: 3,671 (3)
...
EG iterations: 2
abstracting: (p68<=p12)
states: 3,692 (3)
abstracting: (p12<=p69)
states: 3,360 (3)
abstracting: (1<=p105)
states: 35
abstracting: (p68<=1)
states: 3,708 (3)
abstracting: (1<=p62)
states: 4
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.202sec

checking: E [E [~ [A [~ [1<=p74] U ~ [A [p64<=p103 U p35<=p99]]]] U [E [1<=p67 U AX [p4<=0]] & E [[~ [p71<=1] | AF [1<=p53]] U EG [1<=p38]]]] U AG [AF [[[EF [p2<=1] & p3<=p106] | [p69<=p110 & [p41<=p76 & p47<=p61]]]]]]
normalized: E [E [~ [[~ [EG [[~ [E [~ [p35<=p99] U [~ [p64<=p103] & ~ [p35<=p99]]]] & ~ [EG [~ [p35<=p99]]]]]] & ~ [E [[~ [E [~ [p35<=p99] U [~ [p64<=p103] & ~ [p35<=p99]]]] & ~ [EG [~ [p35<=p99]]]] U [1<=p74 & [~ [E [~ [p35<=p99] U [~ [p64<=p103] & ~ [p35<=p99]]]] & ~ [EG [~ [p35<=p99]]]]]]]]] U [E [1<=p67 U ~ [EX [~ [p4<=0]]]] & E [[~ [EG [~ [1<=p53]]] | ~ [p71<=1]] U EG [1<=p38]]]] U ~ [E [true U EG [~ [[[p3<=p106 & E [true U p2<=1]] | [p69<=p110 & [p41<=p76 & p47<=p61]]]]]]]]

abstracting: (p47<=p61)
states: 3,665 (3)
abstracting: (p41<=p76)
states: 3,677 (3)
abstracting: (p69<=p110)
states: 3,708 (3)
abstracting: (p2<=1)
states: 3,708 (3)
abstracting: (p3<=p106)
states: 3,707 (3)
.
EG iterations: 1
abstracting: (1<=p38)
states: 37
..
EG iterations: 2
abstracting: (p71<=1)
states: 3,708 (3)
abstracting: (1<=p53)
states: 43
....
EG iterations: 4
abstracting: (p4<=0)
states: 3,707 (3)
.abstracting: (1<=p67)
states: 16
abstracting: (p35<=p99)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (p35<=p99)
states: 3,567 (3)
abstracting: (p64<=p103)
states: 3,692 (3)
abstracting: (p35<=p99)
states: 3,567 (3)
abstracting: (1<=p74)
states: 16
abstracting: (p35<=p99)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (p35<=p99)
states: 3,567 (3)
abstracting: (p64<=p103)
states: 3,692 (3)
abstracting: (p35<=p99)
states: 3,567 (3)
abstracting: (p35<=p99)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (p35<=p99)
states: 3,567 (3)
abstracting: (p64<=p103)
states: 3,692 (3)
abstracting: (p35<=p99)
states: 3,567 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

totally nodes used: 2006457 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3014797 8626473 11641270
used/not used/entry size/cache size: 10430833 56678031 16 1024MB
basic ops cache: hits/miss/sum: 138570 733155 871725
used/not used/entry size/cache size: 1219656 15557560 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: 5337 27267 32604
used/not used/entry size/cache size: 27238 8361370 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 65601262
1 1174107
2 258593
3 59737
4 11155
5 1911
6 561
7 141
8 172
9 78
>= 10 1147

Total processing time: 0m11.329sec


BK_STOP 1680000657721

--------------------
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:32471 (331), effective:3707 (37)

initing FirstDep: 0m 0.000sec


iterations count:358 (3), effective:27 (0)

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

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

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

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

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

iterations count:2352 (24), effective:184 (1)

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

iterations count:929 (9), effective:56 (0)

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

iterations count:1693 (17), effective:140 (1)

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

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

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

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

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

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

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

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

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

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

iterations count:743 (7), effective:66 (0)

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

iterations count:1003 (10), effective:71 (0)

iterations count:1730 (17), effective:154 (1)

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

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

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

iterations count:2974 (30), effective:237 (2)

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

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

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

iterations count:2853 (29), effective:242 (2)

iterations count:98 (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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r129-smll-167819404300449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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