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.r170-tall-167838857200450.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K 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 FlexibleBarrier-PT-04b-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678549941948

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 15:52:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:52:23] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-11 15:52:23] [INFO ] Transformed 268 places.
[2023-03-11 15:52:23] [INFO ] Transformed 305 transitions.
[2023-03-11 15:52:23] [INFO ] Found NUPN structural information;
[2023-03-11 15:52:23] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 96 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 217 transition count 254
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 217 transition count 254
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 116 place count 203 transition count 240
Iterating global reduction 0 with 14 rules applied. Total rules applied 130 place count 203 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 135 place count 198 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 140 place count 198 transition count 235
Applied a total of 140 rules in 51 ms. Remains 198 /268 variables (removed 70) and now considering 235/305 (removed 70) transitions.
// Phase 1: matrix 235 rows 198 cols
[2023-03-11 15:52:23] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-11 15:52:24] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-11 15:52:24] [INFO ] Invariant cache hit.
[2023-03-11 15:52:24] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-11 15:52:24] [INFO ] Invariant cache hit.
[2023-03-11 15:52:24] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/268 places, 235/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 198/268 places, 235/305 transitions.
Support contains 96 out of 198 places after structural reductions.
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 40 ms
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 16 ms
[2023-03-11 15:52:24] [INFO ] Input system was already deterministic with 235 transitions.
Incomplete random walk after 10000 steps, including 237 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 79) seen :66
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 15:52:25] [INFO ] Invariant cache hit.
[2023-03-11 15:52:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 15:52:26] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:4
[2023-03-11 15:52:26] [INFO ] Deduced a trap composed of 129 places in 73 ms of which 5 ms to minimize.
[2023-03-11 15:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-11 15:52:26] [INFO ] After 282ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-11 15:52:26] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-11 15:52:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 15:52:26] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-11 15:52:26] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2023-03-11 15:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-11 15:52:26] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 15:52:26] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 19 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 235/235 transitions.
Graph (trivial) has 178 edges and 198 vertex of which 19 / 198 are part of one of the 3 SCC in 6 ms
Free SCC test removed 16 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 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 36 place count 182 transition count 180
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 147 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 145 transition count 178
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 75 place count 145 transition count 164
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 103 place count 131 transition count 164
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 139 place count 95 transition count 128
Iterating global reduction 3 with 36 rules applied. Total rules applied 175 place count 95 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 175 place count 95 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 93 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 184 place count 88 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 189 place count 88 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 194 place count 88 transition count 116
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 246 place count 62 transition count 90
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 253 place count 62 transition count 83
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 261 place count 54 transition count 75
Iterating global reduction 5 with 8 rules applied. Total rules applied 269 place count 54 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 273 place count 54 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 277 place count 52 transition count 88
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 297 place count 52 transition count 68
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 322 place count 32 transition count 63
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 331 place count 32 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 332 place count 31 transition count 53
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 30 vertex of which 6 / 30 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 334 place count 27 transition count 53
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 340 place count 27 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 340 place count 27 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 348 place count 23 transition count 43
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 352 place count 23 transition count 39
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 362 place count 18 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 366 place count 16 transition count 42
Drop transitions removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 378 place count 16 transition count 30
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 383 place count 16 transition count 25
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 385 place count 16 transition count 23
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 392 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 393 place count 12 transition count 19
Applied a total of 393 rules in 79 ms. Remains 12 /198 variables (removed 186) and now considering 19/235 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 12/198 places, 19/235 transitions.
Finished random walk after 123 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=123 )
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA FlexibleBarrier-PT-04b-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 11 ms
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 11 ms
[2023-03-11 15:52:26] [INFO ] Input system was already deterministic with 235 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Graph (trivial) has 175 edges and 198 vertex of which 25 / 198 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 34 place count 176 transition count 179
Reduce places removed 33 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 143 transition count 175
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 139 transition count 175
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 75 place count 139 transition count 164
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 97 place count 128 transition count 164
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 133 place count 92 transition count 128
Iterating global reduction 3 with 36 rules applied. Total rules applied 169 place count 92 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 169 place count 92 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 90 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 87 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 87 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 182 place count 87 transition count 120
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 206 place count 75 transition count 108
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 72 transition count 105
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 72 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 215 place count 72 transition count 102
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 72 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 70 transition count 96
Applied a total of 221 rules in 35 ms. Remains 70 /198 variables (removed 128) and now considering 96/235 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 70/198 places, 96/235 transitions.
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:26] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Graph (trivial) has 150 edges and 198 vertex of which 12 / 198 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 34 place count 188 transition count 192
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 155 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 153 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 72 place count 153 transition count 176
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 98 place count 140 transition count 176
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 131 place count 107 transition count 143
Iterating global reduction 3 with 33 rules applied. Total rules applied 164 place count 107 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 107 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 106 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 171 place count 101 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 176 place count 101 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 180 place count 101 transition count 133
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 210 place count 86 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 212 place count 84 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 84 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 216 place count 84 transition count 114
Applied a total of 216 rules in 27 ms. Remains 84 /198 variables (removed 114) and now considering 114/235 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 84/198 places, 114/235 transitions.
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:26] [INFO ] Flatten gal took : 5 ms
[2023-03-11 15:52:26] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Graph (trivial) has 183 edges and 198 vertex of which 25 / 198 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 176 transition count 175
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 139 transition count 175
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 75 place count 139 transition count 162
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 101 place count 126 transition count 162
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 139 place count 88 transition count 124
Iterating global reduction 2 with 38 rules applied. Total rules applied 177 place count 88 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 177 place count 88 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 86 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 82 transition count 118
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 82 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 193 place count 82 transition count 114
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 213 place count 72 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 217 place count 68 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 68 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 68 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 68 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 66 transition count 90
Applied a total of 231 rules in 30 ms. Remains 66 /198 variables (removed 132) and now considering 90/235 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 66/198 places, 90/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 90 transitions.
Finished random walk after 240 steps, including 20 resets, run visited all 1 properties in 3 ms. (steps per millisecond=80 )
FORMULA FlexibleBarrier-PT-04b-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 157 transition count 194
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 157 transition count 194
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 147 transition count 184
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 147 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 147 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 144 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 144 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 144 transition count 174
Applied a total of 115 rules in 10 ms. Remains 144 /198 variables (removed 54) and now considering 174/235 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 144/198 places, 174/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 158 transition count 195
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 158 transition count 195
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 147 transition count 184
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 147 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 147 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 144 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 144 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 144 transition count 174
Applied a total of 115 rules in 10 ms. Remains 144 /198 variables (removed 54) and now considering 174/235 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 144/198 places, 174/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 160 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 160 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 151 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 151 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 151 transition count 184
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 149 transition count 182
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 149 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 149 transition count 181
Applied a total of 103 rules in 10 ms. Remains 149 /198 variables (removed 49) and now considering 181/235 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 149/198 places, 181/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 161 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 161 transition count 198
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 86 place count 149 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 98 place count 149 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 104 place count 149 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 145 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 145 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 114 place count 145 transition count 174
Applied a total of 114 rules in 9 ms. Remains 145 /198 variables (removed 53) and now considering 174/235 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 145/198 places, 174/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 158 transition count 195
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 158 transition count 195
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 147 transition count 184
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 147 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 147 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 143 transition count 175
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 143 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 117 place count 143 transition count 173
Applied a total of 117 rules in 16 ms. Remains 143 /198 variables (removed 55) and now considering 173/235 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 143/198 places, 173/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 160 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 160 transition count 197
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 149 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 149 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 149 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 145 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 145 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 145 transition count 176
Applied a total of 112 rules in 10 ms. Remains 145 /198 variables (removed 53) and now considering 176/235 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 145/198 places, 176/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 156 transition count 193
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 156 transition count 193
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 98 place count 142 transition count 179
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 142 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 142 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 138 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 138 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 138 transition count 166
Applied a total of 129 rules in 10 ms. Remains 138 /198 variables (removed 60) and now considering 166/235 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 138/198 places, 166/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 5 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 161 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 161 transition count 198
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 152 transition count 189
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 152 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 152 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 150 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 150 transition count 183
Applied a total of 100 rules in 10 ms. Remains 150 /198 variables (removed 48) and now considering 183/235 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 150/198 places, 183/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Graph (trivial) has 183 edges and 198 vertex of which 25 / 198 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 176 transition count 175
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 139 transition count 175
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 75 place count 139 transition count 162
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 101 place count 126 transition count 162
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 139 place count 88 transition count 124
Iterating global reduction 2 with 38 rules applied. Total rules applied 177 place count 88 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 177 place count 88 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 86 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 81 transition count 117
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 81 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 196 place count 81 transition count 112
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 216 place count 71 transition count 102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 68 transition count 99
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 68 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 225 place count 68 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 68 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 66 transition count 90
Applied a total of 231 rules in 26 ms. Remains 66 /198 variables (removed 132) and now considering 90/235 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 66/198 places, 90/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 159 transition count 196
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 159 transition count 196
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 148 transition count 185
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 148 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 106 place count 148 transition count 179
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 147 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 147 transition count 178
Applied a total of 108 rules in 8 ms. Remains 147 /198 variables (removed 51) and now considering 178/235 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 147/198 places, 178/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 158 transition count 195
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 158 transition count 195
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 92 place count 146 transition count 183
Iterating global reduction 0 with 12 rules applied. Total rules applied 104 place count 146 transition count 183
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 146 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 143 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 143 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 117 place count 143 transition count 173
Applied a total of 117 rules in 9 ms. Remains 143 /198 variables (removed 55) and now considering 173/235 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 143/198 places, 173/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 11 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 235/235 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 156 transition count 193
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 156 transition count 193
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 98 place count 142 transition count 179
Iterating global reduction 0 with 14 rules applied. Total rules applied 112 place count 142 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 142 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 138 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 138 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 138 transition count 166
Applied a total of 129 rules in 8 ms. Remains 138 /198 variables (removed 60) and now considering 166/235 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 138/198 places, 166/235 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 5 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:27] [INFO ] Input system was already deterministic with 166 transitions.
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 15:52:27] [INFO ] Flatten gal took : 8 ms
[2023-03-11 15:52:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 15:52:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 235 transitions and 603 arcs took 1 ms.
Total runtime 4042 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 198 NrTr: 235 NrArc: 603)

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

net check time: 0m 0.000sec

init dd package: 0m 2.817sec


RS generation: 0m25.020sec


-> reachability set: #nodes 99061 (9.9e+04) #states 203,424,394 (8)



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

checking: EX [EF [[p194<=1 & 1<=p194]]]
normalized: EX [E [true U [p194<=1 & 1<=p194]]]

abstracting: (1<=p194)
states: 16,228,592 (7)
abstracting: (p194<=1)
states: 203,424,394 (8)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m15.507sec

checking: EF [AG [[p54<=0 & 0<=p54]]]
normalized: E [true U ~ [E [true U ~ [[p54<=0 & 0<=p54]]]]]

abstracting: (0<=p54)
states: 203,424,394 (8)
abstracting: (p54<=0)
states: 199,499,795 (8)

before gc: list nodes free: 950125

after gc: idd nodes used:374742, unused:63625258; list nodes free:287776814
MC time: 4m30.003sec

checking: EF [[AX [[[p107<=1 & 1<=p107] | [[p174<=1 & 1<=p174] | [p48<=1 & 1<=p48]]]] | [p114<=1 & 1<=p114]]]
normalized: E [true U [[p114<=1 & 1<=p114] | ~ [EX [~ [[[[p48<=1 & 1<=p48] | [p174<=1 & 1<=p174]] | [p107<=1 & 1<=p107]]]]]]]

abstracting: (1<=p107)
states: 4,689,280 (6)
abstracting: (p107<=1)
states: 203,424,394 (8)
abstracting: (1<=p174)
states: 4,047,904 (6)
abstracting: (p174<=1)
states: 203,424,394 (8)
abstracting: (1<=p48)
states: 4,272,991 (6)
abstracting: (p48<=1)
states: 203,424,394 (8)
.abstracting: (1<=p114)
states: 5,443,269 (6)
abstracting: (p114<=1)
states: 203,424,394 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m27.941sec

checking: E [EF [~ [[[p172<=1 & 1<=p172] | [[[p42<=1 & 1<=p42] | E [[p32<=1 & 1<=p32] U [p125<=1 & 1<=p125]]] & [p64<=1 & 1<=p64]]]]] U [p103<=1 & 1<=p103]]
normalized: E [E [true U ~ [[[[p64<=1 & 1<=p64] & [E [[p32<=1 & 1<=p32] U [p125<=1 & 1<=p125]] | [p42<=1 & 1<=p42]]] | [p172<=1 & 1<=p172]]]] U [p103<=1 & 1<=p103]]

abstracting: (1<=p103)
states: 4,689,280 (6)
abstracting: (p103<=1)
states: 203,424,394 (8)
abstracting: (1<=p172)
states: 3,668,279 (6)
abstracting: (p172<=1)
states: 203,424,394 (8)
abstracting: (1<=p42)
states: 4,328,954 (6)
abstracting: (p42<=1)
states: 203,424,394 (8)
abstracting: (1<=p125)
states: 4,725,289 (6)
abstracting: (p125<=1)
states: 203,424,394 (8)
abstracting: (1<=p32)
states: 5,502,504 (6)
abstracting: (p32<=1)
states: 203,424,394 (8)
abstracting: (1<=p64)
states: 4,708,869 (6)
abstracting: (p64<=1)
states: 203,424,394 (8)

before gc: list nodes free: 1484078

after gc: idd nodes used:185299, unused:63814701; list nodes free:288560053
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.133sec

checking: [AF [[EF [[[p26<=0 & 0<=p26] | [[p196<=0 & 0<=p196] | [p190<=1 & 1<=p190]]]] & AG [EX [[[p113<=0 & 0<=p113] | [p196<=0 & 0<=p196]]]]]] & AF [[p150<=0 & 0<=p150]]]
normalized: [~ [EG [~ [[p150<=0 & 0<=p150]]]] & ~ [EG [~ [[~ [E [true U ~ [EX [[[p196<=0 & 0<=p196] | [p113<=0 & 0<=p113]]]]]] & E [true U [[[p190<=1 & 1<=p190] | [p196<=0 & 0<=p196]] | [p26<=0 & 0<=p26]]]]]]]]

abstracting: (0<=p26)
states: 203,424,394 (8)
abstracting: (p26<=0)
states: 199,143,873 (8)
abstracting: (0<=p196)
states: 203,424,394 (8)
abstracting: (p196<=0)
states: 154,549,161 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (0<=p113)
states: 203,424,394 (8)
abstracting: (p113<=0)
states: 197,414,791 (8)
abstracting: (0<=p196)
states: 203,424,394 (8)
abstracting: (p196<=0)
states: 154,549,161 (8)
.
EG iterations: 0
abstracting: (0<=p150)
states: 203,424,394 (8)
abstracting: (p150<=0)
states: 196,781,759 (8)
..................
EG iterations: 18
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.634sec

checking: EG [[AG [E [[[p43<=1 & 1<=p43] & [[p55<=1 & 1<=p55] & [p171<=1 & 1<=p171]]] U ~ [[p164<=1 & 1<=p164]]]] | [AF [EX [[[p108<=1 & 1<=p108] | [p86<=1 & 1<=p86]]]] | [p178<=1 & 1<=p178]]]]
normalized: EG [[[[p178<=1 & 1<=p178] | ~ [EG [~ [EX [[[p86<=1 & 1<=p86] | [p108<=1 & 1<=p108]]]]]]] | ~ [E [true U ~ [E [[[[p171<=1 & 1<=p171] & [p55<=1 & 1<=p55]] & [p43<=1 & 1<=p43]] U ~ [[p164<=1 & 1<=p164]]]]]]]]

abstracting: (1<=p164)
states: 3,970,881 (6)
abstracting: (p164<=1)
states: 203,424,394 (8)
abstracting: (1<=p43)
states: 5,465,261 (6)
abstracting: (p43<=1)
states: 203,424,394 (8)
abstracting: (1<=p55)
states: 5,395,459 (6)
abstracting: (p55<=1)
states: 203,424,394 (8)
abstracting: (1<=p171)
states: 9,806,356 (6)
abstracting: (p171<=1)
states: 203,424,394 (8)
abstracting: (1<=p108)
states: 4,689,280 (6)
abstracting: (p108<=1)
states: 203,424,394 (8)
abstracting: (1<=p86)
states: 5,395,459 (6)
abstracting: (p86<=1)
states: 203,424,394 (8)
............
before gc: list nodes free: 1903213

after gc: idd nodes used:554511, unused:63445489; list nodes free:288957072
.........
EG iterations: 20
abstracting: (1<=p178)
states: 5,195,961 (6)
abstracting: (p178<=1)
states: 203,424,394 (8)
..............
EG iterations: 14
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m26.547sec

checking: EG [[AX [A [~ [[p107<=1 & 1<=p107]] U [[p97<=1 & 1<=p97] | [p9<=1 & 1<=p9]]]] | [A [EX [~ [AG [[[p70<=1 & 1<=p70] & [p196<=1 & 1<=p196]]]]] U ~ [EF [AG [[[p27<=1 & 1<=p27] & [p196<=1 & 1<=p196]]]]]] | [[p73<=1 & 1<=p73] & [p196<=1 & 1<=p196]]]]]
normalized: EG [[[[[p196<=1 & 1<=p196] & [p73<=1 & 1<=p73]] | [~ [EG [E [true U ~ [E [true U ~ [[[p196<=1 & 1<=p196] & [p27<=1 & 1<=p27]]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [[[p196<=1 & 1<=p196] & [p27<=1 & 1<=p27]]]]]] U [~ [EX [E [true U ~ [[[p196<=1 & 1<=p196] & [p70<=1 & 1<=p70]]]]]] & E [true U ~ [E [true U ~ [[[p196<=1 & 1<=p196] & [p27<=1 & 1<=p27]]]]]]]]]]] | ~ [EX [~ [[~ [EG [~ [[[p9<=1 & 1<=p9] | [p97<=1 & 1<=p97]]]]] & ~ [E [~ [[[p9<=1 & 1<=p9] | [p97<=1 & 1<=p97]]] U [[p107<=1 & 1<=p107] & ~ [[[p9<=1 & 1<=p9] | [p97<=1 & 1<=p97]]]]]]]]]]]]

abstracting: (1<=p97)
states: 4,083,056 (6)
abstracting: (p97<=1)
states: 203,424,394 (8)
abstracting: (1<=p9)
states: 4,210,441 (6)
abstracting: (p9<=1)
states: 203,424,394 (8)
abstracting: (1<=p107)
states: 4,689,280 (6)
abstracting: (p107<=1)
states: 203,424,394 (8)
abstracting: (1<=p97)
states: 4,083,056 (6)
abstracting: (p97<=1)
states: 203,424,394 (8)
abstracting: (1<=p9)
states: 4,210,441 (6)
abstracting: (p9<=1)
states: 203,424,394 (8)
abstracting: (1<=p97)
states: 4,083,056 (6)
abstracting: (p97<=1)
states: 203,424,394 (8)
abstracting: (1<=p9)
states: 4,210,441 (6)
abstracting: (p9<=1)
states: 203,424,394 (8)
...........
EG iterations: 11
.abstracting: (1<=p27)
states: 4,246,275 (6)
abstracting: (p27<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
abstracting: (1<=p70)
states: 4,073,684 (6)
abstracting: (p70<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
.abstracting: (1<=p27)
states: 4,246,275 (6)
abstracting: (p27<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
abstracting: (1<=p27)
states: 4,246,275 (6)
abstracting: (p27<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
.
EG iterations: 1
abstracting: (1<=p73)
states: 6,008,165 (6)
abstracting: (p73<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.894sec

checking: AX [[EX [[AF [[p83<=1 & 1<=p83]] | AG [[p74<=1 & 1<=p74]]]] | [~ [A [A [[p20<=1 & 1<=p20] U [p13<=1 & 1<=p13]] U ~ [[[p101<=1 & 1<=p101] | [p39<=1 & 1<=p39]]]]] & AF [[[p81<=1 & 1<=p81] & [[p91<=0 & 0<=p91] | [p120<=0 & 0<=p120]]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[[[p120<=0 & 0<=p120] | [p91<=0 & 0<=p91]] & [p81<=1 & 1<=p81]]]]] & ~ [[~ [EG [[[p39<=1 & 1<=p39] | [p101<=1 & 1<=p101]]]] & ~ [E [[[p39<=1 & 1<=p39] | [p101<=1 & 1<=p101]] U [~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[p20<=1 & 1<=p20]] & ~ [[p13<=1 & 1<=p13]]]]]]] & [[p39<=1 & 1<=p39] | [p101<=1 & 1<=p101]]]]]]]] | EX [[~ [E [true U ~ [[p74<=1 & 1<=p74]]]] | ~ [EG [~ [[p83<=1 & 1<=p83]]]]]]]]]]

abstracting: (1<=p83)
states: 5,146,478 (6)
abstracting: (p83<=1)
states: 203,424,394 (8)
...................
EG iterations: 19
abstracting: (1<=p74)
states: 5,465,589 (6)
abstracting: (p74<=1)
states: 203,424,394 (8)
.abstracting: (1<=p101)
states: 4,689,280 (6)
abstracting: (p101<=1)
states: 203,424,394 (8)
abstracting: (1<=p39)
states: 5,465,261 (6)
abstracting: (p39<=1)
states: 203,424,394 (8)
abstracting: (1<=p13)
states: 4,140,947 (6)
abstracting: (p13<=1)
states: 203,424,394 (8)
abstracting: (1<=p20)
states: 4,740,127 (6)
abstracting: (p20<=1)
states: 203,424,394 (8)
abstracting: (1<=p13)
states: 4,140,947 (6)
abstracting: (p13<=1)
states: 203,424,394 (8)
abstracting: (1<=p13)
states: 4,140,947 (6)
abstracting: (p13<=1)
states: 203,424,394 (8)
...........
EG iterations: 11
abstracting: (1<=p101)
states: 4,689,280 (6)
abstracting: (p101<=1)
states: 203,424,394 (8)
abstracting: (1<=p39)
states: 5,465,261 (6)
abstracting: (p39<=1)
states: 203,424,394 (8)
abstracting: (1<=p101)
states: 4,689,280 (6)
abstracting: (p101<=1)
states: 203,424,394 (8)
abstracting: (1<=p39)
states: 5,465,261 (6)
abstracting: (p39<=1)
states: 203,424,394 (8)
..................
EG iterations: 18
abstracting: (1<=p81)
states: 5,395,459 (6)
abstracting: (p81<=1)
states: 203,424,394 (8)
abstracting: (0<=p91)
states: 203,424,394 (8)
abstracting: (p91<=0)
states: 199,365,401 (8)
abstracting: (0<=p120)
states: 203,424,394 (8)
abstracting: (p120<=0)
states: 199,181,062 (8)
.....................
EG iterations: 21
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.406sec

checking: [AG [AX [[[[p177<=0 & 0<=p177] | AF [[[p14<=0 & 0<=p14] | [[p126<=0 & 0<=p126] | [p170<=0 & 0<=p170]]]]] & EX [[[p84<=1 & 1<=p84] | [p47<=1 & 1<=p47]]]]]] | EF [[EG [[EF [[p158<=0 & 0<=p158]] & [[p13<=0 & 0<=p13] | EF [[p166<=1 & 1<=p166]]]]] & EX [[p91<=1 & 1<=p91]]]]]
normalized: [E [true U [EX [[p91<=1 & 1<=p91]] & EG [[[E [true U [p166<=1 & 1<=p166]] | [p13<=0 & 0<=p13]] & E [true U [p158<=0 & 0<=p158]]]]]] | ~ [E [true U EX [~ [[EX [[[p47<=1 & 1<=p47] | [p84<=1 & 1<=p84]]] & [~ [EG [~ [[[[p170<=0 & 0<=p170] | [p126<=0 & 0<=p126]] | [p14<=0 & 0<=p14]]]]] | [p177<=0 & 0<=p177]]]]]]]]

abstracting: (0<=p177)
states: 203,424,394 (8)
abstracting: (p177<=0)
states: 198,228,433 (8)
abstracting: (0<=p14)
states: 203,424,394 (8)
abstracting: (p14<=0)
states: 197,959,133 (8)
abstracting: (0<=p126)
states: 203,424,394 (8)
abstracting: (p126<=0)
states: 198,004,906 (8)
abstracting: (0<=p170)
states: 203,424,394 (8)
abstracting: (p170<=0)
states: 193,618,038 (8)
...........
EG iterations: 11
abstracting: (1<=p84)
states: 4,340,521 (6)
abstracting: (p84<=1)
states: 203,424,394 (8)
abstracting: (1<=p47)
states: 4,272,991 (6)
abstracting: (p47<=1)
states: 203,424,394 (8)
..abstracting: (0<=p158)
states: 203,424,394 (8)
abstracting: (p158<=0)
states: 196,843,877 (8)
abstracting: (0<=p13)
states: 203,424,394 (8)
abstracting: (p13<=0)
states: 199,283,447 (8)
abstracting: (1<=p166)
states: 3,694,015 (6)
abstracting: (p166<=1)
states: 203,424,394 (8)

before gc: list nodes free: 78125

after gc: idd nodes used:684573, unused:63315427; list nodes free:290498531
.
EG iterations: 1
abstracting: (1<=p91)
states: 4,058,993 (6)
abstracting: (p91<=1)
states: 203,424,394 (8)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m43.124sec

checking: [E [AF [[E [[[p46<=1 & 1<=p46] | [[p126<=1 & 1<=p126] & [[p137<=1 & 1<=p137] & [p188<=1 & 1<=p188]]]] U [p63<=1 & 1<=p63]] | ~ [AX [[p37<=1 & 1<=p37]]]]] U AG [~ [AF [~ [[p54<=1 & 1<=p54]]]]]] & EG [[AX [[p134<=1 & 1<=p134]] | [[p49<=0 & 0<=p49] | ~ [E [~ [[p186<=1 & 1<=p186]] U AG [[[p81<=1 & 1<=p81] & [p190<=1 & 1<=p190]]]]]]]]]
normalized: [EG [[[~ [E [~ [[p186<=1 & 1<=p186]] U ~ [E [true U ~ [[[p190<=1 & 1<=p190] & [p81<=1 & 1<=p81]]]]]]] | [p49<=0 & 0<=p49]] | ~ [EX [~ [[p134<=1 & 1<=p134]]]]]] & E [~ [EG [~ [[EX [~ [[p37<=1 & 1<=p37]]] | E [[[[[p188<=1 & 1<=p188] & [p137<=1 & 1<=p137]] & [p126<=1 & 1<=p126]] | [p46<=1 & 1<=p46]] U [p63<=1 & 1<=p63]]]]]] U ~ [E [true U ~ [EG [[p54<=1 & 1<=p54]]]]]]]

abstracting: (1<=p54)
states: 3,924,599 (6)
abstracting: (p54<=1)
states: 203,424,394 (8)
..................
EG iterations: 18
abstracting: (1<=p63)
states: 4,708,869 (6)
abstracting: (p63<=1)
states: 203,424,394 (8)
abstracting: (1<=p46)
states: 5,395,459 (6)
abstracting: (p46<=1)
states: 203,424,394 (8)
abstracting: (1<=p126)
states: 5,419,488 (6)
abstracting: (p126<=1)
states: 203,424,394 (8)
abstracting: (1<=p137)
states: 6,580,517 (6)
abstracting: (p137<=1)
states: 203,424,394 (8)
abstracting: (1<=p188)
states: 9,806,356 (6)
abstracting: (p188<=1)
states: 203,424,394 (8)
abstracting: (1<=p37)
states: 4,217,210 (6)
abstracting: (p37<=1)
states: 203,424,394 (8)
...
EG iterations: 2
abstracting: (1<=p134)
states: 4,938,638 (6)
abstracting: (p134<=1)
states: 203,424,394 (8)
.abstracting: (0<=p49)
states: 203,424,394 (8)
abstracting: (p49<=0)
states: 199,151,403 (8)
abstracting: (1<=p81)
states: 5,395,459 (6)
abstracting: (p81<=1)
states: 203,424,394 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (1<=p186)
states: 5,417,220 (6)
abstracting: (p186<=1)
states: 203,424,394 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.064sec

checking: [EG [[AG [[[[p72<=0 & 0<=p72] | [p190<=0 & 0<=p190]] & [[p30<=0 & 0<=p30] | [p196<=0 & 0<=p196]]]] | [[[p8<=1 & 1<=p8] | AG [[p17<=0 & 0<=p17]]] & [p41<=0 & 0<=p41]]]] | E [AF [~ [[~ [A [[p1<=1 & 1<=p1] U [p93<=1 & 1<=p93]]] & [A [[p158<=1 & 1<=p158] U [p190<=1 & 1<=p190]] | ~ [[p48<=1 & 1<=p48]]]]]] U [p4<=1 & 1<=p4]]]
normalized: [E [~ [EG [[[~ [[p48<=1 & 1<=p48]] | [~ [EG [~ [[p190<=1 & 1<=p190]]]] & ~ [E [~ [[p190<=1 & 1<=p190]] U [~ [[p158<=1 & 1<=p158]] & ~ [[p190<=1 & 1<=p190]]]]]]] & ~ [[~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p1<=1 & 1<=p1]] & ~ [[p93<=1 & 1<=p93]]]]]]]]]] U [p4<=1 & 1<=p4]] | EG [[[[p41<=0 & 0<=p41] & [~ [E [true U ~ [[p17<=0 & 0<=p17]]]] | [p8<=1 & 1<=p8]]] | ~ [E [true U ~ [[[[p196<=0 & 0<=p196] | [p30<=0 & 0<=p30]] & [[p190<=0 & 0<=p190] | [p72<=0 & 0<=p72]]]]]]]]]

abstracting: (0<=p72)
states: 203,424,394 (8)
abstracting: (p72<=0)
states: 197,742,596 (8)
abstracting: (0<=p190)
states: 203,424,394 (8)
abstracting: (p190<=0)
states: 193,618,038 (8)
abstracting: (0<=p30)
states: 203,424,394 (8)
abstracting: (p30<=0)
states: 197,355,597 (8)
abstracting: (0<=p196)
states: 203,424,394 (8)
abstracting: (p196<=0)
states: 154,549,161 (8)

before gc: list nodes free: 4798584

after gc: idd nodes used:819181, unused:63180819; list nodes free:289877280
abstracting: (1<=p8)
states: 4,112,449 (6)
abstracting: (p8<=1)
states: 203,424,394 (8)
abstracting: (0<=p17)
states: 203,424,394 (8)
abstracting: (p17<=0)
states: 197,959,133 (8)

before gc: list nodes free: 6933352

after gc: idd nodes used:1015554, unused:62984446; list nodes free:288983459
abstracting: (0<=p41)
states: 203,424,394 (8)
abstracting: (p41<=0)
states: 198,643,438 (8)
..................
EG iterations: 18
abstracting: (1<=p4)
states: 3,763,878 (6)
abstracting: (p4<=1)
states: 203,424,394 (8)
abstracting: (1<=p93)
states: 4,061,021 (6)
abstracting: (p93<=1)
states: 203,424,394 (8)
abstracting: (1<=p1)
states: 66
abstracting: (p1<=1)
states: 203,424,394 (8)
abstracting: (1<=p93)
states: 4,061,021 (6)
abstracting: (p93<=1)
states: 203,424,394 (8)
abstracting: (1<=p93)
states: 4,061,021 (6)
abstracting: (p93<=1)
states: 203,424,394 (8)
...........
EG iterations: 11
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (1<=p158)
states: 6,580,517 (6)
abstracting: (p158<=1)
states: 203,424,394 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
...................
EG iterations: 19
abstracting: (1<=p48)
states: 4,272,991 (6)
abstracting: (p48<=1)
states: 203,424,394 (8)
...........
EG iterations: 11
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m 6.132sec

checking: AF [EG [[AX [[EF [[p82<=1 & 1<=p82]] | [[p58<=1 & 1<=p58] | [p91<=1 & 1<=p91]]]] | [[~ [E [[[p16<=1 & 1<=p16] & [[p126<=1 & 1<=p126] & [p170<=1 & 1<=p170]]] U [p122<=1 & 1<=p122]]] & [p12<=1 & 1<=p12]] & [[p85<=1 & 1<=p85] & [[p167<=1 & 1<=p167] & [EG [[p119<=1 & 1<=p119]] | [[p36<=1 & 1<=p36] & [p185<=1 & 1<=p185]]]]]]]]]
normalized: ~ [EG [~ [EG [[[[[[[[p185<=1 & 1<=p185] & [p36<=1 & 1<=p36]] | EG [[p119<=1 & 1<=p119]]] & [p167<=1 & 1<=p167]] & [p85<=1 & 1<=p85]] & [[p12<=1 & 1<=p12] & ~ [E [[[[p170<=1 & 1<=p170] & [p126<=1 & 1<=p126]] & [p16<=1 & 1<=p16]] U [p122<=1 & 1<=p122]]]]] | ~ [EX [~ [[[[p91<=1 & 1<=p91] | [p58<=1 & 1<=p58]] | E [true U [p82<=1 & 1<=p82]]]]]]]]]]]

abstracting: (1<=p82)
states: 5,146,478 (6)
abstracting: (p82<=1)
states: 203,424,394 (8)
abstracting: (1<=p58)
states: 3,816,777 (6)
abstracting: (p58<=1)
states: 203,424,394 (8)
abstracting: (1<=p91)
states: 4,058,993 (6)
abstracting: (p91<=1)
states: 203,424,394 (8)
.abstracting: (1<=p122)
states: 5,419,488 (6)
abstracting: (p122<=1)
states: 203,424,394 (8)
abstracting: (1<=p16)
states: 5,465,261 (6)
abstracting: (p16<=1)
states: 203,424,394 (8)
abstracting: (1<=p126)
states: 5,419,488 (6)
abstracting: (p126<=1)
states: 203,424,394 (8)
abstracting: (1<=p170)
states: 9,806,356 (6)
abstracting: (p170<=1)
states: 203,424,394 (8)
abstracting: (1<=p12)
states: 5,465,261 (6)
abstracting: (p12<=1)
states: 203,424,394 (8)
abstracting: (1<=p85)
states: 5,395,459 (6)
abstracting: (p85<=1)
states: 203,424,394 (8)
abstracting: (1<=p167)
states: 9,806,356 (6)
abstracting: (p167<=1)
states: 203,424,394 (8)
abstracting: (1<=p119)
states: 5,419,488 (6)
abstracting: (p119<=1)
states: 203,424,394 (8)
..................
EG iterations: 18
abstracting: (1<=p36)
states: 5,465,261 (6)
abstracting: (p36<=1)
states: 203,424,394 (8)
abstracting: (1<=p185)
states: 5,417,220 (6)
abstracting: (p185<=1)
states: 203,424,394 (8)

before gc: list nodes free: 4936263

after gc: idd nodes used:1901216, unused:62098784; list nodes free:284847716
......
before gc: list nodes free: 5215252

after gc: idd nodes used:3393889, unused:60606111; list nodes free:278267857
....
before gc: list nodes free: 6490260

after gc: idd nodes used:3156445, unused:60843555; list nodes free:279576387
MC time: 9m20.213sec

checking: ~ [E [[EF [~ [[[p82<=1 & 1<=p82] & [p190<=1 & 1<=p190]]]] | [[[A [[p147<=1 & 1<=p147] U [p181<=1 & 1<=p181]] & [E [[p67<=1 & 1<=p67] U [p180<=1 & 1<=p180]] & ~ [[[p33<=1 & 1<=p33] & [p195<=1 & 1<=p195]]]]] & [[[p85<=1 & 1<=p85] & [p133<=1 & 1<=p133]] & [[p183<=1 & 1<=p183] & [p22<=1 & 1<=p22]]]] | [p138<=1 & 1<=p138]]] U AX [~ [EF [[p74<=1 & 1<=p74]]]]]]
normalized: ~ [E [[[[p138<=1 & 1<=p138] | [[[[p22<=1 & 1<=p22] & [p183<=1 & 1<=p183]] & [[p133<=1 & 1<=p133] & [p85<=1 & 1<=p85]]] & [[~ [[[p195<=1 & 1<=p195] & [p33<=1 & 1<=p33]]] & E [[p67<=1 & 1<=p67] U [p180<=1 & 1<=p180]]] & [~ [EG [~ [[p181<=1 & 1<=p181]]]] & ~ [E [~ [[p181<=1 & 1<=p181]] U [~ [[p147<=1 & 1<=p147]] & ~ [[p181<=1 & 1<=p181]]]]]]]]] | E [true U ~ [[[p190<=1 & 1<=p190] & [p82<=1 & 1<=p82]]]]] U ~ [EX [E [true U [p74<=1 & 1<=p74]]]]]]

abstracting: (1<=p74)
states: 5,465,589 (6)
abstracting: (p74<=1)
states: 203,424,394 (8)
.abstracting: (1<=p82)
states: 5,146,478 (6)
abstracting: (p82<=1)
states: 203,424,394 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (1<=p181)
states: 5,140,910 (6)
abstracting: (p181<=1)
states: 203,424,394 (8)
abstracting: (1<=p147)
states: 4,787,630 (6)
abstracting: (p147<=1)
states: 203,424,394 (8)
abstracting: (1<=p181)
states: 5,140,910 (6)
abstracting: (p181<=1)
states: 203,424,394 (8)
abstracting: (1<=p181)
states: 5,140,910 (6)
abstracting: (p181<=1)
states: 203,424,394 (8)
.................
EG iterations: 17
abstracting: (1<=p180)
states: 4,773,108 (6)
abstracting: (p180<=1)
states: 203,424,394 (8)
abstracting: (1<=p67)
states: 4,708,869 (6)
abstracting: (p67<=1)
states: 203,424,394 (8)
abstracting: (1<=p33)
states: 5,465,261 (6)
abstracting: (p33<=1)
states: 203,424,394 (8)
abstracting: (1<=p195)
states: 48,875,233 (7)
abstracting: (p195<=1)
states: 203,424,394 (8)
abstracting: (1<=p85)
states: 5,395,459 (6)
abstracting: (p85<=1)
states: 203,424,394 (8)
abstracting: (1<=p133)
states: 6,580,517 (6)
abstracting: (p133<=1)
states: 203,424,394 (8)
abstracting: (1<=p183)
states: 9,806,356 (6)
abstracting: (p183<=1)
states: 203,424,394 (8)
abstracting: (1<=p22)
states: 5,502,504 (6)
abstracting: (p22<=1)
states: 203,424,394 (8)
abstracting: (1<=p138)
states: 6,580,517 (6)
abstracting: (p138<=1)
states: 203,424,394 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m14.425sec

checking: [AX [[EX [E [AG [[[p146<=1 & 1<=p146] & [p196<=1 & 1<=p196]]] U [[[p109<=1 & 1<=p109] & [p196<=1 & 1<=p196]] | [p190<=1 & 1<=p190]]]] | E [EF [[[p31<=1 & 1<=p31] & [p81<=1 & 1<=p81]]] U [[[[p23<=1 & 1<=p23] & [p197<=1 & 1<=p197]] | [[[p43<=1 & 1<=p43] & [[p96<=1 & 1<=p96] & [p175<=1 & 1<=p175]]] | [p88<=1 & 1<=p88]]] & [~ [[p158<=1 & 1<=p158]] | EX [[p39<=1 & 1<=p39]]]]]]] & [EF [[[p14<=1 & 1<=p14] & [[p126<=1 & 1<=p126] & [p170<=1 & 1<=p170]]]] | [AG [[p122<=1 & 1<=p122]] | EX [AX [[EG [[p187<=1 & 1<=p187]] | [[p189<=1 & 1<=p189] | [p122<=1 & 1<=p122]]]]]]]]
normalized: [[[EX [~ [EX [~ [[[[p122<=1 & 1<=p122] | [p189<=1 & 1<=p189]] | EG [[p187<=1 & 1<=p187]]]]]]] | ~ [E [true U ~ [[p122<=1 & 1<=p122]]]]] | E [true U [[[p170<=1 & 1<=p170] & [p126<=1 & 1<=p126]] & [p14<=1 & 1<=p14]]]] & ~ [EX [~ [[E [E [true U [[p81<=1 & 1<=p81] & [p31<=1 & 1<=p31]]] U [[EX [[p39<=1 & 1<=p39]] | ~ [[p158<=1 & 1<=p158]]] & [[[p88<=1 & 1<=p88] | [[[p175<=1 & 1<=p175] & [p96<=1 & 1<=p96]] & [p43<=1 & 1<=p43]]] | [[p197<=1 & 1<=p197] & [p23<=1 & 1<=p23]]]]] | EX [E [~ [E [true U ~ [[[p196<=1 & 1<=p196] & [p146<=1 & 1<=p146]]]]] U [[p190<=1 & 1<=p190] | [[p196<=1 & 1<=p196] & [p109<=1 & 1<=p109]]]]]]]]]]

abstracting: (1<=p109)
states: 4,292,827 (6)
abstracting: (p109<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
abstracting: (1<=p190)
states: 9,806,356 (6)
abstracting: (p190<=1)
states: 203,424,394 (8)
abstracting: (1<=p146)
states: 4,787,630 (6)
abstracting: (p146<=1)
states: 203,424,394 (8)
abstracting: (1<=p196)
states: 48,875,233 (7)
abstracting: (p196<=1)
states: 203,424,394 (8)
.abstracting: (1<=p23)
states: 4,246,275 (6)
abstracting: (p23<=1)
states: 203,424,394 (8)
abstracting: (1<=p197)
states: 8,034,778 (6)
abstracting: (p197<=1)
states: 203,424,394 (8)
abstracting: (1<=p43)
states: 5,465,261 (6)
abstracting: (p43<=1)
states: 203,424,394 (8)
abstracting: (1<=p96)
states: 5,419,488 (6)
abstracting: (p96<=1)
states: 203,424,394 (8)
abstracting: (1<=p175)
states: 9,806,356 (6)
abstracting: (p175<=1)
states: 203,424,394 (8)
abstracting: (1<=p88)
states: 5,419,488 (6)
abstracting: (p88<=1)
states: 203,424,394 (8)
abstracting: (1<=p158)
states: 6,580,517 (6)
abstracting: (p158<=1)
states: 203,424,394 (8)
abstracting: (1<=p39)
states: 5,465,261 (6)
abstracting: (p39<=1)
states: 203,424,394 (8)
.abstracting: (1<=p31)
states: 5,502,504 (6)
abstracting: (p31<=1)
states: 203,424,394 (8)
abstracting: (1<=p81)
states: 5,395,459 (6)
abstracting: (p81<=1)
states: 203,424,394 (8)

before gc: list nodes free: 6497768

after gc: idd nodes used:1241207, unused:62758793; list nodes free:287929684
.abstracting: (1<=p14)
states: 5,465,261 (6)
abstracting: (p14<=1)
states: 203,424,394 (8)
abstracting: (1<=p126)
states: 5,419,488 (6)
abstracting: (p126<=1)
states: 203,424,394 (8)
abstracting: (1<=p170)
states: 9,806,356 (6)
abstracting: (p170<=1)
states: 203,424,394 (8)

before gc: list nodes free: 4493094

after gc: idd nodes used:1735772, unused:62264228; list nodes free:285594712
abstracting: (1<=p122)
states: 5,419,488 (6)
abstracting: (p122<=1)
states: 203,424,394 (8)
abstracting: (1<=p187)
states: 5,231,744 (6)
abstracting: (p187<=1)
states: 203,424,394 (8)
.................
EG iterations: 17
abstracting: (1<=p189)
states: 8,978,770 (6)
abstracting: (p189<=1)
states: 203,424,394 (8)
abstracting: (1<=p122)
states: 5,419,488 (6)
abstracting: (p122<=1)
states: 203,424,394 (8)
..-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m 8.168sec

checking: EF [AG [[p54<=0 & 0<=p54]]]
normalized: E [true U ~ [E [true U ~ [[p54<=0 & 0<=p54]]]]]

abstracting: (0<=p54)
states: 203,424,394 (8)
abstracting: (p54<=0)
states: 199,499,795 (8)

before gc: list nodes free: 5880079

after gc: idd nodes used:1323246, unused:62676754; list nodes free:287576800
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m57.216sec

checking: AF [EG [[AX [[EF [[p82<=1 & 1<=p82]] | [[p58<=1 & 1<=p58] | [p91<=1 & 1<=p91]]]] | [[~ [E [[[p16<=1 & 1<=p16] & [[p126<=1 & 1<=p126] & [p170<=1 & 1<=p170]]] U [p122<=1 & 1<=p122]]] & [p12<=1 & 1<=p12]] & [[p85<=1 & 1<=p85] & [[p167<=1 & 1<=p167] & [EG [[p119<=1 & 1<=p119]] | [[p36<=1 & 1<=p36] & [p185<=1 & 1<=p185]]]]]]]]]
normalized: ~ [EG [~ [EG [[[[[[[[p185<=1 & 1<=p185] & [p36<=1 & 1<=p36]] | EG [[p119<=1 & 1<=p119]]] & [p167<=1 & 1<=p167]] & [p85<=1 & 1<=p85]] & [[p12<=1 & 1<=p12] & ~ [E [[[[p170<=1 & 1<=p170] & [p126<=1 & 1<=p126]] & [p16<=1 & 1<=p16]] U [p122<=1 & 1<=p122]]]]] | ~ [EX [~ [[[[p91<=1 & 1<=p91] | [p58<=1 & 1<=p58]] | E [true U [p82<=1 & 1<=p82]]]]]]]]]]]

abstracting: (1<=p82)
states: 5,146,478 (6)
abstracting: (p82<=1)
states: 203,424,394 (8)

before gc: list nodes free: 7071971

after gc: idd nodes used:1361389, unused:62638611; list nodes free:287434730
abstracting: (1<=p58)
states: 3,816,777 (6)
abstracting: (p58<=1)
states: 203,424,394 (8)
abstracting: (1<=p91)
states: 4,058,993 (6)
abstracting: (p91<=1)
states: 203,424,394 (8)
.abstracting: (1<=p122)
states: 5,419,488 (6)
abstracting: (p122<=1)
states: 203,424,394 (8)
abstracting: (1<=p16)
states: 5,465,261 (6)
abstracting: (p16<=1)
states: 203,424,394 (8)
abstracting: (1<=p126)
states: 5,419,488 (6)
abstracting: (p126<=1)
states: 203,424,394 (8)
abstracting: (1<=p170)
states: 9,806,356 (6)
abstracting: (p170<=1)
states: 203,424,394 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6099428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100924 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

60047
iterations count:190871 (812), effective:10967 (46)

initing FirstDep: 0m 0.000sec


iterations count:59571 (253), effective:4222 (17)
265682
iterations count:113058 (481), effective:6554 (27)

sat_reach.icc:155: Timeout: after 269 sec


iterations count:69035 (293), effective:4466 (19)

iterations count:36852 (156), effective:1708 (7)

iterations count:1321 (5), effective:77 (0)

iterations count:83003 (353), effective:5437 (23)

iterations count:2981 (12), effective:122 (0)

iterations count:9892 (42), effective:486 (2)

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

iterations count:99299 (422), effective:5497 (23)

iterations count:83732 (356), effective:5240 (22)

iterations count:636 (2), effective:11 (0)

iterations count:710 (3), effective:8 (0)

iterations count:636 (2), effective:11 (0)

iterations count:636 (2), effective:11 (0)

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

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

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

iterations count:1276 (5), effective:75 (0)

iterations count:240 (1), effective:1 (0)
292168
iterations count:104512 (444), effective:5949 (25)
260904
iterations count:107798 (458), effective:7143 (30)

iterations count:531 (2), effective:45 (0)

iterations count:24768 (105), effective:1630 (6)

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

iterations count:78673 (334), effective:4988 (21)

iterations count:72240 (307), effective:3552 (15)

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

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

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

iterations count:80062 (340), effective:5848 (24)

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

net_ddint.h:600: Timeout: after 559 sec


iterations count:58696 (249), effective:4263 (18)

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

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

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

iterations count:15380 (65), effective:806 (3)

iterations count:384 (1), effective:7 (0)

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

iterations count:93015 (395), effective:4995 (21)

iterations count:82894 (352), effective:5440 (23)
221065
iterations count:119209 (507), effective:7090 (30)

iterations count:1957 (8), effective:160 (0)
265682
iterations count:113058 (481), effective:6554 (27)

iterations count:11809 (50), effective:565 (2)

iterations count:80062 (340), effective:5848 (24)

iterations count:235 (1), effective:0 (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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FlexibleBarrier-PT-04b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857200450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;