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.r170-tall-167838856600010.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 ERK-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.2K Feb 26 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 16:35 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 3.7K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678463938467

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ERK-PT-000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:59:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 15:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:59:00] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-10 15:59:00] [INFO ] Transformed 11 places.
[2023-03-10 15:59:00] [INFO ] Transformed 11 transitions.
[2023-03-10 15:59:00] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ERK-PT-000010-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000010-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:59:00] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 15:59:00] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-10 15:59:00] [INFO ] Invariant cache hit.
[2023-03-10 15:59:00] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-10 15:59:00] [INFO ] Invariant cache hit.
[2023-03-10 15:59:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 18 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 3 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 4085 steps, including 1 resets, run visited all 21 properties in 50 ms. (steps per millisecond=81 )
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 3 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 7 transition count 9
Applied a total of 6 rules in 11 ms. Remains 7 /11 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 7/11 places, 9/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
FORMULA ERK-PT-000010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:00] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-10 15:59:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 805 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.788sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 111 (1.1e+02) #states 47,047 (4)



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

checking: EF [AX [p4<=0]]
normalized: E [true U ~ [EX [~ [p4<=0]]]]

abstracting: (p4<=0)
states: 9,009 (3)
.-> the formula is TRUE

FORMULA ERK-PT-000010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [AF [EX [[[p4<=0 | p5<=0] | EG [p6<=0]]]]]
normalized: ~ [E [true U EG [~ [EX [[EG [p6<=0] | [p4<=0 | p5<=0]]]]]]]

abstracting: (p5<=0)
states: 18,876 (4)
abstracting: (p4<=0)
states: 9,009 (3)
abstracting: (p6<=0)
states: 12,298 (4)
..
EG iterations: 2
..
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (1<=p5)
states: 28,171 (4)
.abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
abstracting: (1<=p5)
states: 28,171 (4)
..abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ERK-PT-000010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[AF [~ [A [[1<=p5 | [1<=p2 & 1<=p3]] U EF [[1<=p0 & 1<=p1]]]]] & 1<=p5]]
normalized: E [true U [~ [EG [[~ [EG [~ [E [true U [1<=p0 & 1<=p1]]]]] & ~ [E [~ [E [true U [1<=p0 & 1<=p1]]] U [~ [[[1<=p2 & 1<=p3] | 1<=p5]] & ~ [E [true U [1<=p0 & 1<=p1]]]]]]]]] & 1<=p5]]

abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [E [[[1<=p2 & 1<=p3] | [[1<=p6 | AF [1<=p4]] & [p6<=0 | EF [1<=p4]]]] U 1<=p5]]
normalized: ~ [E [true U ~ [E [[[[E [true U 1<=p4] | p6<=0] & [~ [EG [~ [1<=p4]]] | 1<=p6]] | [1<=p2 & 1<=p3]] U 1<=p5]]]]

abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
abstracting: (p6<=0)
states: 12,298 (4)
abstracting: (1<=p4)
states: 38,038 (4)
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [A [p2<=0 U EG [1<=p5]] | AG [E [~ [AX [[1<=p6 & [1<=p2 & 1<=p3]]]] U AX [[p6<=0 & ~ [[1<=p9 & 1<=p10]]]]]]]
normalized: [~ [E [true U ~ [E [EX [~ [[[1<=p2 & 1<=p3] & 1<=p6]]] U ~ [EX [~ [[~ [[1<=p9 & 1<=p10]] & p6<=0]]]]]]]] | [~ [EG [~ [EG [1<=p5]]]] & ~ [E [~ [EG [1<=p5]] U [~ [p2<=0] & ~ [EG [1<=p5]]]]]]]

abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
abstracting: (p2<=0)
states: 12,298 (4)
abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p6<=0)
states: 12,298 (4)
abstracting: (1<=p10)
states: 46,981 (4)
abstracting: (1<=p9)
states: 34,749 (4)
.abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
.-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [EX [[EX [[1<=p0 & 1<=p1]] & [~ [A [1<=p2 U 1<=p6]] & ~ [E [[1<=p5 | [1<=p0 & 1<=p1]] U AG [[1<=p0 & 1<=p1]]]]]]]]
normalized: ~ [EG [~ [EX [[[~ [E [[[1<=p0 & 1<=p1] | 1<=p5] U ~ [E [true U ~ [[1<=p0 & 1<=p1]]]]]] & ~ [[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p2] & ~ [1<=p6]]]]]]] & EX [[1<=p0 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
.abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p6)
states: 34,749 (4)
..
EG iterations: 2
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
...
EG iterations: 2
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [AX [[EX [[1<=p4 & [1<=p9 & 1<=p10]]] | [EG [p5<=0] | ~ [[AG [[1<=p7 & 1<=p8]] & [1<=p4 & EX [1<=p5]]]]]]] U 1<=p5]
normalized: [~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [EX [~ [[[~ [[[EX [1<=p5] & 1<=p4] & ~ [E [true U ~ [[1<=p7 & 1<=p8]]]]]] | EG [p5<=0]] | EX [[[1<=p9 & 1<=p10] & 1<=p4]]]]] & ~ [1<=p5]]]]]

abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p10)
states: 46,981 (4)
abstracting: (1<=p9)
states: 34,749 (4)
.abstracting: (p5<=0)
states: 18,876 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p5)
states: 28,171 (4)
..abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p2)
states: 34,749 (4)
..
EG iterations: 2
abstracting: (1<=p2)
states: 34,749 (4)
.abstracting: (1<=p10)
states: 46,981 (4)
abstracting: (1<=p9)
states: 34,749 (4)
.abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
abstracting: (p4<=0)
states: 9,009 (3)
.abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
..abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA ERK-PT-000010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p4)
states: 38,038 (4)
.abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
.
EG iterations: 1
abstracting: (1<=p5)
states: 28,171 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 46,981 (4)
abstracting: (1<=p9)
states: 34,749 (4)
.abstracting: (1<=p4)
states: 38,038 (4)
abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
abstracting: (1<=p4)
states: 38,038 (4)
-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (1<=p8)
states: 38,038 (4)
abstracting: (1<=p7)
states: 46,761 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (p6<=0)
states: 12,298 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
..
EG iterations: 2
.abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p10)
states: 46,981 (4)
abstracting: (1<=p9)
states: 34,749 (4)
abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (p4<=0)
states: 9,009 (3)
.-> the formula is TRUE

FORMULA ERK-PT-000010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (p8<=0)
states: 9,009 (3)
abstracting: (p7<=0)
states: 286
.
EG iterations: 1
.abstracting: (1<=p5)
states: 28,171 (4)
abstracting: (1<=p6)
states: 34,749 (4)
abstracting: (p4<=0)
states: 9,009 (3)
abstracting: (p10<=0)
states: 66
abstracting: (p9<=0)
states: 12,298 (4)
abstracting: (p8<=0)
states: 9,009 (3)
abstracting: (p7<=0)
states: 286
abstracting: (p1<=0)
states: 12,298 (4)
abstracting: (p0<=0)
states: 286
abstracting: (p1<=0)
states: 12,298 (4)
abstracting: (p0<=0)
states: 286
abstracting: (1<=p3)
states: 38,038 (4)
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p1)
states: 34,749 (4)
abstracting: (1<=p0)
states: 46,761 (4)
..
EG iterations: 2
abstracting: (1<=p4)
states: 38,038 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 34,749 (4)
abstracting: (1<=p5)
states: 28,171 (4)
.-> the formula is FALSE

FORMULA ERK-PT-000010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 17663 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 114712 43494 158206
used/not used/entry size/cache size: 58855 67050009 16 1024MB
basic ops cache: hits/miss/sum: 47770 20192 67962
used/not used/entry size/cache size: 38010 16739206 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: 2735 959 3694
used/not used/entry size/cache size: 959 8387649 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 67093395
1 14698
2 496
3 127
4 30
5 31
6 22
7 15
8 12
9 7
>= 10 31

Total processing time: 0m 4.401sec


BK_STOP 1678463946307

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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:251 (22), effective:80 (7)

initing FirstDep: 0m 0.000sec


iterations count:51 (4), effective:20 (1)

iterations count:125 (11), effective:36 (3)

iterations count:27 (2), effective:6 (0)

iterations count:32 (2), effective:6 (0)

iterations count:43 (3), effective:12 (1)

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

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

iterations count:76 (6), effective:19 (1)

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

iterations count:25 (2), effective:4 (0)

iterations count:25 (2), effective:4 (0)

iterations count:25 (2), effective:4 (0)

iterations count:32 (2), effective:6 (0)

iterations count:27 (2), effective:6 (0)

iterations count:141 (12), effective:40 (3)

iterations count:21 (1), effective:3 (0)

iterations count:139 (12), effective:37 (3)

iterations count:85 (7), effective:24 (2)

iterations count:71 (6), effective:30 (2)

iterations count:41 (3), effective:10 (0)

iterations count:21 (1), effective:10 (0)

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

iterations count:27 (2), effective:6 (0)

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

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

iterations count:46 (4), effective:12 (1)

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

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

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

iterations count:61 (5), effective:20 (1)

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

iterations count:85 (7), effective:37 (3)

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

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

iterations count:32 (2), effective:6 (0)

iterations count:71 (6), effective:20 (1)

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

iterations count:33 (3), effective:6 (0)

iterations count:28 (2), effective:4 (0)

iterations count:27 (2), effective:6 (0)

iterations count:32 (2), effective:6 (0)

iterations count:31 (2), effective:6 (0)

iterations count:54 (4), effective:24 (2)

iterations count:27 (2), effective:6 (0)

iterations count:53 (4), effective:21 (1)

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="ERK-PT-000010"
export BK_EXAMINATION="CTLFireability"
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 ERK-PT-000010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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