About the Execution of ITS-Tools for ShieldPPPt-PT-040B
| 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 | ?FTT???T?TT??FF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600918.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 ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600918
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 762K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749327566772
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-07 20:19:27] [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-07 20:19:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 20:19:28] [INFO ] Load time of PNML (sax parser for PT used): 598 ms
[2025-06-07 20:19:28] [INFO ] Transformed 3123 places.
[2025-06-07 20:19:28] [INFO ] Transformed 2843 transitions.
[2025-06-07 20:19:28] [INFO ] Found NUPN structural information;
[2025-06-07 20:19:28] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 821 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 20:19:29] [INFO ] Flatten gal took : 392 ms
RANDOM walk for 40000 steps (8 resets) in 2147 ms. (18 steps per ms) remains 10/14 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
[2025-06-07 20:19:29] [INFO ] Flatten gal took : 207 ms
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 10/10 properties
[2025-06-07 20:19:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3390067837960167016.gal : 118 ms
[2025-06-07 20:19:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3237977421608399331.prop : 2 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/ReachabilityCardinality3390067837960167016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3237977421608399331.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 362 ms. (110 steps per ms) remains 10/10 properties
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
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality3237977421608399331.prop.
// Phase 1: matrix 2843 rows 3123 cols
[2025-06-07 20:19:30] [INFO ] Computed 441 invariants in 44 ms
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/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1833/1964 variables, 257/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1964 variables, 1833/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1964 variables, 0/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1159/3123 variables, 184/2405 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3123 variables, 1159/3564 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3123 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2843/5966 variables, 3123/6687 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
At refinement iteration 10 (OVERLAPS) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :58 after 873
After SMT solving in domain Real declared 5966/5966 variables, and 6687 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4541 ms.
Refiners :[Domain max(s): 3123/3123 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 3123/3123 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :873 after 303615
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :303615 after 5.34242e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :5.34242e+08 after 1.12436e+16
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1.12436e+16 after 8.77745e+31
At refinement iteration 2 (OVERLAPS) 1833/1964 variables, 257/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :8.77745e+31 after 1.24739e+70
At refinement iteration 3 (INCLUDED_ONLY) 0/1964 variables, 1833/2221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:36] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 26 ms to minimize.
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2025-07 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1.24739e+70 after 2.08648e+117
[2025-06-07 20:19:36] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :2.08648e+117 after 2.08648e+117
[2025-06-07 20:19:36] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:37] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :2.08648e+117 after 2.08648e+117
[2025-06-07 20:19:37] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:37] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:38] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:38] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:38] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :2.08648e+117 after 2.08648e+117
[2025-06-07 20:19:39] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:39] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:39] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:39] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:40] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:40] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 27 ms to minimize.
SMT process timed out in 9972ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 130 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3123 transition count 2177
Reduce places removed 666 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 668 rules applied. Total rules applied 1334 place count 2457 transition count 2175
Reduce places removed 1 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 2 with 42 rules applied. Total rules applied 1376 place count 2456 transition count 2134
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1417 place count 2415 transition count 2134
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 164 Pre rules applied. Total rules applied 1417 place count 2415 transition count 1970
Deduced a syphon composed of 164 places in 5 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 4 with 328 rules applied. Total rules applied 1745 place count 2251 transition count 1970
Discarding 256 places :
Symmetric choice reduction at 4 with 256 rule applications. Total rules 2001 place count 1995 transition count 1714
Iterating global reduction 4 with 256 rules applied. Total rules applied 2257 place count 1995 transition count 1714
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 99 Pre rules applied. Total rules applied 2257 place count 1995 transition count 1615
Deduced a syphon composed of 99 places in 11 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 2455 place count 1896 transition count 1615
Performed 626 Post agglomeration using F-continuation condition.Transition count delta: 626
Deduced a syphon composed of 626 places in 4 ms
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1252 rules applied. Total rules applied 3707 place count 1270 transition count 989
Renaming transitions due to excessive name length > 1024 char.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 3907 place count 1170 transition count 989
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 3912 place count 1170 transition count 984
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 3917 place count 1165 transition count 984
Partial Free-agglomeration rule applied 99 times.
Drop transitions (Partial Free agglomeration) removed 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 4016 place count 1165 transition count 984
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4017 place count 1164 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4018 place count 1163 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4018 place count 1163 transition count 981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4022 place count 1161 transition count 981
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :2.08648e+117 after 2.08648e+117
Applied a total of 4022 rules in 1667 ms. Remains 1161 /3123 variables (removed 1962) and now considering 981/2843 (removed 1862) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1673 ms. Remains : 1161/3123 places, 981/2843 transitions.
RANDOM walk for 40000 steps (8 resets) in 866 ms. (46 steps per ms) remains 8/9 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
// Phase 1: matrix 981 rows 1161 cols
[2025-06-07 20:19:43] [INFO ] Computed 440 invariants in 4 ms
[2025-06-07 20:19:43] [INFO ] State equation strengthened by 135 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 619/747 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 170/917 variables, 75/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 847/1764 variables, 917/1248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1764 variables, 129/1377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1764 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 226/1990 variables, 148/1525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1990 variables, 60/1585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1990 variables, 6/1591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1990 variables, 0/1591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/1996 variables, 8/1599 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1996 variables, 6/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/2004 variables, 4/1609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2004 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 83/2087 variables, 55/1664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2087 variables, 18/1682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2087 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/2090 variables, 4/1686 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2090 variables, 3/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2090 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 4/2094 variables, 2/1691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2094 variables, 0/1691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 31/2125 variables, 20/1711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2125 variables, 6/1717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2125 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 2/2127 variables, 2/1719 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2127 variables, 2/1721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2127 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 4/2131 variables, 2/1723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2131 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 11/2142 variables, 10/1733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2142 variables, 3/1736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2142 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 0/2142 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 1736 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5467 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1161/1161 constraints, ReadFeed: 135/135 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 619/747 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 5 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-07 20:19:49] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 6 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-07 20:19:49] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:49] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:50] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:50] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:50] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:50] [INFO ] Deduced a trap composed of 8 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-07 20:19:50] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:50] [INFO ] Deduced a trap composed of 7 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-07 20:19:50] [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-07 20:19:50] [INFO ] Deduced a trap composed of 9 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-07 20:19:50] [INFO ] Deduced a trap composed of 9 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-07 20:19:51] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/747 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:51] [INFO ] Deduced a trap composed of 8 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-07 20:19:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:52] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/747 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 170/917 variables, 75/361 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:52] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:52] [INFO ] Deduced a trap composed of 4 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-07 20:19:52] [INFO ] Deduced a trap composed of 5 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-07 20:19:53] [INFO ] Deduced a trap composed of 6 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-07 20:19:53] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 5/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:53] [INFO ] Deduced a trap composed of 10 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-07 20:19:53] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/917 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/917 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 847/1764 variables, 917/1285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1764 variables, 129/1414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1764 variables, 3/1417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:54] [INFO ] Deduced a trap composed of 7 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-07 20:19:55] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:55] [INFO ] Deduced a trap composed of 9 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-07 20:19:55] [INFO ] Deduced a trap composed of 9 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-07 20:19:55] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:55] [INFO ] Deduced a trap composed of 10 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-07 20:19:55] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:56] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1764 variables, 8/1425 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:56] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:56] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:56] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:56] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:57] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [INFO ] Deduced a trap along path composed of 2 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-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [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-07 20:19:57] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:57] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:57] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:58] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:58] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:58] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1764 variables, 20/1445 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:59] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:19:59] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1764 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1764 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 226/1990 variables, 148/1595 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1990 variables, 60/1655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 6/1661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 4/1665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:02] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:03] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:03] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:03] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:03] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:04] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:04] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:04] [INFO ] Deduced a trap composed of 4 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-07 20:20:05] [INFO ] Deduced a trap composed of 5 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-07 20:20:05] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 10/1675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:07] [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-07 20:20:07] [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-07 20:20:07] [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-07 20:20:07] [INFO ] Deduced a trap along path composed of 3 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-07 20:20:08] [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-07 20:20:08] [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-07 20:20:08] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:08] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:09] [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-07 20:20:09] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1990 variables, 10/1685 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1990 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 6/1996 variables, 8/1693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1996 variables, 6/1699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1996 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 8/2004 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2004 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 83/2087 variables, 55/1758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2087 variables, 18/1776 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:17] [INFO ] Deduced a trap composed of 5 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-07 20:20:18] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:18] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 7 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2087 variables, 3/1779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:20] [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-07 20:20:20] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:20] [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-07 20:20:20] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:20] [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-07 20:20:20] [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-07 20:20:21] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2087 variables, 7/1786 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:22] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2087 variables, 1/1787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2087 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 3/2090 variables, 4/1791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2090 variables, 3/1794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2090 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 4/2094 variables, 2/1796 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:28] [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-07 20:20:29] [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-07 20:20:29] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:29] [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-07 20:20: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-07 20:20:29] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:29] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/2094 variables, 7/1803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2094 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 31/2125 variables, 20/1823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2125 variables, 6/1829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2142 variables, and 1829 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 433/440 constraints, State Equation: 1149/1161 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 47/47 constraints]
After SMT, in 50533ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 1161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1161/1161 places, 981/981 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1159 transition count 979
Applied a total of 4 rules in 64 ms. Remains 1159 /1161 variables (removed 2) and now considering 979/981 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1159/1161 places, 979/981 transitions.
RANDOM walk for 40000 steps (8 resets) in 658 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 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 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 101840 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 8
Probabilistic random walk after 101840 steps, saw 80959 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 979 rows 1159 cols
[2025-06-07 20:20:37] [INFO ] Computed 440 invariants in 6 ms
[2025-06-07 20:20:37] [INFO ] State equation strengthened by 136 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 618/746 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/746 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 169/915 variables, 75/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 845/1760 variables, 915/1246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 130/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 226/1986 variables, 148/1524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1986 variables, 60/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1986 variables, 6/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1986 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/1992 variables, 8/1598 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1992 variables, 6/1604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1992 variables, 0/1604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/2000 variables, 4/1608 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2000 variables, 0/1608 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 83/2083 variables, 55/1663 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2083 variables, 18/1681 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2083 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/2086 variables, 4/1685 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2086 variables, 3/1688 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2086 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 4/2090 variables, 2/1690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2090 variables, 0/1690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 31/2121 variables, 20/1710 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2121 variables, 6/1716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2121 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 2/2123 variables, 2/1718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2123 variables, 2/1720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2123 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 4/2127 variables, 2/1722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2127 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 11/2138 variables, 10/1732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2138 variables, 3/1735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2138 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 0/2138 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2138/2138 variables, and 1735 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5505 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1159/1159 constraints, ReadFeed: 136/136 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 618/746 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:43] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [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-07 20:20:44] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 8 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-07 20:20:44] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:44] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/746 variables, 19/275 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [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-07 20:20:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [INFO ] Deduced a trap composed of 7 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-07 20:20:45] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/746 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:45] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 169/915 variables, 75/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:46] [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-07 20:20:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:47] [INFO ] Deduced a trap composed of 5 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-07 20:20:47] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/915 variables, 7/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 845/1760 variables, 915/1281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1760 variables, 130/1411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1760 variables, 3/1414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1760 variables, 2/1416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:49] [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-07 20:20:49] [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-07 20:20:50] [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-07 20:20:50] [INFO ] Deduced a trap along path composed of 3 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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [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-07 20:20:50] [INFO ] Deduced a trap along path composed of 3 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-07 20:20:50] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:51] [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-07 20:20:51] [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-07 20:20:51] [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-07 20:20:51] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1760 variables, 15/1431 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1760 variables, 0/1431 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 226/1986 variables, 148/1579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1986 variables, 60/1639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1986 variables, 6/1645 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1986 variables, 4/1649 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:54] [INFO ] Deduced a trap composed of 4 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-07 20:20:54] [INFO ] Deduced a trap composed of 5 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-07 20:20:54] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:54] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:54] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:56] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 11 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1986 variables, 6/1655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:57] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:57] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:57] [INFO ] Deduced a trap composed of 8 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-07 20:20:58] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:20:58] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1986 variables, 5/1660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1986 variables, 2/1662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:00] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:00] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:00] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:00] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:00] [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-07 20:21:01] [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-07 20:21:01] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:01] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:01] [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-07 20:21:01] [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-07 20:21:01] [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-07 20:21:01] [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-07 20:21:02] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1986 variables, 13/1675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1986 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 6/1992 variables, 8/1683 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1992 variables, 6/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1992 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 8/2000 variables, 4/1693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2000 variables, 0/1693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 83/2083 variables, 55/1748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2083 variables, 18/1766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:07] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 7 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2083 variables, 1/1767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:08] [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-07 20:21:08] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:08] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2083 variables, 3/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2083 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 3/2086 variables, 4/1774 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2086 variables, 3/1777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2086 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 4/2090 variables, 2/1779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2090 variables, 0/1779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 31/2121 variables, 20/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2121 variables, 6/1805 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:14] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/2121 variables, 1/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2121 variables, 0/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 2/2123 variables, 2/1808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2123 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:17] [INFO ] Deduced a trap along path composed of 4 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-07 20:21:17] [INFO ] Deduced a trap along path composed of 3 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-07 20:21:17] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/2123 variables, 3/1813 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:18] [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-07 20:21:19] [INFO ] Deduced a trap along path composed of 4 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-07 20:21:19] [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-07 20:21:19] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:19] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/2123 variables, 5/1818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2123 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 4/2127 variables, 2/1820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2127 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 11/2138 variables, 10/1830 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2138 variables, 3/1833 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:23] [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-07 20:21:23] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/2138 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2138 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 0/2138 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2138/2138 variables, and 1835 constraints, problems are : Problem set: 0 solved, 8 unsolved in 44807 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1159/1159 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 44/44 constraints]
After SMT, in 50342ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6409 ms.
Support contains 128 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 979/979 transitions.
Applied a total of 0 rules in 33 ms. Remains 1159 /1159 variables (removed 0) and now considering 979/979 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1159/1159 places, 979/979 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 979/979 transitions.
Applied a total of 0 rules in 31 ms. Remains 1159 /1159 variables (removed 0) and now considering 979/979 (removed 0) transitions.
[2025-06-07 20:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:35] [INFO ] Implicit Places using invariants in 535 ms returned [1138, 1142]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 549 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1157/1159 places, 979/979 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1155 transition count 977
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1155 transition count 977
Applied a total of 4 rules in 72 ms. Remains 1155 /1157 variables (removed 2) and now considering 977/979 (removed 2) transitions.
// Phase 1: matrix 977 rows 1155 cols
[2025-06-07 20:21:35] [INFO ] Computed 438 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:35] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-06-07 20:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:21:36] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-07 20:21:38] [INFO ] Implicit Places using invariants and state equation in 2668 ms returned []
Implicit Place search using SMT with State Equation took 3161 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1155/1159 places, 977/979 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3815 ms. Remains : 1155/1159 places, 977/979 transitions.
RANDOM walk for 40000 steps (8 resets) in 435 ms. (91 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 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 99828 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 8
Probabilistic random walk after 99828 steps, saw 79686 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-07 20:21:42] [INFO ] Invariant cache hit.
[2025-06-07 20:21:42] [INFO ] State equation strengthened by 134 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 618/746 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/746 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 169/915 variables, 75/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 843/1758 variables, 915/1246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1758 variables, 128/1374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1758 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 222/1980 variables, 144/1518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1980 variables, 58/1576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1980 variables, 6/1582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1980 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 6/1986 variables, 8/1590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1986 variables, 6/1596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1986 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/1994 variables, 4/1600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1994 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 83/2077 variables, 55/1655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2077 variables, 18/1673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2077 variables, 0/1673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/2080 variables, 4/1677 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2080 variables, 3/1680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2080 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 4/2084 variables, 2/1682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2084 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 31/2115 variables, 20/1702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2115 variables, 6/1708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2115 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 2/2117 variables, 2/1710 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2117 variables, 2/1712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2117 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 4/2121 variables, 2/1714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2121 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 11/2132 variables, 10/1724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2132 variables, 3/1727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2132 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 0/2132 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2132/2132 variables, and 1727 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1155/1155 constraints, ReadFeed: 134/134 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 618/746 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:48] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:48] [INFO ] Deduced a trap composed of 5 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-07 20:21:48] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:48] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:48] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [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-07 20:21:49] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [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-07 20:21:49] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [INFO ] Deduced a trap composed of 8 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-07 20:21:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:49] [INFO ] Deduced a trap composed of 8 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-07 20:21:50] [INFO ] Deduced a trap composed of 8 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-07 20:21:50] [INFO ] Deduced a trap composed of 9 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-07 20:21:50] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:50] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:50] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/746 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:50] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:50] [INFO ] Deduced a trap composed of 7 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-07 20:21:50] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:50] [INFO ] Deduced a trap composed of 8 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-07 20:21:50] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:51] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:51] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/746 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 169/915 variables, 75/359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:51] [INFO ] Deduced a trap composed of 4 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-07 20:21:51] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:51] [INFO ] Deduced a trap composed of 5 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-07 20:21:51] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:52] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 5/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-07 20:21:52] [INFO ] Deduced a trap composed of 6 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-07 20:21:52] [INFO ] Deduced a trap composed of 11 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-07 20:21:52] [INFO ] Deduced a trap composed of 11 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-07 20:21:52] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:52] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/915 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/915 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 843/1758 variables, 915/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 128/1412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 3/1415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:54] [INFO ] Deduced a trap composed of 8 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-07 20:21:54] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:54] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:55] [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-07 20:21:55] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:55] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 6/1421 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:56] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1758 variables, 1/1422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:56] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:56] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1758 variables, 2/1424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:57] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1758 variables, 1/1425 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:57] [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-07 20:21:58] [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-07 20:21:58] [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-07 20:21:58] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1758 variables, 4/1429 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:59] [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-07 20:21:59] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1758 variables, 2/1431 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:21:59] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:00] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1758 variables, 2/1433 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:01] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:01] [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-07 20:22:01] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:01] [INFO ] Deduced a trap along path composed of 3 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-07 20:22:01] [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-07 20:22:02] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1758 variables, 6/1439 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1758 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 222/1980 variables, 144/1583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1980 variables, 58/1641 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1980 variables, 6/1647 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1980 variables, 4/1651 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:08] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:08] [INFO ] Deduced a trap composed of 5 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-07 20:22:08] [INFO ] Deduced a trap composed of 4 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-07 20:22:08] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 8 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1980 variables, 4/1655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:10] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:10] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:10] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:10] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 7 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1980 variables, 4/1659 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:12] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 7 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1980 variables, 1/1660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:12] [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-07 20:22:13] [INFO ] Deduced a trap along path composed of 3 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-07 20:22:13] [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-07 20:22:13] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1980 variables, 4/1664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:15] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1980 variables, 1/1665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1980 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 6/1986 variables, 8/1673 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1986 variables, 6/1679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:17] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:17] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:19] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:19] [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-07 20:22:19] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1986 variables, 5/1684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:20] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:20] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:20] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:21] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 9 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1986 variables, 4/1688 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:22] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1986 variables, 1/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1986 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 8/1994 variables, 4/1693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:25] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 7 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1994 variables, 1/1694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1994 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 83/2077 variables, 55/1749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2077 variables, 18/1767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:30] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 6 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/2077 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2077 variables, 0/1768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (OVERLAPS) 3/2080 variables, 4/1772 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2080 variables, 3/1775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2080 variables, 0/1775 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (OVERLAPS) 4/2084 variables, 2/1777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2084 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 31/2115 variables, 20/1797 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2115 variables, 6/1803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:38] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/2115 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2115 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (OVERLAPS) 2/2117 variables, 2/1806 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2117 variables, 2/1808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2117 variables, 0/1808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 4/2121 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2121 variables, 0/1810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 11/2132 variables, 10/1820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2132 variables, 3/1823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:22:47] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/2132 variables, 1/1824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2132 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 0/2132 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2132/2132 variables, and 1824 constraints, problems are : Problem set: 0 solved, 8 unsolved in 64731 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1155/1155 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 23/23 constraints]
After SMT, in 70725ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4836 ms.
Support contains 128 out of 1155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1155/1155 places, 977/977 transitions.
Applied a total of 0 rules in 32 ms. Remains 1155 /1155 variables (removed 0) and now considering 977/977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1155/1155 places, 977/977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1155/1155 places, 977/977 transitions.
Applied a total of 0 rules in 30 ms. Remains 1155 /1155 variables (removed 0) and now considering 977/977 (removed 0) transitions.
[2025-06-07 20:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:58] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-06-07 20:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:22:58] [INFO ] State equation strengthened by 134 read => feed constraints.
[2025-06-07 20:23:00] [INFO ] Implicit Places using invariants and state equation in 2650 ms returned []
Implicit Place search using SMT with State Equation took 3188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:23:01] [INFO ] Redundant transitions in 52 ms returned []
Running 957 sub problems to find dead transitions.
[2025-06-07 20:23:01] [INFO ] Invariant cache hit.
[2025-06-07 20:23:01] [INFO ] State equation strengthened by 134 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1136 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 957 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:23:27] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:23:28] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/2132 variables, and 133 constraints, problems are : Problem set: 0 solved, 957 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/438 constraints, State Equation: 0/1155 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 957/957 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 957 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1136 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1136 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1136 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 957 unsolved
At refinement iteration 3 (OVERLAPS) 19/1155 variables, 307/440 constraints. Problems are: Problem set: 0 solved, 957 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:00] [INFO ] Deduced a trap 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-07 20:24:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:01] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:01] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 1)
(s348 0)
(s349 0)
(s350 1)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 1)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 1)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 1)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 1)
(s424 0)
(s425 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/2132 variables, and 447 constraints, problems are : Problem set: 0 solved, 957 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 0/1155 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 0/957 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 957 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63530 ms. Remains : 1155/1155 places, 977/977 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 184 times.
Drop transitions (Partial Free agglomeration) removed 184 transitions
Iterating global reduction 0 with 184 rules applied. Total rules applied 184 place count 1155 transition count 977
Applied a total of 184 rules in 69 ms. Remains 1155 /1155 variables (removed 0) and now considering 977/977 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 977 rows 1155 cols
[2025-06-07 20:24:01] [INFO ] Computed 438 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 20:24:01] [INFO ] After 318ms 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-07 20:24:01] [INFO ] [Nat]Absence check using 438 positive place invariants in 68 ms returned sat
[2025-06-07 20:24:02] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-06-07 20:24:02] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-07 20:24:04] [INFO ] After 1221ms SMT Verify possible using 152 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-07 20:24:04] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:04] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:04] [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-07 20:24:05] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:05] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:05] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:05] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:06] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:06] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:06] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:06] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:06] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:07] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:07] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:07] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:07] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:07] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:08] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:08] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:08] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:08] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 7 ms to minimize.
[2025-06-07 20:24:08] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4729 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:09] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:09] [INFO ] Deduced a trap composed of 7 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-07 20:24:09] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 10 ms to minimize.
[2025-06-07 20:24:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 675 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:10] [INFO ] Deduced a trap composed of 5 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-07 20:24:10] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:10] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:10] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:10] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:11] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:11] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:11] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:11] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:12] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:12] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:12] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:12] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:12] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 8 ms to minimize.
[2025-06-07 20:24:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3185 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:13] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:13] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:14] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:14] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 9 ms to minimize.
[2025-06-07 20:24:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 963 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:14] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:15] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:15] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:15] [INFO ] Deduced a trap composed of 7 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-07 20:24:15] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:15] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:16] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 7 ms to minimize.
[2025-06-07 20:24:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1380 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:17] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:18] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:18] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 12 ms to minimize.
[2025-06-07 20:24:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1314 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:19] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:19] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 14 ms to minimize.
[2025-06-07 20:24:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:21] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 10 ms to minimize.
[2025-06-07 20:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:22] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:22] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 9 ms to minimize.
[2025-06-07 20:24:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:23] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:23] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:23] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:24] [INFO ] Deduced a trap composed of 8 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-07 20:24:24] [INFO ] Deduced a trap composed of 8 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-07 20:24:24] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 8 ms to minimize.
[2025-06-07 20:24:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1281 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:25] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:25] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:25] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:25] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:25] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 8 ms to minimize.
[2025-06-07 20:24:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1219 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:26] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:26] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:26] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 8 ms to minimize.
[2025-06-07 20:24:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:27] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:27] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:27] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:28] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:28] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:28] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:28] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 8 ms to minimize.
[2025-06-07 20:24:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1699 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:29] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:30] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:30] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 9 ms to minimize.
[2025-06-07 20:24:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 796 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:31] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:31] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:32] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:32] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:32] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:32] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:32] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 11 ms to minimize.
[2025-06-07 20:24:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1537 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:34] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:35] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:35] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 14 ms to minimize.
[2025-06-07 20:24:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 917 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:37] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 8 ms to minimize.
[2025-06-07 20:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:37] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:37] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 7 ms to minimize.
[2025-06-07 20:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:38] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:38] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:38] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:38] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 9 ms to minimize.
[2025-06-07 20:24:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 972 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:42] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:42] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:42] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 8 ms to minimize.
[2025-06-07 20:24:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 717 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:43] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:43] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 8 ms to minimize.
[2025-06-07 20:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:47] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 11 ms to minimize.
[2025-06-07 20:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:47] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:48] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:48] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:48] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 10 ms to minimize.
[2025-06-07 20:24:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1069 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:49] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:49] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:49] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:49] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 9 ms to minimize.
[2025-06-07 20:24:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1014 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:51] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 8 ms to minimize.
[2025-06-07 20:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
TRAPS : Iteration 7
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:52] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:52] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 8 ms to minimize.
[2025-06-07 20:24:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:53] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 7 ms to minimize.
[2025-06-07 20:24:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:53] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:54] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:54] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:54] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:54] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 7 ms to minimize.
[2025-06-07 20:24:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1036 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:55] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 7 ms to minimize.
[2025-06-07 20:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
TRAPS : Iteration 8
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:55] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:55] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:56] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 10 ms to minimize.
[2025-06-07 20:24:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 710 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:56] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:56] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 10 ms to minimize.
[2025-06-07 20:24:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:57] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 8 ms to minimize.
[2025-06-07 20:24:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:58] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:58] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:24:59] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 10 ms to minimize.
[2025-06-07 20:24:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:00] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 11 ms to minimize.
[2025-06-07 20:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:00] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 9 ms to minimize.
[2025-06-07 20:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
TRAPS : Iteration 9
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:01] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:02] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:02] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 8 ms to minimize.
[2025-06-07 20:25:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 779 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:03] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:03] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 8 ms to minimize.
[2025-06-07 20:25:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
TRAPS : Iteration 10
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:04] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 10 ms to minimize.
[2025-06-07 20:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:04] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 9 ms to minimize.
[2025-06-07 20:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:05] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 9 ms to minimize.
[2025-06-07 20:25:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
TRAPS : Iteration 11
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:06] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 15 ms to minimize.
[2025-06-07 20:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:07] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 16 ms to minimize.
[2025-06-07 20:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:09] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:09] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 13 ms to minimize.
[2025-06-07 20:25:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 700 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:12] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 8 ms to minimize.
[2025-06-07 20:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
TRAPS : Iteration 12
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:13] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:13] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 8 ms to minimize.
[2025-06-07 20:25:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:14] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 8 ms to minimize.
[2025-06-07 20:25:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
TRAPS : Iteration 13
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:17] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:18] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 8 ms to minimize.
[2025-06-07 20:25:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:18] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 10 ms to minimize.
[2025-06-07 20:25:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
TRAPS : Iteration 14
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:19] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 8 ms to minimize.
[2025-06-07 20:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:20] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 11 ms to minimize.
[2025-06-07 20:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
TRAPS : Iteration 15
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:25] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:25] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 8 ms to minimize.
[2025-06-07 20:25:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
TRAPS : Iteration 16
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:26] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:26] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:26] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 7 ms to minimize.
[2025-06-07 20:25:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 654 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:27] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 9 ms to minimize.
[2025-06-07 20:25:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:28] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 7 ms to minimize.
[2025-06-07 20:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
TRAPS : Iteration 17
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:31] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 7 ms to minimize.
[2025-06-07 20:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
TRAPS : Iteration 18
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:31] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 7 ms to minimize.
[2025-06-07 20:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:33] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:33] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:33] [INFO ] Deduced a trap composed of 11 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-07 20:25:34] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:34] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:34] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 6 ms to minimize.
[2025-06-07 20:25:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1260 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:35] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 7 ms to minimize.
[2025-06-07 20:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
TRAPS : Iteration 19
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:36] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:36] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 7 ms to minimize.
[2025-06-07 20:25:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
TRAPS : Iteration 20
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:39] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 7 ms to minimize.
[2025-06-07 20:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:39] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 6 ms to minimize.
[2025-06-07 20:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:41] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:42] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 8 ms to minimize.
[2025-06-07 20:25:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
TRAPS : Iteration 21
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:44] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 9 ms to minimize.
[2025-06-07 20:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
TRAPS : Iteration 22
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:47] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:48] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:48] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 9 ms to minimize.
[2025-06-07 20:25:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 869 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:48] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 11 ms to minimize.
[2025-06-07 20:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
TRAPS : Iteration 23
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:51] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:51] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 7 ms to minimize.
[2025-06-07 20:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 560 ms
TRAPS : Iteration 24
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:52] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 8 ms to minimize.
[2025-06-07 20:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:53] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 6 ms to minimize.
[2025-06-07 20:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
TRAPS : Iteration 25
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:54] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 8 ms to minimize.
[2025-06-07 20:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:54] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 7 ms to minimize.
[2025-06-07 20:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:56] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 11 ms to minimize.
[2025-06-07 20:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:57] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 9 ms to minimize.
[2025-06-07 20:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
TRAPS : Iteration 26
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:58] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:58] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 9 ms to minimize.
[2025-06-07 20:25:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:58] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:59] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 9 ms to minimize.
[2025-06-07 20:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:25:59] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:00] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 8 ms to minimize.
[2025-06-07 20:26:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
TRAPS : Iteration 27
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:01] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 8 ms to minimize.
[2025-06-07 20:26:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:01] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:02] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 9 ms to minimize.
[2025-06-07 20:26:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
TRAPS : Iteration 28
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:04] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:05] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 9 ms to minimize.
[2025-06-07 20:26:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:05] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 10 ms to minimize.
[2025-06-07 20:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:06] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 8 ms to minimize.
[2025-06-07 20:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:26:06] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 7 ms to minimize.
[2025-06-07 20:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
TRAPS : Iteration 29
[2025-06-07 20:26:08] [INFO ] After 125687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-06-07 20:26:10] [INFO ] After 128856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-06-07 20:26:10] [INFO ] Flatten gal took : 61 ms
[2025-06-07 20:26:10] [INFO ] Flatten gal took : 49 ms
[2025-06-07 20:26:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10116818925587975551.gal : 12 ms
[2025-06-07 20:26:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7057395080034623934.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/ReachabilityCardinality10116818925587975551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7057395080034623934.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
Loading property file /tmp/ReachabilityCardinality7057395080034623934.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 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :14 after 40
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :40 after 124
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :124 after 34565
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :34565 after 2.46926e+10
Detected timeout of ITS tools.
[2025-06-07 20:26:25] [INFO ] Flatten gal took : 33 ms
[2025-06-07 20:26:25] [INFO ] Applying decomposition
[2025-06-07 20:26:25] [INFO ] Flatten gal took : 32 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/graph15226065821199535368.txt' '-o' '/tmp/graph15226065821199535368.bin' '-w' '/tmp/graph15226065821199535368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15226065821199535368.bin' '-l' '-1' '-v' '-w' '/tmp/graph15226065821199535368.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:26:26] [INFO ] Decomposing Gal with order
[2025-06-07 20:26:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:26:26] [INFO ] Removed a total of 235 redundant transitions.
[2025-06-07 20:26:26] [INFO ] Flatten gal took : 109 ms
[2025-06-07 20:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 27 ms.
[2025-06-07 20:26:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13339406129182121061.gal : 15 ms
[2025-06-07 20:26:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1068827566377601619.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/ReachabilityCardinality13339406129182121061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1068827566377601619.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 ...308
Loading property file /tmp/ReachabilityCardinality1068827566377601619.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 11
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :11 after 110
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :110 after 210
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :210 after 2410
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :2410 after 3610
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3610 after 1.03689e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.03689e+06 after 2.46926e+10
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2025-04 is true.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :6.77087e+20 after 2.26115e+40
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2025-15 does not hold.
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2025-12 does not hold.
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2025-08 does not hold.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.26115e+40 after 5.65684e+68
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 160124 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 20:26:41] [INFO ] Flatten gal took : 65 ms
[2025-06-07 20:26:41] [INFO ] Applying decomposition
[2025-06-07 20:26:41] [INFO ] Flatten gal took : 66 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/graph11827807276817029493.txt' '-o' '/tmp/graph11827807276817029493.bin' '-w' '/tmp/graph11827807276817029493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11827807276817029493.bin' '-l' '-1' '-v' '-w' '/tmp/graph11827807276817029493.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:26:41] [INFO ] Decomposing Gal with order
[2025-06-07 20:26:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:26:42] [INFO ] Removed a total of 240 redundant transitions.
[2025-06-07 20:26:42] [INFO ] Flatten gal took : 177 ms
[2025-06-07 20:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2025-06-07 20:26:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10433744453125020298.gal : 44 ms
[2025-06-07 20:26:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality793031129940370017.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/ReachabilityCardinality10433744453125020298.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality793031129940370017.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/ReachabilityCardinality793031129940370017.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 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 3042
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :3042 after 91237
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :2.4836e+120 after 6.71662e+121
ITS-tools command line returned an error code 137
[2025-06-07 20:51:12] [INFO ] Flatten gal took : 353 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15957164765705867068
[2025-06-07 20:51:13] [INFO ] Applying decomposition
[2025-06-07 20:51:13] [INFO ] Computing symmetric may disable matrix : 977 transitions.
[2025-06-07 20:51:13] [INFO ] Flatten gal took : 307 ms
[2025-06-07 20:51:13] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 20:51:13] [INFO ] Computing symmetric may enable matrix : 977 transitions.
[2025-06-07 20:51:13] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 20:51:16] [INFO ] Computing Do-Not-Accords matrix : 977 transitions.
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/graph3483566519631327536.txt' '-o' '/tmp/graph3483566519631327536.bin' '-w' '/tmp/graph3483566519631327536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3483566519631327536.bin' '-l' '-1' '-v' '-w' '/tmp/graph3483566519631327536.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:51:16] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 20:51:16] [INFO ] Decomposing Gal with order
[2025-06-07 20:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:51:17] [INFO ] Built C files in 3852ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15957164765705867068
Running compilation step : cd /tmp/ltsmin15957164765705867068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '90' '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-07 20:51:17] [INFO ] Removed a total of 483 redundant transitions.
[2025-06-07 20:51:17] [INFO ] Flatten gal took : 246 ms
[2025-06-07 20:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 68 ms.
[2025-06-07 20:51:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11019945164733203319.gal : 18 ms
[2025-06-07 20:51:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3486123980680330138.prop : 2 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/ReachabilityCardinality11019945164733203319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3486123980680330138.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 ...308
Loading property file /tmp/ReachabilityCardinality3486123980680330138.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 78
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :78 after 498
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :498 after 1.45168e+06
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1.45168e+06 after 3.52751e+09
Compilation finished in 3278 ms.
Running link step : cd /tmp/ltsmin15957164765705867068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202500==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202504==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202505==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202505==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202506==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202506==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202508==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202511==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202511==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202512==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202512==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202500==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202504==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202504==true'
Running LTSmin : cd /tmp/ltsmin15957164765705867068;'/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' 'ShieldPPPtPT040BReachabilityCardinality202505==true'
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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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-174894533600918"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 ;