About the Execution of ITS-Tools for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FTFFTTFTTTTFFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldIIPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533000582
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 860K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749168870898
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-06 00:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 00:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 00:14:32] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2025-06-06 00:14:32] [INFO ] Transformed 3503 places.
[2025-06-06 00:14:32] [INFO ] Transformed 3253 transitions.
[2025-06-06 00:14:32] [INFO ] Found NUPN structural information;
[2025-06-06 00:14:32] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1911 ms. (20 steps per ms) remains 9/12 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 00:14:33] [INFO ] Flatten gal took : 233 ms
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 9/9 properties
[2025-06-06 00:14:33] [INFO ] Flatten gal took : 158 ms
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
[2025-06-06 00:14:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2373857713487101665.gal : 122 ms
[2025-06-06 00:14:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16420005337162655605.prop : 1 ms
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2373857713487101665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16420005337162655605.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
// Phase 1: matrix 3253 rows 3503 cols
[2025-06-06 00:14:33] [INFO ] Computed 451 invariants in 40 ms
Loading property file /tmp/ReachabilityCardinality16420005337162655605.prop.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2785/2934 variables, 374/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2934 variables, 2785/3308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2934 variables, 0/3308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 569/3503 variables, 77/3385 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 569/3954 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/3954 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 3253/6756 variables, 3503/7457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6756 variables, 0/7457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/6756 variables, 0/7457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6756/6756 variables, and 7457 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5037 ms.
Refiners :[Domain max(s): 3503/3503 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3503/3503 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2785/2934 variables, 374/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2934 variables, 2785/3308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 63
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :63 after 643
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :643 after 9223
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :9223 after 5.67589e+08
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :5.67589e+08 after 4.34846e+18
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :4.34846e+18 after 9.30908e+37
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :9.30908e+37 after 5.13271e+78
[2025-06-06 00:14:40] [INFO ] Deduced a trap composed of 16 places in 811 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:41] [INFO ] Deduced a trap composed of 17 places in 663 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:42] [INFO ] Deduced a trap composed of 18 places in 724 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:43] [INFO ] Deduced a trap composed of 19 places in 640 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:43] [INFO ] Deduced a trap composed of 24 places in 663 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:44] [INFO ] Deduced a trap composed of 24 places in 651 ms of which 59 ms to minimize.
SMT process timed out in 10608ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 747 transitions
Trivial Post-agglo rules discarded 747 transitions
Performed 747 trivial Post agglomeration. Transition count delta: 747
Iterating post reduction 0 with 747 rules applied. Total rules applied 747 place count 3503 transition count 2506
Reduce places removed 747 places and 0 transitions.
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 1 with 749 rules applied. Total rules applied 1496 place count 2756 transition count 2504
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1527 place count 2755 transition count 2474
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1557 place count 2725 transition count 2474
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 207 Pre rules applied. Total rules applied 1557 place count 2725 transition count 2267
Deduced a syphon composed of 207 places in 6 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 4 with 414 rules applied. Total rules applied 1971 place count 2518 transition count 2267
Discarding 323 places :
Symmetric choice reduction at 4 with 323 rule applications. Total rules 2294 place count 2195 transition count 1944
Iterating global reduction 4 with 323 rules applied. Total rules applied 2617 place count 2195 transition count 1944
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 2617 place count 2195 transition count 1816
Deduced a syphon composed of 128 places in 13 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 2873 place count 2067 transition count 1816
Performed 773 Post agglomeration using F-continuation condition.Transition count delta: 773
Deduced a syphon composed of 773 places in 5 ms
Reduce places removed 773 places and 0 transitions.
Iterating global reduction 4 with 1546 rules applied. Total rules applied 4419 place count 1294 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4621 place count 1193 transition count 1088
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 4661 place count 1173 transition count 1097
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4669 place count 1173 transition count 1089
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 4677 place count 1165 transition count 1089
Partial Free-agglomeration rule applied 45 times.
Drop transitions (Partial Free agglomeration) removed 45 transitions
Iterating global reduction 5 with 45 rules applied. Total rules applied 4722 place count 1165 transition count 1089
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4723 place count 1164 transition count 1088
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4725 place count 1162 transition count 1088
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4725 place count 1162 transition count 1087
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4727 place count 1161 transition count 1087
Applied a total of 4727 rules in 1198 ms. Remains 1161 /3503 variables (removed 2342) and now considering 1087/3253 (removed 2166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1204 ms. Remains : 1161/3503 places, 1087/3253 transitions.
RANDOM walk for 40000 steps (8 resets) in 939 ms. (42 steps per ms) remains 8/9 properties
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 417 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
// Phase 1: matrix 1087 rows 1161 cols
[2025-06-06 00:14:46] [INFO ] Computed 449 invariants in 6 ms
[2025-06-06 00:14:46] [INFO ] State equation strengthened by 282 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 857/980 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/980 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 123/1103 variables, 58/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1103 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1043/2146 variables, 1103/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2146 variables, 281/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2146 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 57/2203 variables, 30/1836 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2203 variables, 13/1849 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2203 variables, 1/1850 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2203 variables, 0/1850 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/2206 variables, 2/1852 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2206 variables, 1/1853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2206 variables, 0/1853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 32/2238 variables, 20/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2238 variables, 8/1881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2238 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1/2239 variables, 1/1882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2239 variables, 1/1883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2239 variables, 0/1883 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 2/2241 variables, 1/1884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2241 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 7/2248 variables, 6/1890 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2248 variables, 2/1892 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2248 variables, 0/1892 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/2248 variables, 0/1892 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2248/2248 variables, and 1892 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5553 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1161/1161 constraints, ReadFeed: 282/282 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 857/980 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:52] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:52] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:52] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:53] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/980 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:55] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:56] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:56] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/980 variables, 12/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:56] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 123/1103 variables, 58/456 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:57] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:57] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:14:57] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1103 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1043/2146 variables, 1103/1562 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2146 variables, 281/1843 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2146 variables, 6/1849 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:06] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:07] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:07] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:07] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:08] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:08] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:09] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2146 variables, 8/1857 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:12] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:13] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:14] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:14] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:15] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:16] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:16] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:16] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:17] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:17] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:18] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2146 variables, 11/1868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:20] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:21] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:22] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:23] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:23] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:23] [INFO ] Deduced a trap along path composed of 4 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:23] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:24] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:24] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:25] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2146 variables, 20/1888 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:26] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:26] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2146 variables, 2/1890 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:29] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:29] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:29] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:29] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:30] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:30] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2146 variables, 6/1896 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:33] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2146 variables, 1/1897 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:35] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:35] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:36] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2146 variables, 3/1900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2146/2248 variables, and 1900 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 422/449 constraints, State Equation: 1103/1161 constraints, ReadFeed: 281/282 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 29/29 constraints]
After SMT, in 50616ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 123 out of 1161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1161/1161 places, 1087/1087 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 1161 transition count 1079
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1153 transition count 1079
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 1153 transition count 1074
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 1148 transition count 1074
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 48 place count 1137 transition count 1063
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 62 place count 1130 transition count 1070
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1130 transition count 1069
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1129 transition count 1069
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 1129 transition count 1069
Applied a total of 67 rules in 293 ms. Remains 1129 /1161 variables (removed 32) and now considering 1069/1087 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 1129/1161 places, 1069/1087 transitions.
RANDOM walk for 40000 steps (8 resets) in 627 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 116182 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 8
Probabilistic random walk after 116182 steps, saw 64867 distinct states, run finished after 3007 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1069 rows 1129 cols
[2025-06-06 00:15:41] [INFO ] Computed 449 invariants in 4 ms
[2025-06-06 00:15:41] [INFO ] State equation strengthened by 306 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 830/953 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/953 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 121/1074 variables, 58/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1074 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1027/2101 variables, 1074/1496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2101 variables, 305/1801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2101 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 54/2155 variables, 30/1831 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 15/1846 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 1/1847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2155 variables, 0/1847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 33/2188 variables, 18/1865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2188 variables, 8/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2188 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/2189 variables, 1/1874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2189 variables, 1/1875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2189 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 2/2191 variables, 1/1876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2191 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 7/2198 variables, 6/1882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2198 variables, 2/1884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2198 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/2198 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2198/2198 variables, and 1884 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1129/1129 constraints, ReadFeed: 306/306 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 830/953 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:46] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:46] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:46] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:47] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:48] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/953 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:49] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:50] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/953 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 121/1074 variables, 58/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:50] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:50] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1074 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1074 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1027/2101 variables, 1074/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2101 variables, 305/1832 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2101 variables, 6/1838 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:55] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:55] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:55] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:56] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:56] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:59] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:15:59] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:01] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:01] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:02] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:02] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:02] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:02] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2101 variables, 15/1853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:05] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:05] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:05] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2101 variables, 6/1859 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:08] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:08] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:08] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:08] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:08] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:09] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:10] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2101 variables, 12/1871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:16] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:16] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2101 variables, 2/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:19] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2101 variables, 1/1874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:21] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:21] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:21] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:22] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:23] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:23] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:23] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2101 variables, 13/1887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2101 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 54/2155 variables, 30/1917 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2155 variables, 15/1932 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2155 variables, 1/1933 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2155 variables, 1/1934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:31] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:32] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 7 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2155 variables, 2/1936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:35] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2155 variables, 6/1942 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2155 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 33/2188 variables, 18/1960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2188 variables, 8/1968 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2188 variables, 0/1968 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 1/2189 variables, 1/1969 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2189 variables, 1/1970 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2189 variables, 0/1970 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 2/2191 variables, 1/1971 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2191 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 7/2198 variables, 6/1977 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2198 variables, 2/1979 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:16:48] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2198 variables, 1/1980 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2198 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 0/2198 variables, 0/1980 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2198/2198 variables, and 1980 constraints, problems are : Problem set: 0 solved, 8 unsolved in 67378 ms.
Refiners :[Positive P Invariants (semi-flows): 449/449 constraints, State Equation: 1129/1129 constraints, ReadFeed: 306/306 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 32/32 constraints]
After SMT, in 72251ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10368 ms.
Support contains 123 out of 1129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1129/1129 places, 1069/1069 transitions.
Applied a total of 0 rules in 26 ms. Remains 1129 /1129 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1129/1129 places, 1069/1069 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1129/1129 places, 1069/1069 transitions.
Applied a total of 0 rules in 24 ms. Remains 1129 /1129 variables (removed 0) and now considering 1069/1069 (removed 0) transitions.
[2025-06-06 00:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 00:17:04] [INFO ] Implicit Places using invariants in 512 ms returned [1113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1128/1129 places, 1069/1069 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1127 transition count 1068
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1127 transition count 1068
Applied a total of 2 rules in 45 ms. Remains 1127 /1128 variables (removed 1) and now considering 1068/1069 (removed 1) transitions.
// Phase 1: matrix 1068 rows 1127 cols
[2025-06-06 00:17:04] [INFO ] Computed 448 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 00:17:05] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-06-06 00:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 00:17:05] [INFO ] State equation strengthened by 306 read => feed constraints.
[2025-06-06 00:17:10] [INFO ] Implicit Places using invariants and state equation in 4900 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1127/1129 places, 1068/1069 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5978 ms. Remains : 1127/1129 places, 1068/1069 transitions.
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 119943 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 8
Probabilistic random walk after 119943 steps, saw 67436 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-06 00:17:13] [INFO ] Invariant cache hit.
[2025-06-06 00:17:13] [INFO ] State equation strengthened by 306 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 829/952 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/952 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 120/1072 variables, 57/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1072 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1026/2098 variables, 1072/1493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2098 variables, 305/1798 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2098 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 54/2152 variables, 30/1828 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2152 variables, 15/1843 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2152 variables, 1/1844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2152 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 33/2185 variables, 18/1862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2185 variables, 8/1870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2185 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/2186 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2186 variables, 1/1872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2186 variables, 0/1872 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 2/2188 variables, 1/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2188 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 7/2195 variables, 6/1879 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2195 variables, 2/1881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2195 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/2195 variables, 0/1881 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2195/2195 variables, and 1881 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4359 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1127/1127 constraints, ReadFeed: 306/306 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 829/952 variables, 364/364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:18] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:18] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:18] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:18] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:18] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:19] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/952 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:20] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:21] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 16/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:22] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:23] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:23] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:23] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:23] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/952 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 120/1072 variables, 57/467 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:23] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1072 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:24] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1072 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1026/2098 variables, 1072/1546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2098 variables, 305/1851 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2098 variables, 6/1857 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:27] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:28] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:28] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:28] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:28] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:28] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:29] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:29] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2098 variables, 8/1865 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:31] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:31] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2098 variables, 2/1867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:35] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:36] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2098 variables, 2/1869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:38] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2098 variables, 1/1870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:42] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:42] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:42] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:42] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:42] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:43] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:43] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:43] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:44] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2098 variables, 9/1879 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2098 variables, 0/1879 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 54/2152 variables, 30/1909 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2152 variables, 15/1924 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2152 variables, 1/1925 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2152 variables, 1/1926 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:57] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2152 variables, 1/1927 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:58] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:58] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:17:58] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2152 variables, 3/1930 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:01] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2152 variables, 1/1931 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2152 variables, 0/1931 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 33/2185 variables, 18/1949 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2185 variables, 8/1957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2185 variables, 0/1957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 1/2186 variables, 1/1958 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2186 variables, 1/1959 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2186 variables, 0/1959 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 2/2188 variables, 1/1960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:11] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 7 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2188 variables, 1/1961 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:13] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:13] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:13] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2188 variables, 3/1964 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2188 variables, 0/1964 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 7/2195 variables, 6/1970 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2195 variables, 2/1972 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:18] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:18:19] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2195 variables, 2/1974 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2195 variables, 0/1974 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 0/2195 variables, 0/1974 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2195/2195 variables, and 1974 constraints, problems are : Problem set: 0 solved, 8 unsolved in 68117 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 1127/1127 constraints, ReadFeed: 306/306 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 18/18 constraints]
After SMT, in 72497ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11234 ms.
Support contains 123 out of 1127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 1068/1068 transitions.
Applied a total of 0 rules in 26 ms. Remains 1127 /1127 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1127/1127 places, 1068/1068 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 1068/1068 transitions.
Applied a total of 0 rules in 25 ms. Remains 1127 /1127 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
[2025-06-06 00:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 00:18:38] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-06-06 00:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 00:18:38] [INFO ] State equation strengthened by 306 read => feed constraints.
[2025-06-06 00:18:43] [INFO ] Implicit Places using invariants and state equation in 4941 ms returned []
Implicit Place search using SMT with State Equation took 5408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 00:18:43] [INFO ] Redundant transitions in 60 ms returned []
Running 1058 sub problems to find dead transitions.
[2025-06-06 00:18:43] [INFO ] Invariant cache hit.
[2025-06-06 00:18:43] [INFO ] State equation strengthened by 306 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1119/2195 variables, and 33 constraints, problems are : Problem set: 0 solved, 1058 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 33/448 constraints, State Equation: 0/1127 constraints, ReadFeed: 0/306 constraints, PredecessorRefiner: 1058/1058 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1058 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1119 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1058 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1119/2195 variables, and 33 constraints, problems are : Problem set: 0 solved, 1058 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/448 constraints, State Equation: 0/1127 constraints, ReadFeed: 0/306 constraints, PredecessorRefiner: 0/1058 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 1058 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65805 ms. Remains : 1127/1127 places, 1068/1068 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 184 edges and 1127 vertex of which 2 / 1127 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Partial Free-agglomeration rule applied 168 times.
Drop transitions (Partial Free agglomeration) removed 168 transitions
Iterating global reduction 0 with 168 rules applied. Total rules applied 169 place count 1126 transition count 1066
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 171 place count 1126 transition count 1064
Applied a total of 171 rules in 80 ms. Remains 1126 /1127 variables (removed 1) and now considering 1064/1068 (removed 4) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1064 rows 1126 cols
[2025-06-06 00:19:43] [INFO ] Computed 448 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 00:19:43] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 00:19:44] [INFO ] [Nat]Absence check using 448 positive place invariants in 71 ms returned sat
[2025-06-06 00:19:44] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-06-06 00:19:44] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-06 00:19:45] [INFO ] After 943ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:46] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:46] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:46] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:46] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:46] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:47] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:47] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:47] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:47] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:47] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:48] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:48] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:48] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:48] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:49] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:50] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:50] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 7 ms to minimize.
[2025-06-06 00:19:50] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4415 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:50] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:50] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:50] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:51] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:51] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:51] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 7 ms to minimize.
[2025-06-06 00:19:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1089 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:51] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:52] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 13 ms to minimize.
[2025-06-06 00:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 618 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:52] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:52] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 8 ms to minimize.
[2025-06-06 00:19:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 569 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:53] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 7 ms to minimize.
[2025-06-06 00:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:53] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:54] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 14 ms to minimize.
[2025-06-06 00:19:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 617 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:54] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:54] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 6 ms to minimize.
[2025-06-06 00:19:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:55] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:55] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 7 ms to minimize.
[2025-06-06 00:19:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:55] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:56] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 7 ms to minimize.
[2025-06-06 00:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:56] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:56] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 12 ms to minimize.
[2025-06-06 00:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:57] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 6 ms to minimize.
[2025-06-06 00:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:57] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 6 ms to minimize.
[2025-06-06 00:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:57] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 7 ms to minimize.
[2025-06-06 00:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:58] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:58] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:58] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 9 ms to minimize.
[2025-06-06 00:19:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 534 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:59] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:19:59] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 6 ms to minimize.
[2025-06-06 00:19:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:00] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 9 ms to minimize.
[2025-06-06 00:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:01] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 9 ms to minimize.
[2025-06-06 00:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:01] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 8 ms to minimize.
[2025-06-06 00:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:03] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:03] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 7 ms to minimize.
[2025-06-06 00:20:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:03] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 7 ms to minimize.
[2025-06-06 00:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:04] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 8 ms to minimize.
[2025-06-06 00:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:04] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 7 ms to minimize.
[2025-06-06 00:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
TRAPS : Iteration 7
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:05] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 8 ms to minimize.
[2025-06-06 00:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:06] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 8 ms to minimize.
[2025-06-06 00:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:06] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:06] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:06] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:07] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 9 ms to minimize.
[2025-06-06 00:20:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 802 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:07] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 9 ms to minimize.
[2025-06-06 00:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
TRAPS : Iteration 8
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:08] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 7 ms to minimize.
[2025-06-06 00:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:09] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 8 ms to minimize.
[2025-06-06 00:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
TRAPS : Iteration 9
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:10] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 7 ms to minimize.
[2025-06-06 00:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 00:20:11] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 6 ms to minimize.
[2025-06-06 00:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
TRAPS : Iteration 10
[2025-06-06 00:20:12] [INFO ] After 27802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-06-06 00:20:13] [INFO ] After 30165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-06-06 00:20:14] [INFO ] Flatten gal took : 79 ms
[2025-06-06 00:20:14] [INFO ] Flatten gal took : 52 ms
[2025-06-06 00:20:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4615550047054881780.gal : 10 ms
[2025-06-06 00:20:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8225116468004826870.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4615550047054881780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8225116468004826870.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8225116468004826870.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 23
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :23 after 167
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :167 after 3893
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :3893 after 699845
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :699845 after 1.98359e+12
Detected timeout of ITS tools.
[2025-06-06 00:20:29] [INFO ] Flatten gal took : 45 ms
[2025-06-06 00:20:29] [INFO ] Applying decomposition
[2025-06-06 00:20:29] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8006568505274344373.txt' '-o' '/tmp/graph8006568505274344373.bin' '-w' '/tmp/graph8006568505274344373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8006568505274344373.bin' '-l' '-1' '-v' '-w' '/tmp/graph8006568505274344373.weights' '-q' '0' '-e' '0.001'
[2025-06-06 00:20:29] [INFO ] Decomposing Gal with order
[2025-06-06 00:20:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 00:20:29] [INFO ] Removed a total of 574 redundant transitions.
[2025-06-06 00:20:29] [INFO ] Flatten gal took : 110 ms
[2025-06-06 00:20:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 60 ms.
[2025-06-06 00:20:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12305646909363045521.gal : 17 ms
[2025-06-06 00:20:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12670563389906276570.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12305646909363045521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12670563389906276570.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12670563389906276570.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :3 after 21
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :21 after 693
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :693 after 693
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :693 after 23373
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :23373 after 1.11979e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.11979e+06 after 2.01554e+08
Reachability property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-04 is true.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1.12366e+23 after 1.82884e+55
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 61542 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 00:20:45] [INFO ] Flatten gal took : 70 ms
[2025-06-06 00:20:45] [INFO ] Applying decomposition
[2025-06-06 00:20:45] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16154495580877914053.txt' '-o' '/tmp/graph16154495580877914053.bin' '-w' '/tmp/graph16154495580877914053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16154495580877914053.bin' '-l' '-1' '-v' '-w' '/tmp/graph16154495580877914053.weights' '-q' '0' '-e' '0.001'
[2025-06-06 00:20:45] [INFO ] Decomposing Gal with order
[2025-06-06 00:20:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 00:20:45] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-06 00:20:46] [INFO ] Flatten gal took : 147 ms
[2025-06-06 00:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-06 00:20:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3094244371960262249.gal : 29 ms
[2025-06-06 00:20:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5966232842933541486.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3094244371960262249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5966232842933541486.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5966232842933541486.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1410
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1410 after 9.78865e+08
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9.78865e+08 after 3.88297e+148
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-14 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-13 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-06 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-04 is true.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-03 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-02 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-050B-ReachabilityCardinality-2025-00 does not hold.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.88297e+148 after 1.68409e+170
ITS-tools command line returned an error code 137
[2025-06-06 00:45:06] [INFO ] Flatten gal took : 344 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin245618004509372641
[2025-06-06 00:45:07] [INFO ] Applying decomposition
[2025-06-06 00:45:07] [INFO ] Computing symmetric may disable matrix : 1068 transitions.
[2025-06-06 00:45:07] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 00:45:07] [INFO ] Computing symmetric may enable matrix : 1068 transitions.
[2025-06-06 00:45:07] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 00:45:07] [INFO ] Flatten gal took : 332 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3880387883957251416.txt' '-o' '/tmp/graph3880387883957251416.bin' '-w' '/tmp/graph3880387883957251416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3880387883957251416.bin' '-l' '-1' '-v' '-w' '/tmp/graph3880387883957251416.weights' '-q' '0' '-e' '0.001'
[2025-06-06 00:45:11] [INFO ] Computing Do-Not-Accords matrix : 1068 transitions.
[2025-06-06 00:45:11] [INFO ] Decomposing Gal with order
[2025-06-06 00:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 00:45:11] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 00:45:11] [INFO ] Built C files in 4345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin245618004509372641
Running compilation step : cd /tmp/ltsmin245618004509372641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 00:45:11] [INFO ] Removed a total of 745 redundant transitions.
[2025-06-06 00:45:11] [INFO ] Flatten gal took : 248 ms
[2025-06-06 00:45:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 50 ms.
[2025-06-06 00:45:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16359058751706186674.gal : 12 ms
[2025-06-06 00:45:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality576712742711836271.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16359058751706186674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality576712742711836271.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality576712742711836271.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :65 after 245
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :245 after 2585
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2585 after 14735
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :14735 after 2.51943e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.49822e+23 after 5.58144e+46
Compilation finished in 3669 ms.
Running link step : cd /tmp/ltsmin245618004509372641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin245618004509372641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin245618004509372641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin245618004509372641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT050BReachabilityCardinality202515==true'
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.58144e+46 after 1.95907e+111
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533000582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;