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.r330-tall-167889203100294.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 marciexred
Input is Raft-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K 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 Raft-PT-02-ReachabilityCardinality-00
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-01
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-02
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-03
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-04
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-05
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-06
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-07
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-08
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-09
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-10
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-11
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-12
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-13
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-14
FORMULA_NAME Raft-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679139819999

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=Raft-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:43:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 11:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:43:41] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-18 11:43:41] [INFO ] Transformed 28 places.
[2023-03-18 11:43:41] [INFO ] Transformed 52 transitions.
[2023-03-18 11:43:41] [INFO ] Found NUPN structural information;
[2023-03-18 11:43:41] [INFO ] Parsed PT model containing 28 places and 52 transitions and 159 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA Raft-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :4
FORMULA Raft-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:43:41] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2023-03-18 11:43:41] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 11:43:42] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:43:42] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA Raft-PT-02-ReachabilityCardinality-06 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 697 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: Raft_PT_02
(NrP: 28 NrTr: 52 NrArc: 159)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 180 (1.8e+02) #states 7,381 (3)



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

checking: AG [p21<=1]
normalized: ~ [E [true U ~ [p21<=1]]]

abstracting: (p21<=1)
states: 7,381 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [p13<=0]
normalized: E [true U p13<=0]

abstracting: (p13<=0)
states: 6,161 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[1<=p24 | p14<=1]]]
normalized: E [true U ~ [[1<=p24 | p14<=1]]]

abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (1<=p24)
states: 1,476 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p12<=p19]
normalized: ~ [E [true U ~ [p12<=p19]]]

abstracting: (p12<=p19)
states: 6,341 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [p11<=p23]]
normalized: ~ [E [true U p11<=p23]]

abstracting: (p11<=p23)
states: 6,405 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p7<=p2 & 1<=p1]]
normalized: ~ [E [true U ~ [[p7<=p2 & 1<=p1]]]]

abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p7<=p2)
states: 6,341 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[1<=p17 | [~ [p9<=p15] | ~ [p18<=0]]]]]
normalized: ~ [E [true U [[~ [p18<=0] | ~ [p9<=p15]] | 1<=p17]]]

abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p9<=p15)
states: 6,661 (3)
abstracting: (p18<=0)
states: 6,161 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[p17<=p3 | [1<=p23 & [p16<=p18 & p1<=0]]]]]
normalized: E [true U ~ [[[[p16<=p18 & p1<=0] & 1<=p23] | p17<=p3]]]

abstracting: (p17<=p3)
states: 6,341 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p1<=0)
states: 6,161 (3)
abstracting: (p16<=p18)
states: 6,161 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[p8<=1 | [[p20<=1 & [p13<=1 & ~ [p24<=0]]] | ~ [[~ [[[1<=p26 | ~ [1<=p3]] & [[p24<=p13 | p9<=p26] & p2<=1]]] | ~ [1<=p15]]]]]]]
normalized: E [true U ~ [[[[[~ [p24<=0] & p13<=1] & p20<=1] | ~ [[~ [1<=p15] | ~ [[[[p24<=p13 | p9<=p26] & p2<=1] & [~ [1<=p3] | 1<=p26]]]]]] | p8<=1]]]

abstracting: (p8<=1)
states: 7,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p2<=1)
states: 7,381 (3)
abstracting: (p9<=p26)
states: 6,466 (3)
abstracting: (p24<=p13)
states: 6,149 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (p24<=0)
states: 5,905 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[p22<=1 | [[1<=p23 & ~ [[~ [[p7<=p23 & 1<=p8]] & p19<=1]]] | [~ [[p4<=1 & [p21<=1 & p4<=p13]]] | ~ [[p9<=p1 & ~ [p5<=1]]]]]] | ~ [p22<=0]]]
normalized: ~ [E [true U ~ [[~ [p22<=0] | [[[~ [[~ [p5<=1] & p9<=p1]] | ~ [[[p21<=1 & p4<=p13] & p4<=1]]] | [~ [[~ [[p7<=p23 & 1<=p8]] & p19<=1]] & 1<=p23]] | p22<=1]]]]]

abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p7<=p23)
states: 6,405 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p4<=p13)
states: 6,341 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (p9<=p1)
states: 6,341 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (p22<=0)
states: 5,905 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [p25<=1] & [1<=p15 | [~ [[[p18<=0 | ~ [p8<=p8]] | ~ [p7<=p23]]] | ~ [[p27<=0 & [[[[1<=p16 & 1<=p6] & p9<=1] | [1<=p17 | p16<=p20]] & p27<=p13]]]]]]]
normalized: E [true U [[[~ [[[[[1<=p17 | p16<=p20] | [[1<=p16 & 1<=p6] & p9<=1]] & p27<=p13] & p27<=0]] | ~ [[~ [p7<=p23] | [~ [p8<=p8] | p18<=0]]]] | 1<=p15] & ~ [p25<=1]]]

abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p18<=0)
states: 6,161 (3)
abstracting: (p8<=p8)
states: 7,381 (3)
abstracting: (p7<=p23)
states: 6,405 (3)
abstracting: (p27<=0)
states: 5,536 (3)
abstracting: (p27<=p13)
states: 5,841 (3)
abstracting: (p9<=1)
states: 7,381 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p16<=p20)
states: 6,161 (3)
abstracting: (1<=p17)
states: 1,220 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[[[[1<=p7 | p2<=p11] | 1<=p13] & [[1<=p22 | p27<=1] | [1<=p15 | p18<=1]]] | ~ [[~ [p2<=p25] & 1<=p1]]]] | [p16<=p15 & ~ [[1<=p22 & [[[1<=p8 | ~ [1<=p15]] | ~ [[p21<=p19 & p4<=1]]] & [[~ [1<=p22] | p18<=p16] | 1<=p26]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [p2<=p25] & 1<=p1]] | [[[1<=p15 | p18<=1] | [1<=p22 | p27<=1]] & [[1<=p7 | p2<=p11] | 1<=p13]]]] | [~ [[[[[~ [1<=p22] | p18<=p16] | 1<=p26] & [~ [[p21<=p19 & p4<=1]] | [~ [1<=p15] | 1<=p8]]] & 1<=p22]] & p16<=p15]]]]]

abstracting: (p16<=p15)
states: 6,661 (3)
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p21<=p19)
states: 6,149 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p18<=p16)
states: 6,161 (3)
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p2<=p11)
states: 6,341 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p22)
states: 1,476 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p2<=p25)
states: 6,466 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[[p27<=1 | ~ [p9<=p6]] & [~ [[~ [[~ [[[1<=p1 | p10<=1] | [p21<=p1 & p6<=p17]]] | [[[p4<=1 & p17<=0] & [1<=p0 & 1<=p8]] | ~ [[p23<=0 & 1<=p6]]]]] & ~ [[[[p11<=p6 & ~ [p11<=0]] & [[1<=p4 & p24<=0] | 1<=p15]] & ~ [p8<=p19]]]]] & [p10<=1 | [[p1<=1 & p10<=0] | [~ [[1<=p26 | ~ [[1<=p2 & 1<=p16]]]] & [[[[1<=p16 | p20<=p26] & [p25<=1 & p4<=1]] | p7<=p11] & [p16<=1 | [p12<=p18 & 1<=p5]]]]]]]]]
normalized: E [true U [[[[[[[[p12<=p18 & 1<=p5] | p16<=1] & [[[p25<=1 & p4<=1] & [1<=p16 | p20<=p26]] | p7<=p11]] & ~ [[~ [[1<=p2 & 1<=p16]] | 1<=p26]]] | [p1<=1 & p10<=0]] | p10<=1] & ~ [[~ [[~ [p8<=p19] & [[[1<=p4 & p24<=0] | 1<=p15] & [~ [p11<=0] & p11<=p6]]]] & ~ [[[~ [[p23<=0 & 1<=p6]] | [[1<=p0 & 1<=p8] & [p4<=1 & p17<=0]]] | ~ [[[p21<=p1 & p6<=p17] | [1<=p1 | p10<=1]]]]]]]] & [~ [p9<=p6] | p27<=1]]]

abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (p9<=p6)
states: 6,161 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p6<=p17)
states: 6,341 (3)
abstracting: (p21<=p1)
states: 6,149 (3)
abstracting: (p17<=0)
states: 6,161 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p11<=p6)
states: 6,341 (3)
abstracting: (p11<=0)
states: 6,161 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p24<=0)
states: 5,905 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (p8<=p19)
states: 6,341 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (p7<=p11)
states: 6,341 (3)
abstracting: (p20<=p26)
states: 5,506 (3)
abstracting: (1<=p16)
states: 1,220 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p12<=p18)
states: 6,341 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[~ [[~ [p25<=p26] & [[1<=p27 & [~ [p13<=0] | [1<=p18 | ~ [p13<=0]]]] | [~ [[[p6<=0 | p8<=p14] & ~ [1<=p11]]] | p23<=p8]]]] & ~ [[[[p18<=1 & ~ [[~ [p5<=p12] | [1<=p0 & 1<=p1]]]] & p7<=0] | [[[p8<=0 | ~ [[p7<=p17 | 1<=p1]]] | 1<=p6] | [[[[p22<=p0 | p23<=p10] & p5<=1] | p15<=1] & p10<=1]]]]] & [[~ [[[[1<=p4 | [1<=p21 & ~ [p4<=1]]] | [[p0<=0 & [p6<=0 & 1<=p0]] & ~ [1<=p9]]] | 1<=p20]] | [[~ [p0<=p9] | 1<=p3] & p14<=p26]] | [1<=p20 | ~ [[[p18<=0 & 1<=p18] & p15<=p18]]]]]]
normalized: E [true U [[[~ [[[p18<=0 & 1<=p18] & p15<=p18]] | 1<=p20] | [[[~ [p0<=p9] | 1<=p3] & p14<=p26] | ~ [[[[~ [1<=p9] & [[p6<=0 & 1<=p0] & p0<=0]] | [[~ [p4<=1] & 1<=p21] | 1<=p4]] | 1<=p20]]]] & [~ [[[[[[[p22<=p0 | p23<=p10] & p5<=1] | p15<=1] & p10<=1] | [[~ [[p7<=p17 | 1<=p1]] | p8<=0] | 1<=p6]] | [[~ [[[1<=p0 & 1<=p1] | ~ [p5<=p12]]] & p18<=1] & p7<=0]]] & ~ [[[[~ [[~ [1<=p11] & [p6<=0 | p8<=p14]]] | p23<=p8] | [[[~ [p13<=0] | 1<=p18] | ~ [p13<=0]] & 1<=p27]] & ~ [p25<=p26]]]]]]

abstracting: (p25<=p26)
states: 5,536 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p13<=0)
states: 6,161 (3)
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p13<=0)
states: 6,161 (3)
abstracting: (p23<=p8)
states: 6,149 (3)
abstracting: (p8<=p14)
states: 6,341 (3)
abstracting: (p6<=0)
states: 6,161 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p7<=0)
states: 6,161 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p5<=p12)
states: 5,381 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p7<=p17)
states: 6,341 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (p23<=p10)
states: 6,405 (3)
abstracting: (p22<=p0)
states: 5,905 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p0<=0)
states: 7,380 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p6<=0)
states: 6,161 (3)
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p14<=p26)
states: 6,466 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p0<=p9)
states: 7,380 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p15<=p18)
states: 5,381 (3)
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p18<=0)
states: 6,161 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[[p21<=0 & p17<=p23] | [p22<=p18 | ~ [p26<=p0]]] | p1<=p4] | [[[p13<=p7 | [[[[~ [1<=p20] & [p20<=0 | p17<=p22]] & [p24<=p7 | [1<=p11 & p14<=0]]] & [[[1<=p3 & p13<=0] & [1<=p20 & p13<=p2]] | [p21<=p9 & [p4<=0 | 1<=p18]]]] | [1<=p6 & [[[p11<=p13 | p12<=1] & [p3<=1 & p8<=1]] & p18<=1]]]] | p23<=0] | [~ [[[p1<=p9 & 1<=p27] & 1<=p4]] & [p15<=1 | [p24<=p12 & [p18<=p25 | [[1<=p7 & [1<=p21 & 1<=p26]] | [[1<=p0 | 1<=p8] | [p5<=p17 & p19<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p5<=p17 & p19<=1] | [1<=p0 | 1<=p8]] | [[1<=p21 & 1<=p26] & 1<=p7]] | p18<=p25] & p24<=p12] | p15<=1] & ~ [[[p1<=p9 & 1<=p27] & 1<=p4]]] | [[[[[[[p3<=1 & p8<=1] & [p11<=p13 | p12<=1]] & p18<=1] & 1<=p6] | [[[[p4<=0 | 1<=p18] & p21<=p9] | [[1<=p20 & p13<=p2] & [1<=p3 & p13<=0]]] & [[[1<=p11 & p14<=0] | p24<=p7] & [[p20<=0 | p17<=p22] & ~ [1<=p20]]]]] | p13<=p7] | p23<=0]] | [[[~ [p26<=p0] | p22<=p18] | [p21<=0 & p17<=p23]] | p1<=p4]]]]]

abstracting: (p1<=p4)
states: 6,161 (3)
abstracting: (p17<=p23)
states: 6,405 (3)
abstracting: (p21<=0)
states: 5,905 (3)
abstracting: (p22<=p18)
states: 6,149 (3)
abstracting: (p26<=p0)
states: 5,536 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p13<=p7)
states: 6,341 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p17<=p22)
states: 6,405 (3)
abstracting: (p20<=0)
states: 4,881 (3)
abstracting: (p24<=p7)
states: 6,149 (3)
abstracting: (p14<=0)
states: 6,161 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p13<=0)
states: 6,161 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p13<=p2)
states: 6,341 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p21<=p9)
states: 6,149 (3)
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p4<=0)
states: 6,161 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p12<=1)
states: 7,381 (3)
abstracting: (p11<=p13)
states: 6,161 (3)
abstracting: (p8<=1)
states: 7,381 (3)
abstracting: (p3<=1)
states: 7,381 (3)
abstracting: (1<=p4)
states: 1,220 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p1<=p9)
states: 6,341 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (p24<=p12)
states: 6,149 (3)
abstracting: (p18<=p25)
states: 6,466 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (p5<=p17)
states: 5,381 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[~ [[p11<=1 & ~ [[~ [[~ [p1<=p5] & [p5<=0 | p10<=1]]] | [[[p24<=p13 & p4<=1] & p15<=p3] & [[p20<=p14 | p10<=0] | [p3<=p24 | p9<=0]]]]]]] & ~ [[~ [[1<=p24 | [[p23<=0 | p6<=p0] | ~ [p9<=p8]]]] | [[[1<=p27 | [[1<=p18 | 1<=p13] & p2<=p24]] | [[p2<=p17 | [p1<=p27 | p7<=1]] & [[1<=p12 & 1<=p14] | [p8<=p4 | p22<=1]]]] | ~ [[~ [[p21<=1 & p24<=p26]] & ~ [[1<=p13 & p21<=p24]]]]]]]] | [[[~ [[[p4<=0 | ~ [[1<=p20 | p5<=1]]] & [[[p21<=p9 | p4<=p2] & ~ [p25<=p16]] & [~ [p0<=p5] | 1<=p3]]]] & [[~ [[[p6<=p12 & p14<=p20] | p18<=1]] | ~ [[p16<=p26 | p5<=p21]]] | ~ [p26<=p6]]] & p19<=p19] | [[[[1<=p15 & ~ [[~ [p7<=p20] & p9<=0]]] | 1<=p1] | [[[[p13<=0 | [p11<=p26 & p27<=p10]] & ~ [p22<=0]] | p16<=1] | [[~ [p12<=p4] & [[p1<=1 | p26<=0] | ~ [p11<=1]]] | p0<=p9]]] | [~ [[[p6<=0 & p23<=0] | ~ [p8<=p27]]] | ~ [[p18<=0 & [[p27<=0 & p7<=0] | [~ [p27<=p18] & 1<=p9]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[[[[p3<=p24 | p9<=0] | [p20<=p14 | p10<=0]] & [[p24<=p13 & p4<=1] & p15<=p3]] | ~ [[[p5<=0 | p10<=1] & ~ [p1<=p5]]]]] & p11<=1]] & ~ [[[~ [[~ [[1<=p13 & p21<=p24]] & ~ [[p21<=1 & p24<=p26]]]] | [[[[p8<=p4 | p22<=1] | [1<=p12 & 1<=p14]] & [[p1<=p27 | p7<=1] | p2<=p17]] | [[[1<=p18 | 1<=p13] & p2<=p24] | 1<=p27]]] | ~ [[[~ [p9<=p8] | [p23<=0 | p6<=p0]] | 1<=p24]]]]] | [[[~ [[[[~ [p27<=p18] & 1<=p9] | [p27<=0 & p7<=0]] & p18<=0]] | ~ [[~ [p8<=p27] | [p6<=0 & p23<=0]]]] | [[[[[~ [p11<=1] | [p1<=1 | p26<=0]] & ~ [p12<=p4]] | p0<=p9] | [[~ [p22<=0] & [[p11<=p26 & p27<=p10] | p13<=0]] | p16<=1]] | [[~ [[~ [p7<=p20] & p9<=0]] & 1<=p15] | 1<=p1]]] | [[[~ [p26<=p6] | [~ [[p16<=p26 | p5<=p21]] | ~ [[[p6<=p12 & p14<=p20] | p18<=1]]]] & ~ [[[[~ [p0<=p5] | 1<=p3] & [~ [p25<=p16] & [p21<=p9 | p4<=p2]]] & [~ [[1<=p20 | p5<=1]] | p4<=0]]]] & p19<=p19]]]]]]

abstracting: (p19<=p19)
states: 7,381 (3)
abstracting: (p4<=0)
states: 6,161 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p4<=p2)
states: 6,161 (3)
abstracting: (p21<=p9)
states: 6,149 (3)
abstracting: (p25<=p16)
states: 5,841 (3)
abstracting: (1<=p3)
states: 1,220 (3)
abstracting: (p0<=p5)
states: 7,380 (3)
abstracting: (p18<=1)
states: 7,381 (3)
abstracting: (p14<=p20)
states: 6,661 (3)
abstracting: (p6<=p12)
states: 6,341 (3)
abstracting: (p5<=p21)
states: 5,381 (3)
abstracting: (p16<=p26)
states: 6,466 (3)
abstracting: (p26<=p6)
states: 5,841 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p9<=0)
states: 6,161 (3)
abstracting: (p7<=p20)
states: 6,661 (3)
abstracting: (p16<=1)
states: 7,381 (3)
abstracting: (p13<=0)
states: 6,161 (3)
abstracting: (p27<=p10)
states: 6,161 (3)
abstracting: (p11<=p26)
states: 6,466 (3)
abstracting: (p22<=0)
states: 5,905 (3)
abstracting: (p0<=p9)
states: 7,380 (3)
abstracting: (p12<=p4)
states: 6,341 (3)
abstracting: (p26<=0)
states: 5,536 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p6<=0)
states: 6,161 (3)
abstracting: (p8<=p27)
states: 6,466 (3)
abstracting: (p18<=0)
states: 6,161 (3)
abstracting: (p7<=0)
states: 6,161 (3)
abstracting: (p27<=0)
states: 5,536 (3)
abstracting: (1<=p9)
states: 1,220 (3)
abstracting: (p27<=p18)
states: 5,841 (3)
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p6<=p0)
states: 6,161 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (p9<=p8)
states: 6,161 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p2<=p24)
states: 6,405 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (1<=p18)
states: 1,220 (3)
abstracting: (p2<=p17)
states: 6,341 (3)
abstracting: (p7<=1)
states: 7,381 (3)
abstracting: (p1<=p27)
states: 6,466 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (1<=p12)
states: 1,220 (3)
abstracting: (p22<=1)
states: 7,381 (3)
abstracting: (p8<=p4)
states: 6,341 (3)
abstracting: (p24<=p26)
states: 6,274 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (p21<=p24)
states: 5,905 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (p1<=p5)
states: 6,161 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (p15<=p3)
states: 5,381 (3)
abstracting: (p4<=1)
states: 7,381 (3)
abstracting: (p24<=p13)
states: 6,149 (3)
abstracting: (p10<=0)
states: 4,881 (3)
abstracting: (p20<=p14)
states: 5,381 (3)
abstracting: (p9<=0)
states: 6,161 (3)
abstracting: (p3<=p24)
states: 6,405 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 20213 (2.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33990 77538 111528
used/not used/entry size/cache size: 86253 67022611 16 1024MB
basic ops cache: hits/miss/sum: 16652 33054 49706
used/not used/entry size/cache size: 61474 16715742 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: 2710 4499 7209
used/not used/entry size/cache size: 4499 8384109 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 67089250
1 19037
2 556
3 20
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.384sec


BK_STOP 1679139827410

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
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:2392 (46), effective:186 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:283 (5), effective:17 (0)

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

iterations count:199 (3), effective:14 (0)

iterations count:245 (4), effective:16 (0)

iterations count:389 (7), effective:23 (0)

iterations count:863 (16), effective:63 (1)

iterations count:91 (1), effective:5 (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="Raft-PT-02"
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 Raft-PT-02, 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 r330-tall-167889203100294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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