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.r202-smll-167840348600370.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 HexagonalGrid-PT-110, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348600370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:00 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.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-CTLFireability-00
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-01
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-02
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-03
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-04
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-05
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-06
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-07
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-08
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-09
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-10
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-11
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-12
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-13
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-14
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678733727805

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=HexagonalGrid-PT-110
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:55:31] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-13 18:55:31] [INFO ] Transformed 31 places.
[2023-03-13 18:55:31] [INFO ] Transformed 42 transitions.
[2023-03-13 18:55:31] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA HexagonalGrid-PT-110-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 14 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2023-03-13 18:55:31] [INFO ] Computed 14 place invariants in 7 ms
[2023-03-13 18:55:31] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-13 18:55:31] [INFO ] Invariant cache hit.
[2023-03-13 18:55:31] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-13 18:55:31] [INFO ] Invariant cache hit.
[2023-03-13 18:55:31] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 31/31 places, 42/42 transitions.
Support contains 25 out of 31 places after structural reductions.
[2023-03-13 18:55:32] [INFO ] Flatten gal took : 47 ms
[2023-03-13 18:55:32] [INFO ] Flatten gal took : 20 ms
[2023-03-13 18:55:32] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 30) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 18:55:32] [INFO ] Invariant cache hit.
[2023-03-13 18:55:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-13 18:55:33] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 18:55:33] [INFO ] After 80ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 42/42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:55:33] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:55:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:55:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 18:55:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 42 transitions and 168 arcs took 1 ms.
Total runtime 2485 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: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.675sec


RS generation: 0m 0.023sec


-> reachability set: #nodes 679 (6.8e+02) #states 40,193 (4)



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

checking: EX [AG [EF [[p6<=0 | p10<=0]]]]
normalized: EX [~ [E [true U ~ [E [true U [p6<=0 | p10<=0]]]]]]

abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EG [EF [AG [[1<=p6 & 1<=p11]]]]
normalized: EG [E [true U ~ [E [true U ~ [[1<=p6 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [[p6<=0 | p11<=0]]
normalized: EX [[p6<=0 | p11<=0]]

abstracting: (p11<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [[AX [[p6<=0 | p12<=0]] | [1<=p6 & 1<=p12]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p6 & 1<=p12] | ~ [EX [~ [[p6<=0 | p12<=0]]]]]]]]]

abstracting: (p12<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
.abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AF [EX [[1<=p6 & 1<=p9]]] | EF [[p2<=0 | p27<=0]]]
normalized: [E [true U [p2<=0 | p27<=0]] | ~ [EG [~ [EX [[1<=p6 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 2
abstracting: (p27<=0)
states: 10,625 (4)
abstracting: (p2<=0)
states: 26,351 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [AF [~ [E [~ [[1<=p16 & 1<=p22]] U [1<=p6 & 1<=p8]]]]]
normalized: ~ [EX [EG [E [~ [[1<=p16 & 1<=p22]] U [1<=p6 & 1<=p8]]]]]

abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AG [EF [[[[p6<=0 | p9<=0] & [p1<=0 | p26<=0]] | [1<=p6 & 1<=p10]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p6 & 1<=p10] | [[p1<=0 | p26<=0] & [p6<=0 | p9<=0]]]]]]]

abstracting: (p9<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p26<=0)
states: 10,625 (4)
abstracting: (p1<=0)
states: 26,351 (4)
abstracting: (1<=p10)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[AX [[1<=p6 & 1<=p12]] & EX [EG [[1<=p18 & 1<=p24]]]] & [1<=p6 & 1<=p9]]]
normalized: E [true U [[1<=p6 & 1<=p9] & [EX [EG [[1<=p18 & 1<=p24]]] & ~ [EX [~ [[1<=p6 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p24)
states: 10,625 (4)
abstracting: (1<=p18)
states: 29,568 (4)
..
EG iterations: 2
.abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [E [AX [EF [[1<=p6 & 1<=p7]]] U [~ [EF [[1<=p17 & 1<=p23]]] & [1<=p16 & 1<=p22]]]]]
normalized: E [true U ~ [E [~ [EX [~ [E [true U [1<=p6 & 1<=p7]]]]] U [[1<=p16 & 1<=p22] & ~ [E [true U [1<=p17 & 1<=p23]]]]]]]

abstracting: (1<=p23)
states: 10,625 (4)
abstracting: (1<=p17)
states: 29,568 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

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

abstracting: (p12<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 3
..-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [A [AX [EF [[1<=p6 & 1<=p8]]] U E [AX [[1<=p6 & [1<=p10 & 1<=p12]]] U E [A [[1<=p6 & 1<=p7] U ~ [[p6<=0 | p10<=0]]] U ~ [[p6<=0 | p10<=0]]]]]]
normalized: EX [[~ [EG [~ [E [~ [EX [~ [[[1<=p10 & 1<=p12] & 1<=p6]]]] U E [[~ [EG [[p6<=0 | p10<=0]]] & ~ [E [[p6<=0 | p10<=0] U [~ [[1<=p6 & 1<=p7]] & [p6<=0 | p10<=0]]]]] U ~ [[p6<=0 | p10<=0]]]]]]] & ~ [E [~ [E [~ [EX [~ [[[1<=p10 & 1<=p12] & 1<=p6]]]] U E [[~ [EG [[p6<=0 | p10<=0]]] & ~ [E [[p6<=0 | p10<=0] U [~ [[1<=p6 & 1<=p7]] & [p6<=0 | p10<=0]]]]] U ~ [[p6<=0 | p10<=0]]]]] U [EX [~ [E [true U [1<=p6 & 1<=p8]]]] & ~ [E [~ [EX [~ [[[1<=p10 & 1<=p12] & 1<=p6]]]] U E [[~ [EG [[p6<=0 | p10<=0]]] & ~ [E [[p6<=0 | p10<=0] U [~ [[1<=p6 & 1<=p7]] & [p6<=0 | p10<=0]]]]] U ~ [[p6<=0 | p10<=0]]]]]]]]]]

abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
...
EG iterations: 3
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p10)
states: 10,625 (4)
.abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
...
EG iterations: 3
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p10)
states: 10,625 (4)
.abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
...
EG iterations: 3
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p10)
states: 10,625 (4)
....
EG iterations: 3
.-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AG [[EF [[p5<=0 | [p30<=0 | [1<=p4 & 1<=p29]]]] & [EX [[EF [[1<=p6 & 1<=p9]] | EG [[1<=p6 & 1<=p10]]]] | [EG [[AX [[1<=p6 & 1<=p7]] & [p4<=0 | p29<=0]]] | [AF [[p18<=0 | p24<=0]] & [1<=p6 & 1<=p8]]]]]]
normalized: ~ [E [true U ~ [[[[[[1<=p6 & 1<=p8] & ~ [EG [~ [[p18<=0 | p24<=0]]]]] | EG [[[p4<=0 | p29<=0] & ~ [EX [~ [[1<=p6 & 1<=p7]]]]]]] | EX [[EG [[1<=p6 & 1<=p10]] | E [true U [1<=p6 & 1<=p9]]]]] & E [true U [[[1<=p4 & 1<=p29] | p30<=0] | p5<=0]]]]]]

abstracting: (p5<=0)
states: 26,351 (4)
abstracting: (p30<=0)
states: 10,625 (4)
abstracting: (1<=p29)
states: 29,568 (4)
abstracting: (1<=p4)
states: 13,842 (4)
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p10)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 3
.abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (p29<=0)
states: 10,625 (4)
abstracting: (p4<=0)
states: 26,351 (4)
..
EG iterations: 2
abstracting: (p24<=0)
states: 29,568 (4)
abstracting: (p18<=0)
states: 10,625 (4)
..
EG iterations: 2
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: ~ [E [[E [[EX [~ [[p6<=0 | p10<=0]]] | ~ [[[1<=p6 & 1<=p7] | [1<=p17 & 1<=p23]]]] U A [[1<=p16 & 1<=p22] U ~ [[1<=p16 & 1<=p22]]]] | [[E [[p6<=0 | p10<=0] U ~ [[1<=p6 & 1<=p7]]] & EX [[1<=p6 & 1<=p9]]] & [~ [[~ [A [[1<=p5 & 1<=p30] U [1<=p6 & 1<=p7]]] | [[[1<=p6 & 1<=p8] & [1<=p6 & 1<=p7]] | ~ [[1<=p6 & 1<=p11]]]]] & [1<=p6 & 1<=p11]]]] U EX [[1<=p6 & 1<=p9]]]]
normalized: ~ [E [[[[[1<=p6 & 1<=p11] & ~ [[[~ [[1<=p6 & 1<=p11]] | [[1<=p6 & 1<=p7] & [1<=p6 & 1<=p8]]] | ~ [[~ [EG [~ [[1<=p6 & 1<=p7]]]] & ~ [E [~ [[1<=p6 & 1<=p7]] U [~ [[1<=p5 & 1<=p30]] & ~ [[1<=p6 & 1<=p7]]]]]]]]]] & [EX [[1<=p6 & 1<=p9]] & E [[p6<=0 | p10<=0] U ~ [[1<=p6 & 1<=p7]]]]] | E [[~ [[[1<=p17 & 1<=p23] | [1<=p6 & 1<=p7]]] | EX [~ [[p6<=0 | p10<=0]]]] U [~ [EG [[1<=p16 & 1<=p22]]] & ~ [E [[1<=p16 & 1<=p22] U [~ [[1<=p16 & 1<=p22]] & [1<=p16 & 1<=p22]]]]]]] U EX [[1<=p6 & 1<=p9]]]]

abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
..
EG iterations: 2
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
.abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p23)
states: 10,625 (4)
abstracting: (1<=p17)
states: 29,568 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (p10<=0)
states: 29,568 (4)
abstracting: (p6<=0)
states: 462
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p30)
states: 29,568 (4)
abstracting: (1<=p5)
states: 13,842 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 3
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-110-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [E [[A [[[1<=p6 & 1<=p11] & [1<=p6 & [1<=p7 & ~ [[1<=p17 & 1<=p23]]]]] U ~ [AX [[1<=p6 & 1<=p9]]]] | [EX [AX [[1<=p6 & 1<=p7]]] & [~ [E [[1<=p3 & 1<=p28] U [1<=p6 & 1<=p7]]] & ~ [AG [[1<=p6 & 1<=p11]]]]]] U [[~ [E [[1<=p6 & 1<=p8] U [1<=p3 & 1<=p28]]] | ~ [[[~ [[1<=p6 & 1<=p8]] & 1<=p6] & [1<=p7 & [1<=p6 & 1<=p11]]]]] | [[1<=p6 & 1<=p8] | [~ [[1<=p5 & 1<=p30]] & ~ [[1<=p6 & 1<=p10]]]]]]]
normalized: ~ [E [true U ~ [E [[[[E [true U ~ [[1<=p6 & 1<=p11]]] & ~ [E [[1<=p3 & 1<=p28] U [1<=p6 & 1<=p7]]]] & EX [~ [EX [~ [[1<=p6 & 1<=p7]]]]]] | [~ [EG [~ [EX [~ [[1<=p6 & 1<=p9]]]]]] & ~ [E [~ [EX [~ [[1<=p6 & 1<=p9]]]] U [~ [[[1<=p6 & [1<=p7 & ~ [[1<=p17 & 1<=p23]]]] & [1<=p6 & 1<=p11]]] & ~ [EX [~ [[1<=p6 & 1<=p9]]]]]]]]] U [[[~ [[1<=p6 & 1<=p10]] & ~ [[1<=p5 & 1<=p30]]] | [1<=p6 & 1<=p8]] | [~ [[[1<=p7 & [1<=p6 & 1<=p11]] & [1<=p6 & ~ [[1<=p6 & 1<=p8]]]]] | ~ [E [[1<=p6 & 1<=p8] U [1<=p3 & 1<=p28]]]]]]]]]

abstracting: (1<=p28)
states: 29,568 (4)
abstracting: (1<=p3)
states: 13,842 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p30)
states: 29,568 (4)
abstracting: (1<=p5)
states: 13,842 (4)
abstracting: (1<=p10)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p23)
states: 10,625 (4)
abstracting: (1<=p17)
states: 29,568 (4)
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p9)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 2
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
..abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p28)
states: 29,568 (4)
abstracting: (1<=p3)
states: 13,842 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: [~ [E [[E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p11]] & [[EG [[1<=p6 & 1<=p11]] | ~ [[AF [[1<=p6 & 1<=p11]] | AG [[1<=p6 & 1<=p7]]]]] | [[1<=p6 & 1<=p12] | [1<=p6 & 1<=p8]]]] U A [~ [AF [[1<=p15 & 1<=p21]]] U AF [[[1<=p2 & 1<=p27] & [1<=p6 & 1<=p8]]]]]] | ~ [A [[1<=p5 & 1<=p30] U ~ [[AX [[[1<=p16 & 1<=p22] & [1<=p6 & 1<=p11]]] & [~ [[[1<=p6 & 1<=p11] & [1<=p6 & 1<=p8]]] & ~ [[1<=p6 & 1<=p8]]]]]]]]
normalized: [~ [[~ [EG [[[~ [[1<=p6 & 1<=p8]] & ~ [[[1<=p6 & 1<=p8] & [1<=p6 & 1<=p11]]]] & ~ [EX [~ [[[1<=p6 & 1<=p11] & [1<=p16 & 1<=p22]]]]]]]] & ~ [E [[[~ [[1<=p6 & 1<=p8]] & ~ [[[1<=p6 & 1<=p8] & [1<=p6 & 1<=p11]]]] & ~ [EX [~ [[[1<=p6 & 1<=p11] & [1<=p16 & 1<=p22]]]]]] U [~ [[1<=p5 & 1<=p30]] & [[~ [[1<=p6 & 1<=p8]] & ~ [[[1<=p6 & 1<=p8] & [1<=p6 & 1<=p11]]]] & ~ [EX [~ [[[1<=p6 & 1<=p11] & [1<=p16 & 1<=p22]]]]]]]]]]] | ~ [E [[[[[1<=p6 & 1<=p8] | [1<=p6 & 1<=p12]] | [~ [[~ [E [true U ~ [[1<=p6 & 1<=p7]]]] | ~ [EG [~ [[1<=p6 & 1<=p11]]]]]] | EG [[1<=p6 & 1<=p11]]]] & E [[1<=p6 & 1<=p11] U [1<=p6 & 1<=p11]]] U [~ [EG [EG [~ [[[1<=p6 & 1<=p8] & [1<=p2 & 1<=p27]]]]]] & ~ [E [EG [~ [[[1<=p6 & 1<=p8] & [1<=p2 & 1<=p27]]]] U [~ [EG [~ [[1<=p15 & 1<=p21]]]] & EG [~ [[[1<=p6 & 1<=p8] & [1<=p2 & 1<=p27]]]]]]]]]]]

abstracting: (1<=p27)
states: 29,568 (4)
abstracting: (1<=p2)
states: 13,842 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.
EG iterations: 1
abstracting: (1<=p21)
states: 10,625 (4)
abstracting: (1<=p15)
states: 29,568 (4)
..
EG iterations: 2
abstracting: (1<=p27)
states: 29,568 (4)
abstracting: (1<=p2)
states: 13,842 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.
EG iterations: 1
abstracting: (1<=p27)
states: 29,568 (4)
abstracting: (1<=p2)
states: 13,842 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 3
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
...
EG iterations: 3
abstracting: (1<=p7)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p12)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p30)
states: 29,568 (4)
abstracting: (1<=p5)
states: 13,842 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p22)
states: 10,625 (4)
abstracting: (1<=p16)
states: 29,568 (4)
abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.abstracting: (1<=p11)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
abstracting: (1<=p8)
states: 10,625 (4)
abstracting: (1<=p6)
states: 39,731 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HexagonalGrid-PT-110-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

totally nodes used: 55253 (5.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 300112 516599 816711
used/not used/entry size/cache size: 566219 66542645 16 1024MB
basic ops cache: hits/miss/sum: 29588 57644 87232
used/not used/entry size/cache size: 108712 16668504 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: 3128 4887 8015
used/not used/entry size/cache size: 4886 8383722 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 67054317
1 53921
2 587
3 29
4 3
5 1
6 0
7 0
8 3
9 0
>= 10 3

Total processing time: 0m 5.541sec


BK_STOP 1678733740307

--------------------
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:798 (19), effective:65 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:286 (6), effective:15 (0)

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

iterations count:352 (8), effective:18 (0)

iterations count:321 (7), effective:17 (0)

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

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

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

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

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

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

iterations count:311 (7), effective:17 (0)

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

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

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

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

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

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

iterations count:318 (7), effective:17 (0)

iterations count:303 (7), effective:17 (0)

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

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

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

iterations count:318 (7), effective:17 (0)

iterations count:102 (2), effective:8 (0)

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

iterations count:296 (7), effective:15 (0)

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

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

iterations count:778 (18), effective:72 (1)

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

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

iterations count:486 (11), effective:37 (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="HexagonalGrid-PT-110"
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 HexagonalGrid-PT-110, 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 r202-smll-167840348600370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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