About the Execution of Marcie+red for Railroad-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6186.107 | 49044.00 | 55464.00 | 488.50 | FTTFFFFFTFTTFFTF | 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.r330-tall-167889203200370.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 Railroad-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203200370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 22:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 22:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 82K 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 Railroad-PT-010-CTLFireability-00
FORMULA_NAME Railroad-PT-010-CTLFireability-01
FORMULA_NAME Railroad-PT-010-CTLFireability-02
FORMULA_NAME Railroad-PT-010-CTLFireability-03
FORMULA_NAME Railroad-PT-010-CTLFireability-04
FORMULA_NAME Railroad-PT-010-CTLFireability-05
FORMULA_NAME Railroad-PT-010-CTLFireability-06
FORMULA_NAME Railroad-PT-010-CTLFireability-07
FORMULA_NAME Railroad-PT-010-CTLFireability-08
FORMULA_NAME Railroad-PT-010-CTLFireability-09
FORMULA_NAME Railroad-PT-010-CTLFireability-10
FORMULA_NAME Railroad-PT-010-CTLFireability-11
FORMULA_NAME Railroad-PT-010-CTLFireability-12
FORMULA_NAME Railroad-PT-010-CTLFireability-13
FORMULA_NAME Railroad-PT-010-CTLFireability-14
FORMULA_NAME Railroad-PT-010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679151046964
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=Railroad-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 14:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 14:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:50:48] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-18 14:50:48] [INFO ] Transformed 118 places.
[2023-03-18 14:50:48] [INFO ] Transformed 156 transitions.
[2023-03-18 14:50:48] [INFO ] Found NUPN structural information;
[2023-03-18 14:50:48] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 146
Applied a total of 6 rules in 12 ms. Remains 81 /87 variables (removed 6) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 81 cols
[2023-03-18 14:50:48] [INFO ] Computed 35 place invariants in 19 ms
[2023-03-18 14:50:48] [INFO ] Implicit Places using invariants in 212 ms returned [41, 46, 47, 48, 58, 69, 72, 77]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 237 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/87 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 73/87 places, 146/146 transitions.
Support contains 52 out of 73 places after structural reductions.
[2023-03-18 14:50:49] [INFO ] Flatten gal took : 36 ms
[2023-03-18 14:50:49] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:50:49] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 51 out of 73 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 51) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 146 rows 73 cols
[2023-03-18 14:50:49] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-18 14:50:50] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-18 14:50:50] [INFO ] [Real]Absence check using 18 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-18 14:50:50] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 18 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 12 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 67 transition count 142
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 62 transition count 141
Applied a total of 10 rules in 24 ms. Remains 62 /73 variables (removed 11) and now considering 141/146 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 62/73 places, 141/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 67 transition count 142
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 61 transition count 140
Applied a total of 12 rules in 17 ms. Remains 61 /73 variables (removed 12) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 61/73 places, 140/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 146
Applied a total of 5 rules in 3 ms. Remains 68 /73 variables (removed 5) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/73 places, 146/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 67 transition count 141
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 140
Applied a total of 12 rules in 16 ms. Remains 61 /73 variables (removed 12) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 61/73 places, 140/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 146
Applied a total of 4 rules in 3 ms. Remains 69 /73 variables (removed 4) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/73 places, 146/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 67 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 59 transition count 138
Applied a total of 16 rules in 12 ms. Remains 59 /73 variables (removed 14) and now considering 138/146 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 59/73 places, 138/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 146
Applied a total of 5 rules in 2 ms. Remains 68 /73 variables (removed 5) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/73 places, 146/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 5 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 68 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 63 transition count 141
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 57 transition count 135
Applied a total of 22 rules in 11 ms. Remains 57 /73 variables (removed 16) and now considering 135/146 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 57/73 places, 135/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 67 transition count 141
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 62 transition count 141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 58 transition count 137
Applied a total of 18 rules in 11 ms. Remains 58 /73 variables (removed 15) and now considering 137/146 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 58/73 places, 137/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 5 places
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 68 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 61 transition count 139
Applied a total of 14 rules in 12 ms. Remains 61 /73 variables (removed 12) and now considering 139/146 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 61/73 places, 139/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 62 transition count 141
Applied a total of 10 rules in 9 ms. Remains 62 /73 variables (removed 11) and now considering 141/146 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 62/73 places, 141/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 6 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 67 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 61 transition count 140
Applied a total of 12 rules in 8 ms. Remains 61 /73 variables (removed 12) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 61/73 places, 140/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 146/146 transitions.
Ensure Unique test removed 5 places
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 143
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 140
Applied a total of 12 rules in 9 ms. Remains 62 /73 variables (removed 11) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 62/73 places, 140/146 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Input system was already deterministic with 140 transitions.
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 14:50:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 146 transitions and 800 arcs took 1 ms.
Total runtime 2413 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: 73 NrTr: 146 NrArc: 800)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 2.819sec
RS generation: 0m 2.315sec
-> reachability set: #nodes 70452 (7.0e+04) #states 2,038,166 (6)
starting MCC model checker
--------------------------
checking: EF [AG [[~ [[p44<=1 & 1<=p44]] | ~ [[p58<=1 & 1<=p58]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[p44<=1 & 1<=p44]] | ~ [[p58<=1 & 1<=p58]]]]]]]
abstracting: (1<=p58)
states: 504,605 (5)
abstracting: (p58<=1)
states: 2,038,166 (6)
abstracting: (1<=p44)
states: 504,605 (5)
abstracting: (p44<=1)
states: 2,038,166 (6)
-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.773sec
checking: EF [EG [[[[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]] & [[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]]]]
normalized: E [true U EG [[[[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]] & [[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]]]]
abstracting: (1<=p8)
states: 16,890 (4)
abstracting: (p8<=1)
states: 2,038,166 (6)
abstracting: (1<=p23)
states: 504,605 (5)
abstracting: (p23<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
.....
EG iterations: 5
-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.122sec
checking: EF [[EF [[[p4<=1 & 1<=p4] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]]] & [[p50<=1 & 1<=p50] & [p67<=1 & 1<=p67]]]]
normalized: E [true U [E [true U [[[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]] & [p4<=1 & 1<=p4]]] & [[p67<=1 & 1<=p67] & [p50<=1 & 1<=p50]]]]
abstracting: (1<=p50)
states: 524,294 (5)
abstracting: (p50<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p4)
states: 254,855 (5)
abstracting: (p4<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.365sec
checking: EF [[[EG [[[p2<=1 & 1<=p2] & [[p38<=1 & 1<=p38] & [p45<=1 & 1<=p45]]]] & A [EG [[[p24<=1 & 1<=p24] & [[p57<=1 & 1<=p57] & [p67<=1 & 1<=p67]]]] U [[p30<=1 & 1<=p30] & [[p34<=1 & 1<=p34] & [p67<=1 & 1<=p67]]]]] & [[p7<=1 & 1<=p7] & [[p23<=1 & 1<=p23] & [p42<=1 & 1<=p42]]]]]
normalized: E [true U [[[[p23<=1 & 1<=p23] & [p42<=1 & 1<=p42]] & [p7<=1 & 1<=p7]] & [[~ [EG [~ [[[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]]]] & ~ [E [~ [[[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]] U [~ [EG [[[[p67<=1 & 1<=p67] & [p57<=1 & 1<=p57]] & [p24<=1 & 1<=p24]]]] & ~ [[[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]]]]]] & EG [[[[p45<=1 & 1<=p45] & [p38<=1 & 1<=p38]] & [p2<=1 & 1<=p2]]]]]]
abstracting: (1<=p2)
states: 32
abstracting: (p2<=1)
states: 2,038,166 (6)
abstracting: (1<=p38)
states: 32
abstracting: (p38<=1)
states: 2,038,166 (6)
abstracting: (1<=p45)
states: 10
abstracting: (p45<=1)
states: 2,038,166 (6)
..
EG iterations: 2
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p24)
states: 504,662 (5)
abstracting: (p24<=1)
states: 2,038,166 (6)
abstracting: (1<=p57)
states: 1,009,267 (6)
abstracting: (p57<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
................................
EG iterations: 32
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
........................
EG iterations: 24
abstracting: (1<=p7)
states: 2,685 (3)
abstracting: (p7<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p23)
states: 504,605 (5)
abstracting: (p23<=1)
states: 2,038,166 (6)
-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.899sec
checking: [AF [[[[p4<=0 & 0<=p4] | [[p16<=0 & 0<=p16] | [p42<=0 & 0<=p42]]] & [[[p5<=0 & 0<=p5] | [p19<=0 & 0<=p19]] | [[p42<=0 & 0<=p42] | [[p9<=1 & 1<=p9] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]]]]]] & EF [[[p8<=1 & 1<=p8] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]]]
normalized: [E [true U [[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & [p8<=1 & 1<=p8]]] & ~ [EG [~ [[[[[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p9<=1 & 1<=p9]] | [p42<=0 & 0<=p42]] | [[p19<=0 & 0<=p19] | [p5<=0 & 0<=p5]]] & [[[p42<=0 & 0<=p42] | [p16<=0 & 0<=p16]] | [p4<=0 & 0<=p4]]]]]]]
abstracting: (0<=p4)
states: 2,038,166 (6)
abstracting: (p4<=0)
states: 1,783,311 (6)
abstracting: (0<=p16)
states: 2,038,166 (6)
abstracting: (p16<=0)
states: 1,533,561 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 63
abstracting: (0<=p5)
states: 2,038,166 (6)
abstracting: (p5<=0)
states: 1,979,117 (6)
abstracting: (0<=p19)
states: 2,038,166 (6)
abstracting: (p19<=0)
states: 1,533,561 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 63
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
...................
EG iterations: 19
abstracting: (1<=p8)
states: 16,890 (4)
abstracting: (p8<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.780sec
checking: AX [EF [[EG [[[p4<=1 & 1<=p4] & [[p18<=1 & 1<=p18] & [p42<=1 & 1<=p42]]]] & EX [[E [[[p54<=1 & 1<=p54] & [p67<=1 & 1<=p67]] U [[p36<=1 & 1<=p36] & [[p39<=1 & 1<=p39] & [p56<=1 & 1<=p56]]]] | [[[p7<=1 & 1<=p7] & [[p15<=1 & 1<=p15] & [p42<=1 & 1<=p42]]] | [[p0<=1 & 1<=p0] & [p70<=1 & 1<=p70]]]]]]]]
normalized: ~ [EX [~ [E [true U [EX [[E [[[p67<=1 & 1<=p67] & [p54<=1 & 1<=p54]] U [[[p56<=1 & 1<=p56] & [p39<=1 & 1<=p39]] & [p36<=1 & 1<=p36]]] | [[[p70<=1 & 1<=p70] & [p0<=1 & 1<=p0]] | [[[p42<=1 & 1<=p42] & [p15<=1 & 1<=p15]] & [p7<=1 & 1<=p7]]]]] & EG [[[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]] & [p4<=1 & 1<=p4]]]]]]]]
abstracting: (1<=p4)
states: 254,855 (5)
abstracting: (p4<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
...................
EG iterations: 19
abstracting: (1<=p7)
states: 2,685 (3)
abstracting: (p7<=1)
states: 2,038,166 (6)
abstracting: (1<=p15)
states: 504,605 (5)
abstracting: (p15<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p0)
states: 504,605 (5)
abstracting: (p0<=1)
states: 2,038,166 (6)
abstracting: (1<=p70)
states: 504,605 (5)
abstracting: (p70<=1)
states: 2,038,166 (6)
abstracting: (1<=p36)
states: 2,038,113 (6)
abstracting: (p36<=1)
states: 2,038,166 (6)
abstracting: (1<=p39)
states: 2,038,113 (6)
abstracting: (p39<=1)
states: 2,038,166 (6)
abstracting: (1<=p56)
states: 11
abstracting: (p56<=1)
states: 2,038,166 (6)
abstracting: (1<=p54)
states: 524,294 (5)
abstracting: (p54<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
..-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.299sec
checking: EG [~ [A [[AG [~ [[[p6<=1 & 1<=p6] & [[p19<=1 & 1<=p19] & [p42<=1 & 1<=p42]]]]] | AF [~ [[[p5<=1 & 1<=p5] & [[p16<=1 & 1<=p16] & [p42<=1 & 1<=p42]]]]]] U A [[EF [[[p30<=1 & 1<=p30] & [[p34<=1 & 1<=p34] & [p67<=1 & 1<=p67]]]] & AG [[[p9<=1 & 1<=p9] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]]]] U [[p53<=1 & 1<=p53] & [p61<=1 & 1<=p61]]]]]]
normalized: EG [~ [[~ [EG [~ [[~ [EG [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]] U [~ [[E [true U [[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]] & ~ [E [true U ~ [[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p9<=1 & 1<=p9]]]]]]] & ~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]] U [~ [[E [true U [[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]] & ~ [E [true U ~ [[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p9<=1 & 1<=p9]]]]]]] & ~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]]]]] U [~ [[~ [EG [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]] U [~ [[E [true U [[[p67<=1 & 1<=p67] & [p34<=1 & 1<=p34]] & [p30<=1 & 1<=p30]]] & ~ [E [true U ~ [[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p9<=1 & 1<=p9]]]]]]] & ~ [[[p61<=1 & 1<=p61] & [p53<=1 & 1<=p53]]]]]]]] & ~ [[~ [EG [[[[p42<=1 & 1<=p42] & [p16<=1 & 1<=p16]] & [p5<=1 & 1<=p5]]]] | ~ [E [true U [[[p42<=1 & 1<=p42] & [p19<=1 & 1<=p19]] & [p6<=1 & 1<=p6]]]]]]]]]]]]
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p19)
states: 504,605 (5)
abstracting: (p19<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p5)
states: 59,049 (4)
abstracting: (p5<=1)
states: 2,038,166 (6)
abstracting: (1<=p16)
states: 504,605 (5)
abstracting: (p16<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
....................
EG iterations: 20
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
abstracting: (1<=p61)
states: 504,605 (5)
abstracting: (p61<=1)
states: 2,038,166 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.924sec
checking: EG [[EF [[[~ [E [[[p12<=1 & 1<=p12] & [[p19<=1 & 1<=p19] & [p42<=1 & 1<=p42]]] U [[p13<=1 & 1<=p13] & [[p14<=1 & 1<=p14] & [p42<=1 & 1<=p42]]]]] & [p13<=1 & 1<=p13]] & [[p23<=1 & 1<=p23] & [p42<=1 & 1<=p42]]]] & [AG [[[p6<=0 & 0<=p6] | [[p21<=0 & 0<=p21] | [p42<=0 & 0<=p42]]]] | EG [[[p7<=0 & 0<=p7] | [[p23<=0 & 0<=p23] | [p42<=0 & 0<=p42]]]]]]]
normalized: EG [[E [true U [[~ [E [[[[p42<=1 & 1<=p42] & [p19<=1 & 1<=p19]] & [p12<=1 & 1<=p12]] U [[[p42<=1 & 1<=p42] & [p14<=1 & 1<=p14]] & [p13<=1 & 1<=p13]]]] & [p13<=1 & 1<=p13]] & [[p42<=1 & 1<=p42] & [p23<=1 & 1<=p23]]]] & [EG [[[[p42<=0 & 0<=p42] | [p23<=0 & 0<=p23]] | [p7<=0 & 0<=p7]]] | ~ [E [true U ~ [[[p6<=0 & 0<=p6] | [[p42<=0 & 0<=p42] | [p21<=0 & 0<=p21]]]]]]]]]
abstracting: (0<=p21)
states: 2,038,166 (6)
abstracting: (p21<=0)
states: 1,533,561 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 63
abstracting: (0<=p6)
states: 2,038,166 (6)
abstracting: (p6<=0)
states: 2,037,881 (6)
abstracting: (0<=p7)
states: 2,038,166 (6)
abstracting: (p7<=0)
states: 2,035,481 (6)
abstracting: (0<=p23)
states: 2,038,166 (6)
abstracting: (p23<=0)
states: 1,533,561 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 63
.
EG iterations: 1
abstracting: (1<=p23)
states: 504,605 (5)
abstracting: (p23<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p12)
states: 546,165 (5)
abstracting: (p12<=1)
states: 2,038,166 (6)
abstracting: (1<=p19)
states: 504,605 (5)
abstracting: (p19<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.727sec
checking: EF [[AF [[[[[p10<=1 & 1<=p10] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]] & [[p5<=1 & 1<=p5] & [[p20<=1 & 1<=p20] & [p42<=1 & 1<=p42]]]] | [[p7<=1 & 1<=p7] & [[p14<=1 & 1<=p14] & [p42<=1 & 1<=p42]]]]] & [AF [[[p13<=1 & 1<=p13] & [[p14<=1 & 1<=p14] & [p42<=1 & 1<=p42]]]] & [[p12<=0 & 0<=p12] | [[p23<=0 & 0<=p23] | [p42<=0 & 0<=p42]]]]]]
normalized: E [true U [~ [EG [~ [[[[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p10<=1 & 1<=p10]] & [[[p42<=1 & 1<=p42] & [p20<=1 & 1<=p20]] & [p5<=1 & 1<=p5]]] | [[[p42<=1 & 1<=p42] & [p14<=1 & 1<=p14]] & [p7<=1 & 1<=p7]]]]]] & [~ [EG [~ [[[[p42<=1 & 1<=p42] & [p14<=1 & 1<=p14]] & [p13<=1 & 1<=p13]]]]] & [[[p42<=0 & 0<=p42] | [p23<=0 & 0<=p23]] | [p12<=0 & 0<=p12]]]]]
abstracting: (0<=p12)
states: 2,038,166 (6)
abstracting: (p12<=0)
states: 1,492,001 (6)
abstracting: (0<=p23)
states: 2,038,166 (6)
abstracting: (p23<=0)
states: 1,533,561 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 63
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 2,685 (3)
abstracting: (p7<=1)
states: 2,038,166 (6)
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p5)
states: 59,049 (4)
abstracting: (p5<=1)
states: 2,038,166 (6)
abstracting: (1<=p20)
states: 504,605 (5)
abstracting: (p20<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p10)
states: 200,886 (5)
abstracting: (p10<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.497sec
checking: AG [~ [E [[[[[p6<=1 & 1<=p6] & [[p20<=1 & 1<=p20] & [p42<=1 & 1<=p42]]] | [[p71<=1 & 1<=p71] & [p72<=1 & 1<=p72]]] & [[[[p7<=1 & 1<=p7] & [p15<=1 & 1<=p15]] & [[p42<=1 & 1<=p42] & [[p37<=1 & 1<=p37] & [p68<=1 & 1<=p68]]]] | ~ [[[p25<=1 & 1<=p25] & [[p35<=1 & 1<=p35] & [p67<=1 & 1<=p67]]]]]] U AX [[[p9<=1 & 1<=p9] & [[p18<=1 & 1<=p18] & [p42<=1 & 1<=p42]]]]]]]
normalized: ~ [E [true U E [[[~ [[[[p67<=1 & 1<=p67] & [p35<=1 & 1<=p35]] & [p25<=1 & 1<=p25]]] | [[[[p68<=1 & 1<=p68] & [p37<=1 & 1<=p37]] & [p42<=1 & 1<=p42]] & [[p15<=1 & 1<=p15] & [p7<=1 & 1<=p7]]]] & [[[p72<=1 & 1<=p72] & [p71<=1 & 1<=p71]] | [[[p42<=1 & 1<=p42] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]]] U ~ [EX [~ [[[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]] & [p9<=1 & 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p20)
states: 504,605 (5)
abstracting: (p20<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p71)
states: 504,605 (5)
abstracting: (p71<=1)
states: 2,038,166 (6)
abstracting: (1<=p72)
states: 504,605 (5)
abstracting: (p72<=1)
states: 2,038,166 (6)
abstracting: (1<=p7)
states: 2,685 (3)
abstracting: (p7<=1)
states: 2,038,166 (6)
abstracting: (1<=p15)
states: 504,605 (5)
abstracting: (p15<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p37)
states: 21
abstracting: (p37<=1)
states: 2,038,166 (6)
abstracting: (1<=p68)
states: 10
abstracting: (p68<=1)
states: 2,038,166 (6)
abstracting: (1<=p25)
states: 504,662 (5)
abstracting: (p25<=1)
states: 2,038,166 (6)
abstracting: (1<=p35)
states: 1,009,267 (6)
abstracting: (p35<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.506sec
checking: ~ [E [[EF [[[[p20<=1 & 1<=p20] & [p42<=1 & 1<=p42]] & [p12<=1 & 1<=p12]]] | [[[[[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]] & [[p42<=1 & 1<=p42] & [p49<=1 & 1<=p49]]] & [[[p67<=1 & 1<=p67] & [p6<=1 & 1<=p6]] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]] | [[p5<=1 & 1<=p5] & [[p15<=1 & 1<=p15] & [p42<=1 & 1<=p42]]]]] U [[[p13<=1 & 1<=p13] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]] | AF [[[p6<=1 & 1<=p6] & [[p20<=1 & 1<=p20] & [p42<=1 & 1<=p42]]]]]]]
normalized: ~ [E [[[[[[p42<=1 & 1<=p42] & [p15<=1 & 1<=p15]] & [p5<=1 & 1<=p5]] | [[[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & [[p6<=1 & 1<=p6] & [p67<=1 & 1<=p67]]] & [[[p49<=1 & 1<=p49] & [p42<=1 & 1<=p42]] & [[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]]]]] | E [true U [[p12<=1 & 1<=p12] & [[p42<=1 & 1<=p42] & [p20<=1 & 1<=p20]]]]] U [~ [EG [~ [[[[p42<=1 & 1<=p42] & [p20<=1 & 1<=p20]] & [p6<=1 & 1<=p6]]]]] | [[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p13<=1 & 1<=p13]]]]]
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p20)
states: 504,605 (5)
abstracting: (p20<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p20)
states: 504,605 (5)
abstracting: (p20<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p12)
states: 546,165 (5)
abstracting: (p12<=1)
states: 2,038,166 (6)
abstracting: (1<=p11)
states: 400,170 (5)
abstracting: (p11<=1)
states: 2,038,166 (6)
abstracting: (1<=p23)
states: 504,605 (5)
abstracting: (p23<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p49)
states: 524,294 (5)
abstracting: (p49<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p5)
states: 59,049 (4)
abstracting: (p5<=1)
states: 2,038,166 (6)
abstracting: (1<=p15)
states: 504,605 (5)
abstracting: (p15<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.913sec
checking: E [[~ [[[[AG [[[p9<=1 & 1<=p9] & [[p17<=1 & 1<=p17] & [p42<=1 & 1<=p42]]]] | [[p10<=1 & 1<=p10] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]] | [[[p10<=1 & 1<=p10] & [[p17<=1 & 1<=p17] & [p42<=1 & 1<=p42]]] | [[p50<=1 & 1<=p50] & [p67<=1 & 1<=p67]]]] & ~ [[[[p8<=1 & 1<=p8] & [[p20<=1 & 1<=p20] & [p42<=1 & 1<=p42]]] | [[p9<=1 & 1<=p9] & [[p16<=1 & 1<=p16] & [p42<=1 & 1<=p42]]]]]]] | ~ [EG [[[p6<=1 & 1<=p6] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]]]] U [[p11<=1 & 1<=p11] & [[p14<=1 & 1<=p14] & [p42<=1 & 1<=p42]]]]
normalized: E [[~ [EG [[[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & [p6<=1 & 1<=p6]]]] | ~ [[~ [[[[[p42<=1 & 1<=p42] & [p16<=1 & 1<=p16]] & [p9<=1 & 1<=p9]] | [[[p42<=1 & 1<=p42] & [p20<=1 & 1<=p20]] & [p8<=1 & 1<=p8]]]] & [[[[p67<=1 & 1<=p67] & [p50<=1 & 1<=p50]] | [[[p42<=1 & 1<=p42] & [p17<=1 & 1<=p17]] & [p10<=1 & 1<=p10]]] | [[[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & [p10<=1 & 1<=p10]] | ~ [E [true U ~ [[[[p42<=1 & 1<=p42] & [p17<=1 & 1<=p17]] & [p9<=1 & 1<=p9]]]]]]]]]] U [[[p42<=1 & 1<=p42] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]
abstracting: (1<=p11)
states: 400,170 (5)
abstracting: (p11<=1)
states: 2,038,166 (6)
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p17)
states: 504,605 (5)
abstracting: (p17<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p10)
states: 200,886 (5)
abstracting: (p10<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p10)
states: 200,886 (5)
abstracting: (p10<=1)
states: 2,038,166 (6)
abstracting: (1<=p17)
states: 504,605 (5)
abstracting: (p17<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p50)
states: 524,294 (5)
abstracting: (p50<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p8)
states: 16,890 (4)
abstracting: (p8<=1)
states: 2,038,166 (6)
abstracting: (1<=p20)
states: 504,605 (5)
abstracting: (p20<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p16)
states: 504,605 (5)
abstracting: (p16<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
...
EG iterations: 3
-> the formula is TRUE
FORMULA Railroad-PT-010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.068sec
checking: E [~ [[[[p41<=1 & 1<=p41] & [p67<=1 & 1<=p67]] | [EX [~ [[[p10<=1 & 1<=p10] & [[p18<=1 & 1<=p18] & [p42<=1 & 1<=p42]]]]] & AX [1<=0]]]] U EF [[EG [[[p13<=1 & 1<=p13] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]] & [~ [[[[p13<=1 & 1<=p13] & [[p19<=1 & 1<=p19] & [p42<=1 & 1<=p42]]] | [[p7<=1 & 1<=p7] & [[p22<=1 & 1<=p22] & [p42<=1 & 1<=p42]]]]] & [[EX [[[p33<=1 & 1<=p33] & [[p60<=1 & 1<=p60] & [p67<=1 & 1<=p67]]]] | [[p11<=1 & 1<=p11] & [[p14<=1 & 1<=p14] & [p42<=1 & 1<=p42]]]] | [[[[p10<=1 & 1<=p10] & [[p17<=1 & 1<=p17] & [p42<=1 & 1<=p42]]] & [[p71<=1 & 1<=p71] & [[p72<=1 & 1<=p72] & [[[p9<=1 & 1<=p9] & [p18<=1 & 1<=p18]] | [[p6<=1 & 1<=p6] & [p23<=1 & 1<=p23]]]]]] | [[[p12<=1 & 1<=p12] & [p16<=1 & 1<=p16]] & [[p42<=1 & 1<=p42] & [[p9<=1 & 1<=p9] & [p18<=1 & 1<=p18]]]]]]]]]]
normalized: E [~ [[[~ [EX [~ [1<=0]]] & EX [~ [[[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]] & [p10<=1 & 1<=p10]]]]] | [[p67<=1 & 1<=p67] & [p41<=1 & 1<=p41]]]] U E [true U [[[[[[[[p18<=1 & 1<=p18] & [p9<=1 & 1<=p9]] & [p42<=1 & 1<=p42]] & [[p16<=1 & 1<=p16] & [p12<=1 & 1<=p12]]] | [[[[[[p23<=1 & 1<=p23] & [p6<=1 & 1<=p6]] | [[p18<=1 & 1<=p18] & [p9<=1 & 1<=p9]]] & [p72<=1 & 1<=p72]] & [p71<=1 & 1<=p71]] & [[[p42<=1 & 1<=p42] & [p17<=1 & 1<=p17]] & [p10<=1 & 1<=p10]]]] | [[[[p42<=1 & 1<=p42] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]] | EX [[[[p67<=1 & 1<=p67] & [p60<=1 & 1<=p60]] & [p33<=1 & 1<=p33]]]]] & ~ [[[[[p42<=1 & 1<=p42] & [p22<=1 & 1<=p22]] & [p7<=1 & 1<=p7]] | [[[p42<=1 & 1<=p42] & [p19<=1 & 1<=p19]] & [p13<=1 & 1<=p13]]]]] & EG [[[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]]]
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p21)
states: 504,605 (5)
abstracting: (p21<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.................
EG iterations: 17
abstracting: (1<=p13)
states: 486,955 (5)
abstracting: (p13<=1)
states: 2,038,166 (6)
abstracting: (1<=p19)
states: 504,605 (5)
abstracting: (p19<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p7)
states: 2,685 (3)
abstracting: (p7<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p33)
states: 504,662 (5)
abstracting: (p33<=1)
states: 2,038,166 (6)
abstracting: (1<=p60)
states: 1,009,267 (6)
abstracting: (p60<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
.abstracting: (1<=p11)
states: 400,170 (5)
abstracting: (p11<=1)
states: 2,038,166 (6)
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p10)
states: 200,886 (5)
abstracting: (p10<=1)
states: 2,038,166 (6)
abstracting: (1<=p17)
states: 504,605 (5)
abstracting: (p17<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p71)
states: 504,605 (5)
abstracting: (p71<=1)
states: 2,038,166 (6)
abstracting: (1<=p72)
states: 504,605 (5)
abstracting: (p72<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (1<=p23)
states: 504,605 (5)
abstracting: (p23<=1)
states: 2,038,166 (6)
abstracting: (1<=p12)
states: 546,165 (5)
abstracting: (p12<=1)
states: 2,038,166 (6)
abstracting: (1<=p16)
states: 504,605 (5)
abstracting: (p16<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (1<=p41)
states: 524,294 (5)
abstracting: (p41<=1)
states: 2,038,166 (6)
abstracting: (1<=p67)
states: 1,048,579 (6)
abstracting: (p67<=1)
states: 2,038,166 (6)
abstracting: (1<=p10)
states: 200,886 (5)
abstracting: (p10<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (1<=p42)
states: 2,038,103 (6)
abstracting: (p42<=1)
states: 2,038,166 (6)
.abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA Railroad-PT-010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.605sec
totally nodes used: 10093713 (1.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27335896 92537860 119873756
used/not used/entry size/cache size: 51295694 15813170 16 1024MB
basic ops cache: hits/miss/sum: 3807423 9954250 13761673
used/not used/entry size/cache size: 9844788 6932428 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: 95528 441887 537415
used/not used/entry size/cache size: 431048 7957560 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 58516373
1 7331045
2 1055284
3 176601
4 25931
5 3242
6 356
7 29
8 3
9 0
>= 10 0
Total processing time: 0m44.327sec
BK_STOP 1679151096008
--------------------
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:8544 (58), effective:373 (2)
initing FirstDep: 0m 0.000sec
iterations count:59985 (410), effective:2203 (15)
iterations count:10193 (69), effective:281 (1)
iterations count:6846 (46), effective:219 (1)
iterations count:146 (1), effective:0 (0)
iterations count:23508 (161), effective:703 (4)
iterations count:146 (1), effective:0 (0)
59629
iterations count:167793 (1149), effective:6549 (44)
iterations count:261 (1), effective:8 (0)
iterations count:40330 (276), effective:1503 (10)
iterations count:146 (1), effective:0 (0)
iterations count:261 (1), effective:8 (0)
iterations count:40330 (276), effective:1503 (10)
iterations count:146 (1), effective:0 (0)
iterations count:261 (1), effective:8 (0)
iterations count:40330 (276), effective:1503 (10)
iterations count:146 (1), effective:0 (0)
60976
iterations count:152263 (1042), effective:5775 (39)
iterations count:610 (4), effective:14 (0)
iterations count:9810 (67), effective:270 (1)
iterations count:8062 (55), effective:239 (1)
iterations count:40071 (274), effective:1662 (11)
iterations count:261 (1), effective:8 (0)
iterations count:6600 (45), effective:201 (1)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-010"
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 Railroad-PT-010, 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 r330-tall-167889203200370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-010.tgz
mv Railroad-PT-010 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 ;