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.r266-smll-167863540400081.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 NeighborGrid-PT-d2n3m1t12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540400081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 19K 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 NeighborGrid-PT-d2n3m1t12-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678785711584

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d2n3m1t12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:21:55] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-14 09:21:55] [INFO ] Transformed 9 places.
[2023-03-14 09:21:55] [INFO ] Transformed 72 transitions.
[2023-03-14 09:21:55] [INFO ] Parsed PT model containing 9 places and 72 transitions and 144 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 21 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2023-03-14 09:21:55] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-14 09:21:55] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-14 09:21:55] [INFO ] Invariant cache hit.
[2023-03-14 09:21:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-14 09:21:55] [INFO ] Invariant cache hit.
[2023-03-14 09:21:56] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 9/9 places, 72/72 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 47 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 17 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 74 steps, including 0 resets, run visited all 43 properties in 42 ms. (steps per millisecond=1 )
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 20 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Applied a total of 1 rules in 14 ms. Remains 5 /9 variables (removed 4) and now considering 21/72 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 5/9 places, 21/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:56] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:56] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:21:57] [INFO ] Input system was already deterministic with 72 transitions.
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:21:57] [INFO ] Flatten gal took : 3 ms
[2023-03-14 09:21:57] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-14 09:21:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 72 transitions and 144 arcs took 0 ms.
Total runtime 2100 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.676sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: AX [EX [EF [AX [~ [p5<=p6]]]]]
normalized: ~ [EX [~ [EX [E [true U ~ [EX [p5<=p6]]]]]]]

abstracting: (p5<=p6)
states: 15,792 (4)
...-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: ~ [A [AX [1<=p2] U p1<=0]]
normalized: ~ [[~ [EG [~ [p1<=0]]] & ~ [E [~ [p1<=0] U [EX [~ [1<=p2]] & ~ [p1<=0]]]]]]

abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (1<=p2)
states: 12,870 (4)
.abstracting: (p1<=0)
states: 11,440 (4)
abstracting: (p1<=0)
states: 11,440 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [AG [[p2<=p1 | AG [p5<=p7]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [true U ~ [p5<=p7]]] | p2<=p1]]]]]

abstracting: (p2<=p1)
states: 15,792 (4)
abstracting: (p5<=p7)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [EF [AX [p3<=0]] & A [~ [AF [AX [p0<=p6]]] U ~ [AX [p2<=0]]]]
normalized: [[~ [EG [~ [EX [~ [p2<=0]]]]] & ~ [E [~ [EX [~ [p2<=0]]] U [~ [EG [EX [~ [p0<=p6]]]] & ~ [EX [~ [p2<=0]]]]]]] & E [true U ~ [EX [~ [p3<=0]]]]]

abstracting: (p3<=0)
states: 11,440 (4)
.abstracting: (p2<=0)
states: 11,440 (4)
.abstracting: (p0<=p6)
states: 15,792 (4)
..
EG iterations: 1
abstracting: (p2<=0)
states: 11,440 (4)
.abstracting: (p2<=0)
states: 11,440 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EX [EG [A [AX [~ [1<=p2]] U ~ [A [p2<=1 U p4<=p2]]]]]
normalized: EX [EG [[~ [EG [[~ [EG [~ [p4<=p2]]] & ~ [E [~ [p4<=p2] U [~ [p2<=1] & ~ [p4<=p2]]]]]]] & ~ [E [[~ [EG [~ [p4<=p2]]] & ~ [E [~ [p4<=p2] U [~ [p2<=1] & ~ [p4<=p2]]]]] U [EX [1<=p2] & [~ [EG [~ [p4<=p2]]] & ~ [E [~ [p4<=p2] U [~ [p2<=1] & ~ [p4<=p2]]]]]]]]]]]

abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p2<=1)
states: 17,875 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 12,870 (4)
.abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p2<=1)
states: 17,875 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p2<=1)
states: 17,875 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
abstracting: (p4<=p2)
states: 15,792 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AF [[~ [p3<=1] & AX [~ [E [[p5<=1 | p5<=p0] U p7<=0]]]]]
normalized: ~ [EG [~ [[~ [EX [E [[p5<=1 | p5<=p0] U p7<=0]]] & ~ [p3<=1]]]]]

abstracting: (p3<=1)
states: 17,875 (4)
abstracting: (p7<=0)
states: 11,440 (4)
abstracting: (p5<=p0)
states: 15,792 (4)
abstracting: (p5<=1)
states: 17,875 (4)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[AX [[EF [~ [p4<=1]] | ~ [A [1<=p1 U 1<=p1]]]] | [EG [1<=p1] & AF [1<=p5]]]]
normalized: E [true U [[~ [EG [~ [1<=p5]]] & EG [1<=p1]] | ~ [EX [~ [[~ [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]]]] | E [true U ~ [p4<=1]]]]]]]]

abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [EF [[AG [EF [1<=p7]] & [A [EG [p4<=p8] U ~ [1<=p3]] & [EX [1<=p3] | EX [EG [p4<=1]]]]]]]
normalized: EX [E [true U [[[EX [EG [p4<=1]] | EX [1<=p3]] & [~ [EG [1<=p3]] & ~ [E [1<=p3 U [1<=p3 & ~ [EG [p4<=p8]]]]]]] & ~ [E [true U ~ [E [true U 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p4<=p8)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 12,870 (4)
.abstracting: (p4<=1)
states: 17,875 (4)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[E [AF [p0<=1] U AX [[EG [1<=p8] | ~ [1<=p8]]]] | [p2<=p4 | p1<=p7]]]
normalized: ~ [E [true U ~ [[[p2<=p4 | p1<=p7] | E [~ [EG [~ [p0<=1]]] U ~ [EX [~ [[~ [1<=p8] | EG [1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 12,870 (4)
.abstracting: (p0<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p1<=p7)
states: 15,792 (4)
abstracting: (p2<=p4)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [EG [1<=p5] & AX [[AG [p2<=p0] & [[1<=p8 & [AX [p1<=0] & 1<=p3]] | E [~ [EG [p2<=1]] U 1<=p4]]]]]
normalized: [~ [EX [~ [[[E [~ [EG [p2<=1]] U 1<=p4] | [1<=p8 & [1<=p3 & ~ [EX [~ [p1<=0]]]]]] & ~ [E [true U ~ [p2<=p0]]]]]]] & EG [1<=p5]]

abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p2<=p0)
states: 15,792 (4)
abstracting: (p1<=0)
states: 11,440 (4)
.abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (p2<=1)
states: 17,875 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: E [[EF [1<=p2] | [EX [[[[1<=p1 | p6<=p8] & ~ [1<=p4]] & [1<=p1 & 1<=p5]]] & p2<=1]] U AG [1<=p0]]
normalized: E [[[p2<=1 & EX [[[1<=p1 & 1<=p5] & [~ [1<=p4] & [1<=p1 | p6<=p8]]]]] | E [true U 1<=p2]] U ~ [E [true U ~ [1<=p0]]]]

abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (p6<=p8)
states: 15,792 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.abstracting: (p2<=1)
states: 17,875 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [E [~ [[~ [[[p3<=p0 & p3<=0] | [p1<=p4 & p2<=p8]]] & AG [p1<=p4]]] U EX [EG [1<=p5]]]]
normalized: ~ [EX [~ [E [~ [[~ [E [true U ~ [p1<=p4]]] & ~ [[[p1<=p4 & p2<=p8] | [p3<=p0 & p3<=0]]]]] U EX [EG [1<=p5]]]]]]

abstracting: (1<=p5)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (p3<=p0)
states: 15,792 (4)
abstracting: (p2<=p8)
states: 15,792 (4)
abstracting: (p1<=p4)
states: 15,792 (4)
abstracting: (p1<=p4)
states: 15,792 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AG [[[p2<=p1 | EX [p2<=0]] | [p5<=0 | [p6<=p8 | [p6<=p1 & [p1<=1 & A [1<=p3 U p6<=p8]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[p5<=0 | [p6<=p8 | [p6<=p1 & [p1<=1 & [~ [EG [~ [p6<=p8]]] & ~ [E [~ [p6<=p8] U [~ [1<=p3] & ~ [p6<=p8]]]]]]]]] | [p2<=p1 | EX [p2<=0]]]]]]]

abstracting: (p2<=0)
states: 11,440 (4)
.abstracting: (p2<=p1)
states: 15,792 (4)
abstracting: (p6<=p8)
states: 15,792 (4)
abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (p6<=p8)
states: 15,792 (4)
abstracting: (p6<=p8)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p1<=1)
states: 17,875 (4)
abstracting: (p6<=p1)
states: 15,792 (4)
abstracting: (p6<=p8)
states: 15,792 (4)
abstracting: (p5<=0)
states: 11,440 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [AX [AX [[[EF [p8<=1] & E [p1<=1 U p2<=1]] | ~ [1<=p6]]]] & A [1<=p2 U [[[~ [A [p7<=p5 U p4<=1]] & E [p8<=p5 U p3<=1]] & [1<=p2 & p4<=1]] | [[~ [1<=p7] & EF [EG [p6<=0]]] | ~ [[[A [p5<=0 U p6<=1] & AG [p5<=1]] | ~ [[1<=p7 & [p8<=0 & [1<=p1 | p2<=0]]]]]]]]]]
normalized: [[~ [EG [~ [[[~ [[~ [[1<=p7 & [p8<=0 & [1<=p1 | p2<=0]]]] | [~ [E [true U ~ [p5<=1]]] & [~ [EG [~ [p6<=1]]] & ~ [E [~ [p6<=1] U [~ [p5<=0] & ~ [p6<=1]]]]]]]] | [E [true U EG [p6<=0]] & ~ [1<=p7]]] | [[1<=p2 & p4<=1] & [E [p8<=p5 U p3<=1] & ~ [[~ [EG [~ [p4<=1]]] & ~ [E [~ [p4<=1] U [~ [p7<=p5] & ~ [p4<=1]]]]]]]]]]]] & ~ [E [~ [[[~ [[~ [[1<=p7 & [p8<=0 & [1<=p1 | p2<=0]]]] | [~ [E [true U ~ [p5<=1]]] & [~ [EG [~ [p6<=1]]] & ~ [E [~ [p6<=1] U [~ [p5<=0] & ~ [p6<=1]]]]]]]] | [E [true U EG [p6<=0]] & ~ [1<=p7]]] | [[1<=p2 & p4<=1] & [E [p8<=p5 U p3<=1] & ~ [[~ [EG [~ [p4<=1]]] & ~ [E [~ [p4<=1] U [~ [p7<=p5] & ~ [p4<=1]]]]]]]]]] U [~ [1<=p2] & ~ [[[~ [[~ [[1<=p7 & [p8<=0 & [1<=p1 | p2<=0]]]] | [~ [E [true U ~ [p5<=1]]] & [~ [EG [~ [p6<=1]]] & ~ [E [~ [p6<=1] U [~ [p5<=0] & ~ [p6<=1]]]]]]]] | [E [true U EG [p6<=0]] & ~ [1<=p7]]] | [[1<=p2 & p4<=1] & [E [p8<=p5 U p3<=1] & ~ [[~ [EG [~ [p4<=1]]] & ~ [E [~ [p4<=1] U [~ [p7<=p5] & ~ [p4<=1]]]]]]]]]]]]]] & ~ [EX [EX [~ [[~ [1<=p6] | [E [p1<=1 U p2<=1] & E [true U p8<=1]]]]]]]]

abstracting: (p8<=1)
states: 17,875 (4)
abstracting: (p2<=1)
states: 17,875 (4)
abstracting: (p1<=1)
states: 17,875 (4)
abstracting: (1<=p6)
states: 12,870 (4)
..abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p7<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p4<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p3<=1)
states: 17,875 (4)
abstracting: (p8<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p6<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p6<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p5<=1)
states: 17,875 (4)
abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (p8<=0)
states: 11,440 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p7<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p4<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p3<=1)
states: 17,875 (4)
abstracting: (p8<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p6<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p6<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p5<=1)
states: 17,875 (4)
abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (p8<=0)
states: 11,440 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p7<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (p4<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p3<=1)
states: 17,875 (4)
abstracting: (p8<=p5)
states: 15,792 (4)
abstracting: (p4<=1)
states: 17,875 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (p6<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p5<=0)
states: 11,440 (4)
abstracting: (p6<=1)
states: 17,875 (4)
abstracting: (p6<=1)
states: 17,875 (4)
.
EG iterations: 1
abstracting: (p5<=1)
states: 17,875 (4)
abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (p8<=0)
states: 11,440 (4)
abstracting: (1<=p7)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

totally nodes used: 23069 (2.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 617264 194544 811808
used/not used/entry size/cache size: 205749 66903115 16 1024MB
basic ops cache: hits/miss/sum: 92046 23777 115823
used/not used/entry size/cache size: 42480 16734736 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: 7187 1665 8852
used/not used/entry size/cache size: 1665 8386943 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 67087316
1 20801
2 507
3 80
4 40
5 41
6 25
7 20
8 7
9 8
>= 10 19

Total processing time: 0m 5.465sec


BK_STOP 1678785723903

--------------------
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 CTLCardinality -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:1720 (23), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:834 (11), effective:42 (0)

iterations count:93 (1), effective:7 (0)

iterations count:729 (10), effective:36 (0)

iterations count:257 (3), effective:16 (0)

iterations count:777 (10), effective:31 (0)

iterations count:777 (10), effective:31 (0)

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

iterations count:777 (10), effective:31 (0)

iterations count:459 (6), effective:9 (0)

iterations count:426 (5), effective:16 (0)

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

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

iterations count:249 (3), effective:8 (0)

iterations count:837 (11), effective:33 (0)

iterations count:135 (1), effective:9 (0)

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

iterations count:265 (3), effective:16 (0)

iterations count:113 (1), effective:5 (0)

iterations count:90 (1), effective:9 (0)

iterations count:249 (3), effective:8 (0)

iterations count:349 (4), effective:24 (0)

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

iterations count:128 (1), effective:8 (0)

iterations count:1195 (16), effective:53 (0)

iterations count:528 (7), effective:8 (0)

iterations count:96 (1), effective:8 (0)

iterations count:375 (5), effective:14 (0)

iterations count:128 (1), effective:8 (0)

iterations count:351 (4), effective:9 (0)

iterations count:249 (3), effective:8 (0)

iterations count:426 (5), effective:16 (0)

iterations count:375 (5), effective:14 (0)

iterations count:128 (1), effective:8 (0)

iterations count:351 (4), effective:9 (0)

iterations count:249 (3), effective:8 (0)

iterations count:426 (5), effective:16 (0)

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

iterations count:375 (5), effective:14 (0)

iterations count:128 (1), effective:8 (0)

iterations count:351 (4), effective:9 (0)

iterations count:249 (3), effective:8 (0)

iterations count:426 (5), effective:16 (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="NeighborGrid-PT-d2n3m1t12"
export BK_EXAMINATION="CTLCardinality"
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 NeighborGrid-PT-d2n3m1t12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540400081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d2n3m1t12.tgz
mv NeighborGrid-PT-d2n3m1t12 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;