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.r138-smll-167819419300050.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 Diffusion2D-PT-D05N010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419300050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 04:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 55K 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 Diffusion2D-PT-D05N010-CTLFireability-00
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-01
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-02
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-03
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-04
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-05
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-06
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-07
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-08
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-09
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-10
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-11
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-12
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-13
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-14
FORMULA_NAME Diffusion2D-PT-D05N010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678558677053

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=Diffusion2D-PT-D05N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 18:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 18:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:18:00] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-11 18:18:00] [INFO ] Transformed 25 places.
[2023-03-11 18:18:00] [INFO ] Transformed 144 transitions.
[2023-03-11 18:18:00] [INFO ] Parsed PT model containing 25 places and 144 transitions and 288 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Diffusion2D-PT-D05N010-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 23 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2023-03-11 18:18:00] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-11 18:18:00] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-11 18:18:00] [INFO ] Invariant cache hit.
[2023-03-11 18:18:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-11 18:18:00] [INFO ] Invariant cache hit.
[2023-03-11 18:18:00] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 25/25 places, 144/144 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 66 ms
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 23 ms
[2023-03-11 18:18:01] [INFO ] Input system was already deterministic with 144 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 33) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 18:18:01] [INFO ] Invariant cache hit.
[2023-03-11 18:18:01] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 14 ms
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 14 ms
[2023-03-11 18:18:01] [INFO ] Input system was already deterministic with 144 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 118 edges and 25 vertex of which 23 / 25 are part of one of the 1 SCC in 4 ms
Free SCC test removed 22 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Applied a total of 1 rules in 13 ms. Remains 3 /25 variables (removed 22) and now considering 5/144 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 3/25 places, 5/144 transitions.
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:01] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 20 ms
[2023-03-11 18:18:01] [INFO ] Flatten gal took : 12 ms
[2023-03-11 18:18:01] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 10 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 10 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 10 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 98 edges and 25 vertex of which 22 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Applied a total of 1 rules in 3 ms. Remains 4 /25 variables (removed 21) and now considering 9/144 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 4/25 places, 9/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 138 edges and 25 vertex of which 24 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /25 variables (removed 23) and now considering 3/144 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/25 places, 3/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 138 edges and 25 vertex of which 24 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /25 variables (removed 23) and now considering 3/144 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/25 places, 3/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA Diffusion2D-PT-D05N010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 134 edges and 25 vertex of which 24 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /25 variables (removed 23) and now considering 3/144 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/25 places, 3/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 108 edges and 25 vertex of which 22 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Applied a total of 1 rules in 3 ms. Remains 4 /25 variables (removed 21) and now considering 7/144 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 4/25 places, 7/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 144/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 90 edges and 25 vertex of which 20 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 19 places
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Applied a total of 1 rules in 3 ms. Remains 6 /25 variables (removed 19) and now considering 19/144 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 6/25 places, 19/144 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 18:18:02] [INFO ] Input system was already deterministic with 19 transitions.
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:18:02] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 18:18:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 144 transitions and 288 arcs took 1 ms.
Total runtime 2644 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: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 3.740sec


RS generation: 0m 0.043sec


-> reachability set: #nodes 265 (2.6e+02) #states 131,128,140 (8)



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

checking: AG [AF [1<=p24]]
normalized: ~ [E [true U EG [~ [1<=p24]]]]

abstracting: (1<=p24)
states: 38,567,100 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AF [1<=p3]
normalized: ~ [EG [~ [1<=p3]]]

abstracting: (1<=p3)
states: 38,567,100 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [EF [[1<=p19 | EG [AF [p8<=0]]]]]
normalized: ~ [E [true U ~ [E [true U [1<=p19 | EG [~ [EG [~ [p8<=0]]]]]]]]]

abstracting: (p8<=0)
states: 92,561,040 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p19)
states: 38,567,100 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: EF [EG [[p13<=0 | [p18<=0 | 1<=p16]]]]
normalized: E [true U EG [[p13<=0 | [p18<=0 | 1<=p16]]]]

abstracting: (1<=p16)
states: 38,567,100 (7)
abstracting: (p18<=0)
states: 92,561,040 (7)
abstracting: (p13<=0)
states: 92,561,040 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EG [[EX [EG [A [1<=p15 U 1<=p23]]] | EG [EF [p9<=0]]]]
normalized: EG [[EG [E [true U p9<=0]] | EX [EG [[~ [EG [~ [1<=p23]]] & ~ [E [~ [1<=p23] U [~ [1<=p15] & ~ [1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 38,567,100 (7)
abstracting: (1<=p15)
states: 38,567,100 (7)
abstracting: (1<=p23)
states: 38,567,100 (7)
abstracting: (1<=p23)
states: 38,567,100 (7)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (p9<=0)
states: 92,561,040 (7)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [EF [[A [p9<=0 U 1<=p15] | 1<=p9]] & EF [1<=p12]]
normalized: [E [true U 1<=p12] & E [true U [1<=p9 | [~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [~ [p9<=0] & ~ [1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 38,567,100 (7)
abstracting: (p9<=0)
states: 92,561,040 (7)
abstracting: (1<=p15)
states: 38,567,100 (7)
abstracting: (1<=p15)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (1<=p9)
states: 38,567,100 (7)
abstracting: (1<=p12)
states: 38,567,100 (7)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: AG [[p16<=0 | [AG [[p21<=0 | p1<=0]] | [p17<=0 & EG [p5<=0]]]]]
normalized: ~ [E [true U ~ [[p16<=0 | [[p17<=0 & EG [p5<=0]] | ~ [E [true U ~ [[p21<=0 | p1<=0]]]]]]]]]

abstracting: (p1<=0)
states: 92,561,040 (7)
abstracting: (p21<=0)
states: 92,561,040 (7)
abstracting: (p5<=0)
states: 92,561,040 (7)
.
EG iterations: 1
abstracting: (p17<=0)
states: 92,561,040 (7)
abstracting: (p16<=0)
states: 92,561,040 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

checking: [EX [EX [[AG [p18<=0] | ~ [E [1<=p13 U 1<=p18]]]]] & EF [AG [[[p18<=0 & p5<=0] & [p12<=0 & p8<=0]]]]]
normalized: [E [true U ~ [E [true U ~ [[[p12<=0 & p8<=0] & [p18<=0 & p5<=0]]]]]] & EX [EX [[~ [E [1<=p13 U 1<=p18]] | ~ [E [true U ~ [p18<=0]]]]]]]

abstracting: (p18<=0)
states: 92,561,040 (7)
abstracting: (1<=p18)
states: 38,567,100 (7)
abstracting: (1<=p13)
states: 38,567,100 (7)
..abstracting: (p5<=0)
states: 92,561,040 (7)
abstracting: (p18<=0)
states: 92,561,040 (7)
abstracting: (p8<=0)
states: 92,561,040 (7)
abstracting: (p12<=0)
states: 92,561,040 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: EX [[EG [AF [1<=p23]] & [[~ [E [[1<=p8 | 1<=p24] U A [1<=p21 U 1<=p2]]] | p16<=0] | [EX [p6<=0] | [[EX [p11<=0] & p12<=0] | [EF [p3<=0] & p5<=0]]]]]]
normalized: EX [[[[[[p5<=0 & E [true U p3<=0]] | [p12<=0 & EX [p11<=0]]] | EX [p6<=0]] | [p16<=0 | ~ [E [[1<=p8 | 1<=p24] U [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p21] & ~ [1<=p2]]]]]]]]] & EG [~ [EG [~ [1<=p23]]]]]]

abstracting: (1<=p23)
states: 38,567,100 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 38,567,100 (7)
abstracting: (1<=p21)
states: 38,567,100 (7)
abstracting: (1<=p2)
states: 38,567,100 (7)
abstracting: (1<=p2)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (1<=p24)
states: 38,567,100 (7)
abstracting: (1<=p8)
states: 38,567,100 (7)
abstracting: (p16<=0)
states: 92,561,040 (7)
abstracting: (p6<=0)
states: 92,561,040 (7)
.abstracting: (p11<=0)
states: 92,561,040 (7)
.abstracting: (p12<=0)
states: 92,561,040 (7)
abstracting: (p3<=0)
states: 92,561,040 (7)
abstracting: (p5<=0)
states: 92,561,040 (7)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.166sec

checking: AX [[[~ [A [1<=p3 U AF [1<=p17]]] & EX [1<=p16]] | [[EG [[[[1<=p14 | 1<=p20] & 1<=p6] | 1<=p16]] & AX [p13<=0]] & [EX [p15<=0] & [p23<=0 | AX [1<=p24]]]]]]
normalized: ~ [EX [~ [[[[[p23<=0 | ~ [EX [~ [1<=p24]]]] & EX [p15<=0]] & [~ [EX [~ [p13<=0]]] & EG [[1<=p16 | [1<=p6 & [1<=p14 | 1<=p20]]]]]] | [EX [1<=p16] & ~ [[~ [EG [EG [~ [1<=p17]]]] & ~ [E [EG [~ [1<=p17]] U [~ [1<=p3] & EG [~ [1<=p17]]]]]]]]]]]]

abstracting: (1<=p17)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (1<=p3)
states: 38,567,100 (7)
abstracting: (1<=p17)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (1<=p17)
states: 38,567,100 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p16)
states: 38,567,100 (7)
.abstracting: (1<=p20)
states: 38,567,100 (7)
abstracting: (1<=p14)
states: 38,567,100 (7)
abstracting: (1<=p6)
states: 38,567,100 (7)
abstracting: (1<=p16)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (p13<=0)
states: 92,561,040 (7)
.abstracting: (p15<=0)
states: 92,561,040 (7)
.abstracting: (1<=p24)
states: 38,567,100 (7)
.abstracting: (p23<=0)
states: 92,561,040 (7)
.-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.080sec

checking: AG [[1<=p16 | [A [AX [p8<=0] U [p5<=0 & [1<=p17 | E [1<=p14 U 1<=p10]]]] & [[EX [p18<=0] | [p16<=0 | AF [p6<=0]]] & [AX [EF [1<=p16]] | EF [[1<=p8 & 1<=p21]]]]]]]
normalized: ~ [E [true U ~ [[1<=p16 | [[[E [true U [1<=p8 & 1<=p21]] | ~ [EX [~ [E [true U 1<=p16]]]]] & [[p16<=0 | ~ [EG [~ [p6<=0]]]] | EX [p18<=0]]] & [~ [EG [~ [[p5<=0 & [1<=p17 | E [1<=p14 U 1<=p10]]]]]] & ~ [E [~ [[p5<=0 & [1<=p17 | E [1<=p14 U 1<=p10]]]] U [EX [~ [p8<=0]] & ~ [[p5<=0 & [1<=p17 | E [1<=p14 U 1<=p10]]]]]]]]]]]]]

abstracting: (1<=p10)
states: 38,567,100 (7)
abstracting: (1<=p14)
states: 38,567,100 (7)
abstracting: (1<=p17)
states: 38,567,100 (7)
abstracting: (p5<=0)
states: 92,561,040 (7)
abstracting: (p8<=0)
states: 92,561,040 (7)
.abstracting: (1<=p10)
states: 38,567,100 (7)
abstracting: (1<=p14)
states: 38,567,100 (7)
abstracting: (1<=p17)
states: 38,567,100 (7)
abstracting: (p5<=0)
states: 92,561,040 (7)
abstracting: (1<=p10)
states: 38,567,100 (7)
abstracting: (1<=p14)
states: 38,567,100 (7)
abstracting: (1<=p17)
states: 38,567,100 (7)
abstracting: (p5<=0)
states: 92,561,040 (7)
.
EG iterations: 1
abstracting: (p18<=0)
states: 92,561,040 (7)
.abstracting: (p6<=0)
states: 92,561,040 (7)
.
EG iterations: 1
abstracting: (p16<=0)
states: 92,561,040 (7)
abstracting: (1<=p16)
states: 38,567,100 (7)
.abstracting: (1<=p21)
states: 38,567,100 (7)
abstracting: (1<=p8)
states: 38,567,100 (7)
abstracting: (1<=p16)
states: 38,567,100 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.251sec

checking: AG [[AX [p1<=0] | [p8<=0 | [E [[[EG [1<=p22] | p12<=0] & ~ [[1<=p10 & 1<=p19]]] U [[AF [1<=p12] | EX [1<=p7]] & E [1<=p8 U 1<=p12]]] & AX [~ [E [1<=p5 U 1<=p11]]]]]]]
normalized: ~ [E [true U ~ [[[p8<=0 | [~ [EX [E [1<=p5 U 1<=p11]]] & E [[~ [[1<=p10 & 1<=p19]] & [p12<=0 | EG [1<=p22]]] U [E [1<=p8 U 1<=p12] & [EX [1<=p7] | ~ [EG [~ [1<=p12]]]]]]]] | ~ [EX [~ [p1<=0]]]]]]]

abstracting: (p1<=0)
states: 92,561,040 (7)
.abstracting: (1<=p12)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (1<=p7)
states: 38,567,100 (7)
.abstracting: (1<=p12)
states: 38,567,100 (7)
abstracting: (1<=p8)
states: 38,567,100 (7)
abstracting: (1<=p22)
states: 38,567,100 (7)
.
EG iterations: 1
abstracting: (p12<=0)
states: 92,561,040 (7)
abstracting: (1<=p19)
states: 38,567,100 (7)
abstracting: (1<=p10)
states: 38,567,100 (7)
abstracting: (1<=p11)
states: 38,567,100 (7)
abstracting: (1<=p5)
states: 38,567,100 (7)
.abstracting: (p8<=0)
states: 92,561,040 (7)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.224sec

checking: EX [[[AG [[EF [p17<=0] | [[p13<=0 | p20<=0] & [p10<=0 & p6<=0]]]] & EF [p13<=0]] & [p8<=0 & [[EG [p17<=0] | [1<=p14 | p1<=0]] & [1<=p8 | [p11<=0 & p0<=0]]]]]]
normalized: EX [[[p8<=0 & [[1<=p8 | [p11<=0 & p0<=0]] & [[1<=p14 | p1<=0] | EG [p17<=0]]]] & [E [true U p13<=0] & ~ [E [true U ~ [[[[p10<=0 & p6<=0] & [p13<=0 | p20<=0]] | E [true U p17<=0]]]]]]]]

abstracting: (p17<=0)
states: 92,561,040 (7)
abstracting: (p20<=0)
states: 92,561,040 (7)
abstracting: (p13<=0)
states: 92,561,040 (7)
abstracting: (p6<=0)
states: 92,561,040 (7)
abstracting: (p10<=0)
states: 92,561,040 (7)
abstracting: (p13<=0)
states: 92,561,040 (7)
abstracting: (p17<=0)
states: 92,561,040 (7)
.
EG iterations: 1
abstracting: (p1<=0)
states: 92,561,040 (7)
abstracting: (1<=p14)
states: 38,567,100 (7)
abstracting: (p0<=0)
states: 92,561,040 (7)
abstracting: (p11<=0)
states: 92,561,040 (7)
abstracting: (1<=p8)
states: 38,567,100 (7)
abstracting: (p8<=0)
states: 92,561,040 (7)
.-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

totally nodes used: 147335 (1.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8217973 1838733 10056706
used/not used/entry size/cache size: 1921154 65187710 16 1024MB
basic ops cache: hits/miss/sum: 542315 107064 649379
used/not used/entry size/cache size: 202450 16574766 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: 24369 5035 29404
used/not used/entry size/cache size: 5035 8383573 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 66963483
1 143564
2 1717
3 70
4 23
5 7
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.856sec


BK_STOP 1678558690502

--------------------
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 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:7924 (55), effective:240 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:836 (5), effective:23 (0)

iterations count:921 (6), effective:23 (0)

iterations count:942 (6), effective:24 (0)

iterations count:1739 (12), effective:48 (0)

iterations count:1666 (11), effective:47 (0)

iterations count:941 (6), effective:24 (0)

iterations count:872 (6), effective:22 (0)

iterations count:799 (5), effective:21 (0)

iterations count:704 (4), effective:10 (0)

iterations count:942 (6), effective:24 (0)

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

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

iterations count:942 (6), effective:24 (0)

iterations count:942 (6), effective:24 (0)

iterations count:758 (5), effective:18 (0)

iterations count:942 (6), effective:24 (0)

iterations count:941 (6), effective:24 (0)

iterations count:1737 (12), effective:48 (0)

iterations count:1329 (9), effective:28 (0)

iterations count:427 (2), effective:14 (0)

iterations count:961 (6), effective:25 (0)

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

iterations count:1705 (11), effective:44 (0)

iterations count:884 (6), effective:10 (0)

iterations count:624 (4), effective:10 (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="Diffusion2D-PT-D05N010"
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 Diffusion2D-PT-D05N010, 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 r138-smll-167819419300050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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