About the Execution of Marcie+red for BusinessProcesses-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10067.951 | 1981287.00 | 2007995.00 | 486.20 | FTTTTTFTFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695800449.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800449
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678725750814
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:42:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:42:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:42:32] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-13 16:42:32] [INFO ] Transformed 200 places.
[2023-03-13 16:42:32] [INFO ] Transformed 178 transitions.
[2023-03-13 16:42:32] [INFO ] Found NUPN structural information;
[2023-03-13 16:42:32] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 183 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 183 transition count 163
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 177 transition count 157
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 177 transition count 157
Applied a total of 42 rules in 30 ms. Remains 177 /199 variables (removed 22) and now considering 157/177 (removed 20) transitions.
// Phase 1: matrix 157 rows 177 cols
[2023-03-13 16:42:32] [INFO ] Computed 28 place invariants in 12 ms
[2023-03-13 16:42:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-13 16:42:32] [INFO ] Invariant cache hit.
[2023-03-13 16:42:32] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-13 16:42:32] [INFO ] Invariant cache hit.
[2023-03-13 16:42:33] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/199 places, 157/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 177/199 places, 157/177 transitions.
Support contains 90 out of 177 places after structural reductions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 36 ms
[2023-03-13 16:42:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-01-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 12 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 56 out of 177 places (down from 90) after GAL structural reductions.
Finished random walk after 3544 steps, including 44 resets, run visited all 36 properties in 80 ms. (steps per millisecond=44 )
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 157 transitions.
Computed a total of 146 stabilizing places and 126 stable transitions
Graph (complete) has 353 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 138
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 138
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 150 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 150 transition count 130
Applied a total of 54 rules in 18 ms. Remains 150 /177 variables (removed 27) and now considering 130/157 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 150/177 places, 130/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 96 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 168 transition count 118
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 140 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 137 transition count 115
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 64 place count 137 transition count 92
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 115 place count 109 transition count 92
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 131 place count 93 transition count 76
Iterating global reduction 3 with 16 rules applied. Total rules applied 147 place count 93 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 147 place count 93 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 90 transition count 73
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 209 place count 62 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 61 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 60 transition count 44
Applied a total of 211 rules in 29 ms. Remains 60 /177 variables (removed 117) and now considering 44/157 (removed 113) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 60/177 places, 44/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 138
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 158 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 148 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 148 transition count 127
Applied a total of 59 rules in 7 ms. Remains 148 /177 variables (removed 29) and now considering 127/157 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 148/177 places, 127/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 138
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 158 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 148 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 148 transition count 127
Applied a total of 59 rules in 7 ms. Remains 148 /177 variables (removed 29) and now considering 127/157 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 148/177 places, 127/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 103 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 168 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 137 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 136 transition count 114
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 66 place count 136 transition count 88
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 123 place count 105 transition count 88
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 141 place count 87 transition count 70
Iterating global reduction 3 with 18 rules applied. Total rules applied 159 place count 87 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 159 place count 87 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 165 place count 84 transition count 67
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 221 place count 56 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 55 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 54 transition count 38
Applied a total of 223 rules in 21 ms. Remains 54 /177 variables (removed 123) and now considering 38/157 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 54/177 places, 38/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 138
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 158 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 148 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 148 transition count 127
Applied a total of 59 rules in 6 ms. Remains 148 /177 variables (removed 29) and now considering 127/157 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 148/177 places, 127/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 104 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 168 transition count 114
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 136 transition count 114
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 66 place count 136 transition count 87
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 126 place count 103 transition count 87
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 144 place count 85 transition count 69
Iterating global reduction 2 with 18 rules applied. Total rules applied 162 place count 85 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 162 place count 85 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 82 transition count 66
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 228 place count 52 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 51 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 50 transition count 35
Applied a total of 230 rules in 13 ms. Remains 50 /177 variables (removed 127) and now considering 35/157 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 50/177 places, 35/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 159 transition count 139
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 159 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 159 transition count 138
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 151 transition count 130
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 151 transition count 130
Applied a total of 53 rules in 6 ms. Remains 151 /177 variables (removed 26) and now considering 130/157 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 151/177 places, 130/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 102 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 168 transition count 115
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 137 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 64 place count 137 transition count 88
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 124 place count 104 transition count 88
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 86 transition count 70
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 86 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 160 place count 86 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 83 transition count 67
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 224 place count 54 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 53 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 52 transition count 37
Applied a total of 226 rules in 13 ms. Remains 52 /177 variables (removed 125) and now considering 37/157 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 52/177 places, 37/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 157 transition count 137
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 157 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 157 transition count 136
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 146 transition count 125
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 146 transition count 125
Applied a total of 63 rules in 6 ms. Remains 146 /177 variables (removed 31) and now considering 125/157 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 146/177 places, 125/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 4 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 104 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 168 transition count 114
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 136 transition count 114
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 66 place count 136 transition count 87
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 126 place count 103 transition count 87
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 144 place count 85 transition count 69
Iterating global reduction 2 with 18 rules applied. Total rules applied 162 place count 85 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 162 place count 85 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 82 transition count 66
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 228 place count 52 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 52 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 51 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 50 transition count 35
Applied a total of 232 rules in 14 ms. Remains 50 /177 variables (removed 127) and now considering 35/157 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 50/177 places, 35/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 35 transitions.
Finished random walk after 16 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
FORMULA BusinessProcesses-PT-01-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Graph (trivial) has 97 edges and 177 vertex of which 8 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 169 transition count 119
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 141 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 139 transition count 117
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 62 place count 139 transition count 92
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 116 place count 110 transition count 92
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 133 place count 93 transition count 75
Iterating global reduction 3 with 17 rules applied. Total rules applied 150 place count 93 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 150 place count 93 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 90 transition count 72
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 216 place count 60 transition count 42
Applied a total of 216 rules in 17 ms. Remains 60 /177 variables (removed 117) and now considering 42/157 (removed 115) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 60/177 places, 42/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 3 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 2 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 157/157 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 136
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 156 transition count 135
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 145 transition count 124
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 145 transition count 124
Applied a total of 65 rules in 6 ms. Remains 145 /177 variables (removed 32) and now considering 124/157 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 145/177 places, 124/157 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 5 ms
[2023-03-13 16:42:33] [INFO ] Input system was already deterministic with 124 transitions.
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 16:42:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 16:42:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 16:42:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 157 transitions and 443 arcs took 2 ms.
Total runtime 1467 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 177 NrTr: 157 NrArc: 443)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.981sec
RS generation: 0m14.669sec
-> reachability set: #nodes 951447 (9.5e+05) #states 21,625,643,148 (10)
starting MCC model checker
--------------------------
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA BusinessProcesses-PT-01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m37.052sec
checking: AF [EG [AG [[p135<=0 & 0<=p135]]]]
normalized: ~ [EG [~ [EG [~ [E [true U ~ [[p135<=0 & 0<=p135]]]]]]]]
abstracting: (0<=p135)
states: 21,625,643,148 (10)
abstracting: (p135<=0)
states: 20,811,820,116 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA BusinessProcesses-PT-01-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m21.403sec
checking: AG [EF [[p16<=1 & 1<=p16]]]
normalized: ~ [E [true U ~ [E [true U [p16<=1 & 1<=p16]]]]]
abstracting: (1<=p16)
states: 1,327,072,896 (9)
abstracting: (p16<=1)
states: 21,625,643,148 (10)
-> the formula is FALSE
FORMULA BusinessProcesses-PT-01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m58.791sec
checking: EF [AG [[[p79<=0 & 0<=p79] & [p20<=0 & 0<=p20]]]]
normalized: E [true U ~ [E [true U ~ [[[p20<=0 & 0<=p20] & [p79<=0 & 0<=p79]]]]]]
abstracting: (0<=p79)
states: 21,625,643,148 (10)
abstracting: (p79<=0)
states: 21,623,681,409 (10)
abstracting: (0<=p20)
states: 21,625,643,148 (10)
abstracting: (p20<=0)
states: 21,077,590,668 (10)
-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.502sec
checking: EX [EF [AX [[[p22<=0 & 0<=p22] & [p112<=1 & 1<=p112]]]]]
normalized: EX [E [true U ~ [EX [~ [[[p22<=0 & 0<=p22] & [p112<=1 & 1<=p112]]]]]]]
abstracting: (1<=p112)
states: 606,974,982 (8)
abstracting: (p112<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p22)
states: 21,625,643,148 (10)
abstracting: (p22<=0)
states: 19,571,646,444 (10)
before gc: list nodes free: 1396927
after gc: idd nodes used:3198839, unused:60801161; list nodes free:266870319
..-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m28.570sec
checking: [AG [EF [EG [[[p166<=0 & 0<=p166] & [p72<=1 & 1<=p72]]]]] & [EG [[[p15<=0 & 0<=p15] & AX [[p40<=0 & 0<=p40]]]] | AF [[p114<=0 & 0<=p114]]]]
normalized: [[~ [EG [~ [[p114<=0 & 0<=p114]]]] | EG [[~ [EX [~ [[p40<=0 & 0<=p40]]]] & [p15<=0 & 0<=p15]]]] & ~ [E [true U ~ [E [true U EG [[[p72<=1 & 1<=p72] & [p166<=0 & 0<=p166]]]]]]]]
abstracting: (0<=p166)
states: 21,625,643,148 (10)
abstracting: (p166<=0)
states: 21,612,355,164 (10)
abstracting: (1<=p72)
states: 10,753,954,744 (10)
abstracting: (p72<=1)
states: 21,625,643,148 (10)
................
before gc: list nodes free: 994621
after gc: idd nodes used:3097127, unused:60902873; list nodes free:273750213
.......................
EG iterations: 39
before gc: list nodes free: 3584155
after gc: idd nodes used:2107329, unused:61892671; list nodes free:278121150
abstracting: (0<=p15)
states: 21,625,643,148 (10)
abstracting: (p15<=0)
states: 7,404,057,824 (9)
abstracting: (0<=p40)
states: 21,625,643,148 (10)
abstracting: (p40<=0)
states: 16,775,826,156 (10)
.....................
before gc: list nodes free: 862672
after gc: idd nodes used:3556651, unused:60443349; list nodes free:271403030
.....................
EG iterations: 41
abstracting: (0<=p114)
states: 21,625,643,148 (10)
abstracting: (p114<=0)
states: 13,506,921,276 (10)
.......................................
EG iterations: 39
-> the formula is FALSE
FORMULA BusinessProcesses-PT-01-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 7m 4.701sec
checking: EF [[[[p41<=1 & 1<=p41] & AX [E [[p102<=1 & 1<=p102] U [[p143<=0 & 0<=p143] | [p139<=1 & 1<=p139]]]]] & [[p112<=0 & 0<=p112] & EF [[p56<=1 & 1<=p56]]]]]
normalized: E [true U [[E [true U [p56<=1 & 1<=p56]] & [p112<=0 & 0<=p112]] & [~ [EX [~ [E [[p102<=1 & 1<=p102] U [[p139<=1 & 1<=p139] | [p143<=0 & 0<=p143]]]]]] & [p41<=1 & 1<=p41]]]]
abstracting: (1<=p41)
states: 4,849,816,992 (9)
abstracting: (p41<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p143)
states: 21,625,643,148 (10)
abstracting: (p143<=0)
states: 21,472,376,460 (10)
abstracting: (1<=p139)
states: 764,863,488 (8)
abstracting: (p139<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p102)
states: 7,221,134,538 (9)
abstracting: (p102<=1)
states: 21,625,643,148 (10)
.abstracting: (0<=p112)
states: 21,625,643,148 (10)
abstracting: (p112<=0)
states: 21,018,668,166 (10)
abstracting: (1<=p56)
states: 460,479,984 (8)
abstracting: (p56<=1)
states: 21,625,643,148 (10)
-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 0.826sec
checking: AG [EF [[A [[[p59<=0 & 0<=p59] | [p25<=1 & 1<=p25]] U [[p40<=0 & 0<=p40] | [p57<=1 & 1<=p57]]] | [EF [[p0<=0 & 0<=p0]] & EG [[p50<=1 & 1<=p50]]]]]]
normalized: ~ [E [true U ~ [E [true U [[EG [[p50<=1 & 1<=p50]] & E [true U [p0<=0 & 0<=p0]]] | [~ [EG [~ [[[p57<=1 & 1<=p57] | [p40<=0 & 0<=p40]]]]] & ~ [E [~ [[[p57<=1 & 1<=p57] | [p40<=0 & 0<=p40]]] U [~ [[[p25<=1 & 1<=p25] | [p59<=0 & 0<=p59]]] & ~ [[[p57<=1 & 1<=p57] | [p40<=0 & 0<=p40]]]]]]]]]]]]
abstracting: (0<=p40)
states: 21,625,643,148 (10)
abstracting: (p40<=0)
states: 16,775,826,156 (10)
abstracting: (1<=p57)
states: 460,479,984 (8)
abstracting: (p57<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p59)
states: 21,625,643,148 (10)
abstracting: (p59<=0)
states: 21,599,067,180 (10)
abstracting: (1<=p25)
states: 2,483,908,164 (9)
abstracting: (p25<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p40)
states: 21,625,643,148 (10)
abstracting: (p40<=0)
states: 16,775,826,156 (10)
abstracting: (1<=p57)
states: 460,479,984 (8)
abstracting: (p57<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p40)
states: 21,625,643,148 (10)
abstracting: (p40<=0)
states: 16,775,826,156 (10)
abstracting: (1<=p57)
states: 460,479,984 (8)
abstracting: (p57<=1)
states: 21,625,643,148 (10)
.............
before gc: list nodes free: 3938345
after gc: idd nodes used:3220010, unused:60779990; list nodes free:273135672
.........................
EG iterations: 38
abstracting: (0<=p0)
states: 21,625,643,148 (10)
abstracting: (p0<=0)
states: 21,625,643,147 (10)
abstracting: (1<=p50)
states: 13,288,136 (7)
abstracting: (p50<=1)
states: 21,625,643,148 (10)
.........................................
EG iterations: 41
-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m42.413sec
checking: EF [EX [[~ [E [[[p57<=0 & 0<=p57] & [[p49<=0 & 0<=p49] | [p169<=1 & 1<=p169]]] U [[p106<=1 & 1<=p106] & [p86<=0 & 0<=p86]]]] & AG [[[p135<=1 & 1<=p135] | [[p98<=0 & 0<=p98] & [p137<=1 & 1<=p137]]]]]]]
normalized: E [true U EX [[~ [E [true U ~ [[[[p137<=1 & 1<=p137] & [p98<=0 & 0<=p98]] | [p135<=1 & 1<=p135]]]]] & ~ [E [[[[p169<=1 & 1<=p169] | [p49<=0 & 0<=p49]] & [p57<=0 & 0<=p57]] U [[p86<=0 & 0<=p86] & [p106<=1 & 1<=p106]]]]]]]
abstracting: (1<=p106)
states: 2,241,178,848 (9)
abstracting: (p106<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p86)
states: 21,625,643,148 (10)
abstracting: (p86<=0)
states: 17,449,537,569 (10)
abstracting: (0<=p57)
states: 21,625,643,148 (10)
abstracting: (p57<=0)
states: 21,165,163,164 (10)
abstracting: (0<=p49)
states: 21,625,643,148 (10)
abstracting: (p49<=0)
states: 21,612,355,012 (10)
abstracting: (1<=p169)
states: 3,459,812 (6)
abstracting: (p169<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p135)
states: 813,823,032 (8)
abstracting: (p135<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p98)
states: 21,625,643,148 (10)
abstracting: (p98<=0)
states: 19,202,317,773 (10)
abstracting: (1<=p137)
states: 1,245,094,647 (9)
abstracting: (p137<=1)
states: 21,625,643,148 (10)
.-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m34.629sec
checking: EF [[E [[[[p104<=1 & 1<=p104] | [[p103<=0 & 0<=p103] | [p164<=1 & 1<=p164]]] & A [[p17<=1 & 1<=p17] U [p120<=0 & 0<=p120]]] U ~ [[[[p62<=0 & 0<=p62] | [p35<=1 & 1<=p35]] & [p60<=0 & 0<=p60]]]] | [p115<=1 & 1<=p115]]]
normalized: E [true U [[p115<=1 & 1<=p115] | E [[[~ [EG [~ [[p120<=0 & 0<=p120]]]] & ~ [E [~ [[p120<=0 & 0<=p120]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p120<=0 & 0<=p120]]]]]] & [[[p164<=1 & 1<=p164] | [p103<=0 & 0<=p103]] | [p104<=1 & 1<=p104]]] U ~ [[[p60<=0 & 0<=p60] & [[p35<=1 & 1<=p35] | [p62<=0 & 0<=p62]]]]]]]
abstracting: (0<=p62)
states: 21,625,643,148 (10)
abstracting: (p62<=0)
states: 15,936,548,076 (10)
abstracting: (1<=p35)
states: 5,917,550,688 (9)
abstracting: (p35<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p60)
states: 21,625,643,148 (10)
abstracting: (p60<=0)
states: 21,599,067,180 (10)
abstracting: (1<=p104)
states: 1,296,210,627 (9)
abstracting: (p104<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p103)
states: 21,625,643,148 (10)
abstracting: (p103<=0)
states: 16,839,963,330 (10)
abstracting: (1<=p164)
states: 13,286,160 (7)
abstracting: (p164<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p120)
states: 21,625,643,148 (10)
abstracting: (p120<=0)
states: 21,536,760,420 (10)
abstracting: (1<=p17)
states: 1,327,072,896 (9)
abstracting: (p17<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p120)
states: 21,625,643,148 (10)
abstracting: (p120<=0)
states: 21,536,760,420 (10)
abstracting: (0<=p120)
states: 21,625,643,148 (10)
abstracting: (p120<=0)
states: 21,536,760,420 (10)
.
EG iterations: 1
abstracting: (1<=p115)
states: 2,186,277,072 (9)
abstracting: (p115<=1)
states: 21,625,643,148 (10)
-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m32.135sec
checking: AF [E [[EF [EG [[[1<=p28 & p28<=1] | [p18<=0 & 0<=p18]]]] & [[[p28<=1 & 1<=p28] | [[p131<=1 & 1<=p131] | EX [[p129<=1 & 1<=p129]]]] | [[p31<=0 & 0<=p31] | [[p82<=1 & 1<=p82] | [[p5<=0 & 0<=p5] & [p55<=1 & 1<=p55]]]]]] U ~ [[~ [[p34<=1 & 1<=p34]] | EX [[[p113<=0 & 0<=p113] | [p157<=1 & 1<=p157]]]]]]]
normalized: ~ [EG [~ [E [[[[[[[p55<=1 & 1<=p55] & [p5<=0 & 0<=p5]] | [p82<=1 & 1<=p82]] | [p31<=0 & 0<=p31]] | [[EX [[p129<=1 & 1<=p129]] | [p131<=1 & 1<=p131]] | [p28<=1 & 1<=p28]]] & E [true U EG [[[p18<=0 & 0<=p18] | [1<=p28 & p28<=1]]]]] U ~ [[EX [[[p157<=1 & 1<=p157] | [p113<=0 & 0<=p113]]] | ~ [[p34<=1 & 1<=p34]]]]]]]]
abstracting: (1<=p34)
states: 5,917,550,688 (9)
abstracting: (p34<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p113)
states: 21,625,643,148 (10)
abstracting: (p113<=0)
states: 20,489,520,141 (10)
abstracting: (1<=p157)
states: 6,643,992 (6)
abstracting: (p157<=1)
states: 21,625,643,148 (10)
before gc: list nodes free: 8651015
after gc: idd nodes used:5779295, unused:58220705; list nodes free:262148963
.abstracting: (p28<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p28)
states: 2,483,908,164 (9)
abstracting: (0<=p18)
states: 21,625,643,148 (10)
abstracting: (p18<=0)
states: 21,077,590,668 (10)
.................................
EG iterations: 33
abstracting: (1<=p28)
states: 2,483,908,164 (9)
abstracting: (p28<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p131)
states: 1,245,094,647 (9)
abstracting: (p131<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p129)
states: 1,245,094,647 (9)
abstracting: (p129<=1)
states: 21,625,643,148 (10)
.abstracting: (0<=p31)
states: 21,625,643,148 (10)
abstracting: (p31<=0)
states: 19,492,965,788 (10)
abstracting: (1<=p82)
states: 1,392,035,193 (9)
abstracting: (p82<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p5)
states: 21,625,643,148 (10)
abstracting: (p5<=0)
states: 21,623,943,868 (10)
abstracting: (1<=p55)
states: 13,287,984 (7)
abstracting: (p55<=1)
states: 21,625,643,148 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA BusinessProcesses-PT-01-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m55.843sec
checking: [AG [[[p44<=0 & 0<=p44] & [p83<=1 & 1<=p83]]] | AF [[EF [[[p62<=1 & 1<=p62] | [[p21<=0 & 0<=p21] & [p69<=1 & 1<=p69]]]] & [EG [[p29<=0 & 0<=p29]] | [EX [[[p96<=0 & 0<=p96] & [p16<=1 & 1<=p16]]] | AX [[[[p45<=0 & 0<=p45] | [p161<=1 & 1<=p161]] | [[p5<=1 & 1<=p5] | AF [[[p98<=0 & 0<=p98] | [p136<=1 & 1<=p136]]]]]]]]]]]
normalized: [~ [EG [~ [[[[~ [EX [~ [[[~ [EG [~ [[[p136<=1 & 1<=p136] | [p98<=0 & 0<=p98]]]]] | [p5<=1 & 1<=p5]] | [[p161<=1 & 1<=p161] | [p45<=0 & 0<=p45]]]]]] | EX [[[p16<=1 & 1<=p16] & [p96<=0 & 0<=p96]]]] | EG [[p29<=0 & 0<=p29]]] & E [true U [[[p69<=1 & 1<=p69] & [p21<=0 & 0<=p21]] | [p62<=1 & 1<=p62]]]]]]] | ~ [E [true U ~ [[[p83<=1 & 1<=p83] & [p44<=0 & 0<=p44]]]]]]
abstracting: (0<=p44)
states: 21,625,643,148 (10)
abstracting: (p44<=0)
states: 21,062,978,892 (10)
abstracting: (1<=p83)
states: 5,387,694,507 (9)
abstracting: (p83<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p62)
states: 5,689,095,072 (9)
abstracting: (p62<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p21)
states: 21,625,643,148 (10)
abstracting: (p21<=0)
states: 21,399,883,340 (10)
abstracting: (1<=p69)
states: 4,997,263,392 (9)
abstracting: (p69<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p29)
states: 21,625,643,148 (10)
abstracting: (p29<=0)
states: 19,141,734,984 (10)
....
before gc: list nodes free: 5788893
after gc: idd nodes used:8526611, unused:55473389; list nodes free:249853011
.........
before gc: list nodes free: 1023360
after gc: idd nodes used:10883899, unused:53116101; list nodes free:238790412
......
before gc: list nodes free: 988856
after gc: idd nodes used:9654437, unused:54345563; list nodes free:245261509
.........................
EG iterations: 44
abstracting: (0<=p96)
states: 21,625,643,148 (10)
abstracting: (p96<=0)
states: 16,854,089,388 (10)
abstracting: (1<=p16)
states: 1,327,072,896 (9)
abstracting: (p16<=1)
states: 21,625,643,148 (10)
.abstracting: (0<=p45)
states: 21,625,643,148 (10)
abstracting: (p45<=0)
states: 14,329,280,620 (10)
abstracting: (1<=p161)
states: 8,857,440 (6)
abstracting: (p161<=1)
states: 21,625,643,148 (10)
abstracting: (1<=p5)
states: 1,699,280 (6)
abstracting: (p5<=1)
states: 21,625,643,148 (10)
abstracting: (0<=p98)
states: 21,625,643,148 (10)
abstracting: (p98<=0)
states: 19,202,317,773 (10)
abstracting: (1<=p136)
states: 1,245,094,647 (9)
abstracting: (p136<=1)
states: 21,625,643,148 (10)
......
before gc: list nodes free: 3719037
after gc: idd nodes used:9244733, unused:54755267; list nodes free:247038220
..................
before gc: list nodes free: 3289717
after gc: idd nodes used:9065147, unused:54934853; list nodes free:247823679
.............
EG iterations: 37
............................
EG iterations: 27
-> the formula is TRUE
FORMULA BusinessProcesses-PT-01-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 14m11.513sec
totally nodes used: 671644112 (6.7e+08)
number of garbage collections: 11
fire ops cache: hits/miss/sum: 502874385 2429993457 2932867842
used/not used/entry size/cache size: 52024355 15084509 16 1024MB
basic ops cache: hits/miss/sum: 62002819 275406895 337409714
used/not used/entry size/cache size: 10476813 6300403 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: 2853196 13932832 16786028
used/not used/entry size/cache size: 0 8388608 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 41358786
1 17934485
2 5874535
3 1546991
4 327547
5 56968
6 8374
7 1056
8 102
9 18
>= 10 2
Total processing time: 32m58.023sec
BK_STOP 1678727732101
--------------------
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 CTLCardinality -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:7656 (48), effective:711 (4)
initing FirstDep: 0m 0.001sec
iterations count:2234 (14), effective:106 (0)
iterations count:4198 (26), effective:266 (1)
iterations count:2128 (13), effective:114 (0)
iterations count:4043 (25), effective:258 (1)
iterations count:1992 (12), effective:113 (0)
iterations count:3376 (21), effective:155 (0)
iterations count:946 (6), effective:53 (0)
iterations count:1110 (7), effective:84 (0)
iterations count:157 (1), effective:0 (0)
iterations count:1801 (11), effective:138 (0)
iterations count:2367 (15), effective:185 (1)
iterations count:240 (1), effective:1 (0)
iterations count:159 (1), effective:1 (0)
iterations count:2051 (13), effective:118 (0)
iterations count:243 (1), effective:25 (0)
iterations count:2930 (18), effective:173 (1)
iterations count:157 (1), effective:0 (0)
iterations count:325 (2), effective:11 (0)
iterations count:1799 (11), effective:136 (0)
iterations count:355 (2), effective:15 (0)
iterations count:159 (1), effective:1 (0)
iterations count:3064 (19), effective:172 (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="BusinessProcesses-PT-01"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695800449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;