About the Execution of Marcie+red for TriangularGrid-PT-1500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5909.247 | 15291.00 | 18357.00 | 325.30 | TFFFTTTFTTFTTFTF | normal |
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-167912709000714.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 TriangularGrid-PT-1500, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000714
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:41 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 4.1K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 9.7K 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 TriangularGrid-PT-1500-CTLFireability-00
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-01
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-02
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-03
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-04
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-05
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-06
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-07
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-08
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-09
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-10
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-11
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-12
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-13
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-14
FORMULA_NAME TriangularGrid-PT-1500-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679326181865
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=TriangularGrid-PT-1500
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 15:29:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 15:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:29:43] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-20 15:29:43] [INFO ] Transformed 16 places.
[2023-03-20 15:29:43] [INFO ] Transformed 12 transitions.
[2023-03-20 15:29:43] [INFO ] Parsed PT model containing 16 places and 12 transitions and 48 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA TriangularGrid-PT-1500-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1500-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-20 15:29:43] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-20 15:29:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-20 15:29:43] [INFO ] Invariant cache hit.
[2023-03-20 15:29:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-20 15:29:43] [INFO ] Invariant cache hit.
[2023-03-20 15:29:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 16/16 places, 12/12 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 14 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 20 properties in 11 ms. (steps per millisecond=2 )
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA TriangularGrid-PT-1500-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 15:29:44] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:29:44] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 15:29:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 970 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: 16 NrTr: 12 NrArc: 48)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.838sec
RS generation: 0m 1.123sec
-> reachability set: #nodes 1551 (1.6e+03) #states 705,712 (5)
starting MCC model checker
--------------------------
checking: AG [EX [EF [[p14<=0 | p1<=0]]]]
normalized: ~ [E [true U ~ [EX [E [true U [p14<=0 | p1<=0]]]]]]
abstracting: (p1<=0)
states: 9,472 (3)
abstracting: (p14<=0)
states: 350,480 (5)
.-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.062sec
checking: EF [AX [[p2<=0 | p15<=0]]]
normalized: E [true U ~ [EX [~ [[p2<=0 | p15<=0]]]]]
abstracting: (p15<=0)
states: 350,480 (5)
abstracting: (p2<=0)
states: 9,472 (3)
.-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.768sec
checking: EF [[EF [AX [[p3<=0 | p4<=0]]] & [1<=p9 & 1<=p12]]]
normalized: E [true U [[1<=p9 & 1<=p12] & E [true U ~ [EX [~ [[p3<=0 | p4<=0]]]]]]]
abstracting: (p4<=0)
states: 355,232 (5)
abstracting: (p3<=0)
states: 11,476 (4)
.abstracting: (1<=p12)
states: 350,480 (5)
abstracting: (1<=p9)
states: 355,232 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.100sec
checking: AG [EX [[1<=p7 & [1<=p10 & [p3<=0 | p5<=0]]]]]
normalized: ~ [E [true U ~ [EX [[[[p3<=0 | p5<=0] & 1<=p10] & 1<=p7]]]]]
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (p5<=0)
states: 355,232 (5)
abstracting: (p3<=0)
states: 11,476 (4)
.-> the formula is FALSE
FORMULA TriangularGrid-PT-1500-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: EX [AF [~ [A [[~ [[1<=p3 & 1<=p6]] | [[1<=p9 & 1<=p12] & [1<=p3 & 1<=p4]]] U EX [[1<=p3 & 1<=p5]]]]]]
normalized: EX [~ [EG [[~ [EG [~ [EX [[1<=p3 & 1<=p5]]]]] & ~ [E [~ [EX [[1<=p3 & 1<=p5]]] U [~ [[~ [[1<=p3 & 1<=p6]] | [[1<=p3 & 1<=p4] & [1<=p9 & 1<=p12]]]] & ~ [EX [[1<=p3 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p12)
states: 350,480 (5)
abstracting: (1<=p9)
states: 355,232 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 2
.
EG iterations: 1
.-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.065sec
checking: E [[1<=p3 & 1<=p4] U [~ [AF [[~ [[1<=p1 & 1<=p14]] | EG [[1<=p3 & 1<=p6]]]]] & AX [EF [~ [E [[1<=p2 & 1<=p15] U [1<=p1 & 1<=p14]]]]]]]
normalized: E [[1<=p3 & 1<=p4] U [~ [EX [~ [E [true U ~ [E [[1<=p2 & 1<=p15] U [1<=p1 & 1<=p14]]]]]]] & EG [~ [[EG [[1<=p3 & 1<=p6]] | ~ [[1<=p1 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 451
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
.abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1500-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.388sec
checking: EF [EG [[~ [E [~ [[1<=p7 & 1<=p10]] U [[1<=p8 & 1<=p11] | [1<=p3 & 1<=p5]]]] & ~ [A [E [[1<=p0 & 1<=p13] U [1<=p2 & 1<=p15]] U ~ [[1<=p7 & 1<=p10]]]]]]]
normalized: E [true U EG [[~ [[~ [EG [[1<=p7 & 1<=p10]]] & ~ [E [[1<=p7 & 1<=p10] U [~ [E [[1<=p0 & 1<=p13] U [1<=p2 & 1<=p15]]] & [1<=p7 & 1<=p10]]]]]] & ~ [E [~ [[1<=p7 & 1<=p10]] U [[1<=p3 & 1<=p5] | [1<=p8 & 1<=p11]]]]]]]
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
..
EG iterations: 2
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 449
-> the formula is FALSE
FORMULA TriangularGrid-PT-1500-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.321sec
checking: EX [[AF [~ [E [AF [[1<=p3 & 1<=p5]] U [1<=p2 & 1<=p15]]]] & [AF [[1<=p3 & 1<=p6]] | EF [[[[[1<=p8 & 1<=p11] & [1<=p0 & 1<=p13]] & [[1<=p8 & 1<=p11] & [1<=p3 & 1<=p4]]] | AX [[1<=p3 & 1<=p4]]]]]]]
normalized: EX [[[E [true U [~ [EX [~ [[1<=p3 & 1<=p4]]]] | [[[1<=p3 & 1<=p4] & [1<=p8 & 1<=p11]] & [[1<=p0 & 1<=p13] & [1<=p8 & 1<=p11]]]]] | ~ [EG [~ [[1<=p3 & 1<=p6]]]]] & ~ [EG [E [~ [EG [~ [[1<=p3 & 1<=p5]]]] U [1<=p2 & 1<=p15]]]]]]
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
..
EG iterations: 2
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
..-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.159sec
checking: AG [[A [~ [E [A [[1<=p8 & 1<=p11] U [1<=p0 & 1<=p13]] U ~ [[1<=p3 & 1<=p6]]]] U E [EF [[1<=p1 & 1<=p14]] U [1<=p3 & 1<=p6]]] | [EF [AX [AG [[1<=p8 & 1<=p11]]]] | E [EF [[1<=p3 & 1<=p4]] U ~ [[1<=p2 & 1<=p15]]]]]]
normalized: ~ [E [true U ~ [[[E [E [true U [1<=p3 & 1<=p4]] U ~ [[1<=p2 & 1<=p15]]] | E [true U ~ [EX [E [true U ~ [[1<=p8 & 1<=p11]]]]]]] | [~ [EG [~ [E [E [true U [1<=p1 & 1<=p14]] U [1<=p3 & 1<=p6]]]]] & ~ [E [~ [E [E [true U [1<=p1 & 1<=p14]] U [1<=p3 & 1<=p6]]] U [E [[~ [EG [~ [[1<=p0 & 1<=p13]]]] & ~ [E [~ [[1<=p0 & 1<=p13]] U [~ [[1<=p8 & 1<=p11]] & ~ [[1<=p0 & 1<=p13]]]]]] U ~ [[1<=p3 & 1<=p6]]] & ~ [E [E [true U [1<=p1 & 1<=p14]] U [1<=p3 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
..
EG iterations: 2
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
.
EG iterations: 1
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
.abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.156sec
checking: [EX [EF [[1<=p7 & 1<=p10]]] | A [AG [[EF [[1<=p2 & 1<=p15]] & [[[AF [[1<=p2 & 1<=p15]] & 1<=p8] & [1<=p11 & [1<=p8 & 1<=p11]]] | ~ [[[1<=p0 & 1<=p13] | [1<=p3 & 1<=p5]]]]]] U ~ [EX [A [[1<=p3 & 1<=p6] U EF [[1<=p7 & 1<=p10]]]]]]]
normalized: [[~ [EG [EX [[~ [EG [~ [E [true U [1<=p7 & 1<=p10]]]]] & ~ [E [~ [E [true U [1<=p7 & 1<=p10]]] U [~ [[1<=p3 & 1<=p6]] & ~ [E [true U [1<=p7 & 1<=p10]]]]]]]]]] & ~ [E [EX [[~ [EG [~ [E [true U [1<=p7 & 1<=p10]]]]] & ~ [E [~ [E [true U [1<=p7 & 1<=p10]]] U [~ [[1<=p3 & 1<=p6]] & ~ [E [true U [1<=p7 & 1<=p10]]]]]]]] U [E [true U ~ [[[~ [[[1<=p3 & 1<=p5] | [1<=p0 & 1<=p13]]] | [[1<=p11 & [1<=p8 & 1<=p11]] & [1<=p8 & ~ [EG [~ [[1<=p2 & 1<=p15]]]]]]] & E [true U [1<=p2 & 1<=p15]]]]] & EX [[~ [EG [~ [E [true U [1<=p7 & 1<=p10]]]]] & ~ [E [~ [E [true U [1<=p7 & 1<=p10]]] U [~ [[1<=p3 & 1<=p6]] & ~ [E [true U [1<=p7 & 1<=p10]]]]]]]]]]]] | EX [E [true U [1<=p7 & 1<=p10]]]]
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
..
EG iterations: 2
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.
EG iterations: 1
.abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: [AF [~ [A [~ [[1<=p3 & 1<=p6]] U [[1<=p8 & 1<=p11] | [1<=p9 & 1<=p12]]]]] & E [[[1<=p3 & 1<=p4] | [[1<=p3 & 1<=p5] | EF [[[1<=p3 & 1<=p4] | [AF [[1<=p0 & 1<=p13]] & E [[1<=p2 & 1<=p15] U [1<=p2 & 1<=p15]]]]]]] U ~ [[1<=p1 & 1<=p14]]]]
normalized: [E [[[E [true U [[E [[1<=p2 & 1<=p15] U [1<=p2 & 1<=p15]] & ~ [EG [~ [[1<=p0 & 1<=p13]]]]] | [1<=p3 & 1<=p4]]] | [1<=p3 & 1<=p5]] | [1<=p3 & 1<=p4]] U ~ [[1<=p1 & 1<=p14]]] & ~ [EG [[~ [EG [~ [[[1<=p9 & 1<=p12] | [1<=p8 & 1<=p11]]]]] & ~ [E [~ [[[1<=p9 & 1<=p12] | [1<=p8 & 1<=p11]]] U [[1<=p3 & 1<=p6] & ~ [[[1<=p9 & 1<=p12] | [1<=p8 & 1<=p11]]]]]]]]]]
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p12)
states: 350,480 (5)
abstracting: (1<=p9)
states: 355,232 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p12)
states: 350,480 (5)
abstracting: (1<=p9)
states: 355,232 (5)
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
abstracting: (1<=p12)
states: 350,480 (5)
abstracting: (1<=p9)
states: 355,232 (5)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 454
...
EG iterations: 3
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
..
EG iterations: 2
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
-> the formula is FALSE
FORMULA TriangularGrid-PT-1500-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.282sec
checking: A [[AX [~ [[1<=p3 & 1<=p4]]] & A [[~ [E [[1<=p3 & 1<=p6] U [1<=p3 & 1<=p6]]] | [1<=p3 & 1<=p5]] U [[1<=p0 & 1<=p13] & [1<=p3 & [1<=p6 & [[1<=p3 & 1<=p4] | EF [[1<=p0 & 1<=p13]]]]]]]] U A [[[1<=p0 & 1<=p13] | [1<=p3 & 1<=p6]] U [1<=p3 & 1<=p6]]]
normalized: [~ [EG [~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[[1<=p3 & 1<=p6] | [1<=p0 & 1<=p13]]] & ~ [[1<=p3 & 1<=p6]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[[1<=p3 & 1<=p6] | [1<=p0 & 1<=p13]]] & ~ [[1<=p3 & 1<=p6]]]]]]] U [~ [[[~ [EG [~ [[[1<=p3 & [1<=p6 & [E [true U [1<=p0 & 1<=p13]] | [1<=p3 & 1<=p4]]]] & [1<=p0 & 1<=p13]]]]] & ~ [E [~ [[[1<=p3 & [1<=p6 & [E [true U [1<=p0 & 1<=p13]] | [1<=p3 & 1<=p4]]]] & [1<=p0 & 1<=p13]]] U [~ [[[1<=p3 & 1<=p5] | ~ [E [[1<=p3 & 1<=p6] U [1<=p3 & 1<=p6]]]]] & ~ [[[1<=p3 & [1<=p6 & [E [true U [1<=p0 & 1<=p13]] | [1<=p3 & 1<=p4]]]] & [1<=p0 & 1<=p13]]]]]]] & ~ [EX [[1<=p3 & 1<=p4]]]]] & ~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[[1<=p3 & 1<=p6] | [1<=p0 & 1<=p13]]] & ~ [[1<=p3 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p5)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
...
EG iterations: 3
-> the formula is FALSE
FORMULA TriangularGrid-PT-1500-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.099sec
checking: A [EX [A [AX [AF [[1<=p0 & 1<=p13]]] U [AX [[1<=p3 & 1<=p4]] & [EF [[1<=p3 & 1<=p4]] | ~ [[1<=p0 & 1<=p13]]]]]] U [[~ [EF [[~ [[1<=p3 & 1<=p6]] | A [[1<=p3 & 1<=p4] U [1<=p3 & 1<=p6]]]]] & [~ [[1<=p2 & 1<=p15]] & [AX [AG [[1<=p7 & 1<=p10]]] | [E [[1<=p0 & 1<=p13] U [1<=p7 & 1<=p10]] & [E [[1<=p3 & 1<=p6] U [1<=p0 & 1<=p13]] & [EF [[1<=p3 & 1<=p4]] | EX [[1<=p0 & 1<=p13]]]]]]]] | [1<=p0 & [1<=p13 & AF [[A [[1<=p1 & 1<=p14] U [1<=p3 & 1<=p6]] | EG [[1<=p8 & 1<=p11]]]]]]]]
normalized: [~ [EG [~ [[[1<=p0 & [1<=p13 & ~ [EG [~ [[EG [[1<=p8 & 1<=p11]] | [~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p1 & 1<=p14]] & ~ [[1<=p3 & 1<=p6]]]]]]]]]]]] | [[[[[[EX [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & E [[1<=p3 & 1<=p6] U [1<=p0 & 1<=p13]]] & E [[1<=p0 & 1<=p13] U [1<=p7 & 1<=p10]]] | ~ [EX [E [true U ~ [[1<=p7 & 1<=p10]]]]]] & ~ [[1<=p2 & 1<=p15]]] & ~ [E [true U [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]] | ~ [[1<=p3 & 1<=p6]]]]]]]]]] & ~ [E [~ [[[1<=p0 & [1<=p13 & ~ [EG [~ [[EG [[1<=p8 & 1<=p11]] | [~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p1 & 1<=p14]] & ~ [[1<=p3 & 1<=p6]]]]]]]]]]]] | [[[[[[EX [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & E [[1<=p3 & 1<=p6] U [1<=p0 & 1<=p13]]] & E [[1<=p0 & 1<=p13] U [1<=p7 & 1<=p10]]] | ~ [EX [E [true U ~ [[1<=p7 & 1<=p10]]]]]] & ~ [[1<=p2 & 1<=p15]]] & ~ [E [true U [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]] | ~ [[1<=p3 & 1<=p6]]]]]]]] U [~ [EX [[~ [EG [~ [[[~ [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & ~ [EX [~ [[1<=p3 & 1<=p4]]]]]]]] & ~ [E [~ [[[~ [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & ~ [EX [~ [[1<=p3 & 1<=p4]]]]]] U [EX [EG [~ [[1<=p0 & 1<=p13]]]] & ~ [[[~ [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & ~ [EX [~ [[1<=p3 & 1<=p4]]]]]]]]]]]] & ~ [[[1<=p0 & [1<=p13 & ~ [EG [~ [[EG [[1<=p8 & 1<=p11]] | [~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p1 & 1<=p14]] & ~ [[1<=p3 & 1<=p6]]]]]]]]]]]] | [[[[[[EX [[1<=p0 & 1<=p13]] | E [true U [1<=p3 & 1<=p4]]] & E [[1<=p3 & 1<=p6] U [1<=p0 & 1<=p13]]] & E [[1<=p0 & 1<=p13] U [1<=p7 & 1<=p10]]] | ~ [EX [E [true U ~ [[1<=p7 & 1<=p10]]]]]] & ~ [[1<=p2 & 1<=p15]]] & ~ [E [true U [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]] | ~ [[1<=p3 & 1<=p6]]]]]]]]]]]]
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
.abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
..
EG iterations: 2
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 451
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
..
EG iterations: 2
.abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
.abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
..
EG iterations: 2
.abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
.abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
..
EG iterations: 2
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 451
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p15)
states: 355,232 (5)
abstracting: (1<=p2)
states: 696,240 (5)
abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
.abstracting: (1<=p10)
states: 350,480 (5)
abstracting: (1<=p7)
states: 355,232 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p4)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
.abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p14)
states: 355,232 (5)
abstracting: (1<=p1)
states: 696,240 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
abstracting: (1<=p6)
states: 350,480 (5)
abstracting: (1<=p3)
states: 694,236 (5)
...
EG iterations: 3
abstracting: (1<=p11)
states: 350,480 (5)
abstracting: (1<=p8)
states: 355,232 (5)
..
EG iterations: 2
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 451
abstracting: (1<=p13)
states: 355,232 (5)
abstracting: (1<=p0)
states: 696,240 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA TriangularGrid-PT-1500-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.523sec
totally nodes used: 498758 (5.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 62618791 1912547 64531338
used/not used/entry size/cache size: 2073669 65035195 16 1024MB
basic ops cache: hits/miss/sum: 13563644 475447 14039091
used/not used/entry size/cache size: 935550 15841666 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: 419693 11474 431167
used/not used/entry size/cache size: 11468 8377140 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 66724089
1 317410
2 29765
3 35503
4 744
5 447
6 240
7 409
8 242
9 5
>= 10 10
Total processing time: 0m11.880sec
BK_STOP 1679326197156
--------------------
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:3062 (255), effective:800 (66)
initing FirstDep: 0m 0.000sec
iterations count:18 (1), effective:1 (0)
iterations count:3304 (275), effective:897 (74)
iterations count:17 (1), effective:3 (0)
iterations count:52 (4), effective:8 (0)
iterations count:19 (1), effective:3 (0)
iterations count:34 (2), effective:5 (0)
iterations count:39 (3), effective:7 (0)
iterations count:3304 (275), effective:896 (74)
iterations count:43 (3), effective:5 (0)
iterations count:51 (4), effective:7 (0)
iterations count:22 (1), effective:1 (0)
iterations count:47 (3), effective:8 (0)
iterations count:126 (10), effective:22 (1)
iterations count:53 (4), effective:9 (0)
iterations count:48 (4), effective:8 (0)
iterations count:16 (1), effective:1 (0)
iterations count:20 (1), effective:1 (0)
iterations count:53 (4), effective:9 (0)
iterations count:48 (4), effective:8 (0)
iterations count:53 (4), effective:9 (0)
iterations count:48 (4), effective:8 (0)
iterations count:16 (1), effective:1 (0)
iterations count:53 (4), effective:8 (0)
iterations count:22 (1), effective:1 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:46 (3), effective:8 (0)
iterations count:50 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:12 (1), effective:0 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:56 (4), effective:9 (0)
iterations count:12 (1), effective:0 (0)
iterations count:12 (1), effective:0 (0)
iterations count:53 (4), effective:8 (0)
iterations count:18 (1), effective:1 (0)
iterations count:16 (1), effective:1 (0)
iterations count:54 (4), effective:10 (0)
iterations count:12 (1), effective:0 (0)
iterations count:54 (4), effective:10 (0)
iterations count:62 (5), effective:12 (1)
iterations count:54 (4), effective:10 (0)
iterations count:16 (1), effective:1 (0)
iterations count:12 (1), effective:0 (0)
iterations count:16 (1), effective:1 (0)
iterations count:14 (1), effective:1 (0)
iterations count:12 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:18 (1), effective:2 (0)
iterations count:40 (3), effective:8 (0)
iterations count:53 (4), effective:8 (0)
iterations count:18 (1), effective:1 (0)
iterations count:53 (4), effective:8 (0)
iterations count:53 (4), effective:8 (0)
iterations count:12 (1), effective:0 (0)
iterations count:53 (4), effective:8 (0)
iterations count:14 (1), effective:1 (0)
iterations count:12 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:18 (1), effective:2 (0)
iterations count:40 (3), effective:8 (0)
iterations count:53 (4), effective:8 (0)
iterations count:18 (1), effective:1 (0)
iterations count:25 (2), effective:3 (0)
iterations count:14 (1), effective:1 (0)
iterations count:12 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:18 (1), effective:2 (0)
iterations count:40 (3), effective:8 (0)
iterations count:53 (4), effective:8 (0)
iterations count:18 (1), effective:1 (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="TriangularGrid-PT-1500"
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 TriangularGrid-PT-1500, 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-167912709000714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-1500.tgz
mv TriangularGrid-PT-1500 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 '
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 ;