About the Execution of Marcie+red for ShieldPPPt-PT-002B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10142.123 | 3600000.00 | 3651374.00 | 165.00 | T?F?FTTFTFFF?TT? | 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.r394-oct2-167903718000553.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000553
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 20:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 20:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 20:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 37K 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 ShieldPPPt-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-002B-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679523407046
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=ShieldPPPt-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:16:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:16:49] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-22 22:16:49] [INFO ] Transformed 159 places.
[2023-03-22 22:16:49] [INFO ] Transformed 145 transitions.
[2023-03-22 22:16:49] [INFO ] Found NUPN structural information;
[2023-03-22 22:16:49] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-002B-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 156 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 156 transition count 142
Applied a total of 6 rules in 19 ms. Remains 156 /159 variables (removed 3) and now considering 142/145 (removed 3) transitions.
// Phase 1: matrix 142 rows 156 cols
[2023-03-22 22:16:49] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-22 22:16:50] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-22 22:16:50] [INFO ] Invariant cache hit.
[2023-03-22 22:16:50] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-22 22:16:50] [INFO ] Invariant cache hit.
[2023-03-22 22:16:50] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/159 places, 142/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 156/159 places, 142/145 transitions.
Support contains 94 out of 156 places after structural reductions.
[2023-03-22 22:16:50] [INFO ] Flatten gal took : 30 ms
[2023-03-22 22:16:50] [INFO ] Flatten gal took : 13 ms
[2023-03-22 22:16:50] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 85 out of 156 places (down from 94) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 61) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Finished Best-First random walk after 374 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=187 )
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 155 transition count 106
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 120 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 118 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 117 transition count 102
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 77 place count 117 transition count 94
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 93 place count 109 transition count 94
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 107 place count 95 transition count 80
Iterating global reduction 4 with 14 rules applied. Total rules applied 121 place count 95 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 121 place count 95 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 137 place count 87 transition count 72
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 4 with 56 rules applied. Total rules applied 193 place count 59 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 57 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 56 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 196 place count 56 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 200 place count 54 transition count 40
Applied a total of 200 rules in 27 ms. Remains 54 /156 variables (removed 102) and now considering 40/142 (removed 102) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 54/156 places, 40/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 141 transition count 127
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 141 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 140 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 140 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 139 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 139 transition count 125
Applied a total of 34 rules in 16 ms. Remains 139 /156 variables (removed 17) and now considering 125/142 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 139/156 places, 125/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 155 transition count 108
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 122 transition count 105
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 120 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 118 transition count 103
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 75 place count 118 transition count 95
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 91 place count 110 transition count 95
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 102 place count 99 transition count 84
Iterating global reduction 4 with 11 rules applied. Total rules applied 113 place count 99 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 113 place count 99 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 125 place count 93 transition count 78
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 4 with 60 rules applied. Total rules applied 185 place count 63 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 61 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 60 transition count 46
Applied a total of 188 rules in 17 ms. Remains 60 /156 variables (removed 96) and now considering 46/142 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 60/156 places, 46/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 139 transition count 125
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Applied a total of 38 rules in 13 ms. Remains 137 /156 variables (removed 19) and now considering 123/142 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 137/156 places, 123/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 155 transition count 107
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 121 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 119 transition count 104
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 73 place count 119 transition count 95
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 91 place count 110 transition count 95
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 104 place count 97 transition count 82
Iterating global reduction 3 with 13 rules applied. Total rules applied 117 place count 97 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 117 place count 97 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 133 place count 89 transition count 74
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 187 place count 62 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 62 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 61 transition count 46
Applied a total of 189 rules in 15 ms. Remains 61 /156 variables (removed 95) and now considering 46/142 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 61/156 places, 46/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 136 transition count 122
Applied a total of 40 rules in 7 ms. Remains 136 /156 variables (removed 20) and now considering 122/142 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/156 places, 122/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Applied a total of 38 rules in 8 ms. Remains 137 /156 variables (removed 19) and now considering 123/142 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 137/156 places, 123/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 136 transition count 122
Applied a total of 40 rules in 7 ms. Remains 136 /156 variables (removed 20) and now considering 122/142 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/156 places, 122/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 136 transition count 122
Applied a total of 40 rules in 7 ms. Remains 136 /156 variables (removed 20) and now considering 122/142 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/156 places, 122/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 155 transition count 105
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 119 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 117 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 117 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 110 transition count 95
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 104 place count 97 transition count 82
Iterating global reduction 3 with 13 rules applied. Total rules applied 117 place count 97 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 117 place count 97 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 131 place count 90 transition count 75
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 187 place count 62 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 60 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 59 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 190 place count 59 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 194 place count 57 transition count 43
Applied a total of 194 rules in 20 ms. Remains 57 /156 variables (removed 99) and now considering 43/142 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 57/156 places, 43/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 136 transition count 122
Applied a total of 40 rules in 6 ms. Remains 136 /156 variables (removed 20) and now considering 122/142 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/156 places, 122/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 126
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 126
Applied a total of 32 rules in 4 ms. Remains 140 /156 variables (removed 16) and now considering 126/142 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 140/156 places, 126/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 126
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 126
Applied a total of 32 rules in 3 ms. Remains 140 /156 variables (removed 16) and now considering 126/142 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 140/156 places, 126/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 139 transition count 125
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 137 transition count 123
Applied a total of 38 rules in 18 ms. Remains 137 /156 variables (removed 19) and now considering 123/142 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 137/156 places, 123/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 156/156 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 155 transition count 114
Reduce places removed 27 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 128 transition count 110
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 124 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 123 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 65 place count 123 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 116 transition count 101
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 88 place count 107 transition count 92
Iterating global reduction 4 with 9 rules applied. Total rules applied 97 place count 107 transition count 92
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 97 place count 107 transition count 88
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 103 transition count 88
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 159 place count 76 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 75 transition count 60
Applied a total of 160 rules in 26 ms. Remains 75 /156 variables (removed 81) and now considering 60/142 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 75/156 places, 60/142 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:16:51] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:16:51] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 22:16:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 142 transitions and 356 arcs took 0 ms.
Total runtime 2211 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: 156 NrTr: 142 NrArc: 356)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.013sec
init dd package: 0m 2.995sec
RS generation: 0m 5.150sec
-> reachability set: #nodes 94796 (9.5e+04) #states 80,167,664,912,873 (13)
starting MCC model checker
--------------------------
checking: EG [[0<=p22 & p22<=0]]
normalized: EG [[0<=p22 & p22<=0]]
abstracting: (p22<=0)
states: 58,374,344,764,351 (13)
abstracting: (0<=p22)
states: 80,167,664,912,873 (13)
........................................................................................................
before gc: list nodes free: 591118
after gc: idd nodes used:722792, unused:63277208; list nodes free:290284634
..................................................................
before gc: list nodes free: 892034
after gc: idd nodes used:960744, unused:63039256; list nodes free:289160884
............................................................
EG iterations: 230
-> the formula is TRUE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m37.946sec
checking: AG [EX [EF [[p134<=1 & 1<=p134]]]]
normalized: ~ [E [true U ~ [EX [E [true U [p134<=1 & 1<=p134]]]]]]
abstracting: (1<=p134)
states: 7,874,488,709,564 (12)
abstracting: (p134<=1)
states: 80,167,664,912,873 (13)
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m31.679sec
checking: AG [EF [[[p76<=0 & 0<=p76] & [p72<=1 & 1<=p72]]]]
normalized: ~ [E [true U ~ [E [true U [[p72<=1 & 1<=p72] & [p76<=0 & 0<=p76]]]]]]
abstracting: (0<=p76)
states: 80,167,664,912,873 (13)
abstracting: (p76<=0)
states: 71,198,205,460,637 (13)
abstracting: (1<=p72)
states: 8,616,558,068,083 (12)
abstracting: (p72<=1)
states: 80,167,664,912,873 (13)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.811sec
checking: [AF [[[p82<=0 & 0<=p82] & [p50<=1 & 1<=p50]]] & AF [[p52<=1 & 1<=p52]]]
normalized: [~ [EG [~ [[p52<=1 & 1<=p52]]]] & ~ [EG [~ [[[p50<=1 & 1<=p50] & [p82<=0 & 0<=p82]]]]]]
abstracting: (0<=p82)
states: 80,167,664,912,873 (13)
abstracting: (p82<=0)
states: 80,167,664,910,371 (13)
abstracting: (1<=p50)
states: 10,865,612,053,428 (13)
abstracting: (p50<=1)
states: 80,167,664,912,873 (13)
before gc: list nodes free: 1570675
after gc: idd nodes used:245596, unused:63754404; list nodes free:292491044
..................................................................................................
before gc: list nodes free: 2065309
after gc: idd nodes used:901560, unused:63098440; list nodes free:291549965
.................................................
before gc: list nodes free: 2149741
after gc: idd nodes used:1084752, unused:62915248; list nodes free:290632525
...................................................................
EG iterations: 214
abstracting: (1<=p52)
states: 10,916,642,041,002 (13)
abstracting: (p52<=1)
states: 80,167,664,912,873 (13)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m43.804sec
checking: E [[EX [0<=0] | [p71<=0 & 0<=p71]] U [[p74<=1 & 1<=p74] | [p38<=1 & 1<=p38]]]
normalized: E [[[p71<=0 & 0<=p71] | EX [0<=0]] U [[p38<=1 & 1<=p38] | [p74<=1 & 1<=p74]]]
abstracting: (1<=p74)
states: 8,969,459,452,236 (12)
abstracting: (p74<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p38)
states: 9,384,678,842,318 (12)
abstracting: (p38<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=0)
states: 80,167,664,912,873 (13)
.abstracting: (0<=p71)
states: 80,167,664,912,873 (13)
abstracting: (p71<=0)
states: 71,198,205,460,637 (13)
-> the formula is TRUE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.855sec
checking: AX [AG [[EF [[[p10<=0 & 0<=p10] | [p113<=1 & 1<=p113]]] | [[p85<=0 & 0<=p85] & [p139<=1 & 1<=p139]]]]]
normalized: ~ [EX [E [true U ~ [[[[p139<=1 & 1<=p139] & [p85<=0 & 0<=p85]] | E [true U [[p113<=1 & 1<=p113] | [p10<=0 & 0<=p10]]]]]]]]
abstracting: (0<=p10)
states: 80,167,664,912,873 (13)
abstracting: (p10<=0)
states: 80,167,552,951,337 (13)
abstracting: (1<=p113)
states: 8,628,743,546,012 (12)
abstracting: (p113<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p85)
states: 80,167,664,912,873 (13)
abstracting: (p85<=0)
states: 80,167,664,752,745 (13)
abstracting: (1<=p139)
states: 9,037,490,897,386 (12)
abstracting: (p139<=1)
states: 80,167,664,912,873 (13)
.-> the formula is TRUE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.861sec
checking: [AG [EF [[[p102<=0 & 0<=p102] & [p155<=1 & 1<=p155]]]] | ~ [A [~ [[[p146<=0 & 0<=p146] | [p95<=1 & 1<=p95]]] U EF [~ [AF [[p134<=1 & 1<=p134]]]]]]]
normalized: [~ [[~ [EG [~ [E [true U EG [~ [[p134<=1 & 1<=p134]]]]]]] & ~ [E [~ [E [true U EG [~ [[p134<=1 & 1<=p134]]]]] U [[[p95<=1 & 1<=p95] | [p146<=0 & 0<=p146]] & ~ [E [true U EG [~ [[p134<=1 & 1<=p134]]]]]]]]]] | ~ [E [true U ~ [E [true U [[p155<=1 & 1<=p155] & [p102<=0 & 0<=p102]]]]]]]
abstracting: (0<=p102)
states: 80,167,664,912,873 (13)
abstracting: (p102<=0)
states: 59,713,054,408,109 (13)
abstracting: (1<=p155)
states: 323,346,954 (8)
abstracting: (p155<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p134)
states: 7,874,488,709,564 (12)
abstracting: (p134<=1)
states: 80,167,664,912,873 (13)
.........
before gc: list nodes free: 2690225
after gc: idd nodes used:455357, unused:63544643; list nodes free:293635234
........................................................................................................................................................
EG iterations: 161
abstracting: (0<=p146)
states: 80,167,664,912,873 (13)
abstracting: (p146<=0)
states: 71,958,770,231,257 (13)
abstracting: (1<=p95)
states: 19,721,894,086,124 (13)
abstracting: (p95<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p134)
states: 7,874,488,709,564 (12)
abstracting: (p134<=1)
states: 80,167,664,912,873 (13)
.................................................................................................................................................................
EG iterations: 161
abstracting: (1<=p134)
states: 7,874,488,709,564 (12)
abstracting: (p134<=1)
states: 80,167,664,912,873 (13)
.................................................................................................................................................................
EG iterations: 161
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m46.016sec
checking: [EF [EX [[[[[p116<=0 & 0<=p116] | [p37<=1 & 1<=p37]] & [p124<=0 & 0<=p124]] & [AF [[p31<=1 & 1<=p31]] & AG [EF [[[p124<=0 & 0<=p124] | [p144<=1 & 1<=p144]]]]]]]] & EF [EG [EX [EF [[p36<=0 & 0<=p36]]]]]]
normalized: [E [true U EG [EX [E [true U [p36<=0 & 0<=p36]]]]] & E [true U EX [[[~ [E [true U ~ [E [true U [[p144<=1 & 1<=p144] | [p124<=0 & 0<=p124]]]]]] & ~ [EG [~ [[p31<=1 & 1<=p31]]]]] & [[p124<=0 & 0<=p124] & [[p37<=1 & 1<=p37] | [p116<=0 & 0<=p116]]]]]]]
abstracting: (0<=p116)
states: 80,167,664,912,873 (13)
abstracting: (p116<=0)
states: 71,047,837,343,401 (13)
abstracting: (1<=p37)
states: 307,837,191,952 (11)
abstracting: (p37<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p124)
states: 80,167,664,912,873 (13)
abstracting: (p124<=0)
states: 69,279,285,108,195 (13)
abstracting: (1<=p31)
states: 11,469,705,158,136 (13)
abstracting: (p31<=1)
states: 80,167,664,912,873 (13)
...........................................................................
before gc: list nodes free: 3719804
after gc: idd nodes used:915761, unused:63084239; list nodes free:291565035
.....................................................................................................................
EG iterations: 192
abstracting: (0<=p124)
states: 80,167,664,912,873 (13)
abstracting: (p124<=0)
states: 69,279,285,108,195 (13)
abstracting: (1<=p144)
states: 896,550 (5)
abstracting: (p144<=1)
states: 80,167,664,912,873 (13)
.
before gc: list nodes free: 4032396
after gc: idd nodes used:372618, unused:63627382; list nodes free:294040701
abstracting: (0<=p36)
states: 80,167,664,912,873 (13)
abstracting: (p36<=0)
states: 57,304,862,716,247 (13)
.........................................................................................................
before gc: list nodes free: 4010659
after gc: idd nodes used:640961, unused:63359039; list nodes free:292822090
....................................................................................
EG iterations: 188
-> the formula is TRUE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m28.993sec
checking: [AX [EX [[[[p92<=0 & 0<=p92] & [[p15<=0 & 0<=p15] | [p61<=1 & 1<=p61]]] & [[p85<=0 & 0<=p85] & EX [0<=0]]]]] & AF [[[p126<=0 & 0<=p126] | [[p80<=1 & 1<=p80] | [[p31<=1 & 1<=p31] & [p100<=1 & 1<=p100]]]]]]
normalized: [~ [EG [~ [[[[[p100<=1 & 1<=p100] & [p31<=1 & 1<=p31]] | [p80<=1 & 1<=p80]] | [p126<=0 & 0<=p126]]]]] & ~ [EX [~ [EX [[[EX [0<=0] & [p85<=0 & 0<=p85]] & [[[p61<=1 & 1<=p61] | [p15<=0 & 0<=p15]] & [p92<=0 & 0<=p92]]]]]]]]
abstracting: (0<=p92)
states: 80,167,664,912,873 (13)
abstracting: (p92<=0)
states: 70,304,905,879,521 (13)
abstracting: (0<=p15)
states: 80,167,664,912,873 (13)
abstracting: (p15<=0)
states: 53,508,563,736,771 (13)
abstracting: (1<=p61)
states: 8,855,785,639,439 (12)
abstracting: (p61<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p85)
states: 80,167,664,912,873 (13)
abstracting: (p85<=0)
states: 80,167,664,752,745 (13)
abstracting: (0<=0)
states: 80,167,664,912,873 (13)
...abstracting: (0<=p126)
states: 80,167,664,912,873 (13)
abstracting: (p126<=0)
states: 69,279,285,108,195 (13)
abstracting: (1<=p80)
states: 834
abstracting: (p80<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p31)
states: 11,469,705,158,136 (13)
abstracting: (p31<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p100)
states: 12,059,114,693,264 (13)
abstracting: (p100<=1)
states: 80,167,664,912,873 (13)
.................................................................
before gc: list nodes free: 2142401
after gc: idd nodes used:979271, unused:63020729; list nodes free:291296895
..........................................................................................................................................
EG iterations: 203
-> the formula is TRUE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m54.934sec
checking: AF [AG [[E [AG [[p77<=0 & 0<=p77]] U [[p41<=0 & 0<=p41] & [p33<=1 & 1<=p33]]] & [AX [[[[p10<=0 & 0<=p10] | [p103<=1 & 1<=p103]] | [[p90<=0 & 0<=p90] | [p123<=1 & 1<=p123]]]] & [[p35<=0 & 0<=p35] | [p70<=1 & 1<=p70]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[p70<=1 & 1<=p70] | [p35<=0 & 0<=p35]] & ~ [EX [~ [[[[p123<=1 & 1<=p123] | [p90<=0 & 0<=p90]] | [[p103<=1 & 1<=p103] | [p10<=0 & 0<=p10]]]]]]] & E [~ [E [true U ~ [[p77<=0 & 0<=p77]]]] U [[p33<=1 & 1<=p33] & [p41<=0 & 0<=p41]]]]]]]]
abstracting: (0<=p41)
states: 80,167,664,912,873 (13)
abstracting: (p41<=0)
states: 70,183,979,709,749 (13)
abstracting: (1<=p33)
states: 22,862,378,674,414 (13)
abstracting: (p33<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p77)
states: 80,167,664,912,873 (13)
abstracting: (p77<=0)
states: 71,263,947,742,517 (13)
abstracting: (0<=p10)
states: 80,167,664,912,873 (13)
abstracting: (p10<=0)
states: 80,167,552,951,337 (13)
abstracting: (1<=p103)
states: 22,278,941,277,980 (13)
abstracting: (p103<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p90)
states: 80,167,664,912,873 (13)
abstracting: (p90<=0)
states: 53,523,918,307,767 (13)
abstracting: (1<=p123)
states: 1,260,327,148,900 (12)
abstracting: (p123<=1)
states: 80,167,664,912,873 (13)
.abstracting: (0<=p35)
states: 80,167,664,912,873 (13)
abstracting: (p35<=0)
states: 57,271,924,900,049 (13)
abstracting: (1<=p70)
states: 8,825,338,607,544 (12)
abstracting: (p70<=1)
states: 80,167,664,912,873 (13)
.......................................................
EG iterations: 55
-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.904sec
checking: AG [[[EF [[[p71<=0 & 0<=p71] | [p51<=1 & 1<=p51]]] | AF [EG [[[p72<=0 & 0<=p72] & [p147<=1 & 1<=p147]]]]] | [EG [[[p35<=0 & 0<=p35] & [p95<=1 & 1<=p95]]] | [[[p48<=0 & 0<=p48] & AX [[p9<=1 & 1<=p9]]] & [EG [[p72<=0 & 0<=p72]] & [[p141<=1 & 1<=p141] | [[p3<=0 & 0<=p3] | [p150<=1 & 1<=p150]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p150<=1 & 1<=p150] | [p3<=0 & 0<=p3]] | [p141<=1 & 1<=p141]] & EG [[p72<=0 & 0<=p72]]] & [~ [EX [~ [[p9<=1 & 1<=p9]]]] & [p48<=0 & 0<=p48]]] | EG [[[p95<=1 & 1<=p95] & [p35<=0 & 0<=p35]]]] | [~ [EG [~ [EG [[[p147<=1 & 1<=p147] & [p72<=0 & 0<=p72]]]]]] | E [true U [[p51<=1 & 1<=p51] | [p71<=0 & 0<=p71]]]]]]]]
abstracting: (0<=p71)
states: 80,167,664,912,873 (13)
abstracting: (p71<=0)
states: 71,198,205,460,637 (13)
abstracting: (1<=p51)
states: 10,916,642,041,002 (13)
abstracting: (p51<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p72)
states: 80,167,664,912,873 (13)
abstracting: (p72<=0)
states: 71,551,106,844,790 (13)
abstracting: (1<=p147)
states: 9,043,844,605,126 (12)
abstracting: (p147<=1)
states: 80,167,664,912,873 (13)
....................
before gc: list nodes free: 3001027
after gc: idd nodes used:1351107, unused:62648893; list nodes free:289605314
...........................
before gc: list nodes free: 831157
after gc: idd nodes used:3974388, unused:60025612; list nodes free:277545961
...............
before gc: list nodes free: 1903026
after gc: idd nodes used:5879540, unused:58120460; list nodes free:270913216
..............
before gc: list nodes free: 1936912
after gc: idd nodes used:4319976, unused:59680024; list nodes free:277724203
.MC time: 8m58.301sec
checking: AG [[A [[[[[p148<=0 & 0<=p148] | [p117<=1 & 1<=p117]] | [[p5<=0 & 0<=p5] | [p141<=1 & 1<=p141]]] & [[p57<=1 & 1<=p57] & [p36<=1 & 1<=p36]]] U E [[[p93<=0 & 0<=p93] | [p129<=1 & 1<=p129]] U [[p65<=0 & 0<=p65] | [p34<=1 & 1<=p34]]]] | [~ [A [[[p68<=0 & 0<=p68] | [p121<=1 & 1<=p121]] U [p61<=0 & 0<=p61]]] & AF [[p106<=0 & 0<=p106]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[p106<=0 & 0<=p106]]]] & ~ [[~ [EG [~ [[p61<=0 & 0<=p61]]]] & ~ [E [~ [[p61<=0 & 0<=p61]] U [~ [[[p121<=1 & 1<=p121] | [p68<=0 & 0<=p68]]] & ~ [[p61<=0 & 0<=p61]]]]]]]] | [~ [EG [~ [E [[[p129<=1 & 1<=p129] | [p93<=0 & 0<=p93]] U [[p34<=1 & 1<=p34] | [p65<=0 & 0<=p65]]]]]] & ~ [E [~ [E [[[p129<=1 & 1<=p129] | [p93<=0 & 0<=p93]] U [[p34<=1 & 1<=p34] | [p65<=0 & 0<=p65]]]] U [~ [[[[p36<=1 & 1<=p36] & [p57<=1 & 1<=p57]] & [[[p141<=1 & 1<=p141] | [p5<=0 & 0<=p5]] | [[p117<=1 & 1<=p117] | [p148<=0 & 0<=p148]]]]] & ~ [E [[[p129<=1 & 1<=p129] | [p93<=0 & 0<=p93]] U [[p34<=1 & 1<=p34] | [p65<=0 & 0<=p65]]]]]]]]]]]]
abstracting: (0<=p65)
states: 80,167,664,912,873 (13)
abstracting: (p65<=0)
states: 71,175,791,936,054 (13)
abstracting: (1<=p34)
states: 22,896,163,535,036 (13)
abstracting: (p34<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p93)
states: 80,167,664,912,873 (13)
abstracting: (p93<=0)
states: 68,566,630,410,917 (13)
abstracting: (1<=p129)
states: 10,888,379,804,678 (13)
abstracting: (p129<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p148)
states: 80,167,664,912,873 (13)
abstracting: (p148<=0)
states: 71,504,438,078,775 (13)
abstracting: (1<=p117)
states: 9,119,827,569,472 (12)
abstracting: (p117<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p5)
states: 80,167,664,912,873 (13)
abstracting: (p5<=0)
states: 80,167,664,329,740 (13)
abstracting: (1<=p141)
states: 9,030,024,915,636 (12)
abstracting: (p141<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p57)
states: 1,140,905,813,860 (12)
abstracting: (p57<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p36)
states: 22,862,802,196,626 (13)
abstracting: (p36<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p65)
states: 80,167,664,912,873 (13)
abstracting: (p65<=0)
states: 71,175,791,936,054 (13)
abstracting: (1<=p34)
states: 22,896,163,535,036 (13)
abstracting: (p34<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p93)
states: 80,167,664,912,873 (13)
abstracting: (p93<=0)
states: 68,566,630,410,917 (13)
abstracting: (1<=p129)
states: 10,888,379,804,678 (13)
abstracting: (p129<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p65)
states: 80,167,664,912,873 (13)
abstracting: (p65<=0)
states: 71,175,791,936,054 (13)
abstracting: (1<=p34)
states: 22,896,163,535,036 (13)
abstracting: (p34<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p93)
states: 80,167,664,912,873 (13)
abstracting: (p93<=0)
states: 68,566,630,410,917 (13)
abstracting: (1<=p129)
states: 10,888,379,804,678 (13)
abstracting: (p129<=1)
states: 80,167,664,912,873 (13)
.....................................................................................................................................................................................................................
EG iterations: 213
abstracting: (0<=p61)
states: 80,167,664,912,873 (13)
abstracting: (p61<=0)
states: 71,311,879,273,434 (13)
abstracting: (0<=p68)
states: 80,167,664,912,873 (13)
abstracting: (p68<=0)
states: 80,166,909,946,262 (13)
abstracting: (1<=p121)
states: 2,593,995,447,630 (12)
abstracting: (p121<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p61)
states: 80,167,664,912,873 (13)
abstracting: (p61<=0)
states: 71,311,879,273,434 (13)
abstracting: (0<=p61)
states: 80,167,664,912,873 (13)
abstracting: (p61<=0)
states: 71,311,879,273,434 (13)
..............................
before gc: list nodes free: 609554
after gc: idd nodes used:1119509, unused:62880491; list nodes free:294854160
.......................................................
before gc: list nodes free: 1571717
after gc: idd nodes used:3085184, unused:60914816; list nodes free:285608898
....................................
before gc: list nodes free: 137402
after gc: idd nodes used:3687983, unused:60312017; list nodes free:282719198
.MC time: 7m10.236sec
checking: [AG [AF [[[p10<=0 & 0<=p10] & [EF [[[p108<=0 & 0<=p108] & [p151<=1 & 1<=p151]]] & [EX [[p128<=0 & 0<=p128]] | [[p83<=0 & 0<=p83] & [[p50<=0 & 0<=p50] & [p78<=1 & 1<=p78]]]]]]]] | AG [[[[p115<=0 & 0<=p115] & [p116<=1 & 1<=p116]] & [A [EX [[p85<=1 & 1<=p85]] U [[[p137<=0 & 0<=p137] | [p59<=1 & 1<=p59]] | [[p155<=0 & 0<=p155] | [p83<=1 & 1<=p83]]]] & AF [[[p74<=0 & 0<=p74] | [p0<=1 & 1<=p0]]]]]]]
normalized: [~ [E [true U EG [~ [[[[[[[p78<=1 & 1<=p78] & [p50<=0 & 0<=p50]] & [p83<=0 & 0<=p83]] | EX [[p128<=0 & 0<=p128]]] & E [true U [[p151<=1 & 1<=p151] & [p108<=0 & 0<=p108]]]] & [p10<=0 & 0<=p10]]]]]] | ~ [E [true U ~ [[[~ [EG [~ [[[p0<=1 & 1<=p0] | [p74<=0 & 0<=p74]]]]] & [~ [EG [~ [[[[p83<=1 & 1<=p83] | [p155<=0 & 0<=p155]] | [[p59<=1 & 1<=p59] | [p137<=0 & 0<=p137]]]]]] & ~ [E [~ [[[[p83<=1 & 1<=p83] | [p155<=0 & 0<=p155]] | [[p59<=1 & 1<=p59] | [p137<=0 & 0<=p137]]]] U [~ [EX [[p85<=1 & 1<=p85]]] & ~ [[[[p83<=1 & 1<=p83] | [p155<=0 & 0<=p155]] | [[p59<=1 & 1<=p59] | [p137<=0 & 0<=p137]]]]]]]]] & [[p116<=1 & 1<=p116] & [p115<=0 & 0<=p115]]]]]]]
abstracting: (0<=p115)
states: 80,167,664,912,873 (13)
abstracting: (p115<=0)
states: 71,047,837,343,401 (13)
abstracting: (1<=p116)
states: 9,119,827,569,472 (12)
abstracting: (p116<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p137)
states: 80,167,664,912,873 (13)
abstracting: (p137<=0)
states: 71,130,174,015,487 (13)
abstracting: (1<=p59)
states: 8,387,464,788,100 (12)
abstracting: (p59<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p155)
states: 80,167,664,912,873 (13)
abstracting: (p155<=0)
states: 80,167,341,565,919 (13)
abstracting: (1<=p83)
states: 10,008 (4)
abstracting: (p83<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p85)
states: 160,128 (5)
abstracting: (p85<=1)
states: 80,167,664,912,873 (13)
.abstracting: (0<=p137)
states: 80,167,664,912,873 (13)
abstracting: (p137<=0)
states: 71,130,174,015,487 (13)
abstracting: (1<=p59)
states: 8,387,464,788,100 (12)
abstracting: (p59<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p155)
states: 80,167,664,912,873 (13)
abstracting: (p155<=0)
states: 80,167,341,565,919 (13)
abstracting: (1<=p83)
states: 10,008 (4)
abstracting: (p83<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p137)
states: 80,167,664,912,873 (13)
abstracting: (p137<=0)
states: 71,130,174,015,487 (13)
abstracting: (1<=p59)
states: 8,387,464,788,100 (12)
abstracting: (p59<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p155)
states: 80,167,664,912,873 (13)
abstracting: (p155<=0)
states: 80,167,341,565,919 (13)
abstracting: (1<=p83)
states: 10,008 (4)
abstracting: (p83<=1)
states: 80,167,664,912,873 (13)
..............................
EG iterations: 30
abstracting: (0<=p74)
states: 80,167,664,912,873 (13)
abstracting: (p74<=0)
states: 71,198,205,460,637 (13)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 80,167,664,912,873 (13)
....................................................................................................
before gc: list nodes free: 6411133
after gc: idd nodes used:2304139, unused:61695861; list nodes free:289424125
.........................................................................................
before gc: list nodes free: 6881408
after gc: idd nodes used:1445351, unused:62554649; list nodes free:293420703
.........................................................................................................................................
EG iterations: 326
abstracting: (0<=p10)
states: 80,167,664,912,873 (13)
abstracting: (p10<=0)
states: 80,167,552,951,337 (13)
abstracting: (0<=p108)
states: 80,167,664,912,873 (13)
abstracting: (p108<=0)
states: 57,270,154,207,879 (13)
abstracting: (1<=p151)
states: 9,043,844,605,126 (12)
abstracting: (p151<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p128)
states: 80,167,664,912,873 (13)
abstracting: (p128<=0)
states: 69,279,285,108,195 (13)
.abstracting: (0<=p83)
states: 80,167,664,912,873 (13)
abstracting: (p83<=0)
states: 80,167,664,902,865 (13)
abstracting: (0<=p50)
states: 80,167,664,912,873 (13)
abstracting: (p50<=0)
states: 69,302,052,859,445 (13)
abstracting: (1<=p78)
states: 8,972,197,366,452 (12)
abstracting: (p78<=1)
states: 80,167,664,912,873 (13)
......................................................................................
EG iterations: 86
before gc: list nodes free: 8101172
after gc: idd nodes used:935863, unused:63064137; list nodes free:295727868
-> the formula is FALSE
FORMULA ShieldPPPt-PT-002B-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m40.588sec
checking: A [[AX [~ [AF [[[[p101<=0 & 0<=p101] | [p128<=1 & 1<=p128]] & [p78<=0 & 0<=p78]]]]] & [AF [[[p143<=1 & 1<=p143] & E [[p150<=0 & 0<=p150] U [p30<=1 & 1<=p30]]]] | ~ [EF [[E [[p69<=1 & 1<=p69] U [[p128<=0 & 0<=p128] | [p151<=1 & 1<=p151]]] & E [[[p31<=0 & 0<=p31] | [p41<=1 & 1<=p41]] U [p40<=1 & 1<=p40]]]]]]] U [AG [[AG [AX [[[p129<=0 & 0<=p129] | [p95<=1 & 1<=p95]]]] | [A [[p110<=1 & 1<=p110] U [p153<=1 & 1<=p153]] | EG [[p14<=0 & 0<=p14]]]]] & EF [[p0<=0 & 0<=p0]]]]
normalized: [~ [EG [~ [[E [true U [p0<=0 & 0<=p0]] & ~ [E [true U ~ [[[EG [[p14<=0 & 0<=p14]] | [~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[p110<=1 & 1<=p110]] & ~ [[p153<=1 & 1<=p153]]]]]]] | ~ [E [true U EX [~ [[[p95<=1 & 1<=p95] | [p129<=0 & 0<=p129]]]]]]]]]]]]]] & ~ [E [~ [[E [true U [p0<=0 & 0<=p0]] & ~ [E [true U ~ [[[EG [[p14<=0 & 0<=p14]] | [~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[p110<=1 & 1<=p110]] & ~ [[p153<=1 & 1<=p153]]]]]]] | ~ [E [true U EX [~ [[[p95<=1 & 1<=p95] | [p129<=0 & 0<=p129]]]]]]]]]]]] U [~ [[[~ [E [true U [E [[[p41<=1 & 1<=p41] | [p31<=0 & 0<=p31]] U [p40<=1 & 1<=p40]] & E [[p69<=1 & 1<=p69] U [[p151<=1 & 1<=p151] | [p128<=0 & 0<=p128]]]]]] | ~ [EG [~ [[E [[p150<=0 & 0<=p150] U [p30<=1 & 1<=p30]] & [p143<=1 & 1<=p143]]]]]] & ~ [EX [~ [EG [~ [[[p78<=0 & 0<=p78] & [[p128<=1 & 1<=p128] | [p101<=0 & 0<=p101]]]]]]]]]] & ~ [[E [true U [p0<=0 & 0<=p0]] & ~ [E [true U ~ [[[EG [[p14<=0 & 0<=p14]] | [~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[p110<=1 & 1<=p110]] & ~ [[p153<=1 & 1<=p153]]]]]]] | ~ [E [true U EX [~ [[[p95<=1 & 1<=p95] | [p129<=0 & 0<=p129]]]]]]]]]]]]]]]]
abstracting: (0<=p129)
states: 80,167,664,912,873 (13)
abstracting: (p129<=0)
states: 69,279,285,108,195 (13)
abstracting: (1<=p95)
states: 19,721,894,086,124 (13)
abstracting: (p95<=1)
states: 80,167,664,912,873 (13)
.abstracting: (1<=p153)
states: 9,031,497,770,188 (12)
abstracting: (p153<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p110)
states: 22,903,361,167,878 (13)
abstracting: (p110<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p153)
states: 9,031,497,770,188 (12)
abstracting: (p153<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p153)
states: 9,031,497,770,188 (12)
abstracting: (p153<=1)
states: 80,167,664,912,873 (13)
................................................................................................
before gc: list nodes free: 7005568
after gc: idd nodes used:1273424, unused:62726576; list nodes free:294152479
...........................................................................................
before gc: list nodes free: 6959074
after gc: idd nodes used:1099898, unused:62900102; list nodes free:294965952
...............................................
EG iterations: 234
abstracting: (0<=p14)
states: 80,167,664,912,873 (13)
abstracting: (p14<=0)
states: 54,693,326,384,020 (13)
.............................................................................
before gc: list nodes free: 6587169
after gc: idd nodes used:2525177, unused:61474823; list nodes free:288402594
....................MC time: 5m45.007sec
checking: EX [[EG [[[[p37<=0 & 0<=p37] & [[p115<=1 & 1<=p115] & AX [[p112<=1 & 1<=p112]]]] | AF [[[[p16<=0 & 0<=p16] | [p20<=1 & 1<=p20]] & [[p154<=0 & 0<=p154] | [p87<=1 & 1<=p87]]]]]] & A [~ [[~ [[[p49<=0 & 0<=p49] | [p138<=1 & 1<=p138]]] | [AF [[p92<=1 & 1<=p92]] | AX [[[p130<=0 & 0<=p130] | [p151<=1 & 1<=p151]]]]]] U AF [[[[[p94<=0 & 0<=p94] | [p57<=1 & 1<=p57]] & [p47<=1 & 1<=p47]] | [[[p153<=0 & 0<=p153] | [p46<=1 & 1<=p46]] & [p12<=0 & 0<=p12]]]]]]]
normalized: EX [[[~ [EG [EG [~ [[[[p12<=0 & 0<=p12] & [[p46<=1 & 1<=p46] | [p153<=0 & 0<=p153]]] | [[p47<=1 & 1<=p47] & [[p57<=1 & 1<=p57] | [p94<=0 & 0<=p94]]]]]]]] & ~ [E [EG [~ [[[[p12<=0 & 0<=p12] & [[p46<=1 & 1<=p46] | [p153<=0 & 0<=p153]]] | [[p47<=1 & 1<=p47] & [[p57<=1 & 1<=p57] | [p94<=0 & 0<=p94]]]]]] U [[[~ [EX [~ [[[p151<=1 & 1<=p151] | [p130<=0 & 0<=p130]]]]] | ~ [EG [~ [[p92<=1 & 1<=p92]]]]] | ~ [[[p138<=1 & 1<=p138] | [p49<=0 & 0<=p49]]]] & EG [~ [[[[p12<=0 & 0<=p12] & [[p46<=1 & 1<=p46] | [p153<=0 & 0<=p153]]] | [[p47<=1 & 1<=p47] & [[p57<=1 & 1<=p57] | [p94<=0 & 0<=p94]]]]]]]]]] & EG [[~ [EG [~ [[[[p87<=1 & 1<=p87] | [p154<=0 & 0<=p154]] & [[p20<=1 & 1<=p20] | [p16<=0 & 0<=p16]]]]]] | [[~ [EX [~ [[p112<=1 & 1<=p112]]]] & [p115<=1 & 1<=p115]] & [p37<=0 & 0<=p37]]]]]]
abstracting: (0<=p37)
states: 80,167,664,912,873 (13)
abstracting: (p37<=0)
states: 79,859,827,720,921 (13)
abstracting: (1<=p115)
states: 9,119,827,569,472 (12)
abstracting: (p115<=1)
states: 80,167,664,912,873 (13)
abstracting: (1<=p112)
states: 2,593,995,447,630 (12)
abstracting: (p112<=1)
states: 80,167,664,912,873 (13)
.abstracting: (0<=p16)
states: 80,167,664,912,873 (13)
abstracting: (p16<=0)
states: 66,856,797,509,941 (13)
abstracting: (1<=p20)
states: 21,588,544,641,606 (13)
abstracting: (p20<=1)
states: 80,167,664,912,873 (13)
abstracting: (0<=p154)
states: 80,167,664,912,873 (13)
abstracting: (p154<=0)
states: 71,123,489,007,109 (13)
abstracting: (1<=p87)
states: 1,579,840,238,096 (12)
abstracting: (p87<=1)
states: 80,167,664,912,873 (13)
...................................
before gc: list nodes free: 4083518
after gc: idd nodes used:2058247, unused:61941753; list nodes free:290580485
.................................................................
before gc: list nodes free: 3314310
after gc: idd nodes used:2316437, unused:61683563; list nodes free:289403121
......................................................................................................................................MC time: 4m18.999sec
checking: AG [[[EF [[[p71<=0 & 0<=p71] | [p51<=1 & 1<=p51]]] | AF [EG [[[p72<=0 & 0<=p72] & [p147<=1 & 1<=p147]]]]] | [EG [[[p35<=0 & 0<=p35] & [p95<=1 & 1<=p95]]] | [[[p48<=0 & 0<=p48] & AX [[p9<=1 & 1<=p9]]] & [EG [[p72<=0 & 0<=p72]] & [[p141<=1 & 1<=p141] | [[p3<=0 & 0<=p3] | [p150<=1 & 1<=p150]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p3<=0 & 0<=p3] | [p150<=1 & 1<=p150]] | [p141<=1 & 1<=p141]] & EG [[p72<=0 & 0<=p72]]] & [~ [EX [~ [[p9<=1 & 1<=p9]]]] & [p48<=0 & 0<=p48]]] | EG [[[p95<=1 & 1<=p95] & [p35<=0 & 0<=p35]]]] | [~ [EG [~ [EG [[[p147<=1 & 1<=p147] & [p72<=0 & 0<=p72]]]]]] | E [true U [[p51<=1 & 1<=p51] | [p71<=0 & 0<=p71]]]]]]]]
abstracting: (0<=p71)
states: 80,167,664,912,873 (13)
abstracting: (p71<=0)
states: 71,198,205,460,637 (13)
abstracting: (1<=p51)
states: 10,916,642,041,002 (13)
abstracting: (p51<=1)
states: 80,167,664,912,873 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6007504 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101408 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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:38897 (273), effective:6246 (43)
initing FirstDep: 0m 0.000sec
iterations count:3983 (28), effective:409 (2)
iterations count:10062 (70), effective:1242 (8)
iterations count:2997 (21), effective:298 (2)
iterations count:9367 (65), effective:1142 (8)
iterations count:3193 (22), effective:333 (2)
iterations count:212 (1), effective:1 (0)
iterations count:160 (1), effective:4 (0)
iterations count:1448 (10), effective:104 (0)
iterations count:631 (4), effective:77 (0)
iterations count:631 (4), effective:77 (0)
iterations count:631 (4), effective:77 (0)
iterations count:149 (1), effective:2 (0)
iterations count:5748 (40), effective:775 (5)
iterations count:1269 (8), effective:127 (0)
iterations count:142 (1), effective:0 (0)
iterations count:2724 (19), effective:285 (2)
iterations count:772 (5), effective:56 (0)
iterations count:1638 (11), effective:166 (1)
iterations count:224 (1), effective:10 (0)
net_ddint.h:600: Timeout: after 537 sec
iterations count:144 (1), effective:1 (0)
iterations count:144 (1), effective:1 (0)
iterations count:144 (1), effective:1 (0)
iterations count:144 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 429 sec
iterations count:142 (1), effective:0 (0)
iterations count:1823 (12), effective:231 (1)
iterations count:3547 (24), effective:384 (2)
iterations count:12416 (87), effective:1527 (10)
iterations count:6287 (44), effective:752 (5)
iterations count:1918 (13), effective:211 (1)
net_ddint.h:600: Timeout: after 344 sec
net_ddint.h:600: Timeout: after 258 sec
iterations count:224 (1), effective:10 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-002B"
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 ShieldPPPt-PT-002B, 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 r394-oct2-167903718000553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B 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 ;