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.r490-tall-167912708500330.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 SwimmingPool-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-02-CTLFireability-00
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-01
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-02
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-03
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-04
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-05
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-06
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-07
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-08
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-09
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679241137304

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=SwimmingPool-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 15:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:52:19] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-03-19 15:52:19] [INFO ] Transformed 9 places.
[2023-03-19 15:52:19] [INFO ] Transformed 7 transitions.
[2023-03-19 15:52:19] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:52:19] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-19 15:52:19] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-19 15:52:19] [INFO ] Invariant cache hit.
[2023-03-19 15:52:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-19 15:52:19] [INFO ] Invariant cache hit.
[2023-03-19 15:52:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 13 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 4 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 2450 steps, including 0 resets, run visited all 26 properties in 37 ms. (steps per millisecond=66 )
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 3 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 6 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 7/9 places, 5/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 6/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:52:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:52:19] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 15:52:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 1 ms.
Total runtime 1057 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: 9 NrTr: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.770sec


RS generation: 0m 2.173sec


-> reachability set: #nodes 44324 (4.4e+04) #states 3,408,031 (6)



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

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

abstracting: (1<=p5)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.708sec

checking: AG [EF [[1<=p4 | [1<=p0 & 1<=p7]]]]
normalized: ~ [E [true U ~ [E [true U [1<=p4 | [1<=p0 & 1<=p7]]]]]]

abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.566sec

checking: EX [EG [EF [[EG [[p1<=0 | p8<=0]] & [p0<=0 | p7<=0]]]]]
normalized: EX [EG [E [true U [[p0<=0 | p7<=0] & EG [[p1<=0 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 39,897 (4)
abstracting: (p1<=0)
states: 596,343 (5)
........................................................................................................................................................
EG iterations: 152
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p0<=0)
states: 233,244 (5)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.365sec

checking: AG [[AX [1<=p5] | [1<=p6 | [1<=p0 & 1<=p7]]]]
normalized: ~ [E [true U ~ [[[1<=p6 | [1<=p0 & 1<=p7]] | ~ [EX [~ [1<=p5]]]]]]]

abstracting: (1<=p5)
states: 2,811,688 (6)
.abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.028sec

checking: [EG [p5<=0] | EG [~ [E [EG [[1<=p2 | 1<=p5]] U ~ [AX [1<=p4]]]]]]
normalized: [EG [~ [E [EG [[1<=p2 | 1<=p5]] U EX [~ [1<=p4]]]]] | EG [p5<=0]]

abstracting: (p5<=0)
states: 596,343 (5)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p4)
states: 2,782,912 (6)
.abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
.
EG iterations: 1
..........................................................
EG iterations: 58
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.483sec

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

abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
..
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.619sec

checking: EG [AF [[[p1<=0 | p8<=0] & [EX [1<=p2] | 1<=p6]]]]
normalized: EG [~ [EG [~ [[[1<=p6 | EX [1<=p2]] & [p1<=0 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 39,897 (4)
abstracting: (p1<=0)
states: 596,343 (5)
abstracting: (1<=p2)
states: 2,782,912 (6)
.abstracting: (1<=p6)
states: 3,174,787 (6)
......................
EG iterations: 22
.......................................................................................................................................................
EG iterations: 151
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.855sec

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

abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p0<=0)
states: 233,244 (5)
.abstracting: (1<=p4)
states: 2,782,912 (6)
.abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (p4<=0)
states: 625,119 (5)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.528sec

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

abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
..abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.159sec

checking: E [E [E [E [1<=p4 U AF [[1<=p1 & 1<=p8]]] U p2<=0] U ~ [[EX [[1<=p4 | 1<=p5]] | 1<=p6]]] U EG [AX [~ [[~ [[1<=p1 & 1<=p8]] & 1<=p6]]]]]
normalized: E [E [E [E [1<=p4 U ~ [EG [~ [[1<=p1 & 1<=p8]]]]] U p2<=0] U ~ [[1<=p6 | EX [[1<=p4 | 1<=p5]]]]] U EG [~ [EX [[1<=p6 & ~ [[1<=p1 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
........................................................
EG iterations: 55
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
.abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (p2<=0)
states: 625,119 (5)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p4)
states: 2,782,912 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.877sec

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

abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p3<=0)
states: 265,650 (5)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p3<=0)
states: 265,650 (5)
.
EG iterations: 1
..........................................................................................................................
EG iterations: 122
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p3<=0)
states: 265,650 (5)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p0<=0)
states: 233,244 (5)
.abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
.......................................................................................................
EG iterations: 102

EG iterations: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.839sec

checking: EG [AF [[E [1<=p6 U A [[1<=p3 & 1<=p7] U 1<=p2]] | [[1<=p1 & 1<=p8] & [p6<=0 & [[p3<=0 | p7<=0] & [p0<=0 | p7<=0]]]]]]]
normalized: EG [~ [EG [~ [[[[p6<=0 & [[p0<=0 | p7<=0] & [p3<=0 | p7<=0]]] & [1<=p1 & 1<=p8]] | E [1<=p6 U [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[1<=p3 & 1<=p7]] & ~ [1<=p2]]]]]]]]]]]

abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p3<=0)
states: 265,650 (5)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p0<=0)
states: 233,244 (5)
abstracting: (p6<=0)
states: 233,244 (5)
..........................................
EG iterations: 42

EG iterations: 0
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.929sec

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

abstracting: (p4<=0)
states: 625,119 (5)
abstracting: (p5<=0)
states: 596,343 (5)
........................................................................................................................................................
EG iterations: 152
.abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
.abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.495sec

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

abstracting: (p5<=0)
states: 596,343 (5)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p0<=0)
states: 233,244 (5)
abstracting: (p7<=0)
states: 396,660 (5)
abstracting: (p3<=0)
states: 265,650 (5)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
.abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (p5<=0)
states: 596,343 (5)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (p5<=0)
states: 596,343 (5)
abstracting: (p5<=0)
states: 596,343 (5)
.
EG iterations: 1
abstracting: (p2<=0)
states: 625,119 (5)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.343sec

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

abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p2)
states: 2,782,912 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
..............................................................................................................................................
EG iterations: 142
abstracting: (1<=p4)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (p2<=0)
states: 625,119 (5)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
abstracting: (1<=p4)
states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (p4<=0)
states: 625,119 (5)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.380sec

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

abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
..........................................................................................................................................
EG iterations: 137
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
.abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
.abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p2)
states: 2,782,912 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
..........................................................................................................................................
EG iterations: 137
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
.abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p0)
states: 3,174,787 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
..........................................................................................................................................
EG iterations: 137
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
.abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p7)
states: 3,011,371 (6)
abstracting: (1<=p3)
states: 3,142,381 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p6)
states: 3,174,787 (6)
.abstracting: (1<=p8)
states: 3,368,134 (6)
abstracting: (1<=p1)
states: 2,811,688 (6)
abstracting: (1<=p5)
states: 2,811,688 (6)
abstracting: (1<=p6)
states: 3,174,787 (6)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.338sec

totally nodes used: 12342807 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 233051705 36941543 269993248
used/not used/entry size/cache size: 30077615 37031249 16 1024MB
basic ops cache: hits/miss/sum: 77570702 13214282 90784984
used/not used/entry size/cache size: 11715561 5061655 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: 1829685 277310 2106995
used/not used/entry size/cache size: 271931 8116677 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 58857037
1 6459689
2 1118806
3 313302
4 108793
5 118821
6 33667
7 20291
8 15221
9 9422
>= 10 53815

Total processing time: 1m41.477sec


BK_STOP 1679241242480

--------------------
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:1007 (143), effective:240 (34)

initing FirstDep: 0m 0.000sec


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

iterations count:469 (67), effective:119 (17)

iterations count:79 (11), effective:18 (2)

iterations count:87 (12), effective:20 (2)

iterations count:406 (58), effective:119 (17)

iterations count:27 (3), effective:20 (2)

iterations count:127 (18), effective:40 (5)

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

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

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

iterations count:67 (9), effective:20 (2)

iterations count:467 (66), effective:140 (20)

iterations count:381 (54), effective:107 (15)

iterations count:47 (6), effective:20 (2)

iterations count:47 (6), effective:20 (2)

iterations count:35 (5), effective:8 (1)

iterations count:87 (12), effective:20 (2)

iterations count:37 (5), effective:10 (1)

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

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

iterations count:39 (5), effective:10 (1)

iterations count:287 (41), effective:70 (10)

iterations count:27 (3), effective:20 (2)

iterations count:187 (26), effective:40 (5)

iterations count:30 (4), effective:7 (1)

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

iterations count:178 (25), effective:38 (5)

iterations count:35 (5), effective:8 (1)

iterations count:27 (3), effective:20 (2)

iterations count:30 (4), effective:7 (1)

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

iterations count:97 (13), effective:36 (5)

iterations count:35 (5), effective:8 (1)

iterations count:298 (42), effective:58 (8)

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

iterations count:39 (5), effective:10 (1)

iterations count:298 (42), effective:58 (8)

iterations count:39 (5), effective:10 (1)

iterations count:613 (87), effective:290 (41)

iterations count:39 (5), effective:10 (1)

iterations count:39 (5), effective:10 (1)

iterations count:7 (1), effective:0 (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="SwimmingPool-PT-02"
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 SwimmingPool-PT-02, 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 r490-tall-167912708500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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