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.r522-tall-167987246800006.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 Anderson-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 103K Mar 31 16:48 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 Anderson-PT-04-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680839051921

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=Anderson-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:44:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 03:44:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:44:13] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-04-07 03:44:13] [INFO ] Transformed 105 places.
[2023-04-07 03:44:13] [INFO ] Transformed 200 transitions.
[2023-04-07 03:44:13] [INFO ] Found NUPN structural information;
[2023-04-07 03:44:13] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-04-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 10) seen :8
FORMULA Anderson-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-04-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 200 rows 105 cols
[2023-04-07 03:44:13] [INFO ] Computed 11 invariants in 15 ms
[2023-04-07 03:44:14] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:44:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-04-07 03:44:14] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 03:44:14] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 03:44:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 03:44:14] [INFO ] After 74ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 03:44:14] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 5 ms to minimize.
[2023-04-07 03:44:14] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2023-04-07 03:44:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-04-07 03:44:14] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 03:44:14] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA Anderson-PT-04-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 200/200 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 105 transition count 197
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 197
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 18 place count 90 transition count 131
Iterating global reduction 0 with 12 rules applied. Total rules applied 30 place count 90 transition count 131
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 44 place count 83 transition count 124
Applied a total of 44 rules in 28 ms. Remains 83 /105 variables (removed 22) and now considering 124/200 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 83/105 places, 124/200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3186 steps, run visited all 1 properties in 18 ms. (steps per millisecond=177 )
Probabilistic random walk after 3186 steps, saw 1558 distinct states, run finished after 18 ms. (steps per millisecond=177 ) properties seen :1
FORMULA Anderson-PT-04-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1412 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: Anderson_PT_04
(NrP: 105 NrTr: 200 NrArc: 752)

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

net check time: 0m 0.000sec

init dd package: 0m 2.714sec


RS generation: 0m 1.525sec


-> reachability set: #nodes 15960 (1.6e+04) #states 29,641 (4)



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

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

abstracting: (p2_1_2<=1)
states: 29,641 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [ncs_3_3<=0]
normalized: ~ [E [true U ~ [ncs_3_3<=0]]]

abstracting: (ncs_3_3<=0)
states: 26,841 (4)
-> the formula is FALSE

FORMULA Anderson-PT-04-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.078sec

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

abstracting: (p2_0_1<=1)
states: 29,641 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [1<=p3_3_3]
normalized: E [true U 1<=p3_3_3]

abstracting: (1<=p3_3_3)
states: 520
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.441sec

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

abstracting: (p2_2_1<=1)
states: 29,641 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [1<=cs_1_3]
normalized: E [true U 1<=cs_1_3]

abstracting: (1<=cs_1_3)
states: 520
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.687sec

checking: AG [cs_0_3<=cs_3_0]
normalized: ~ [E [true U ~ [cs_0_3<=cs_3_0]]]

abstracting: (cs_0_3<=cs_3_0)
states: 29,121 (4)
-> the formula is FALSE

FORMULA Anderson-PT-04-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.573sec

checking: AG [[p2_2_0<=1 | [1<=ncs_2_3 | 1<=p1_3_0]]]
normalized: ~ [E [true U ~ [[p2_2_0<=1 | [1<=ncs_2_3 | 1<=p1_3_0]]]]]

abstracting: (1<=p1_3_0)
states: 922
abstracting: (1<=ncs_2_3)
states: 2,800 (3)
abstracting: (p2_2_0<=1)
states: 29,641 (4)
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: EF [[1<=ncs_2_3 & cs_2_1<=p3_1_0]]
normalized: E [true U [1<=ncs_2_3 & cs_2_1<=p3_1_0]]

abstracting: (cs_2_1<=p3_1_0)
states: 29,265 (4)
abstracting: (1<=ncs_2_3)
states: 2,800 (3)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.537sec

checking: AG [~ [[~ [p1_1_4<=1] & [1<=p1_3_2 | ~ [p1_3_6<=p2_0_1]]]]]
normalized: ~ [E [true U [[1<=p1_3_2 | ~ [p1_3_6<=p2_0_1]] & ~ [p1_1_4<=1]]]]

abstracting: (p1_1_4<=1)
states: 29,641 (4)
abstracting: (p1_3_6<=p2_0_1)
states: 29,027 (4)
abstracting: (1<=p1_3_2)
states: 1,618 (3)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[~ [p1_2_2<=1] | [[[[[[p1_1_2<=p1_3_0 & cs_1_1<=1] & ~ [p1_3_0<=1]] & [~ [1<=p1_1_3] & ~ [p3_3_0<=next_1]]] | 1<=ncs_2_2] | ~ [p2_1_3<=p2_3_3]] | cs_3_2<=0]]]]
normalized: E [true U ~ [[[cs_3_2<=0 | [~ [p2_1_3<=p2_3_3] | [1<=ncs_2_2 | [[~ [p3_3_0<=next_1] & ~ [1<=p1_1_3]] & [~ [p1_3_0<=1] & [p1_1_2<=p1_3_0 & cs_1_1<=1]]]]]] | ~ [p1_2_2<=1]]]]

abstracting: (p1_2_2<=1)
states: 29,641 (4)
abstracting: (cs_1_1<=1)
states: 29,641 (4)
abstracting: (p1_1_2<=p1_3_0)
states: 28,081 (4)
abstracting: (p1_3_0<=1)
states: 29,641 (4)
abstracting: (1<=p1_1_3)
states: 1,534 (3)
abstracting: (p3_3_0<=next_1)
states: 29,272 (4)
abstracting: (1<=ncs_2_2)
states: 2,482 (3)
abstracting: (p2_1_3<=p2_3_3)
states: 27,573 (4)
abstracting: (cs_3_2<=0)
states: 29,289 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.546sec

checking: AG [~ [[1<=ncs_2_3 & [~ [1<=ncs_0_3] & [[[~ [p1_2_6<=slot_F_F_F_T] & [1<=p2_2_0 & cs_1_3<=cs_1_1]] | [~ [p2_0_0<=0] & [cs_2_3<=p1_3_6 & ncs_0_0<=0]]] | ~ [[[ncs_2_0<=1 | ncs_2_2<=p2_0_0] & 1<=cs_2_2]]]]]]]
normalized: ~ [E [true U [1<=ncs_2_3 & [[~ [[1<=cs_2_2 & [ncs_2_0<=1 | ncs_2_2<=p2_0_0]]] | [[[cs_2_3<=p1_3_6 & ncs_0_0<=0] & ~ [p2_0_0<=0]] | [[1<=p2_2_0 & cs_1_3<=cs_1_1] & ~ [p1_2_6<=slot_F_F_F_T]]]] & ~ [1<=ncs_0_3]]]]]

abstracting: (1<=ncs_0_3)
states: 2,800 (3)
abstracting: (p1_2_6<=slot_F_F_F_T)
states: 29,029 (4)
abstracting: (cs_1_3<=cs_1_1)
states: 29,121 (4)
abstracting: (1<=p2_2_0)
states: 1,603 (3)
abstracting: (p2_0_0<=0)
states: 28,038 (4)
abstracting: (ncs_0_0<=0)
states: 26,987 (4)
abstracting: (cs_2_3<=p1_3_6)
states: 29,129 (4)
abstracting: (ncs_2_2<=p2_0_0)
states: 27,275 (4)
abstracting: (ncs_2_0<=1)
states: 29,641 (4)
abstracting: (1<=cs_2_2)
states: 352
abstracting: (1<=ncs_2_3)
states: 2,800 (3)
-> the formula is FALSE

FORMULA Anderson-PT-04-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.230sec

checking: AG [[[~ [[[~ [[p2_2_1<=p2_3_1 & [[cs_2_2<=p3_3_0 & cs_2_0<=next_4] | 1<=p1_3_4]]] | ~ [[[[p3_1_3<=p2_0_0 & p3_1_3<=0] & [next_6<=1 | next_7<=p1_1_2]] & ncs_2_0<=1]]] | p1_1_1<=0]] | p3_2_2<=next_3] | p2_0_0<=next_6]]
normalized: ~ [E [true U ~ [[p2_0_0<=next_6 | [p3_2_2<=next_3 | ~ [[p1_1_1<=0 | [~ [[ncs_2_0<=1 & [[next_6<=1 | next_7<=p1_1_2] & [p3_1_3<=p2_0_0 & p3_1_3<=0]]]] | ~ [[p2_2_1<=p2_3_1 & [1<=p1_3_4 | [cs_2_2<=p3_3_0 & cs_2_0<=next_4]]]]]]]]]]]]

abstracting: (cs_2_0<=next_4)
states: 29,256 (4)
abstracting: (cs_2_2<=p3_3_0)
states: 29,289 (4)
abstracting: (1<=p1_3_4)
states: 1,576 (3)
abstracting: (p2_2_1<=p2_3_1)
states: 28,011 (4)
abstracting: (p3_1_3<=0)
states: 29,121 (4)
abstracting: (p3_1_3<=p2_0_0)
states: 29,177 (4)
abstracting: (next_7<=p1_1_2)
states: 29,449 (4)
abstracting: (next_6<=1)
states: 29,641 (4)
abstracting: (ncs_2_0<=1)
states: 29,641 (4)
abstracting: (p1_1_1<=0)
states: 28,311 (4)
abstracting: (p3_2_2<=next_3)
states: 29,353 (4)
abstracting: (p2_0_0<=next_6)
states: 28,146 (4)
-> the formula is FALSE

FORMULA Anderson-PT-04-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.638sec

checking: AG [~ [[[[1<=p3_0_0 | ncs_3_2<=0] & [[[~ [p2_3_3<=cs_1_1] | cs_2_2<=1] | [[[p3_1_0<=1 & slot_F_F_T_F<=p1_1_1] & p3_3_0<=1] & [1<=ncs_1_1 | [1<=p1_3_4 | p2_3_3<=next_2]]]] & [~ [p1_0_4<=1] & [~ [[1<=p3_2_0 | p1_1_6<=0]] | [~ [p1_2_3<=ncs_3_2] | [1<=p1_2_1 & p2_2_0<=1]]]]]] & p3_2_3<=slot_F_F_F_T]]]
normalized: ~ [E [true U [p3_2_3<=slot_F_F_F_T & [[[[[[1<=p1_2_1 & p2_2_0<=1] | ~ [p1_2_3<=ncs_3_2]] | ~ [[1<=p3_2_0 | p1_1_6<=0]]] & ~ [p1_0_4<=1]] & [[[1<=ncs_1_1 | [1<=p1_3_4 | p2_3_3<=next_2]] & [p3_3_0<=1 & [p3_1_0<=1 & slot_F_F_T_F<=p1_1_1]]] | [cs_2_2<=1 | ~ [p2_3_3<=cs_1_1]]]] & [1<=p3_0_0 | ncs_3_2<=0]]]]]

abstracting: (ncs_3_2<=0)
states: 27,159 (4)
abstracting: (1<=p3_0_0)
states: 433
abstracting: (p2_3_3<=cs_1_1)
states: 27,611 (4)
abstracting: (cs_2_2<=1)
states: 29,641 (4)
abstracting: (slot_F_F_T_F<=p1_1_1)
states: 24,498 (4)
abstracting: (p3_1_0<=1)
states: 29,641 (4)
abstracting: (p3_3_0<=1)
states: 29,641 (4)
abstracting: (p2_3_3<=next_2)
states: 28,005 (4)
abstracting: (1<=p1_3_4)
states: 1,576 (3)
abstracting: (1<=ncs_1_1)
states: 2,542 (3)
abstracting: (p1_0_4<=1)
states: 29,641 (4)
abstracting: (p1_1_6<=0)
states: 28,957 (4)
abstracting: (1<=p3_2_0)
states: 433
abstracting: (p1_2_3<=ncs_3_2)
states: 28,215 (4)
abstracting: (p2_2_0<=1)
states: 29,641 (4)
abstracting: (1<=p1_2_1)
states: 1,330 (3)
abstracting: (p3_2_3<=slot_F_F_F_T)
states: 29,641 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EF [[[[[1<=p1_3_1 | [1<=cs_1_2 | next_6<=1]] & [~ [[~ [[~ [p1_2_6<=p1_3_4] & p1_3_2<=slot_T_F_F_F]] & [[~ [1<=cs_3_1] | [1<=next_0 & p1_0_6<=p1_1_2]] | [[1<=cs_0_3 & p3_3_0<=1] & 1<=p2_0_2]]]] & ~ [cs_1_1<=ncs_1_0]]] | [[[~ [ncs_1_0<=cs_1_0] & [~ [[[1<=p1_1_4 | p1_3_1<=p1_2_0] & 1<=next_2]] | [~ [p3_1_2<=ncs_0_0] | [[cs_2_2<=0 & 1<=ncs_2_1] & p1_1_1<=1]]]] & 1<=p1_1_3] & [[ncs_2_1<=p1_0_4 & p1_2_3<=0] & [~ [[p1_3_6<=0 & [slot_F_T_F_F<=0 & [1<=cs_2_3 | p2_0_0<=1]]]] | 1<=next_0]]]] & cs_0_3<=p1_1_3]]
normalized: E [true U [cs_0_3<=p1_1_3 & [[[[1<=next_0 | ~ [[p1_3_6<=0 & [slot_F_T_F_F<=0 & [1<=cs_2_3 | p2_0_0<=1]]]]] & [ncs_2_1<=p1_0_4 & p1_2_3<=0]] & [1<=p1_1_3 & [[[[p1_1_1<=1 & [cs_2_2<=0 & 1<=ncs_2_1]] | ~ [p3_1_2<=ncs_0_0]] | ~ [[1<=next_2 & [1<=p1_1_4 | p1_3_1<=p1_2_0]]]] & ~ [ncs_1_0<=cs_1_0]]]] | [[~ [cs_1_1<=ncs_1_0] & ~ [[[[1<=p2_0_2 & [1<=cs_0_3 & p3_3_0<=1]] | [[1<=next_0 & p1_0_6<=p1_1_2] | ~ [1<=cs_3_1]]] & ~ [[p1_3_2<=slot_T_F_F_F & ~ [p1_2_6<=p1_3_4]]]]]] & [1<=p1_3_1 | [1<=cs_1_2 | next_6<=1]]]]]]

abstracting: (next_6<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_2)
states: 352
abstracting: (1<=p1_3_1)
states: 1,330 (3)
abstracting: (p1_2_6<=p1_3_4)
states: 29,023 (4)
abstracting: (p1_3_2<=slot_T_F_F_F)
states: 28,419 (4)
abstracting: (1<=cs_3_1)
states: 376
abstracting: (p1_0_6<=p1_1_2)
states: 28,957 (4)
abstracting: (1<=next_0)
states: 3,800 (3)
abstracting: (p3_3_0<=1)
states: 29,641 (4)
abstracting: (1<=cs_0_3)
states: 520
abstracting: (1<=p2_0_2)
states: 1,642 (3)
abstracting: (cs_1_1<=ncs_1_0)
states: 29,265 (4)
abstracting: (ncs_1_0<=cs_1_0)
states: 26,987 (4)
abstracting: (p1_3_1<=p1_2_0)
states: 28,401 (4)
abstracting: (1<=p1_1_4)
states: 1,576 (3)
abstracting: (1<=next_2)
states: 6,791 (3)
abstracting: (p3_1_2<=ncs_0_0)
states: 29,331 (4)
abstracting: (1<=ncs_2_1)
states: 2,542 (3)
abstracting: (cs_2_2<=0)
states: 29,289 (4)
abstracting: (p1_1_1<=1)
states: 29,641 (4)
abstracting: (1<=p1_1_3)
states: 1,534 (3)
abstracting: (p1_2_3<=0)
states: 28,107 (4)
abstracting: (ncs_2_1<=p1_0_4)
states: 27,210 (4)
abstracting: (p2_0_0<=1)
states: 29,641 (4)
abstracting: (1<=cs_2_3)
states: 520
abstracting: (slot_F_T_F_F<=0)
states: 23,970 (4)
abstracting: (p1_3_6<=0)
states: 28,957 (4)
abstracting: (1<=next_0)
states: 3,800 (3)
abstracting: (cs_0_3<=p1_1_3)
states: 29,121 (4)
-> the formula is TRUE

FORMULA Anderson-PT-04-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.911sec

checking: EF [[~ [[[[[p2_2_2<=1 & ~ [[[p3_0_1<=1 | p1_1_1<=0] & [p1_2_4<=0 & p3_3_1<=cs_3_0]]]] | [[~ [[ncs_0_3<=0 & p3_1_2<=p1_2_5]] & [1<=p1_0_6 | [p3_2_2<=0 | next_1<=1]]] & ~ [[~ [cs_0_3<=1] & [p1_0_0<=0 & p2_0_2<=1]]]]] & [[[[~ [p1_0_0<=0] & [p2_3_1<=0 & p1_1_3<=p2_1_2]] & [[1<=cs_1_3 | p3_2_3<=1] | [cs_0_1<=1 & p2_1_2<=ncs_3_2]]] & [[~ [p1_0_6<=1] & p1_0_1<=0] & 1<=p1_2_3]] | ~ [[~ [p2_1_0<=0] & [p1_2_1<=0 & 1<=p1_3_3]]]]] & [[1<=ncs_3_0 & p2_3_2<=slot_F_T_F_F] | 1<=p3_2_0]]] & ~ [[[~ [1<=p1_1_6] | [[[~ [[p1_1_5<=0 & 1<=p1_2_3]] & ~ [[p3_2_3<=1 | p3_2_0<=p3_3_1]]] | [[[ncs_0_2<=0 | p2_2_2<=0] | p1_0_0<=p3_1_3] & p1_0_6<=1]] & [~ [p1_1_0<=0] | [p2_1_1<=p2_2_1 | 1<=p1_3_3]]]] & [cs_2_1<=1 | [[p3_1_3<=cs_1_2 | ~ [1<=p1_2_4]] & [ncs_0_2<=p1_0_6 | ~ [next_0<=next_4]]]]]]]]
normalized: E [true U [~ [[[cs_2_1<=1 | [[ncs_0_2<=p1_0_6 | ~ [next_0<=next_4]] & [p3_1_3<=cs_1_2 | ~ [1<=p1_2_4]]]] & [[[[p2_1_1<=p2_2_1 | 1<=p1_3_3] | ~ [p1_1_0<=0]] & [[p1_0_6<=1 & [p1_0_0<=p3_1_3 | [ncs_0_2<=0 | p2_2_2<=0]]] | [~ [[p3_2_3<=1 | p3_2_0<=p3_3_1]] & ~ [[p1_1_5<=0 & 1<=p1_2_3]]]]] | ~ [1<=p1_1_6]]]] & ~ [[[1<=p3_2_0 | [1<=ncs_3_0 & p2_3_2<=slot_F_T_F_F]] & [[~ [[[p1_2_1<=0 & 1<=p1_3_3] & ~ [p2_1_0<=0]]] | [[1<=p1_2_3 & [p1_0_1<=0 & ~ [p1_0_6<=1]]] & [[[cs_0_1<=1 & p2_1_2<=ncs_3_2] | [1<=cs_1_3 | p3_2_3<=1]] & [[p2_3_1<=0 & p1_1_3<=p2_1_2] & ~ [p1_0_0<=0]]]]] & [[~ [[[p1_0_0<=0 & p2_0_2<=1] & ~ [cs_0_3<=1]]] & [[1<=p1_0_6 | [p3_2_2<=0 | next_1<=1]] & ~ [[ncs_0_3<=0 & p3_1_2<=p1_2_5]]]] | [p2_2_2<=1 & ~ [[[p1_2_4<=0 & p3_3_1<=cs_3_0] & [p3_0_1<=1 | p1_1_1<=0]]]]]]]]]]

abstracting: (p1_1_1<=0)
states: 28,311 (4)
abstracting: (p3_0_1<=1)
states: 29,641 (4)
abstracting: (p3_3_1<=cs_3_0)
states: 29,265 (4)
abstracting: (p1_2_4<=0)
states: 28,065 (4)
abstracting: (p2_2_2<=1)
states: 29,641 (4)
abstracting: (p3_1_2<=p1_2_5)
states: 29,297 (4)
abstracting: (ncs_0_3<=0)
states: 26,841 (4)
abstracting: (next_1<=1)
states: 29,641 (4)
abstracting: (p3_2_2<=0)
states: 29,289 (4)
abstracting: (1<=p1_0_6)
states: 684
abstracting: (cs_0_3<=1)
states: 29,641 (4)
abstracting: (p2_0_2<=1)
states: 29,641 (4)
abstracting: (p1_0_0<=0)
states: 28,719 (4)
abstracting: (p1_0_0<=0)
states: 28,719 (4)
abstracting: (p1_1_3<=p2_1_2)
states: 28,107 (4)
abstracting: (p2_3_1<=0)
states: 28,011 (4)
abstracting: (p3_2_3<=1)
states: 29,641 (4)
abstracting: (1<=cs_1_3)
states: 520
abstracting: (p2_1_2<=ncs_3_2)
states: 28,125 (4)
abstracting: (cs_0_1<=1)
states: 29,641 (4)
abstracting: (p1_0_6<=1)
states: 29,641 (4)
abstracting: (p1_0_1<=0)
states: 28,311 (4)
abstracting: (1<=p1_2_3)
states: 1,534 (3)
abstracting: (p2_1_0<=0)
states: 28,038 (4)
abstracting: (1<=p1_3_3)
states: 1,534 (3)
abstracting: (p1_2_1<=0)
states: 28,311 (4)
abstracting: (p2_3_2<=slot_F_T_F_F)
states: 28,491 (4)
abstracting: (1<=ncs_3_0)
states: 2,654 (3)
abstracting: (1<=p3_2_0)
states: 433
abstracting: (1<=p1_1_6)
states: 684
abstracting: (1<=p1_2_3)
states: 1,534 (3)
abstracting: (p1_1_5<=0)
states: 28,447 (4)
abstracting: (p3_2_0<=p3_3_1)
states: 29,208 (4)
abstracting: (p3_2_3<=1)
states: 29,641 (4)
abstracting: (p2_2_2<=0)
states: 27,999 (4)
abstracting: (ncs_0_2<=0)
states: 27,159 (4)
abstracting: (p1_0_0<=p3_1_3)
states: 28,759 (4)
abstracting: (p1_0_6<=1)
states: 29,641 (4)
abstracting: (p1_1_0<=0)
states: 28,719 (4)
abstracting: (1<=p1_3_3)
states: 1,534 (3)
abstracting: (p2_1_1<=p2_2_1)
states: 28,011 (4)
abstracting: (1<=p1_2_4)
states: 1,576 (3)
abstracting: (p3_1_3<=cs_1_2)
states: 29,121 (4)
abstracting: (next_0<=next_4)
states: 25,841 (4)
abstracting: (ncs_0_2<=p1_0_6)
states: 27,159 (4)
abstracting: (cs_2_1<=1)
states: 29,641 (4)
-> the formula is FALSE

FORMULA Anderson-PT-04-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

totally nodes used: 2910038 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8225505 21278602 29504107
used/not used/entry size/cache size: 20100156 47008708 16 1024MB
basic ops cache: hits/miss/sum: 1762827 4057556 5820383
used/not used/entry size/cache size: 5554427 11222789 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: 39897 148123 188020
used/not used/entry size/cache size: 146908 8241700 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 64492553
1 2362103
2 218957
3 31345
4 3575
5 304
6 24
7 2
8 1
9 0
>= 10 0

Total processing time: 0m12.157sec


BK_STOP 1680839067876

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:96665 (483), effective:2273 (11)

initing FirstDep: 0m 0.000sec


iterations count:18428 (92), effective:617 (3)

iterations count:23229 (116), effective:782 (3)

iterations count:17848 (89), effective:565 (2)

iterations count:17237 (86), effective:549 (2)

iterations count:18390 (91), effective:599 (2)

iterations count:22479 (112), effective:754 (3)

iterations count:18791 (93), effective:605 (3)

iterations count:21643 (108), effective:707 (3)

iterations count:38379 (191), effective:1204 (6)

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="Anderson-PT-04"
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 Anderson-PT-04, 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 r522-tall-167987246800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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