Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800358.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679351101533

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:25:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:25:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:25:07] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-20 22:25:07] [INFO ] Transformed 262 places.
[2023-03-20 22:25:07] [INFO ] Transformed 73 transitions.
[2023-03-20 22:25:07] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 72 cols
[2023-03-20 22:25:07] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-20 22:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned sat
[2023-03-20 22:25:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 31 ms returned sat
[2023-03-20 22:25:08] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1784 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SieveSingleMsgMbox_PT_d0m04
(NrP: 262 NrTr: 73 NrArc: 292)

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

net check time: 0m 0.003sec

init dd package: 0m 3.254sec


RS generation: 0m 0.026sec


-> reachability set: #nodes 1558 (1.6e+03) #states 702



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

checking: EF [2<=l140]
normalized: E [true U 2<=l140]

abstracting: (2<=l140)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [l77<=4]
normalized: ~ [E [true U ~ [l77<=4]]]

abstracting: (l77<=4)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [3<=l6]
normalized: ~ [E [true U ~ [3<=l6]]]

abstracting: (3<=l6)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AG [~ [3<=l129]]
normalized: ~ [E [true U 3<=l129]]

abstracting: (3<=l129)
states: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [l199<=l31]
normalized: E [true U l199<=l31]

abstracting: (l199<=l31)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [l59<=l37]
normalized: ~ [E [true U ~ [l59<=l37]]]

abstracting: (l59<=l37)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [l84<=l228]
normalized: ~ [E [true U ~ [l84<=l228]]]

abstracting: (l84<=l228)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[3<=l87 & 1<=l131] | ~ [l168<=l99]]]
normalized: ~ [E [true U ~ [[~ [l168<=l99] | [3<=l87 & 1<=l131]]]]]

abstracting: (1<=l131)
states: 0
abstracting: (3<=l87)
states: 0
abstracting: (l168<=l99)
states: 702
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[4<=l54 & ~ [[l64<=3 & ~ [[[l166<=3 | [l128<=1 | l74<=l190]] | l210<=2]]]]] | 2<=l182]]
normalized: E [true U [2<=l182 | [4<=l54 & ~ [[l64<=3 & ~ [[l210<=2 | [l166<=3 | [l128<=1 | l74<=l190]]]]]]]]]

abstracting: (l74<=l190)
states: 702
abstracting: (l128<=1)
states: 702
abstracting: (l166<=3)
states: 702
abstracting: (l210<=2)
states: 702
abstracting: (l64<=3)
states: 702
abstracting: (4<=l54)
states: 0
abstracting: (2<=l182)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[4<=l218 & ~ [[4<=l49 | [~ [[[l28<=3 & p21<=1] & [1<=l38 & 4<=l83]]] & [~ [l0<=l226] & ~ [l38<=l24]]]]]]]
normalized: ~ [E [true U ~ [[4<=l218 & ~ [[4<=l49 | [[~ [l38<=l24] & ~ [l0<=l226]] & ~ [[[1<=l38 & 4<=l83] & [l28<=3 & p21<=1]]]]]]]]]]

abstracting: (p21<=1)
states: 702
abstracting: (l28<=3)
states: 702
abstracting: (4<=l83)
states: 0
abstracting: (1<=l38)
states: 0
abstracting: (l0<=l226)
states: 180
abstracting: (l38<=l24)
states: 702
abstracting: (4<=l49)
states: 0
abstracting: (4<=l218)
states: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [~ [[[[[[[l214<=l115 & 4<=l2] | l27<=0] & [[2<=l173 | l59<=s1] & [l175<=l129 | 2<=l133]]] & l140<=l103] & 1<=l97] | [~ [[~ [l54<=1] & [[[2<=l61 | 3<=l129] | [l9<=l15 & l142<=l56]] & [[3<=s9 & l197<=l60] | ~ [l15<=l115]]]]] & p10<=l107]]]]
normalized: E [true U ~ [[[p10<=l107 & ~ [[[[~ [l15<=l115] | [3<=s9 & l197<=l60]] & [[l9<=l15 & l142<=l56] | [2<=l61 | 3<=l129]]] & ~ [l54<=1]]]] | [1<=l97 & [l140<=l103 & [[[l175<=l129 | 2<=l133] & [2<=l173 | l59<=s1]] & [l27<=0 | [l214<=l115 & 4<=l2]]]]]]]]

abstracting: (4<=l2)
states: 0
abstracting: (l214<=l115)
states: 702
abstracting: (l27<=0)
states: 702
abstracting: (l59<=s1)
states: 702
abstracting: (2<=l173)
states: 0
abstracting: (2<=l133)
states: 0
abstracting: (l175<=l129)
states: 702
abstracting: (l140<=l103)
states: 702
abstracting: (1<=l97)
states: 0
abstracting: (l54<=1)
states: 702
abstracting: (3<=l129)
states: 0
abstracting: (2<=l61)
states: 0
abstracting: (l142<=l56)
states: 702
abstracting: (l9<=l15)
states: 702
abstracting: (l197<=l60)
states: 702
abstracting: (3<=s9)
states: 0
abstracting: (l15<=l115)
states: 702
abstracting: (p10<=l107)
states: 678
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EF [~ [[[[~ [[[[[2<=l206 | l84<=l183] | l32<=l210] & [~ [2<=s2] & p17<=2]] | [~ [[l10<=l203 | 4<=l229]] | [l31<=l86 | [l1<=l59 | 3<=l209]]]]] & [l107<=l160 | [[4<=l171 | [[l124<=2 & 2<=l110] & [l65<=1 & p12<=0]]] | [~ [[4<=l220 & l101<=1]] & [[4<=l69 & 2<=l97] & ~ [l139<=2]]]]]] | [3<=l70 | 4<=s1]] | l93<=0]]]
normalized: E [true U ~ [[l93<=0 | [[3<=l70 | 4<=s1] | [[l107<=l160 | [[[~ [l139<=2] & [4<=l69 & 2<=l97]] & ~ [[4<=l220 & l101<=1]]] | [4<=l171 | [[l65<=1 & p12<=0] & [l124<=2 & 2<=l110]]]]] & ~ [[[[l31<=l86 | [l1<=l59 | 3<=l209]] | ~ [[l10<=l203 | 4<=l229]]] | [[p17<=2 & ~ [2<=s2]] & [l32<=l210 | [2<=l206 | l84<=l183]]]]]]]]]]

abstracting: (l84<=l183)
states: 702
abstracting: (2<=l206)
states: 0
abstracting: (l32<=l210)
states: 702
abstracting: (2<=s2)
states: 0
abstracting: (p17<=2)
states: 702
abstracting: (4<=l229)
states: 0
abstracting: (l10<=l203)
states: 702
abstracting: (3<=l209)
states: 0
abstracting: (l1<=l59)
states: 700
abstracting: (l31<=l86)
states: 702
abstracting: (2<=l110)
states: 0
abstracting: (l124<=2)
states: 702
abstracting: (p12<=0)
states: 698
abstracting: (l65<=1)
states: 702
abstracting: (4<=l171)
states: 0
abstracting: (l101<=1)
states: 702
abstracting: (4<=l220)
states: 0
abstracting: (2<=l97)
states: 0
abstracting: (4<=l69)
states: 0
abstracting: (l139<=2)
states: 702
abstracting: (l107<=l160)
states: 702
abstracting: (4<=s1)
states: 0
abstracting: (3<=l70)
states: 0
abstracting: (l93<=0)
states: 702
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[~ [[[~ [[[1<=l232 | 1<=l136] & [l193<=2 & p15<=1]]] | [[p19<=4 | [l30<=0 & l92<=2]] & [[1<=s1 | l151<=4] & [4<=l32 & p10<=l168]]]] & ~ [[[[l54<=3 | l203<=l42] & [1<=l32 & 2<=l57]] | [[2<=l201 & l94<=l177] | [l221<=l21 | l166<=0]]]]]] & [[2<=l177 | ~ [3<=l47]] | [~ [[[[l201<=l182 | l224<=0] & l56<=3] | [~ [l156<=l41] & l193<=2]]] & l71<=l223]]] & ~ [1<=l134]] & l39<=l53]]
normalized: E [true U [l39<=l53 & [~ [1<=l134] & [[[l71<=l223 & ~ [[[l193<=2 & ~ [l156<=l41]] | [l56<=3 & [l201<=l182 | l224<=0]]]]] | [2<=l177 | ~ [3<=l47]]] & ~ [[~ [[[[l221<=l21 | l166<=0] | [2<=l201 & l94<=l177]] | [[1<=l32 & 2<=l57] & [l54<=3 | l203<=l42]]]] & [[[[4<=l32 & p10<=l168] & [1<=s1 | l151<=4]] & [p19<=4 | [l30<=0 & l92<=2]]] | ~ [[[l193<=2 & p15<=1] & [1<=l232 | 1<=l136]]]]]]]]]]

abstracting: (1<=l136)
states: 0
abstracting: (1<=l232)
states: 0
abstracting: (p15<=1)
states: 702
abstracting: (l193<=2)
states: 702
abstracting: (l92<=2)
states: 702
abstracting: (l30<=0)
states: 573
abstracting: (p19<=4)
states: 702
abstracting: (l151<=4)
states: 702
abstracting: (1<=s1)
states: 218
abstracting: (p10<=l168)
states: 678
abstracting: (4<=l32)
states: 0
abstracting: (l203<=l42)
states: 702
abstracting: (l54<=3)
states: 702
abstracting: (2<=l57)
states: 0
abstracting: (1<=l32)
states: 0
abstracting: (l94<=l177)
states: 702
abstracting: (2<=l201)
states: 0
abstracting: (l166<=0)
states: 702
abstracting: (l221<=l21)
states: 702
abstracting: (3<=l47)
states: 0
abstracting: (2<=l177)
states: 0
abstracting: (l224<=0)
states: 702
abstracting: (l201<=l182)
states: 702
abstracting: (l56<=3)
states: 702
abstracting: (l156<=l41)
states: 702
abstracting: (l193<=2)
states: 702
abstracting: (l71<=l223)
states: 702
abstracting: (1<=l134)
states: 0
abstracting: (l39<=l53)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [[[~ [[~ [[[s9<=l103 | l70<=l181] | [l166<=l24 & p21<=l47]]] | ~ [[l25<=0 & [l14<=4 | p11<=l80]]]]] | [[~ [l215<=l209] | [[l28<=l17 & 1<=l131] & 3<=l44]] & ~ [[[1<=l148 | l65<=3] & [l8<=l44 | 4<=l140]]]]] & [l85<=4 | ~ [[~ [[[2<=l171 & ~ [[l179<=l197 | l89<=p18]]] & [[[l131<=l200 | 1<=l154] | ~ [3<=p12]] & [[l106<=0 & l91<=l187] & [l165<=4 | 2<=l197]]]]] | 3<=l133]]]]]
normalized: E [true U [[l85<=4 | ~ [[3<=l133 | ~ [[[[[l165<=4 | 2<=l197] & [l106<=0 & l91<=l187]] & [~ [3<=p12] | [l131<=l200 | 1<=l154]]] & [2<=l171 & ~ [[l179<=l197 | l89<=p18]]]]]]]] & [[~ [[[l8<=l44 | 4<=l140] & [1<=l148 | l65<=3]]] & [[3<=l44 & [l28<=l17 & 1<=l131]] | ~ [l215<=l209]]] | ~ [[~ [[l25<=0 & [l14<=4 | p11<=l80]]] | ~ [[[l166<=l24 & p21<=l47] | [s9<=l103 | l70<=l181]]]]]]]]

abstracting: (l70<=l181)
states: 670
abstracting: (s9<=l103)
states: 672
abstracting: (p21<=l47)
states: 678
abstracting: (l166<=l24)
states: 702
abstracting: (p11<=l80)
states: 678
abstracting: (l14<=4)
states: 702
abstracting: (l25<=0)
states: 680
abstracting: (l215<=l209)
states: 702
abstracting: (1<=l131)
states: 0
abstracting: (l28<=l17)
states: 702
abstracting: (3<=l44)
states: 0
abstracting: (l65<=3)
states: 702
abstracting: (1<=l148)
states: 0
abstracting: (4<=l140)
states: 0
abstracting: (l8<=l44)
states: 702
abstracting: (l89<=p18)
states: 666
abstracting: (l179<=l197)
states: 702
abstracting: (2<=l171)
states: 0
abstracting: (1<=l154)
states: 0
abstracting: (l131<=l200)
states: 702
abstracting: (3<=p12)
states: 0
abstracting: (l91<=l187)
states: 702
abstracting: (l106<=0)
states: 702
abstracting: (2<=l197)
states: 0
abstracting: (l165<=4)
states: 702
abstracting: (3<=l133)
states: 0
abstracting: (l85<=4)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[~ [[[l35<=l196 & [[4<=l13 & ~ [[l3<=4 | 2<=l215]]] & [[[p21<=3 & 3<=l135] | l110<=l133] | ~ [2<=l215]]]] | [[~ [[[l29<=l159 | l95<=4] | ~ [l139<=p19]]] & [[~ [l230<=2] & l8<=1] & 2<=l148]] & ~ [[l182<=l178 | [[l19<=3 | l197<=0] & 1<=l87]]]]]] | ~ [[[[[~ [[l99<=0 & 2<=s9]] & ~ [l28<=1]] | [~ [[l97<=0 | 3<=l106]] & l15<=4]] | [[[~ [l27<=l237] | l79<=l169] & [l107<=l160 | [l65<=l176 | l203<=l37]]] | [[~ [l30<=1] | [s9<=1 | l206<=l40]] | p21<=2]]] & l60<=l222]]]]
normalized: E [true U [~ [[l60<=l222 & [[[p21<=2 | [[s9<=1 | l206<=l40] | ~ [l30<=1]]] | [[l107<=l160 | [l65<=l176 | l203<=l37]] & [l79<=l169 | ~ [l27<=l237]]]] | [[l15<=4 & ~ [[l97<=0 | 3<=l106]]] | [~ [l28<=1] & ~ [[l99<=0 & 2<=s9]]]]]]] | ~ [[[~ [[l182<=l178 | [1<=l87 & [l19<=3 | l197<=0]]]] & [[2<=l148 & [l8<=1 & ~ [l230<=2]]] & ~ [[~ [l139<=p19] | [l29<=l159 | l95<=4]]]]] | [l35<=l196 & [[~ [2<=l215] | [l110<=l133 | [p21<=3 & 3<=l135]]] & [4<=l13 & ~ [[l3<=4 | 2<=l215]]]]]]]]]

abstracting: (2<=l215)
states: 0
abstracting: (l3<=4)
states: 702
abstracting: (4<=l13)
states: 0
abstracting: (3<=l135)
states: 0
abstracting: (p21<=3)
states: 702
abstracting: (l110<=l133)
states: 575
abstracting: (2<=l215)
states: 0
abstracting: (l35<=l196)
states: 702
abstracting: (l95<=4)
states: 702
abstracting: (l29<=l159)
states: 416
abstracting: (l139<=p19)
states: 702
abstracting: (l230<=2)
states: 702
abstracting: (l8<=1)
states: 702
abstracting: (2<=l148)
states: 0
abstracting: (l197<=0)
states: 702
abstracting: (l19<=3)
states: 702
abstracting: (1<=l87)
states: 0
abstracting: (l182<=l178)
states: 702
abstracting: (2<=s9)
states: 0
abstracting: (l99<=0)
states: 702
abstracting: (l28<=1)
states: 702
abstracting: (3<=l106)
states: 0
abstracting: (l97<=0)
states: 702
abstracting: (l15<=4)
states: 702
abstracting: (l27<=l237)
states: 702
abstracting: (l79<=l169)
states: 626
abstracting: (l203<=l37)
states: 702
abstracting: (l65<=l176)
states: 646
abstracting: (l107<=l160)
states: 702
abstracting: (l30<=1)
states: 702
abstracting: (l206<=l40)
states: 702
abstracting: (s9<=1)
states: 702
abstracting: (p21<=2)
states: 702
abstracting: (l60<=l222)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: EF [[[l232<=2 | [[[[3<=l143 | [[~ [l96<=l48] | l93<=1] & [4<=l212 | [4<=l156 & l119<=0]]]] | [[[l124<=l105 | [4<=l118 | 4<=l147]] | 2<=l15] & ~ [s0<=3]]] & ~ [[~ [[l157<=1 & 3<=l179]] | l103<=l208]]] & [[[l12<=1 & [s6<=1 | [~ [l227<=p22] & l110<=2]]] | [1<=l63 & 1<=l83]] & [l157<=l195 | [[~ [l78<=0] & [[1<=l40 | l206<=3] | [l123<=4 | l24<=3]]] & ~ [[[l5<=2 & l8<=0] & [l22<=0 | l169<=3]]]]]]]] & ~ [[[[[[~ [[p13<=l186 & 4<=l31]] & ~ [[3<=l197 | 1<=l104]]] & ~ [[[l89<=l106 & l126<=4] | ~ [l89<=l187]]]] | [~ [[~ [l39<=3] & l82<=l177]] & [3<=l158 | ~ [[2<=l114 | 1<=l111]]]]] & ~ [[[[~ [l203<=p22] & ~ [1<=l139]] | [l74<=1 | [3<=l35 & 1<=l229]]] | [~ [l28<=l221] & [[l63<=l170 & s0<=2] & ~ [2<=l39]]]]]] & ~ [l74<=3]]]]]
normalized: E [true U [~ [[~ [l74<=3] & [~ [[[[~ [2<=l39] & [l63<=l170 & s0<=2]] & ~ [l28<=l221]] | [[l74<=1 | [3<=l35 & 1<=l229]] | [~ [1<=l139] & ~ [l203<=p22]]]]] & [[[3<=l158 | ~ [[2<=l114 | 1<=l111]]] & ~ [[l82<=l177 & ~ [l39<=3]]]] | [~ [[~ [l89<=l187] | [l89<=l106 & l126<=4]]] & [~ [[3<=l197 | 1<=l104]] & ~ [[p13<=l186 & 4<=l31]]]]]]]] & [l232<=2 | [[[l157<=l195 | [~ [[[l22<=0 | l169<=3] & [l5<=2 & l8<=0]]] & [[[l123<=4 | l24<=3] | [1<=l40 | l206<=3]] & ~ [l78<=0]]]] & [[1<=l63 & 1<=l83] | [l12<=1 & [s6<=1 | [l110<=2 & ~ [l227<=p22]]]]]] & [~ [[l103<=l208 | ~ [[l157<=1 & 3<=l179]]]] & [[~ [s0<=3] & [2<=l15 | [l124<=l105 | [4<=l118 | 4<=l147]]]] | [3<=l143 | [[4<=l212 | [4<=l156 & l119<=0]] & [l93<=1 | ~ [l96<=l48]]]]]]]]]]

abstracting: (l96<=l48)
states: 702
abstracting: (l93<=1)
states: 702
abstracting: (l119<=0)
states: 702
abstracting: (4<=l156)
states: 0
abstracting: (4<=l212)
states: 0
abstracting: (3<=l143)
states: 0
abstracting: (4<=l147)
states: 0
abstracting: (4<=l118)
states: 0
abstracting: (l124<=l105)
states: 702
abstracting: (2<=l15)
states: 0
abstracting: (s0<=3)
states: 702
abstracting: (3<=l179)
states: 0
abstracting: (l157<=1)
states: 702
abstracting: (l103<=l208)
states: 702
abstracting: (l227<=p22)
states: 702
abstracting: (l110<=2)
states: 702
abstracting: (s6<=1)
states: 702
abstracting: (l12<=1)
states: 702
abstracting: (1<=l83)
states: 0
abstracting: (1<=l63)
states: 71
abstracting: (l78<=0)
states: 651
abstracting: (l206<=3)
states: 702
abstracting: (1<=l40)
states: 0
abstracting: (l24<=3)
states: 702
abstracting: (l123<=4)
states: 702
abstracting: (l8<=0)
states: 702
abstracting: (l5<=2)
states: 702
abstracting: (l169<=3)
states: 702
abstracting: (l22<=0)
states: 702
abstracting: (l157<=l195)
states: 702
abstracting: (l232<=2)
states: 702
abstracting: (4<=l31)
states: 0
abstracting: (p13<=l186)
states: 698
abstracting: (1<=l104)
states: 0
abstracting: (3<=l197)
states: 0
abstracting: (l126<=4)
states: 702
abstracting: (l89<=l106)
states: 666
abstracting: (l89<=l187)
states: 666
abstracting: (l39<=3)
states: 702
abstracting: (l82<=l177)
states: 702
abstracting: (1<=l111)
states: 0
abstracting: (2<=l114)
states: 0
abstracting: (3<=l158)
states: 0
abstracting: (l203<=p22)
states: 702
abstracting: (1<=l139)
states: 0
abstracting: (1<=l229)
states: 0
abstracting: (3<=l35)
states: 0
abstracting: (l74<=1)
states: 702
abstracting: (l28<=l221)
states: 702
abstracting: (s0<=2)
states: 702
abstracting: (l63<=l170)
states: 631
abstracting: (2<=l39)
states: 0
abstracting: (l74<=3)
states: 702
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

totally nodes used: 58511 (5.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35165 213854 249019
used/not used/entry size/cache size: 229367 66879497 16 1024MB
basic ops cache: hits/miss/sum: 49493 318738 368231
used/not used/entry size/cache size: 402056 16375160 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: 1171 4495 5666
used/not used/entry size/cache size: 4495 8384113 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 67051253
1 56733
2 862
3 12
4 2
5 2
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.653sec


BK_STOP 1679351114542

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
l151
l152
l153
l217
l218
l219
l220
l222
l223
l224
l225
l226
l227
l228
l229
l230
l231
l232
l233
l177
l178
l179
l180
l181
l182
l183
l184
l185
l186
l187
l188
l189
l190
l191
l192
l135
l136
l137
l138
l10
l193
l194
l195
l196
l197
l198
l199
l200
l201
l203
l212
l213
l214
l215
l216
l107
l237
l157
l158
l159
l160
l161
l162
l163
l164
l165
l166
l167
l168
l169
l170
l171
l172
l173
l174
l175
l176
l143
l144
l145
l146
l147
l9
l139
l140
l141
l142
l105
l106
l6
l8
l7
l131
l132
l133
l134
l4
l130
l2
l123
l124
l125
l119
l120
l121
l122
l111
l116
l117
l118
l108
l109
l32
l148
l149
l150
l12
l13
l14
l15
l16
l17
l18
l19
l22
l23
l26
l27
l28
l31
l154
l155
l156
l34
l35
l45
l115
l75
l97
l101
l102
l36
l37
l38
l39
l40
l43
l44
l46
l47
l48
l11
l49
l50
l51
l52
l53
l54
l56
l57
l58
l59
l60
l61
l69
l71
l72
l103
l104
l73
l74
l76
l77
l80
l81
l82
l83
l84
l85
l87
l88
l91
l92
l93
l94
l95
l96
l98
l99
l100

The net has transition(s) that can never fire:


check for constant places
l2
l4
l6
l7
l8
l9
l10
l11
l12
l13
l14
l15
l16
l17
l18
l19
l22
l23
l26
l27
l28
l31
l32
l34
l35
l36
l37
l38
l39
l40
l43
l44
l45
l46
l47
l48
l49
l50
l51
l52
l53
l54
l56
l57
l58
l59
l60
l61
l69
l71
l72
l73
l74
l75
l76
l77
l80
l81
l82
l83
l84
l85
l87
l88
l91
l92
l93
l94
l95
l96
l97
l98
l99
l100
l101
l102
l103
l104
l105
l106
l107
l108
l109
l111
l115
l116
l117
l118
l119
l120
l121
l122
l123
l124
l125
l130
l131
l132
l133
l134
l135
l136
l137
l138
l139
l140
l141
l142
l143
l144
l145
l146
l147
l148
l149
l150
l151
l152
l153
l154
l155
l156
l157
l158
l159
l160
l161
l162
l163
l164
l165
l166
l167
l168
l169
l170
l171
l172
l173
l174
l175
l176
l177
l178
l179
l180
l181
l182
l183
l184
l185
l186
l187
l188
l189
l190
l191
l192
l193
l194
l195
l196
l197
l198
l199
l200
l201
l203
l212
l213
l214
l215
l216
l217
l218
l219
l220
l222
l223
l224
l225
l226
l227
l228
l229
l230
l231
l232
l233
l237
found 190 constant places
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:2719 (37), effective:143 (1)

initing FirstDep: 0m 0.012sec


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

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

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

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

iterations count:923 (12), effective:33 (0)

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

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

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

iterations count:73 (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="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is SieveSingleMsgMbox-PT-d0m04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978800358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m04.tgz
mv SieveSingleMsgMbox-PT-d0m04 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;