Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532700406.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 ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532700406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 846K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2023-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749096196033

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 04:03:17] [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-05 04:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 04:03:17] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-06-05 04:03:17] [INFO ] Transformed 3003 places.
[2025-06-05 04:03:17] [INFO ] Transformed 2953 transitions.
[2025-06-05 04:03:17] [INFO ] Found NUPN structural information;
[2025-06-05 04:03:17] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 04:03:18] [INFO ] Flatten gal took : 282 ms
RANDOM walk for 40000 steps (8 resets) in 2283 ms. (17 steps per ms) remains 6/14 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 6/6 properties
[2025-06-05 04:03:18] [INFO ] Flatten gal took : 191 ms
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
[2025-06-05 04:03:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17649032311030212226.gal : 132 ms
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
[2025-06-05 04:03:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13296074200514946316.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/ReachabilityCardinality17649032311030212226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13296074200514946316.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 ...330
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
// Phase 1: matrix 2953 rows 3003 cols
[2025-06-05 04:03:19] [INFO ] Computed 451 invariants in 69 ms
Loading property file /tmp/ReachabilityCardinality13296074200514946316.prop.
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/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 715/774 variables, 81/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 715/855 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2229/3003 variables, 370/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3003 variables, 2229/3454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 0/3454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2953/5956 variables, 3003/6457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5956/5956 variables, and 6457 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3469 ms.
Refiners :[Domain max(s): 3003/3003 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3003/3003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 715/774 variables, 81/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 715/855 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:23] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:23] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:23] [INFO ] Deduced a trap composed of 60 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-05 04:03:23] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 4/859 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 73
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :73 after 432
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :432 after 616
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :616 after 1.18742e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.18742e+08 after 5.73678e+13
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :5.73678e+13 after 5.07018e+29
At refinement iteration 6 (OVERLAPS) 2229/3003 variables, 370/1229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5.07018e+29 after 3.24054e+60
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 2229/3458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :3.24054e+60 after 4.27783e+135
Invariant property ShieldIIPs-PT-050B-ReachabilityCardinality-2025-08 does not hold.
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldIIPs-PT-050B-ReachabilityCardinality-2025-07 does not hold.
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.27783e+135 after 7.82015e+137
[2025-06-05 04:03:25] [INFO ] Deduced a trap composed of 16 places in 683 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :7.82015e+137 after 7.82015e+137
[2025-06-05 04:03:25] [INFO ] Deduced a trap composed of 17 places in 572 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :7.82015e+137 after 7.82015e+137
[2025-06-05 04:03:26] [INFO ] Deduced a trap composed of 17 places in 577 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:27] [INFO ] Deduced a trap composed of 18 places in 565 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:27] [INFO ] Deduced a trap composed of 18 places in 549 ms of which 48 ms to minimize.
SMT process timed out in 8860ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 3003 transition count 2714
Reduce places removed 239 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 481 place count 2764 transition count 2711
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 484 place count 2761 transition count 2711
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 484 place count 2761 transition count 2466
Deduced a syphon composed of 245 places in 8 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 974 place count 2516 transition count 2466
Discarding 334 places :
Symmetric choice reduction at 3 with 334 rule applications. Total rules 1308 place count 2182 transition count 2132
Iterating global reduction 3 with 334 rules applied. Total rules applied 1642 place count 2182 transition count 2132
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 138 Pre rules applied. Total rules applied 1642 place count 2182 transition count 1994
Deduced a syphon composed of 138 places in 16 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 1918 place count 2044 transition count 1994
Performed 731 Post agglomeration using F-continuation condition.Transition count delta: 731
Deduced a syphon composed of 731 places in 4 ms
Reduce places removed 731 places and 0 transitions.
Iterating global reduction 3 with 1462 rules applied. Total rules applied 3380 place count 1313 transition count 1263
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 331 times.
Drop transitions (Partial Free agglomeration) removed 331 transitions
Iterating global reduction 3 with 331 rules applied. Total rules applied 3711 place count 1313 transition count 1263
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :7.82015e+137 after 7.82015e+137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3712 place count 1312 transition count 1262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3713 place count 1311 transition count 1262
Applied a total of 3713 rules in 1016 ms. Remains 1311 /3003 variables (removed 1692) and now considering 1262/2953 (removed 1691) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 1311/3003 places, 1262/2953 transitions.
RANDOM walk for 40000 steps (8 resets) in 1079 ms. (37 steps per ms) remains 3/4 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
// Phase 1: matrix 1262 rows 1311 cols
[2025-06-05 04:03:29] [INFO ] Computed 450 invariants in 56 ms
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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 240/295 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 93/388 variables, 37/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/390 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 583/973 variables, 390/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 696/1669 variables, 363/868 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1669 variables, 116/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1669 variables, 2/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1669 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 10/1679 variables, 10/996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1679 variables, 10/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1679 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/1693 variables, 7/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1693 variables, 10/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1693 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/1697 variables, 2/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1697 variables, 4/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1697 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 465/2162 variables, 267/1296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2162 variables, 81/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2162 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 10/2172 variables, 17/1394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2172 variables, 10/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2172 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 4/2176 variables, 2/1406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2176 variables, 2/1408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2176 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/2178 variables, 1/1409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2178 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 249/2427 variables, 148/1557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2427 variables, 40/1597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2427 variables, 1/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2427 variables, 0/1598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 10/2437 variables, 14/1612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2437 variables, 10/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2437 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 10/2447 variables, 5/1627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2447 variables, 10/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2447 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 96/2543 variables, 64/1701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2543 variables, 25/1726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2543 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 2/2545 variables, 3/1729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2545 variables, 2/1731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2545 variables, 0/1731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 2/2547 variables, 1/1732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2547 variables, 2/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2547 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 20/2567 variables, 14/1748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2567 variables, 4/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2567 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 1/2568 variables, 2/1754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2568 variables, 1/1755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2568 variables, 0/1755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 5/2573 variables, 4/1759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2573 variables, 2/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2573 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 0/2573 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2573/2573 variables, and 1761 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 443/443 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1311/1311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 240/295 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:32] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:32] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 93/388 variables, 37/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:32] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:32] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/390 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 583/973 variables, 390/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 696/1669 variables, 363/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1669 variables, 116/989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1669 variables, 2/991 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1669 variables, 3/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:33] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:33] [INFO ] Deduced a trap composed of 5 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-05 04:03:33] [INFO ] Deduced a trap composed of 4 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-05 04:03:33] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:33] [INFO ] Deduced a trap composed of 5 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-05 04:03:33] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [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-05 04:03:34] [INFO ] Deduced a trap composed of 6 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-05 04:03:34] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [INFO ] Deduced a trap composed of 6 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-05 04:03:34] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:34] [INFO ] Deduced a trap composed of 7 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-05 04:03:35] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:35] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 131072
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :7.82015e+137 after 7.82015e+137
[2025-06-05 04:03:35] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:35] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1669 variables, 19/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:35] [INFO ] Deduced a trap composed of 4 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-05 04:03:35] [INFO ] Deduced a trap composed of 6 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-05 04:03:35] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:35] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1669 variables, 6/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1669 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:36] [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-05 04:03:36] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1669 variables, 4/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1669 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:37] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1669 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1669 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 10/1679 variables, 10/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1679 variables, 10/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:37] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1679 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1679 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 14/1693 variables, 7/1054 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1693 variables, 10/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:38] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 8 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1693 variables, 1/1065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1693 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 4/1697 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1697 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1697 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 465/2162 variables, 267/1338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2162 variables, 81/1419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:39] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:39] [INFO ] Deduced a trap composed of 4 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-05 04:03:39] [INFO ] Deduced a trap composed of 4 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-05 04:03:39] [INFO ] Deduced a trap composed of 4 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-05 04:03:39] [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-05 04:03:39] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:40] [INFO ] Deduced a trap composed of 4 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-05 04:03:40] [INFO ] Deduced a trap composed of 5 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-05 04:03:40] [INFO ] Deduced a trap composed of 10 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-05 04:03:40] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 5 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2162 variables, 10/1429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:40] [INFO ] Deduced a trap composed of 9 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-05 04:03:40] [INFO ] Deduced a trap composed of 5 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-05 04:03:40] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2162 variables, 3/1432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:41] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:41] [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-05 04:03:41] [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-05 04:03:41] [INFO ] Deduced a trap along path composed of 3 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-05 04:03:41] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/2162 variables, 5/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2162 variables, 1/1438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:42] [INFO ] Deduced a trap composed of 5 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-05 04:03:42] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 4 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2162 variables, 2/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:42] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2162 variables, 1/1441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2162 variables, 0/1441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 10/2172 variables, 17/1458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2172 variables, 10/1468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:43] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2172 variables, 1/1469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2172 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 4/2176 variables, 2/1471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2176 variables, 2/1473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2176 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 2/2178 variables, 1/1474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:45] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2178 variables, 1/1475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2178 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 249/2427 variables, 148/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2427 variables, 40/1663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2427 variables, 1/1664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:46] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:46] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 6 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/2427 variables, 2/1666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2427 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 10/2437 variables, 14/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2437 variables, 10/1690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:46] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 4 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/2437 variables, 1/1691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:47] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/2437 variables, 1/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2437 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 10/2447 variables, 5/1697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2447 variables, 10/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :7.82015e+137 after 7.82015e+137
At refinement iteration 64 (INCLUDED_ONLY) 0/2447 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 96/2543 variables, 64/1771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2543 variables, 25/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:48] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:49] [INFO ] Deduced a trap composed of 4 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-05 04:03:49] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:49] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:49] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 6 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/2543 variables, 8/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:50] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 9 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/2543 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:50] [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-05 04:03:50] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:51] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/2543 variables, 3/1808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:51] [INFO ] Deduced a trap composed of 6 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-05 04:03:51] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 5 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/2543 variables, 2/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:52] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 71 (INCLUDED_ONLY) 0/2543 variables, 1/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2543 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 2/2545 variables, 3/1814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2545 variables, 2/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:53] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:53] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:53] [INFO ] Deduced a trap composed of 7 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-05 04:03:53] [INFO ] Deduced a trap composed of 7 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-05 04:03:53] [INFO ] Deduced a trap composed of 11 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-05 04:03:54] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 5 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/2545 variables, 6/1822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:54] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:54] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/2545 variables, 2/1824 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:55] [INFO ] Deduced a trap composed of 4 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-05 04:03:55] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:55] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:55] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:55] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:55] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:56] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 6 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/2545 variables, 7/1831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:56] [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-05 04:03:56] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/2545 variables, 2/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2545 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 2/2547 variables, 1/1834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2547 variables, 2/1836 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:58] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 8 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/2547 variables, 1/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2547 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 20/2567 variables, 14/1851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2567 variables, 4/1855 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:59] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/2567 variables, 1/1856 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:59] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:03:59] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
At refinement iteration 87 (INCLUDED_ONLY) 0/2567 variables, 2/1858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/2567 variables, 1/1859 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2567 variables, 0/1859 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 1/2568 variables, 2/1861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2568 variables, 1/1862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:01] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:01] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 6 ms to minimize.
At refinement iteration 92 (INCLUDED_ONLY) 0/2568 variables, 2/1864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2568 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 5/2573 variables, 4/1868 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2573 variables, 2/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:02] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 5 ms to minimize.
At refinement iteration 96 (INCLUDED_ONLY) 0/2573 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2573 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (OVERLAPS) 0/2573 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2573/2573 variables, and 1871 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31527 ms.
Refiners :[Positive P Invariants (semi-flows): 443/443 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1311/1311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 21/21 constraints]
After SMT, in 34077ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2416 ms.
Support contains 42 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 1262/1262 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1311 transition count 1259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1308 transition count 1259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1308 transition count 1258
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1307 transition count 1258
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 1298 transition count 1249
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 1298 transition count 1249
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 1293 transition count 1244
Applied a total of 34 rules in 290 ms. Remains 1293 /1311 variables (removed 18) and now considering 1244/1262 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 1293/1311 places, 1244/1262 transitions.
RANDOM walk for 40000 steps (8 resets) in 719 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 545 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 120081 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 120081 steps, saw 73148 distinct states, run finished after 3008 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 1244 rows 1293 cols
[2025-06-05 04:04:09] [INFO ] Computed 450 invariants in 42 ms
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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 186/228 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 76/304 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 471/775 variables, 304/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 639/1414 variables, 329/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 107/832 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1414 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/1420 variables, 6/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1420 variables, 6/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1420 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1428 variables, 4/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1428 variables, 6/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1428 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/1432 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1432 variables, 4/862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1432 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 482/1914 variables, 265/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1914 variables, 79/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1914 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 10/1924 variables, 18/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1924 variables, 10/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1924 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 4/1928 variables, 2/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1928 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 291/2219 variables, 166/1402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2219 variables, 48/1450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2219 variables, 1/1451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2219 variables, 0/1451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 10/2229 variables, 12/1463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2229 variables, 10/1473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2229 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 14/2243 variables, 7/1480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2243 variables, 14/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2243 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 151/2394 variables, 86/1580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2394 variables, 31/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2394 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 3/2397 variables, 4/1615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2397 variables, 3/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2397 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 4/2401 variables, 2/1620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2401 variables, 2/1622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2401 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 84/2485 variables, 50/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2485 variables, 14/1686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2485 variables, 0/1686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 3/2488 variables, 4/1690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2488 variables, 3/1693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2488 variables, 0/1693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 4/2492 variables, 2/1695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2492 variables, 4/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2492 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 37/2529 variables, 24/1723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2529 variables, 9/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2529 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 1/2530 variables, 1/1733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2530 variables, 1/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2530 variables, 0/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/2532 variables, 1/1735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2532 variables, 2/1737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2532 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 5/2537 variables, 4/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2537 variables, 2/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2537 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 0/2537 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2537/2537 variables, and 1743 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 445/445 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 1293/1293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 186/228 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:11] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/304 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 471/775 variables, 304/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 639/1414 variables, 329/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1414 variables, 107/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1414 variables, 2/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1414 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:12] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:12] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:12] [INFO ] Deduced a trap composed of 4 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-05 04:04:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:13] [INFO ] Deduced a trap composed of 4 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-05 04:04:13] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:13] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:13] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:13] [INFO ] Deduced a trap composed of 5 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-05 04:04:13] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:13] [INFO ] Deduced a trap composed of 5 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-05 04:04:13] [INFO ] Deduced a trap composed of 4 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-05 04:04:13] [INFO ] Deduced a trap composed of 4 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-05 04:04:14] [INFO ] Deduced a trap composed of 4 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-05 04:04:14] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:14] [INFO ] Deduced a trap composed of 4 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-05 04:04:14] [INFO ] Deduced a trap composed of 4 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-05 04:04:14] [INFO ] Deduced a trap composed of 4 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-05 04:04:14] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1414 variables, 20/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:14] [INFO ] Deduced a trap composed of 5 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-05 04:04:14] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1414 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1414 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/1420 variables, 6/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1420 variables, 6/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1420 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/1428 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1428 variables, 6/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:15] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1428 variables, 2/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1428 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/1432 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1432 variables, 4/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:15] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1432 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1432 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 482/1914 variables, 265/1157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1914 variables, 79/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1914 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 10/1924 variables, 18/1254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1924 variables, 10/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:16] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:16] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:16] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1924 variables, 3/1267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:16] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 4 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1924 variables, 2/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1924 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/1928 variables, 2/1271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1928 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 524288
At refinement iteration 38 (OVERLAPS) 291/2219 variables, 166/1437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2219 variables, 48/1485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2219 variables, 1/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :7.82015e+137 after 7.82015e+137
At refinement iteration 41 (INCLUDED_ONLY) 0/2219 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 10/2229 variables, 12/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2229 variables, 10/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2229 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 14/2243 variables, 7/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2243 variables, 14/1529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 5 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/2243 variables, 1/1530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2243 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 151/2394 variables, 86/1616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2394 variables, 31/1647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:18] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:18] [INFO ] Deduced a trap composed of 8 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-05 04:04:18] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 5 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/2394 variables, 3/1650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2394 variables, 0/1650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 3/2397 variables, 4/1654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2397 variables, 3/1657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2397 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/2401 variables, 2/1659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2401 variables, 2/1661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2401 variables, 0/1661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 84/2485 variables, 50/1711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2485 variables, 14/1725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:20] [INFO ] Deduced a trap composed of 17 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-05 04:04:20] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 5 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/2485 variables, 2/1727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2485 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 3/2488 variables, 4/1731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2488 variables, 3/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:20] [INFO ] Deduced a trap composed of 4 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-05 04:04:20] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 7 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/2488 variables, 2/1736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:21] [INFO ] Deduced a trap composed of 7 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-05 04:04:21] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 7 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/2488 variables, 2/1738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:21] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 5 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/2488 variables, 1/1739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2488 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 4/2492 variables, 2/1741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2492 variables, 4/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2492 variables, 0/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 37/2529 variables, 24/1769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2529 variables, 9/1778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:22] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:22] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:22] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/2529 variables, 3/1781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2529 variables, 0/1781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 1/2530 variables, 1/1782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2530 variables, 1/1783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2530 variables, 0/1783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 2/2532 variables, 1/1784 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2532 variables, 2/1786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2532 variables, 0/1786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 5/2537 variables, 4/1790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2537 variables, 2/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2537 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 0/2537 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2537/2537 variables, and 1792 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12419 ms.
Refiners :[Positive P Invariants (semi-flows): 445/445 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 1293/1293 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14309ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1712 ms.
Support contains 42 out of 1293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1293/1293 places, 1244/1244 transitions.
Applied a total of 0 rules in 44 ms. Remains 1293 /1293 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1293/1293 places, 1244/1244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1293/1293 places, 1244/1244 transitions.
Applied a total of 0 rules in 32 ms. Remains 1293 /1293 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
[2025-06-05 04:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 04:04:26] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-06-05 04:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 04:04:28] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 04:04:28] [INFO ] Redundant transitions in 75 ms returned []
Running 1230 sub problems to find dead transitions.
[2025-06-05 04:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1280 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1280 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:53] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:53] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:57] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:57] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:58] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:58] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:04:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/2537 variables, and 399 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 382/445 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/1293 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1280 variables, 382/382 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1280 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1280 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:08] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:08] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:09] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:09] [INFO ] Deduced a trap composed of 8 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-05 04:05:09] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:10] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1280 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:21] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:21] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:21] [INFO ] Deduced a trap composed of 8 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-05 04:05:21] [INFO ] Deduced a trap composed of 8 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-05 04:05:22] [INFO ] Deduced a trap composed of 8 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-05 04:05:22] [INFO ] Deduced a trap composed of 8 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-05 04:05:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:23] [INFO ] Deduced a trap composed of 8 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-05 04:05:23] [INFO ] Deduced a trap composed of 8 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-05 04:05:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:24] [INFO ] Deduced a trap composed of 8 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-05 04:05:24] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 04:05:24] [INFO ] Deduced a trap composed of 4 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-05 04:05:24] [INFO ] Deduced a trap composed of 8 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-05 04:05:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/2537 variables, and 439 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 382/445 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/1293 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62673 ms. Remains : 1293/1293 places, 1244/1244 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 04:05:28] [INFO ] Flatten gal took : 103 ms
[2025-06-05 04:05:28] [INFO ] Applying decomposition
[2025-06-05 04:05:29] [INFO ] Flatten gal took : 84 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/graph10879948257943406367.txt' '-o' '/tmp/graph10879948257943406367.bin' '-w' '/tmp/graph10879948257943406367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10879948257943406367.bin' '-l' '-1' '-v' '-w' '/tmp/graph10879948257943406367.weights' '-q' '0' '-e' '0.001'
[2025-06-05 04:05:29] [INFO ] Decomposing Gal with order
[2025-06-05 04:05:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 04:05:29] [INFO ] Removed a total of 1150 redundant transitions.
[2025-06-05 04:05:30] [INFO ] Flatten gal took : 202 ms
[2025-06-05 04:05:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 44 ms.
[2025-06-05 04:05:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5053068591120055350.gal : 34 ms
[2025-06-05 04:05:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10350492144040329055.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/ReachabilityCardinality5053068591120055350.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10350492144040329055.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/ReachabilityCardinality10350492144040329055.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 263
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5.01115e+06 after 7.40819e+22
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.54087e+140 after 1.70574e+140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.70574e+140 after 2.31855e+140
Detected timeout of ITS tools.
[2025-06-05 04:35:35] [INFO ] Flatten gal took : 567 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18430405709326416424
[2025-06-05 04:35:35] [INFO ] Computing symmetric may disable matrix : 1244 transitions.
[2025-06-05 04:35:35] [INFO ] Applying decomposition
[2025-06-05 04:35:35] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 04:35:35] [INFO ] Computing symmetric may enable matrix : 1244 transitions.
[2025-06-05 04:35:35] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 04:35:35] [INFO ] Flatten gal took : 279 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/graph1908689754122450504.txt' '-o' '/tmp/graph1908689754122450504.bin' '-w' '/tmp/graph1908689754122450504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1908689754122450504.bin' '-l' '-1' '-v' '-w' '/tmp/graph1908689754122450504.weights' '-q' '0' '-e' '0.001'
[2025-06-05 04:35:37] [INFO ] Decomposing Gal with order
[2025-06-05 04:35:37] [INFO ] Computing Do-Not-Accords matrix : 1244 transitions.
[2025-06-05 04:35:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 04:35:37] [INFO ] Computation of Completed DNA matrix. took 240 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 04:35:37] [INFO ] Built C files in 2080ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18430405709326416424
Running compilation step : cd /tmp/ltsmin18430405709326416424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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-05 04:35:37] [INFO ] Removed a total of 958 redundant transitions.
[2025-06-05 04:35:37] [INFO ] Flatten gal took : 91 ms
[2025-06-05 04:35:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1031 labels/synchronizations in 35 ms.
[2025-06-05 04:35:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6511545779129090597.gal : 13 ms
[2025-06-05 04:35:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8225875437194651934.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/ReachabilityCardinality6511545779129090597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8225875437194651934.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/ReachabilityCardinality8225875437194651934.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2 after 1944
Compilation finished in 70050 ms.
Running link step : cd /tmp/ltsmin18430405709326416424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin18430405709326416424;'/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' 'ShieldIIPsPT050BReachabilityCardinality202304==true'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18430405709326416424;'/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' 'ShieldIIPsPT050BReachabilityCardinality202304==true'
Running LTSmin : cd /tmp/ltsmin18430405709326416424;'/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' 'ShieldIIPsPT050BReachabilityCardinality202513==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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894532700406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;