fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r030-smll-174853813200070
Last Updated
June 24, 2025

About the Execution of ITS-Tools for BusinessProcesses-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 507278.00 0.00 0.00 TTTFTTTTFFTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200070.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 BusinessProcesses-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 104K 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 BusinessProcesses-PT-09-ReachabilityCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748566133838

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 00:48:56] [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-05-30 00:48:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:48:56] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2025-05-30 00:48:56] [INFO ] Transformed 403 places.
[2025-05-30 00:48:56] [INFO ] Transformed 374 transitions.
[2025-05-30 00:48:56] [INFO ] Found NUPN structural information;
[2025-05-30 00:48:56] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (410 resets) in 2321 ms. (17 steps per ms) remains 4/15 properties
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 00:48:57] [INFO ] Flatten gal took : 151 ms
[2025-05-30 00:48:57] [INFO ] Flatten gal took : 138 ms
BEST_FIRST walk for 40002 steps (78 resets) in 590 ms. (67 steps per ms) remains 4/4 properties
[2025-05-30 00:48:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7178641790687135051.gal : 76 ms
[2025-05-30 00:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1146718439089245767.prop : 13 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/ReachabilityCardinality7178641790687135051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1146718439089245767.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (105 resets) in 511 ms. (78 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (79 resets) in 777 ms. (51 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality1146718439089245767.prop.
BEST_FIRST walk for 40003 steps (79 resets) in 546 ms. (73 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 28
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :28 after 41
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :41 after 265
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :265 after 637
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :637 after 1141
// Phase 1: matrix 374 rows 403 cols
[2025-05-30 00:48:58] [INFO ] Computed 65 invariants in 49 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1141 after 9576
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :9576 after 572789
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :572789 after 9.12366e+09
At refinement iteration 2 (OVERLAPS) 232/280 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 37/317 variables, 11/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 37/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9.12366e+09 after 9.13085e+09
Problem BusinessProcesses-PT-09-ReachabilityCardinality-2025-13 is UNSAT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 85/402 variables, 27/381 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 85/466 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/403 variables, 1/467 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 374/777 variables, 403/871 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/777 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/777 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 871 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2351 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :9.13085e+09 after 9.68038e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 235/277 variables, 25/67 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 235/302 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 1/303 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:01] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:01] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:02] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:02] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:02] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:02] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:02] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:03] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:04] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 20/323 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:05] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:06] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:06] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 31 ms to minimize.
SMT process timed out in 7676ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 194 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 395 transition count 299
Reduce places removed 66 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 75 rules applied. Total rules applied 143 place count 329 transition count 290
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 152 place count 320 transition count 290
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 152 place count 320 transition count 240
Deduced a syphon composed of 50 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 259 place count 263 transition count 240
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 294 place count 228 transition count 205
Iterating global reduction 3 with 35 rules applied. Total rules applied 329 place count 228 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 329 place count 228 transition count 201
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 338 place count 223 transition count 201
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 440 place count 172 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 171 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 171 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 446 place count 169 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 449 place count 169 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 450 place count 168 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 451 place count 167 transition count 149
Applied a total of 451 rules in 292 ms. Remains 167 /403 variables (removed 236) and now considering 149/374 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 167/403 places, 149/374 transitions.
RANDOM walk for 40000 steps (1007 resets) in 456 ms. (87 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (166 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (309 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
// Phase 1: matrix 149 rows 167 cols
[2025-05-30 00:49:06] [INFO ] Computed 55 invariants in 7 ms
[2025-05-30 00:49:06] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/95 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/131 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/166 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 149/315 variables, 166/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/316 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 167/167 constraints, ReadFeed: 3/3 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/95 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 4 ms to minimize.
Problem BusinessProcesses-PT-09-ReachabilityCardinality-2025-01 is UNSAT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 36/131 variables, 21/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:07] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/166 variables, 20/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/315 variables, 166/229 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 3/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 1/233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/316 variables, 1/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:08] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 1/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/316 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 235 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 167/167 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1416ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 17 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 149/149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 167 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 165 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 165 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 161 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 160 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 160 transition count 142
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 143 transition count 127
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 143 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 141 transition count 125
Applied a total of 50 rules in 51 ms. Remains 141 /167 variables (removed 26) and now considering 125/149 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 141/167 places, 125/149 transitions.
RANDOM walk for 40000 steps (2389 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (587 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1044534 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1044534 steps, saw 290821 distinct states, run finished after 3011 ms. (steps per millisecond=346 ) properties seen :0
// Phase 1: matrix 125 rows 141 cols
[2025-05-30 00:49:11] [INFO ] Computed 53 invariants in 8 ms
[2025-05-30 00:49:11] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/119 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/121 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 121/242 variables, 121/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/265 variables, 19/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/266 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/266 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/141 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/119 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:11] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:11] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/121 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/242 variables, 121/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/265 variables, 19/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 9/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/266 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/266 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/266 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 141/141 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 17 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 141/141 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2025-05-30 00:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:12] [INFO ] Implicit Places using invariants in 191 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 27, 29, 31, 38, 40, 42, 44, 45, 46, 47, 48, 49, 50, 99]
[2025-05-30 00:49:12] [INFO ] Actually due to overlaps returned [2, 0, 1, 3, 4, 12, 14, 27, 38, 42, 45, 46, 47, 48, 49, 50, 99]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 206 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/141 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 118 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 110
Applied a total of 12 rules in 12 ms. Remains 118 /124 variables (removed 6) and now considering 110/125 (removed 15) transitions.
// Phase 1: matrix 110 rows 118 cols
[2025-05-30 00:49:12] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:12] [INFO ] Implicit Places using invariants in 167 ms returned [6, 20, 22]
[2025-05-30 00:49:12] [INFO ] Actually due to overlaps returned [6, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 116/141 places, 110/125 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 114 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 113 transition count 101
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 113 transition count 101
Applied a total of 11 rules in 30 ms. Remains 113 /116 variables (removed 3) and now considering 101/110 (removed 9) transitions.
// Phase 1: matrix 101 rows 113 cols
[2025-05-30 00:49:12] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:12] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 00:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 00:49:13] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [12, 54, 56, 60, 62, 64]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 574 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 107/141 places, 101/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 105 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 103 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 103 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 102 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 102 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 101 transition count 89
Applied a total of 12 rules in 28 ms. Remains 101 /107 variables (removed 6) and now considering 89/101 (removed 12) transitions.
// Phase 1: matrix 89 rows 101 cols
[2025-05-30 00:49:13] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 00:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 00:49:13] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 101/141 places, 89/125 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1356 ms. Remains : 101/141 places, 89/125 transitions.
RANDOM walk for 40000 steps (2346 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (545 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1839208 steps, run timeout after 3001 ms. (steps per millisecond=612 ) properties seen :0 out of 1
Probabilistic random walk after 1839208 steps, saw 497606 distinct states, run finished after 3001 ms. (steps per millisecond=612 ) properties seen :0
[2025-05-30 00:49:16] [INFO ] Invariant cache hit.
[2025-05-30 00:49:16] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/66 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/84 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/86 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/169 variables, 86/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/187 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/190 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/190 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/66 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/84 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/86 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/169 variables, 86/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/187 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/190 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/190 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 17 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 89/89 transitions.
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/101 places, 89/89 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 89/89 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-05-30 00:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:17] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-30 00:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:49:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 00:49:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:49:17] [INFO ] Redundant transitions in 3 ms returned []
Running 85 sub problems to find dead transitions.
[2025-05-30 00:49:17] [INFO ] Invariant cache hit.
[2025-05-30 00:49:17] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:18] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:19] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:20] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:21] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 6 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 6/65 constraints. Problems are: Problem set: 1 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:23] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/85 constraints. Problems are: Problem set: 1 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:24] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:24] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:24] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:24] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:24] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/90 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 2/100 variables, 7/97 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 2/99 constraints. Problems are: Problem set: 1 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:25] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:26] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 7 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 20/119 constraints. Problems are: Problem set: 4 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:27] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:28] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 7 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 20/139 constraints. Problems are: Problem set: 7 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:29] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:30] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 20/159 constraints. Problems are: Problem set: 7 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 6 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 4/163 constraints. Problems are: Problem set: 8 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:31] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 7 ms to minimize.
Problem TDEAD46 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 5/168 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/168 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 89/189 variables, 100/268 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 3/271 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:33] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 9 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 1/272 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:33] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:34] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/189 variables, 2/274 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/274 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 21 (OVERLAPS) 1/190 variables, 1/275 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/190 variables, 0/275 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 23 (OVERLAPS) 0/190 variables, 0/275 constraints. Problems are: Problem set: 9 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 275 constraints, problems are : Problem set: 9 solved, 76 unsolved in 19316 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 143/143 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 9/9 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 9/18 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 131/149 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/149 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 8/157 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/159 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/171 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:37] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:37] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 3/174 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/174 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 89/189 variables, 100/274 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 3/277 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 76/353 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:41] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/354 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/355 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:46] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 1/356 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:48] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:48] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 2/358 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 0/358 constraints. Problems are: Problem set: 9 solved, 76 unsolved
At refinement iteration 17 (OVERLAPS) 1/190 variables, 1/359 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:59] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:49:59] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 2/361 constraints. Problems are: Problem set: 9 solved, 76 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 361 constraints, problems are : Problem set: 9 solved, 76 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 101/101 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 76/85 constraints, Known Traps: 152/152 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49407ms problems are : Problem set: 9 solved, 76 unsolved
Search for dead transitions found 9 dead transitions in 49410ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 80/89 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 98 transition count 79
Applied a total of 4 rules in 9 ms. Remains 98 /101 variables (removed 3) and now considering 79/80 (removed 1) transitions.
// Phase 1: matrix 79 rows 98 cols
[2025-05-30 00:50:07] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants in 123 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/101 places, 79/89 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 78
Applied a total of 2 rules in 11 ms. Remains 96 /97 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 96 cols
[2025-05-30 00:50:07] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 00:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 288 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 94/101 places, 78/89 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 91 transition count 75
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 90 transition count 74
Applied a total of 8 rules in 17 ms. Remains 90 /94 variables (removed 4) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 90 cols
[2025-05-30 00:50:07] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants in 100 ms returned [16, 75, 81, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 86/101 places, 74/89 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 84 transition count 72
Applied a total of 4 rules in 8 ms. Remains 84 /86 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 84 cols
[2025-05-30 00:50:07] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 00:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:07] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 84/101 places, 72/89 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 50579 ms. Remains : 84/101 places, 72/89 transitions.
RANDOM walk for 40000 steps (4129 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (741 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2181311 steps, run timeout after 3001 ms. (steps per millisecond=726 ) properties seen :0 out of 1
Probabilistic random walk after 2181311 steps, saw 523659 distinct states, run finished after 3001 ms. (steps per millisecond=726 ) properties seen :0
[2025-05-30 00:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/71 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/137 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/153 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/156 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/69 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/71 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/137 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/153 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/153 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/153 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/156 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/156 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-30 00:50:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-30 00:50:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:50:11] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:50:11] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2025-05-30 00:50:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:12] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:12] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:12] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:12] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 2/83 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:13] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:13] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:13] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:13] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:14] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:14] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:14] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 72/155 variables, 83/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:16] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:17] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:18] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:18] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:18] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 16 (OVERLAPS) 1/156 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:19] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:20] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:21] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:21] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:21] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:22] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:22] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:22] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:22] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/156 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:23] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/156 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:25] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 5 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/156 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/156 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:27] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:27] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/156 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/156 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:28] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:28] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 6 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/156 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/156 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:29] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 6 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/156 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/156 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 31 (OVERLAPS) 0/156 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 171 constraints, problems are : Problem set: 0 solved, 67 unsolved in 19159 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 2/83 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:31] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:32] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 72/155 variables, 83/176 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 67/243 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:33] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:34] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:35] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:36] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 18 (OVERLAPS) 1/156 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:42] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:42] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:50:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 5 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/156 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/156 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 22 (OVERLAPS) 0/156 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 254 constraints, problems are : Problem set: 0 solved, 67 unsolved in 19469 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38652ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 38653ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38867 ms. Remains : 84/84 places, 72/72 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 84 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 80 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 79 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 79 transition count 66
Applied a total of 14 rules in 11 ms. Remains 79 /84 variables (removed 5) and now considering 66/72 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 79 cols
[2025-05-30 00:50:50] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 00:50:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 00:50:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-05-30 00:50:50] [INFO ] [Nat]Absence check using 14 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-30 00:50:50] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-05-30 00:50:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 00:50:50] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 00:50:50] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 00:50:50] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-30 00:50:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 00:50:50] [INFO ] Flatten gal took : 8 ms
[2025-05-30 00:50:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5513112457042514724.gal : 7 ms
[2025-05-30 00:50:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1170254935476711582.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/ReachabilityCardinality5513112457042514724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1170254935476711582.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1170254935476711582.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 132
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :132 after 522
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :522 after 1656
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1656 after 3302
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3302 after 10728
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10728 after 42246
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-2025-15 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,127196,0.643879,9624,2,2908,15,24822,6,0,378,25034,0
Total reachable state count : 127196

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-2025-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-09-ReachabilityCardinality-2025-15,2,0.848779,9624,2,81,15,24822,7,0,425,25034,0
Over-approximation ignoring read arcs solved 0 properties in 1102 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 00:50:51] [INFO ] Flatten gal took : 33 ms
[2025-05-30 00:50:51] [INFO ] Applying decomposition
[2025-05-30 00:50:51] [INFO ] Flatten gal took : 31 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/graph4658401270552969275.txt' '-o' '/tmp/graph4658401270552969275.bin' '-w' '/tmp/graph4658401270552969275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4658401270552969275.bin' '-l' '-1' '-v' '-w' '/tmp/graph4658401270552969275.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:50:51] [INFO ] Decomposing Gal with order
[2025-05-30 00:50:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:50:51] [INFO ] Removed a total of 235 redundant transitions.
[2025-05-30 00:50:51] [INFO ] Flatten gal took : 121 ms
[2025-05-30 00:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-05-30 00:50:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8775485098456632952.gal : 16 ms
[2025-05-30 00:50:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7409390966902919793.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/ReachabilityCardinality8775485098456632952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7409390966902919793.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/ReachabilityCardinality7409390966902919793.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 2253
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2253 after 52317
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.5795e+06 after 2.25277e+17
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-2025-15 does not hold.
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.52257e+18,387.962,4535168,140866,64,7.00771e+06,662,946,1.31617e+07,68,1964,0
Total reachable state count : 7522568986194230709

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-09-ReachabilityCardinality-2025-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-09-ReachabilityCardinality-2025-15,1.30917e+13,388.344,4535168,222,20,7.00771e+06,662,1022,1.31617e+07,80,1964,0
All properties solved without resorting to model-checking.
Total runtime 504719 ms.

BK_STOP 1748566641116

--------------------
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="BusinessProcesses-PT-09"
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 BusinessProcesses-PT-09, 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 r030-smll-174853813200070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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