Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910100028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CO4-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 CO4-PT-06-LTLFireability-00
FORMULA_NAME CO4-PT-06-LTLFireability-01
FORMULA_NAME CO4-PT-06-LTLFireability-02
FORMULA_NAME CO4-PT-06-LTLFireability-03
FORMULA_NAME CO4-PT-06-LTLFireability-04
FORMULA_NAME CO4-PT-06-LTLFireability-05
FORMULA_NAME CO4-PT-06-LTLFireability-06
FORMULA_NAME CO4-PT-06-LTLFireability-07
FORMULA_NAME CO4-PT-06-LTLFireability-08
FORMULA_NAME CO4-PT-06-LTLFireability-09
FORMULA_NAME CO4-PT-06-LTLFireability-10
FORMULA_NAME CO4-PT-06-LTLFireability-11
FORMULA_NAME CO4-PT-06-LTLFireability-12
FORMULA_NAME CO4-PT-06-LTLFireability-13
FORMULA_NAME CO4-PT-06-LTLFireability-14
FORMULA_NAME CO4-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368609960

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:50:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:50:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:11] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-02 22:50:11] [INFO ] Transformed 383 places.
[2024-06-02 22:50:11] [INFO ] Transformed 454 transitions.
[2024-06-02 22:50:11] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:11] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 273 transition count 333
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 68 place count 216 transition count 275
Iterating global reduction 1 with 57 rules applied. Total rules applied 125 place count 216 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 216 transition count 271
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 151 place count 194 transition count 249
Iterating global reduction 2 with 22 rules applied. Total rules applied 173 place count 194 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 192 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 192 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 191 transition count 245
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 191 transition count 245
Applied a total of 179 rules in 55 ms. Remains 191 /283 variables (removed 92) and now considering 245/334 (removed 89) transitions.
// Phase 1: matrix 245 rows 191 cols
[2024-06-02 22:50:12] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 186 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/283 places, 245/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 190/283 places, 245/334 transitions.
Support contains 24 out of 190 places after structural reductions.
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:50:12] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:50:12] [INFO ] Input system was already deterministic with 245 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 245 rows 190 cols
[2024-06-02 22:50:13] [INFO ] Computed 3 invariants in 10 ms
[2024-06-02 22:50:13] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 22:50:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:14] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-06-02 22:50:14] [INFO ] After 592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-06-02 22:50:14] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 16 properties in 38 ms.
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 245/245 transitions.
Graph (trivial) has 200 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 314 edges and 189 vertex of which 175 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 175 transition count 150
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 153 place count 105 transition count 150
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 153 place count 105 transition count 131
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 191 place count 86 transition count 131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 80 transition count 124
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 80 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 205 place count 80 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 80 transition count 121
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 207 place count 79 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 78 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 78 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 210 place count 77 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 77 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 212 place count 77 transition count 118
Performed 26 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 264 place count 51 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 270 place count 51 transition count 81
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 272 place count 50 transition count 80
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 274 place count 48 transition count 78
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 48 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 278 place count 47 transition count 77
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 302 place count 35 transition count 78
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 310 place count 35 transition count 70
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 321 place count 24 transition count 48
Iterating global reduction 7 with 11 rules applied. Total rules applied 332 place count 24 transition count 48
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 340 place count 24 transition count 40
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 343 place count 21 transition count 31
Iterating global reduction 8 with 3 rules applied. Total rules applied 346 place count 21 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 348 place count 21 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 350 place count 20 transition count 36
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 353 place count 20 transition count 33
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 357 place count 20 transition count 29
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 361 place count 20 transition count 25
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 366 place count 16 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 367 place count 16 transition count 24
Graph (complete) has 41 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 368 place count 15 transition count 24
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 369 place count 15 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 370 place count 15 transition count 23
Graph (complete) has 38 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 371 place count 14 transition count 23
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 372 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 373 place count 13 transition count 21
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t57.t221 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 375 place count 10 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 376 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 377 place count 9 transition count 16
Iterating global reduction 16 with 1 rules applied. Total rules applied 378 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 379 place count 9 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 381 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 383 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 385 place count 7 transition count 11
Applied a total of 385 rules in 46 ms. Remains 7 /190 variables (removed 183) and now considering 11/245 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 7/190 places, 11/245 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 12 stabilizing places and 14 stable transitions
Graph (complete) has 316 edges and 190 vertex of which 187 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Graph (trivial) has 201 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 315 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 185 transition count 171
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 116 transition count 171
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 140 place count 116 transition count 151
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 180 place count 96 transition count 151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 89 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 89 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 197 place count 89 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 197 place count 89 transition count 137
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 199 place count 88 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 87 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 87 transition count 136
Performed 27 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
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 255 place count 60 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 260 place count 60 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 262 place count 59 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 264 place count 57 transition count 94
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 57 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 270 place count 55 transition count 92
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 296 place count 42 transition count 93
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 304 place count 42 transition count 85
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 314 place count 32 transition count 65
Iterating global reduction 6 with 10 rules applied. Total rules applied 324 place count 32 transition count 65
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 331 place count 32 transition count 58
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 334 place count 29 transition count 49
Iterating global reduction 7 with 3 rules applied. Total rules applied 337 place count 29 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 339 place count 29 transition count 47
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 343 place count 29 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 345 place count 27 transition count 41
Applied a total of 345 rules in 29 ms. Remains 27 /190 variables (removed 163) and now considering 41/245 (removed 204) transitions.
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
// Phase 1: matrix 38 rows 27 cols
[2024-06-02 22:50:15] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-06-02 22:50:15] [INFO ] Invariant cache hit.
[2024-06-02 22:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-02 22:50:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-06-02 22:50:15] [INFO ] Invariant cache hit.
[2024-06-02 22:50:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/190 places, 41/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 27/190 places, 41/245 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10 reset in 140 ms.
Product exploration explored 100000 steps with 16 reset in 74 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 301 steps, including 42 resets, run visited all 1 properties in 6 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-02 22:50:16] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-06-02 22:50:16] [INFO ] Invariant cache hit.
[2024-06-02 22:50:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:50:16] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-06-02 22:50:16] [INFO ] Invariant cache hit.
[2024-06-02 22:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 22:50:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:16] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2024-06-02 22:50:16] [INFO ] Invariant cache hit.
[2024-06-02 22:50:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 27/27 places, 41/41 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 170 steps, including 25 resets, run visited all 1 properties in 1 ms. (steps per millisecond=170 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 68 ms.
Product exploration explored 100000 steps with 4 reset in 76 ms.
Built C files in :
/tmp/ltsmin4164313074261226528
[2024-06-02 22:50:17] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-06-02 22:50:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:17] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-06-02 22:50:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:17] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-06-02 22:50:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4164313074261226528
Running compilation step : cd /tmp/ltsmin4164313074261226528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin4164313074261226528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4164313074261226528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10835070112020592599.hoa' '--buchi-type=spotba'
LTSmin run took 85 ms.
FORMULA CO4-PT-06-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLFireability-00 finished in 2337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(((p1 U (p2||X(p1))) U p3))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 180 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 180 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 180 transition count 232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 175 transition count 227
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 175 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 174 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 174 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 174 transition count 225
Applied a total of 34 rules in 16 ms. Remains 174 /190 variables (removed 16) and now considering 225/245 (removed 20) transitions.
// Phase 1: matrix 225 rows 174 cols
[2024-06-02 22:50:17] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:50:17] [INFO ] Invariant cache hit.
[2024-06-02 22:50:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-02 22:50:17] [INFO ] Invariant cache hit.
[2024-06-02 22:50:17] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/190 places, 225/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 174/190 places, 225/245 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p3), (NOT p1), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p3), (AND (NOT p1) p3 (NOT p2)), (AND (NOT p0) p3 (NOT p2) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 4}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s74 1), p3:(EQ s139 1), p2:(AND (EQ s82 1) (EQ s164 1)), p1:(EQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 2 ms.
FORMULA CO4-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-02 finished in 725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 178 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 172 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 169 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 169 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 169 transition count 218
Applied a total of 45 rules in 13 ms. Remains 169 /190 variables (removed 21) and now considering 218/245 (removed 27) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 22:50:18] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 169/190 places, 218/245 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-04 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Graph (trivial) has 197 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 315 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 185 transition count 174
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 119 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 118 transition count 173
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 136 place count 118 transition count 152
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 178 place count 97 transition count 152
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 187 place count 88 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 196 place count 88 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 199 place count 88 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 199 place count 88 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 87 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 202 place count 86 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 86 transition count 135
Performed 26 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 255 place count 60 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 260 place count 60 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 262 place count 59 transition count 96
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 264 place count 57 transition count 94
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 57 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 270 place count 55 transition count 92
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 298 place count 41 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 307 place count 41 transition count 84
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 318 place count 30 transition count 62
Iterating global reduction 7 with 11 rules applied. Total rules applied 329 place count 30 transition count 62
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 337 place count 30 transition count 54
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 340 place count 27 transition count 45
Iterating global reduction 8 with 3 rules applied. Total rules applied 343 place count 27 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 345 place count 27 transition count 43
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 349 place count 27 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 351 place count 25 transition count 37
Applied a total of 351 rules in 44 ms. Remains 25 /190 variables (removed 165) and now considering 37/245 (removed 208) transitions.
[2024-06-02 22:50:18] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
// Phase 1: matrix 34 rows 25 cols
[2024-06-02 22:50:18] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 22:50:18] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-02 22:50:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:18] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/190 places, 37/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 25/190 places, 37/245 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s11 1)), p1:(AND (EQ s9 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-07 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F((p1&&G(p2)))))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 179 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 179 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 179 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 173 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 173 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 170 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 170 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 170 transition count 219
Applied a total of 43 rules in 12 ms. Remains 170 /190 variables (removed 20) and now considering 219/245 (removed 26) transitions.
// Phase 1: matrix 219 rows 170 cols
[2024-06-02 22:50:18] [INFO ] Computed 3 invariants in 14 ms
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/190 places, 219/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 170/190 places, 219/245 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s38 1), p1:(EQ s24 1), p2:(OR (EQ s160 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 5 ms.
FORMULA CO4-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-09 finished in 526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||(p1&&F(p0))))||F(p1)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 231
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 171 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 171 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 168 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 168 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 168 transition count 219
Applied a total of 46 rules in 14 ms. Remains 168 /190 variables (removed 22) and now considering 219/245 (removed 26) transitions.
// Phase 1: matrix 219 rows 168 cols
[2024-06-02 22:50:19] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/190 places, 219/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 168/190 places, 219/245 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s162 1), p0:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-10 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(p0))) U X((p1&&X(F(p2))))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 178 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 172 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 170 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 170 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 170 transition count 221
Applied a total of 42 rules in 12 ms. Remains 170 /190 variables (removed 20) and now considering 221/245 (removed 24) transitions.
// Phase 1: matrix 221 rows 170 cols
[2024-06-02 22:50:19] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/190 places, 221/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 170/190 places, 221/245 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s93 1), p1:(NEQ s138 1), p2:(NEQ s31 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), true, (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-06-LTLFireability-11 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Graph (trivial) has 199 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 315 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 185 transition count 174
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 119 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 134 place count 119 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 174 place count 99 transition count 154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 181 place count 92 transition count 144
Iterating global reduction 2 with 7 rules applied. Total rules applied 188 place count 92 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 191 place count 92 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 191 place count 92 transition count 140
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 193 place count 91 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 90 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 90 transition count 139
Performed 27 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
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 249 place count 63 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 253 place count 63 transition count 101
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 62 transition count 100
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 257 place count 60 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 60 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 59 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 289 place count 45 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 297 place count 45 transition count 90
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 307 place count 35 transition count 70
Iterating global reduction 6 with 10 rules applied. Total rules applied 317 place count 35 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 324 place count 35 transition count 63
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 327 place count 32 transition count 54
Iterating global reduction 7 with 3 rules applied. Total rules applied 330 place count 32 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 332 place count 32 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 334 place count 31 transition count 62
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 341 place count 31 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 343 place count 29 transition count 53
Applied a total of 343 rules in 26 ms. Remains 29 /190 variables (removed 161) and now considering 53/245 (removed 192) transitions.
[2024-06-02 22:50:20] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 29 cols
[2024-06-02 22:50:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:50:20] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2024-06-02 22:50:20] [INFO ] Invariant cache hit.
[2024-06-02 22:50:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:50:20] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 22:50:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:20] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2024-06-02 22:50:20] [INFO ] Invariant cache hit.
[2024-06-02 22:50:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/190 places, 53/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 29/190 places, 53/245 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s3 1), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-12 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&X(F(p1)))))||(X(p2)&&G(p3))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 178 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 172 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 169 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 169 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 169 transition count 218
Applied a total of 45 rules in 10 ms. Remains 169 /190 variables (removed 21) and now considering 218/245 (removed 27) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 22:50:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:50:20] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 169/190 places, 218/245 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p3 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p3 p0 p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p3) p0) (AND p0 (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p3 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s130 0), p0:(EQ s85 1), p2:(EQ s134 1), p1:(EQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-13 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(F((!p0&&X(p1))))&&F(p2))||G(F((!p0&&X(p1))))))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 178 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 172 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 172 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 169 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 169 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 169 transition count 218
Applied a total of 45 rules in 6 ms. Remains 169 /190 variables (removed 21) and now considering 218/245 (removed 27) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 22:50:21] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 169/190 places, 218/245 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : CO4-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s54 1), p0:(EQ s96 1), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-14 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p2)&&p1))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 245/245 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 178 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 178 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 178 transition count 229
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 171 transition count 222
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 171 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 168 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 168 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 168 transition count 217
Applied a total of 47 rules in 10 ms. Remains 168 /190 variables (removed 22) and now considering 217/245 (removed 28) transitions.
// Phase 1: matrix 217 rows 168 cols
[2024-06-02 22:50:22] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:50:22] [INFO ] Invariant cache hit.
[2024-06-02 22:50:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-02 22:50:22] [INFO ] Invariant cache hit.
[2024-06-02 22:50:22] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/190 places, 217/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 168/190 places, 217/245 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(EQ s16 0), p0:(AND (EQ s36 1) (EQ s158 1)), p1:(AND (EQ s36 1) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLFireability-15 finished in 495 ms.
All properties solved by simple procedures.
Total runtime 11010 ms.

BK_STOP 1717368623769

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CO4-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CO4-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;