Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r013-smll-171620124300023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ASLink-PT-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-smll-171620124300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716210411462

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-20 13:06:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-20 13:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:06:53] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-20 13:06:53] [INFO ] Transformed 1242 places.
[2024-05-20 13:06:53] [INFO ] Transformed 1621 transitions.
[2024-05-20 13:06:53] [INFO ] Found NUPN structural information;
[2024-05-20 13:06:53] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 453 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 20 ms.
[2024-05-20 13:06:55] [INFO ] Flatten gal took : 423 ms
RANDOM walk for 40000 steps (157 resets) in 4310 ms. (9 steps per ms) remains 106/1096 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
[2024-05-20 13:06:55] [INFO ] Flatten gal took : 241 ms
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
[2024-05-20 13:06:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9100383782755985877.gal : 110 ms
[2024-05-20 13:06:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16288418303807667583.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9100383782755985877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16288418303807667583.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 1621 rows 1242 cols

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-20 13:06:55] [INFO ] Computed 121 invariants in 125 ms
Loading property file /tmp/ReachabilityCardinality16288418303807667583.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 72/178 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,106 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,106 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,106 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,106 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,106 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,106 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,106 properties remain. new max is 512
SDD size :964 after 14485
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 227/405 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 227/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,106 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 822/1227 variables, 87/521 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 822/1343 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SDD proceeding with computation,106 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1227/2863 variables, and 1343 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5061 ms.
Refiners :[Domain max(s): 1227/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 89/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 72/178 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 227/405 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 227/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 822/1227 variables, 87/521 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1227 variables, 822/1343 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-20 13:07:05] [INFO ] Deduced a trap composed of 64 places in 423 ms of which 60 ms to minimize.
[2024-05-20 13:07:05] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 4 ms to minimize.
[2024-05-20 13:07:05] [INFO ] Deduced a trap composed of 108 places in 387 ms of which 6 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/2863 variables, and 1346 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5025 ms.
Refiners :[Domain max(s): 1227/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 89/94 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 0/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 10403ms problems are : Problem set: 0 solved, 106 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 254 rules applied. Total rules applied 254 place count 1242 transition count 1367
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 268 rules applied. Total rules applied 522 place count 988 transition count 1353
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 526 place count 984 transition count 1353
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 526 place count 984 transition count 1093
Deduced a syphon composed of 260 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 3 with 541 rules applied. Total rules applied 1067 place count 703 transition count 1093
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 16 rules applied. Total rules applied 1083 place count 702 transition count 1078
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1098 place count 687 transition count 1078
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1098 place count 687 transition count 1071
Deduced a syphon composed of 7 places in 6 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1119 place count 673 transition count 1071
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1119 place count 673 transition count 1064
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1133 place count 666 transition count 1064
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1168 place count 631 transition count 1029
Iterating global reduction 5 with 35 rules applied. Total rules applied 1203 place count 631 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1204 place count 631 transition count 1028
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1204 place count 631 transition count 1016
Deduced a syphon composed of 12 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 25 rules applied. Total rules applied 1229 place count 618 transition count 1016
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1229 place count 618 transition count 1015
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1232 place count 616 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1235 place count 613 transition count 994
Iterating global reduction 6 with 3 rules applied. Total rules applied 1238 place count 613 transition count 994
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1238 place count 613 transition count 992
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1242 place count 611 transition count 992
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1243 place count 610 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 1244 place count 610 transition count 984
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1245 place count 609 transition count 976
Iterating global reduction 6 with 1 rules applied. Total rules applied 1246 place count 609 transition count 976
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1247 place count 608 transition count 968
Iterating global reduction 6 with 1 rules applied. Total rules applied 1248 place count 608 transition count 968
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1249 place count 607 transition count 960
Iterating global reduction 6 with 1 rules applied. Total rules applied 1250 place count 607 transition count 960
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1251 place count 606 transition count 952
Iterating global reduction 6 with 1 rules applied. Total rules applied 1252 place count 606 transition count 952
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1253 place count 605 transition count 944
Iterating global reduction 6 with 1 rules applied. Total rules applied 1254 place count 605 transition count 944
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1255 place count 604 transition count 936
Iterating global reduction 6 with 1 rules applied. Total rules applied 1256 place count 604 transition count 936
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1257 place count 603 transition count 928
Iterating global reduction 6 with 1 rules applied. Total rules applied 1258 place count 603 transition count 928
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1259 place count 602 transition count 920
Iterating global reduction 6 with 1 rules applied. Total rules applied 1260 place count 602 transition count 920
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1261 place count 601 transition count 912
Iterating global reduction 6 with 1 rules applied. Total rules applied 1262 place count 601 transition count 912
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1263 place count 600 transition count 904
Iterating global reduction 6 with 1 rules applied. Total rules applied 1264 place count 600 transition count 904
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1265 place count 599 transition count 896
Iterating global reduction 6 with 1 rules applied. Total rules applied 1266 place count 599 transition count 896
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1267 place count 598 transition count 888
Iterating global reduction 6 with 1 rules applied. Total rules applied 1268 place count 598 transition count 888
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1269 place count 597 transition count 880
Iterating global reduction 6 with 1 rules applied. Total rules applied 1270 place count 597 transition count 880
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1271 place count 596 transition count 872
Iterating global reduction 6 with 1 rules applied. Total rules applied 1272 place count 596 transition count 872
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1273 place count 595 transition count 864
Iterating global reduction 6 with 1 rules applied. Total rules applied 1274 place count 595 transition count 864
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 1394 place count 535 transition count 804
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1395 place count 534 transition count 803
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 1397 place count 533 transition count 803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1398 place count 532 transition count 802
Iterating global reduction 6 with 1 rules applied. Total rules applied 1399 place count 532 transition count 802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1401 place count 532 transition count 800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1402 place count 531 transition count 800
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1404 place count 530 transition count 809
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1407 place count 530 transition count 806
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1410 place count 527 transition count 806
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1411 place count 526 transition count 805
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 1415 place count 523 transition count 804
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1416 place count 522 transition count 804
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 1416 place count 522 transition count 800
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1424 place count 518 transition count 800
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1426 place count 516 transition count 800
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1434 place count 512 transition count 796
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1436 place count 510 transition count 794
Iterating global reduction 12 with 2 rules applied. Total rules applied 1438 place count 510 transition count 794
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1440 place count 510 transition count 792
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1442 place count 508 transition count 792
Applied a total of 1442 rules in 1273 ms. Remains 508 /1242 variables (removed 734) and now considering 792/1621 (removed 829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1296 ms. Remains : 508/1242 places, 792/1621 transitions.
SDD proceeding with computation,106 properties remain. new max is 8192
SDD size :6.03131e+09 after 7.20811e+13
SDD proceeding with computation,106 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
SDD proceeding with computation,106 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
RANDOM walk for 4000000 steps (64890 resets) in 49188 ms. (81 steps per ms) remains 66/106 properties
BEST_FIRST walk for 400004 steps (2204 resets) in 2632 ms. (151 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2178 resets) in 1927 ms. (207 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2292 resets) in 1743 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2185 resets) in 2283 ms. (175 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2175 resets) in 1777 ms. (224 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2181 resets) in 2227 ms. (179 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1756 ms. (227 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2206 resets) in 1740 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2175 resets) in 2284 ms. (175 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1918 ms. (208 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2243 resets) in 1897 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2253 resets) in 1834 ms. (217 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2213 resets) in 1911 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2221 resets) in 2265 ms. (176 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2210 resets) in 1847 ms. (216 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2234 resets) in 1719 ms. (232 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2192 resets) in 1923 ms. (207 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2254 resets) in 1900 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2280 resets) in 1881 ms. (212 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2241 resets) in 1889 ms. (211 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2212 resets) in 1846 ms. (216 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2250 resets) in 1866 ms. (214 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2199 resets) in 1938 ms. (206 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2200 resets) in 2239 ms. (178 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2210 resets) in 2190 ms. (182 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2247 resets) in 1975 ms. (202 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2187 resets) in 1776 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 1844 ms. (216 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2189 resets) in 1814 ms. (220 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 1902 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2226 resets) in 1810 ms. (220 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1815 ms. (220 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2254 resets) in 1692 ms. (236 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 65536
SDD size :7.27837e+13 after 8.14381e+13
BEST_FIRST walk for 400002 steps (2218 resets) in 1846 ms. (216 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1822 ms. (219 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2198 resets) in 1932 ms. (206 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2221 resets) in 1862 ms. (214 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2196 resets) in 1926 ms. (207 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2174 resets) in 1893 ms. (211 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1900 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2176 resets) in 1660 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2194 resets) in 1910 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2212 resets) in 1830 ms. (218 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 2142 ms. (186 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2268 resets) in 1820 ms. (219 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2212 resets) in 2199 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2200 resets) in 1939 ms. (206 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2192 resets) in 1774 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2180 resets) in 1742 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2216 resets) in 1844 ms. (216 steps per ms) remains 66/66 properties
// Phase 1: matrix 792 rows 508 cols
[2024-05-20 13:07:52] [INFO ] Computed 84 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 23/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 113/204 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 26/230 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 2/232 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 103/335 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 83/418 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 9/427 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 79/506 variables, 26/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/506 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 1/507 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/507 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 1/508 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/508 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (OVERLAPS) 792/1300 variables, 508/592 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1300 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 0/1300 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 592 constraints, problems are : Problem set: 0 solved, 66 unsolved in 12329 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 23/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 113/204 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-20 13:08:06] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-20 13:08:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 26/230 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 2/232 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 103/335 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 83/418 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 9/427 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 79/506 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/506 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 1/507 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (OVERLAPS) 1/508 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/508 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 792/1300 variables, 508/594 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1300 variables, 66/660 constraints. Problems are: Problem set: 0 solved, 66 unsolved
SDD proceeding with computation,106 properties remain. new max is 131072
SDD size :8.14381e+13 after 9.19489e+13
At refinement iteration 28 (INCLUDED_ONLY) 0/1300 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 29 (OVERLAPS) 0/1300 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 660 constraints, problems are : Problem set: 0 solved, 66 unsolved in 19710 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 508/508 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 32122ms problems are : Problem set: 0 solved, 66 unsolved
Fused 66 Parikh solutions to 60 different solutions.
Parikh walk visited 0 properties in 20118 ms.
Support contains 66 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 792/792 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 508 transition count 778
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 494 transition count 778
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 28 place count 494 transition count 771
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 487 transition count 771
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 484 transition count 768
Applied a total of 48 rules in 50 ms. Remains 484 /508 variables (removed 24) and now considering 768/792 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 484/508 places, 768/792 transitions.
RANDOM walk for 4000000 steps (64634 resets) in 44973 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2216 resets) in 2136 ms. (187 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2246 resets) in 1885 ms. (212 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2223 resets) in 2040 ms. (195 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2191 resets) in 2295 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2179 resets) in 2028 ms. (197 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2237 resets) in 1757 ms. (227 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2207 resets) in 2288 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2259 resets) in 3301 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2201 resets) in 2579 ms. (155 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2211 resets) in 1898 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2211 resets) in 1750 ms. (228 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 2091 ms. (191 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2226 resets) in 2001 ms. (199 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2259 resets) in 1922 ms. (208 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 1669 ms. (239 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2269 resets) in 2008 ms. (199 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2229 resets) in 2001 ms. (199 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2218 resets) in 2135 ms. (187 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2236 resets) in 1901 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2195 resets) in 2350 ms. (170 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2207 resets) in 1724 ms. (231 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2276 resets) in 2009 ms. (199 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 262144
BEST_FIRST walk for 400003 steps (2213 resets) in 2028 ms. (197 steps per ms) remains 66/66 properties
SDD size :9.19489e+13 after 1.30594e+14
BEST_FIRST walk for 400003 steps (2248 resets) in 1854 ms. (215 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2214 resets) in 1715 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2190 resets) in 1715 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2262 resets) in 1811 ms. (220 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 1803 ms. (221 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2236 resets) in 1664 ms. (240 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2291 resets) in 3022 ms. (132 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2197 resets) in 2859 ms. (139 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2217 resets) in 2131 ms. (187 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 2618 ms. (152 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2216 resets) in 2518 ms. (158 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2262 resets) in 2036 ms. (196 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 1956 ms. (204 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2217 resets) in 2058 ms. (194 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 2187 ms. (182 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2198 resets) in 1999 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2255 resets) in 1769 ms. (225 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2214 resets) in 1736 ms. (230 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2168 resets) in 1715 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2203 resets) in 1781 ms. (224 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2234 resets) in 2161 ms. (185 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2231 resets) in 2095 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2215 resets) in 1886 ms. (211 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 1795 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2226 resets) in 1904 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2189 resets) in 1822 ms. (219 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2249 resets) in 1789 ms. (223 steps per ms) remains 66/66 properties
SDD proceeding with computation,106 properties remain. new max is 524288
SDD size :1.30594e+14 after 3.92624e+14
Interrupted probabilistic random walk after 11104018 steps, run timeout after 141001 ms. (steps per millisecond=78 ) properties seen :64 out of 66
Probabilistic random walk after 11104018 steps, saw 2500482 distinct states, run finished after 141021 ms. (steps per millisecond=78 ) properties seen :64
// Phase 1: matrix 768 rows 484 cols
[2024-05-20 13:11:53] [INFO ] Computed 84 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 824 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 754
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 470 transition count 754
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 28 place count 470 transition count 738
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 452 transition count 738
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 451 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 450 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 450 transition count 736
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 448 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 448 transition count 735
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 447 transition count 735
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 87 place count 438 transition count 727
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 438 transition count 725
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 92 place count 435 transition count 725
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 434 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 434 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 433 transition count 724
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 99 place count 431 transition count 722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 431 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 430 transition count 721
Applied a total of 101 rules in 122 ms. Remains 430 /484 variables (removed 54) and now considering 721/768 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 430/484 places, 721/768 transitions.
RANDOM walk for 4000000 steps (64907 resets) in 13799 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22161 resets) in 6255 ms. (639 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (22187 resets) in 6183 ms. (646 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2310362 steps, run timeout after 21001 ms. (steps per millisecond=110 ) properties seen :0 out of 2
Probabilistic random walk after 2310362 steps, saw 642375 distinct states, run finished after 21002 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 721 rows 430 cols
[2024-05-20 13:12:25] [INFO ] Computed 77 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/149 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/149 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1529ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 748 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 430/430 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-05-20 13:12:27] [INFO ] Invariant cache hit.
[2024-05-20 13:12:28] [INFO ] Implicit Places using invariants in 600 ms returned [1, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 264, 275, 276, 277, 295, 297, 301, 319, 320, 321, 322, 334, 340, 346, 352, 358, 364, 370, 376, 382, 388, 394]
[2024-05-20 13:12:28] [INFO ] Actually due to overlaps returned [295, 277, 49, 169, 301, 32, 152, 149, 275, 319, 150, 276, 297, 320, 1, 19, 260, 261, 67, 187, 321, 364, 382, 394, 18, 264, 322, 334, 340, 346, 352, 358, 370, 376, 388]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 618 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 395/430 places, 721/721 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 393 transition count 658
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 330 transition count 656
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 130 place count 330 transition count 641
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 161 place count 314 transition count 641
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 173 place count 310 transition count 633
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 302 transition count 633
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 196 place count 287 transition count 618
Iterating global reduction 4 with 15 rules applied. Total rules applied 211 place count 287 transition count 618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 287 transition count 615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 214 place count 287 transition count 614
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 286 transition count 614
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 283 transition count 608
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 283 transition count 608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 282 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 282 transition count 607
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 281 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 281 transition count 605
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 268 place count 260 transition count 584
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 258 transition count 582
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 258 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 258 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 256 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 282 place count 256 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 287 place count 251 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 293 place count 251 transition count 577
Applied a total of 293 rules in 119 ms. Remains 251 /395 variables (removed 144) and now considering 577/721 (removed 144) transitions.
// Phase 1: matrix 577 rows 251 cols
[2024-05-20 13:12:28] [INFO ] Computed 34 invariants in 5 ms
[2024-05-20 13:12:28] [INFO ] Implicit Places using invariants in 291 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 176, 182, 185, 187]
[2024-05-20 13:12:28] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 176, 182, 187, 74, 103, 159]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 297 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/430 places, 577/721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 226 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 226 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 220 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 220 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 218 transition count 555
Applied a total of 44 rules in 60 ms. Remains 218 /240 variables (removed 22) and now considering 555/577 (removed 22) transitions.
// Phase 1: matrix 555 rows 218 cols
[2024-05-20 13:12:28] [INFO ] Computed 23 invariants in 4 ms
[2024-05-20 13:12:28] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-20 13:12:28] [INFO ] Invariant cache hit.
[2024-05-20 13:12:29] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/430 places, 555/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1864 ms. Remains : 218/430 places, 555/721 transitions.
RANDOM walk for 4000000 steps (101153 resets) in 11445 ms. (349 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (38511 resets) in 5685 ms. (703 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (38676 resets) in 5310 ms. (753 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38772 steps, run visited all 2 properties in 448 ms. (steps per millisecond=86 )
Probabilistic random walk after 38772 steps, saw 20269 distinct states, run finished after 454 ms. (steps per millisecond=85 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 343452 ms.

BK_STOP 1716210756803

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="ASLink-PT-02b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r013-smll-171620124300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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