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.r106-tall-167814482700450.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 DES-PT-30b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 103K 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 DES-PT-30b-CTLFireability-00
FORMULA_NAME DES-PT-30b-CTLFireability-01
FORMULA_NAME DES-PT-30b-CTLFireability-02
FORMULA_NAME DES-PT-30b-CTLFireability-03
FORMULA_NAME DES-PT-30b-CTLFireability-04
FORMULA_NAME DES-PT-30b-CTLFireability-05
FORMULA_NAME DES-PT-30b-CTLFireability-06
FORMULA_NAME DES-PT-30b-CTLFireability-07
FORMULA_NAME DES-PT-30b-CTLFireability-08
FORMULA_NAME DES-PT-30b-CTLFireability-09
FORMULA_NAME DES-PT-30b-CTLFireability-10
FORMULA_NAME DES-PT-30b-CTLFireability-11
FORMULA_NAME DES-PT-30b-CTLFireability-12
FORMULA_NAME DES-PT-30b-CTLFireability-13
FORMULA_NAME DES-PT-30b-CTLFireability-14
FORMULA_NAME DES-PT-30b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678395585927

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=DES-PT-30b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:59:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 20:59:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:59:47] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-09 20:59:47] [INFO ] Transformed 399 places.
[2023-03-09 20:59:47] [INFO ] Transformed 350 transitions.
[2023-03-09 20:59:47] [INFO ] Found NUPN structural information;
[2023-03-09 20:59:47] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 97 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 377 transition count 331
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 377 transition count 331
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 369 transition count 323
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 369 transition count 323
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 369 transition count 317
Applied a total of 63 rules in 78 ms. Remains 369 /399 variables (removed 30) and now considering 317/350 (removed 33) transitions.
// Phase 1: matrix 317 rows 369 cols
[2023-03-09 20:59:47] [INFO ] Computed 62 place invariants in 35 ms
[2023-03-09 20:59:48] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-09 20:59:48] [INFO ] Invariant cache hit.
[2023-03-09 20:59:48] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-09 20:59:48] [INFO ] Invariant cache hit.
[2023-03-09 20:59:48] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 369/399 places, 317/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1224 ms. Remains : 369/399 places, 317/350 transitions.
Support contains 97 out of 369 places after structural reductions.
[2023-03-09 20:59:48] [INFO ] Flatten gal took : 49 ms
[2023-03-09 20:59:49] [INFO ] Flatten gal took : 27 ms
[2023-03-09 20:59:49] [INFO ] Input system was already deterministic with 317 transitions.
Support contains 96 out of 369 places (down from 97) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 71) seen :48
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-09 20:59:49] [INFO ] Invariant cache hit.
[2023-03-09 20:59:50] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-09 20:59:50] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-09 20:59:50] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 20:59:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-09 20:59:50] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-09 20:59:51] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-09 20:59:51] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 4 ms to minimize.
[2023-03-09 20:59:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-09 20:59:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-09 20:59:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 628 ms
[2023-03-09 20:59:53] [INFO ] Deduced a trap composed of 20 places in 461 ms of which 1 ms to minimize.
[2023-03-09 20:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-09 20:59:53] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-09 20:59:53] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 826 ms
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-09 20:59:54] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 20:59:55] [INFO ] After 4348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 727 ms.
[2023-03-09 20:59:55] [INFO ] After 5583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 2248 ms.
Support contains 32 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 317/317 transitions.
Graph (complete) has 802 edges and 369 vertex of which 364 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 364 transition count 304
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 353 transition count 304
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 23 place count 353 transition count 292
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 47 place count 341 transition count 292
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 333 transition count 284
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 333 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 66 place count 333 transition count 281
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 332 transition count 280
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 73 place count 327 transition count 275
Iterating global reduction 4 with 5 rules applied. Total rules applied 78 place count 327 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 83 place count 327 transition count 270
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 83 place count 327 transition count 268
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 87 place count 325 transition count 268
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 223 place count 257 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 255 transition count 202
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 255 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 254 transition count 201
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 254 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 233 place count 252 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 251 transition count 198
Applied a total of 234 rules in 126 ms. Remains 251 /369 variables (removed 118) and now considering 198/317 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 251/369 places, 198/317 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 468191 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468191 steps, saw 82734 distinct states, run finished after 3003 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 198 rows 251 cols
[2023-03-09 21:00:01] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-09 21:00:01] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 21:00:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-09 21:00:01] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 21:00:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 21:00:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-09 21:00:02] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-09 21:00:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 21:00:03] [INFO ] After 357ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-09 21:00:03] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-09 21:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 21:00:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-09 21:00:03] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-09 21:00:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-09 21:00:03] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-09 21:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 21:00:03] [INFO ] After 1229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 399 ms.
[2023-03-09 21:00:04] [INFO ] After 2404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 1 properties in 771 ms.
Support contains 31 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 198/198 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 251/251 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 198/198 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-09 21:00:05] [INFO ] Invariant cache hit.
[2023-03-09 21:00:05] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-09 21:00:05] [INFO ] Invariant cache hit.
[2023-03-09 21:00:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 21:00:05] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-09 21:00:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 21:00:05] [INFO ] Invariant cache hit.
[2023-03-09 21:00:05] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 251/251 places, 198/198 transitions.
Graph (complete) has 795 edges and 251 vertex of which 250 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 250 /251 variables (removed 1) and now considering 198/198 (removed 0) transitions.
Running SMT prover for 22 properties.
// Phase 1: matrix 198 rows 250 cols
[2023-03-09 21:00:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-09 21:00:06] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-09 21:00:06] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 21:00:06] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-09 21:00:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 21:00:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 21:00:06] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-09 21:00:07] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-09 21:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-09 21:00:07] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-09 21:00:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-09 21:00:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-09 21:00:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-09 21:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 21:00:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-09 21:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 21:00:07] [INFO ] After 1308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-09 21:00:08] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 18 ms
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 19 ms
[2023-03-09 21:00:08] [INFO ] Input system was already deterministic with 317 transitions.
Computed a total of 178 stabilizing places and 170 stable transitions
Graph (complete) has 802 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 353 transition count 293
Applied a total of 40 rules in 22 ms. Remains 353 /369 variables (removed 16) and now considering 293/317 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 353/369 places, 293/317 transitions.
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 18 ms
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 26 ms
[2023-03-09 21:00:08] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Graph (complete) has 802 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 361 transition count 299
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 348 transition count 299
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 348 transition count 287
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 336 transition count 287
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 328 transition count 279
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 328 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 70 place count 328 transition count 276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 327 transition count 275
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 77 place count 322 transition count 270
Iterating global reduction 4 with 5 rules applied. Total rules applied 82 place count 322 transition count 270
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 87 place count 322 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 87 place count 322 transition count 263
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 91 place count 320 transition count 263
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 229 place count 251 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 249 transition count 192
Applied a total of 231 rules in 143 ms. Remains 249 /369 variables (removed 120) and now considering 192/317 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 144 ms. Remains : 249/369 places, 192/317 transitions.
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 12 ms
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 11 ms
[2023-03-09 21:00:08] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Graph (complete) has 802 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 361 transition count 300
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 349 transition count 300
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 349 transition count 288
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 337 transition count 288
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 330 transition count 281
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 330 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 66 place count 330 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 329 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 71 place count 325 transition count 274
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 325 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 79 place count 325 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 325 transition count 269
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 81 place count 324 transition count 269
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 219 place count 255 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 253 transition count 198
Applied a total of 221 rules in 132 ms. Remains 253 /369 variables (removed 116) and now considering 198/317 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 133 ms. Remains : 253/369 places, 198/317 transitions.
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 13 ms
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 23 ms
[2023-03-09 21:00:08] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 354 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 354 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 37 place count 354 transition count 295
Applied a total of 37 rules in 43 ms. Remains 354 /369 variables (removed 15) and now considering 295/317 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 354/369 places, 295/317 transitions.
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 12 ms
[2023-03-09 21:00:08] [INFO ] Flatten gal took : 15 ms
[2023-03-09 21:00:08] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 354 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 354 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 37 place count 354 transition count 295
Applied a total of 37 rules in 44 ms. Remains 354 /369 variables (removed 15) and now considering 295/317 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 354/369 places, 295/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 20 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 13 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 355 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 355 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 35 place count 355 transition count 296
Applied a total of 35 rules in 27 ms. Remains 355 /369 variables (removed 14) and now considering 296/317 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 355/369 places, 296/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 20 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 11 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 355 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 355 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 35 place count 355 transition count 296
Applied a total of 35 rules in 50 ms. Remains 355 /369 variables (removed 14) and now considering 296/317 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 355/369 places, 296/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 10 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 18 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 363 transition count 311
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 363 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 363 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 360 transition count 307
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 360 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 360 transition count 304
Applied a total of 22 rules in 25 ms. Remains 360 /369 variables (removed 9) and now considering 304/317 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 360/369 places, 304/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 10 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 10 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 354 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 354 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 354 transition count 294
Applied a total of 38 rules in 23 ms. Remains 354 /369 variables (removed 15) and now considering 294/317 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 354/369 places, 294/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Graph (complete) has 802 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 361 transition count 300
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 349 transition count 300
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 349 transition count 288
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 337 transition count 288
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 329 transition count 280
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 329 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 68 place count 329 transition count 277
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 328 transition count 276
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 75 place count 323 transition count 271
Iterating global reduction 4 with 5 rules applied. Total rules applied 80 place count 323 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 85 place count 323 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 85 place count 323 transition count 264
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 321 transition count 264
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 227 place count 252 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 250 transition count 193
Applied a total of 229 rules in 50 ms. Remains 250 /369 variables (removed 119) and now considering 193/317 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 250/369 places, 193/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 361 transition count 309
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 361 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 361 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 356 transition count 303
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 356 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 356 transition count 298
Applied a total of 32 rules in 25 ms. Remains 356 /369 variables (removed 13) and now considering 298/317 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 356/369 places, 298/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 353 transition count 293
Applied a total of 40 rules in 18 ms. Remains 353 /369 variables (removed 16) and now considering 293/317 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 353/369 places, 293/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Graph (complete) has 802 edges and 369 vertex of which 362 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 361 transition count 300
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 349 transition count 300
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 349 transition count 288
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 337 transition count 288
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 330 transition count 281
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 330 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 66 place count 330 transition count 278
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 329 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 72 place count 325 transition count 273
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 325 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 80 place count 325 transition count 269
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 80 place count 325 transition count 267
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 84 place count 323 transition count 267
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 218 place count 256 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 254 transition count 198
Applied a total of 220 rules in 80 ms. Remains 254 /369 variables (removed 115) and now considering 198/317 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 254/369 places, 198/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 7 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 7 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 362 transition count 310
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 362 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 362 transition count 309
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 358 transition count 305
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 358 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 358 transition count 301
Applied a total of 27 rules in 12 ms. Remains 358 /369 variables (removed 11) and now considering 301/317 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 358/369 places, 301/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 301 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 359 transition count 307
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 359 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 359 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 353 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 353 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 353 transition count 293
Applied a total of 40 rules in 33 ms. Remains 353 /369 variables (removed 16) and now considering 293/317 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 353/369 places, 293/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 10 ms
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 21:00:09] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 317/317 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 360 transition count 308
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 360 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 360 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 354 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 354 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 354 transition count 294
Applied a total of 38 rules in 11 ms. Remains 354 /369 variables (removed 15) and now considering 294/317 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 354/369 places, 294/317 transitions.
[2023-03-09 21:00:09] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:10] [INFO ] Flatten gal took : 8 ms
[2023-03-09 21:00:10] [INFO ] Input system was already deterministic with 294 transitions.
[2023-03-09 21:00:10] [INFO ] Flatten gal took : 12 ms
[2023-03-09 21:00:10] [INFO ] Flatten gal took : 18 ms
[2023-03-09 21:00:10] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-09 21:00:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 317 transitions and 1059 arcs took 1 ms.
Total runtime 22724 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: 369 NrTr: 317 NrArc: 1059)

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

net check time: 0m 0.000sec

init dd package: 0m 2.703sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8038900 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102868 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

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="DES-PT-30b"
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 DES-PT-30b, 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 r106-tall-167814482700450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 ;