About the Execution of ITS-Tools for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFTTFF??F?FFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889263700188.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 ResAllocation-PT-R100C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889263700188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748973388818
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 17:56:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:56:30] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2025-06-03 17:56:30] [INFO ] Transformed 400 places.
[2025-06-03 17:56:30] [INFO ] Transformed 202 transitions.
[2025-06-03 17:56:30] [INFO ] Found NUPN structural information;
[2025-06-03 17:56:30] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R100C002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 35 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2025-06-03 17:56:30] [INFO ] Computed 200 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:30] [INFO ] Implicit Places using invariants in 528 ms returned [201, 203, 207, 209, 211, 215, 217, 219, 221, 225, 227, 229, 231, 233, 237, 241, 243, 251, 253, 255, 257, 259, 261, 263, 265, 267, 271, 273, 275, 277, 281, 283, 285, 287, 289, 291, 293, 295, 297, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 321, 325, 327, 329, 331, 333, 337, 339, 341, 343, 345, 347, 351, 353, 355, 357, 359, 361, 363, 365, 369, 371, 373, 375, 377, 379, 383, 385, 389, 391, 395, 397, 399]
Discarding 82 places :
Implicit Place search using SMT only with invariants took 572 ms to find 82 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 318/400 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 318/400 places, 202/202 transitions.
Support contains 73 out of 318 places after structural reductions.
[2025-06-03 17:56:31] [INFO ] Flatten gal took : 41 ms
[2025-06-03 17:56:31] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:56:31] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (12 resets) in 1669 ms. (23 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 17:56:32] [INFO ] Computed 118 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 39/68 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 58/127 variables, 69/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 76/203 variables, 50/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 50/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 18/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 47/250 variables, 31/316 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 31/347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 35/285 variables, 21/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/285 variables, 21/400 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/285 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 34/319 variables, 22/429 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/319 variables, 22/451 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/319 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/319 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 25/344 variables, 15/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/344 variables, 15/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/344 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/344 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 25/369 variables, 15/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/369 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/369 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/369 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 26/395 variables, 16/545 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/395 variables, 16/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/395 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/395 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 19/414 variables, 13/580 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/414 variables, 13/593 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/414 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/414 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 15/429 variables, 9/607 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/429 variables, 9/616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/429 variables, 3/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/429 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 15/444 variables, 9/628 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/444 variables, 9/637 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/444 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/444 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (OVERLAPS) 13/457 variables, 9/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/457 variables, 9/658 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/457 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/457 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (OVERLAPS) 5/462 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/462 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/462 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/462 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (OVERLAPS) 5/467 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/467 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/467 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/467 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (OVERLAPS) 6/473 variables, 4/679 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/473 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/473 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/473 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (OVERLAPS) 5/478 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/478 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/478 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/520 variables, and 692 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5015 ms.
Refiners :[Domain max(s): 292/318 constraints, Positive P Invariants (semi-flows): 108/118 constraints, State Equation: 292/318 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 39/68 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 58/127 variables, 69/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 76/203 variables, 50/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 50/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 18/285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 11/296 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 47/250 variables, 31/327 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 31/358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 11/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 35/285 variables, 21/390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/285 variables, 21/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/285 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/285 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/285 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 34/319 variables, 22/443 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/319 variables, 22/465 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/319 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/319 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/319 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 25/344 variables, 15/489 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/344 variables, 15/504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/344 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/344 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 25/369 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/369 variables, 15/539 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/369 variables, 5/544 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/369 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/369 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 26/395 variables, 16/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/395 variables, 16/577 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/395 variables, 6/583 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/395 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 19/414 variables, 13/596 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/414 variables, 13/609 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/414 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/414 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (OVERLAPS) 15/429 variables, 9/623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/429 variables, 9/632 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/429 variables, 3/635 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/429 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (OVERLAPS) 15/444 variables, 9/644 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/444 variables, 9/653 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/444 variables, 3/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/444 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (OVERLAPS) 13/457 variables, 9/665 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 10059ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 202/202 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 317 transition count 201
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 317 transition count 199
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 314 transition count 199
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 1 with 2 rules applied. Total rules applied 9 place count 313 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 313 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 311 transition count 197
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 14 place count 310 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 310 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 308 transition count 195
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 3 with 2 rules applied. Total rules applied 19 place count 307 transition count 194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 307 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 23 place count 304 transition count 193
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 4 with 2 rules applied. Total rules applied 25 place count 303 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 303 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 28 place count 301 transition count 191
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 5 with 2 rules applied. Total rules applied 30 place count 300 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 300 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 33 place count 298 transition count 189
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 6 with 2 rules applied. Total rules applied 35 place count 297 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 297 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 39 place count 294 transition count 187
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 7 with 2 rules applied. Total rules applied 41 place count 293 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 42 place count 293 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 44 place count 291 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 46 place count 290 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 47 place count 290 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 49 place count 288 transition count 183
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 9 with 2 rules applied. Total rules applied 51 place count 287 transition count 182
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 52 place count 287 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 55 place count 284 transition count 181
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 10 with 2 rules applied. Total rules applied 57 place count 283 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 58 place count 283 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 60 place count 281 transition count 179
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 11 with 2 rules applied. Total rules applied 62 place count 280 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 63 place count 280 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 65 place count 278 transition count 177
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 12 with 2 rules applied. Total rules applied 67 place count 277 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 68 place count 277 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 70 place count 275 transition count 175
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 13 with 2 rules applied. Total rules applied 72 place count 274 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 73 place count 274 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 75 place count 272 transition count 173
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 14 with 2 rules applied. Total rules applied 77 place count 271 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 78 place count 271 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 80 place count 269 transition count 171
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 15 with 2 rules applied. Total rules applied 82 place count 268 transition count 170
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 83 place count 268 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 85 place count 266 transition count 169
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 16 with 2 rules applied. Total rules applied 87 place count 265 transition count 168
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 88 place count 265 transition count 167
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 91 place count 262 transition count 167
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 17 with 2 rules applied. Total rules applied 93 place count 261 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 94 place count 261 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 96 place count 259 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 98 place count 258 transition count 164
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 99 place count 258 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 101 place count 256 transition count 163
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 19 with 2 rules applied. Total rules applied 103 place count 255 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 104 place count 255 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 106 place count 253 transition count 161
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 20 with 2 rules applied. Total rules applied 108 place count 252 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 109 place count 252 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 111 place count 250 transition count 159
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 21 with 2 rules applied. Total rules applied 113 place count 249 transition count 158
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 114 place count 249 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 116 place count 247 transition count 157
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 22 with 2 rules applied. Total rules applied 118 place count 246 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 119 place count 246 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 121 place count 244 transition count 155
Applied a total of 121 rules in 312 ms. Remains 244 /318 variables (removed 74) and now considering 155/202 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 244/318 places, 155/202 transitions.
RANDOM walk for 40000 steps (24 resets) in 581 ms. (68 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/6 properties
// Phase 1: matrix 155 rows 244 cols
[2025-06-03 17:56:43] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/21 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/42 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 25/67 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 21/88 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/88 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/88 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/88 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 21/109 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/109 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/109 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/109 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 20/129 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/129 variables, 12/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/129 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/129 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 20/149 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/149 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/149 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/149 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 20/169 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/169 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/169 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 20/189 variables, 12/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/189 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/189 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/189 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 15/204 variables, 11/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/204 variables, 11/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/204 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/204 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 10/214 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/214 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/214 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/214 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 10/224 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/224 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/224 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/224 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 10/234 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/234 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/234 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/234 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 10/244 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/244 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/244 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/244 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 10/254 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/254 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/254 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/254 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 11/265 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/265 variables, 7/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/265 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/265 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 10/275 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/275 variables, 6/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/275 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/275 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 11/286 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/286 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/286 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/286 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 10/296 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/296 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/296 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 10/306 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/306 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/306 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/306 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 12/318 variables, 8/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/318 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/318 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/318 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (OVERLAPS) 11/329 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/329 variables, 7/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/329 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/329 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 11/340 variables, 7/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/340 variables, 7/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/340 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/340 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (OVERLAPS) 10/350 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/350 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/350 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/350 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (OVERLAPS) 10/360 variables, 6/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/360 variables, 6/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/360 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/360 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (OVERLAPS) 11/371 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/371 variables, 7/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/371 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/371 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (OVERLAPS) 10/381 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/381 variables, 6/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/381 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/381 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (OVERLAPS) 10/391 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/391 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/391 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/391 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (OVERLAPS) 8/399 variables, 6/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/399 variables, 6/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/399 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/399 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (OVERLAPS) 0/399 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 579 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1889 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/21 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/22 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/42 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 25/67 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 21/88 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/88 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/88 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/88 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 21/109 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/109 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/109 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/109 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 20/129 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/129 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/129 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/129 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/149 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/149 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/149 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/149 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 20/169 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/169 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/169 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/169 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 20/189 variables, 12/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/189 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/189 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/189 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 15/204 variables, 11/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/204 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/204 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/204 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 10/214 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/214 variables, 6/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/214 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/214 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 10/224 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/224 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/224 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/224 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 10/234 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/234 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/234 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/234 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 10/244 variables, 6/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/244 variables, 6/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/244 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/244 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/244 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 10/254 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/254 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/254 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/254 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 11/265 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/265 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/265 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/265 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 10/275 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/275 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/275 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/275 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 11/286 variables, 7/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/286 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/286 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/286 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 10/296 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/296 variables, 6/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/296 variables, 2/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/296 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 10/306 variables, 6/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/306 variables, 6/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/306 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/306 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 12/318 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/318 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/318 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/318 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 11/329 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/329 variables, 7/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/329 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/329 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (OVERLAPS) 11/340 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/340 variables, 7/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/340 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/340 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (OVERLAPS) 10/350 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/350 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/350 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/350 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (OVERLAPS) 10/360 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/360 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/360 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/360 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 104 (OVERLAPS) 11/371 variables, 7/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/371 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/371 variables, 3/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/371 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 108 (OVERLAPS) 10/381 variables, 6/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/381 variables, 6/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/381 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/381 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 112 (OVERLAPS) 10/391 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/391 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/391 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/391 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 116 (OVERLAPS) 8/399 variables, 6/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/399 variables, 6/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/399 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 119 (INCLUDED_ONLY) 0/399 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/399 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 121 (OVERLAPS) 0/399 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 585 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2597 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4495ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 8159 steps, including 37 resets, run visited all 4 properties in 79 ms. (steps per millisecond=103 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 85 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F((p1||X(p2))))&&(p3||F(p4)))))'
Support contains 10 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 17:56:48] [INFO ] Computed 118 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:48] [INFO ] Implicit Places using invariants in 190 ms returned [203, 208, 214, 221, 224, 228, 230, 232, 243, 273, 280, 288, 298, 306, 310, 314]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 192 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 302/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-01
Stuttering criterion allowed to conclude after 2599 steps with 0 reset in 28 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-01 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:56:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:49] [INFO ] Implicit Places using invariants in 188 ms returned [203, 208, 214, 221, 224, 228, 230, 232, 243, 249, 270, 273, 280, 288, 298, 306, 310, 314]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 190 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 300/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Product exploration explored 100000 steps with 33333 reset in 339 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-02 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 316 transition count 200
Applied a total of 4 rules in 28 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2025-06-03 17:56:49] [INFO ] Computed 118 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:50] [INFO ] Implicit Places using invariants in 187 ms returned [201, 206, 212, 222, 226, 228, 241, 247, 268, 271, 278, 286, 296, 304, 308, 312]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 188 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/318 places, 200/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 300/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-03
Product exploration explored 100000 steps with 38 reset in 414 ms.
Product exploration explored 100000 steps with 38 reset in 420 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (12 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 26150 steps, run visited all 4 properties in 373 ms. (steps per millisecond=70 )
Probabilistic random walk after 26150 steps, saw 20387 distinct states, run finished after 376 ms. (steps per millisecond=69 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2025-06-03 17:56:52] [INFO ] Computed 102 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:52] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-03 17:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:56:52] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:56:52] [INFO ] Redundant transitions in 12 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 17:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:54] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:54] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:54] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:56:59] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:01] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:57:06] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 15/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 797 constraints, problems are : Problem set: 0 solved, 198 unsolved in 28497 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 198/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 995 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30026 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58553ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 58554ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59216 ms. Remains : 300/300 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (12 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 26150 steps, run visited all 4 properties in 292 ms. (steps per millisecond=89 )
Probabilistic random walk after 26150 steps, saw 20387 distinct states, run finished after 293 ms. (steps per millisecond=89 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38 reset in 326 ms.
Product exploration explored 100000 steps with 38 reset in 377 ms.
Built C files in :
/tmp/ltsmin5984330616268782323
[2025-06-03 17:57:53] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 17:57:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:57:53] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 17:57:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:57:53] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 17:57:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:57:53] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5984330616268782323
Running compilation step : cd /tmp/ltsmin5984330616268782323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin5984330616268782323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5984330616268782323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11659082999338208480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-03 17:58:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:58:08] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-03 17:58:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:58:09] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:58:09] [INFO ] Redundant transitions in 9 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 17:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:10] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:14] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:15] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:15] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:21] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:23] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:23] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 15/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 797 constraints, problems are : Problem set: 0 solved, 198 unsolved in 28201 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 198/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 995 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30032 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58259ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 58260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58974 ms. Remains : 300/300 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin14452413819814234385
[2025-06-03 17:59:07] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 17:59:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:59:07] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 17:59:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:59:07] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 17:59:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:59:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14452413819814234385
Running compilation step : cd /tmp/ltsmin14452413819814234385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin14452413819814234385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14452413819814234385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11652852033971448138.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 17:59:22] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:59:22] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:59:22] [INFO ] Time to serialize gal into /tmp/LTL16468846151550148357.gal : 4 ms
[2025-06-03 17:59:22] [INFO ] Time to serialize properties into /tmp/LTL2729893936769559932.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16468846151550148357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9394215894113157516.hoa' '-atoms' '/tmp/LTL2729893936769559932.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2729893936769559932.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9394215894113157516.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 17:59:37] [INFO ] Flatten gal took : 29 ms
[2025-06-03 17:59:37] [INFO ] Flatten gal took : 13 ms
[2025-06-03 17:59:37] [INFO ] Time to serialize gal into /tmp/LTL17801776784747063953.gal : 7 ms
[2025-06-03 17:59:37] [INFO ] Time to serialize properties into /tmp/LTL7135401828701267328.ltl : 20 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17801776784747063953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7135401828701267328.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((r_0_17==0)||(r_1_17==0))")||(("(p_1_18==0)")||(G("(((r_0_24==1)&&(r_1_24==1))&&(p_1_25==1))")))))))
Formula 0 simplified : G(F!"(((r_0_24==1)&&(r_1_24==1))&&(p_1_25==1))" & FG(!"((r_0_17==0)||(r_1_17==0))" & !"(p_1_18==0)"))
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 17:59:53] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:59:53] [INFO ] Applying decomposition
[2025-06-03 17:59:53] [INFO ] Flatten gal took : 12 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/graph12571697211215179416.txt' '-o' '/tmp/graph12571697211215179416.bin' '-w' '/tmp/graph12571697211215179416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12571697211215179416.bin' '-l' '-1' '-v' '-w' '/tmp/graph12571697211215179416.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:59:53] [INFO ] Decomposing Gal with order
[2025-06-03 17:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:59:53] [INFO ] Flatten gal took : 80 ms
[2025-06-03 17:59:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 17:59:53] [INFO ] Time to serialize gal into /tmp/LTL2724937705827678045.gal : 5 ms
[2025-06-03 17:59:53] [INFO ] Time to serialize properties into /tmp/LTL18136256341400715682.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2724937705827678045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18136256341400715682.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i3.u16.r_0_17==0)||(i3.u100.r_1_17==0))")||(("(i3.u17.p_1_18==0)")||(G("(((i4.i0.i1.u23.r_0_24==1)&&(i4.i0.i1.u101.r_1_24==...193
Formula 0 simplified : G(F!"(((i4.i0.i1.u23.r_0_24==1)&&(i4.i0.i1.u101.r_1_24==1))&&(i4.i1.i0.u24.p_1_25==1))" & FG(!"((i3.u16.r_0_17==0)||(i3.u100.r_1_17=...186
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i16.t99_t100, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-03 finished in 198407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 316 transition count 200
Applied a total of 4 rules in 8 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2025-06-03 18:00:08] [INFO ] Computed 118 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:00:08] [INFO ] Implicit Places using invariants in 344 ms returned [201, 206, 212, 219, 222, 226, 230, 241, 247, 268, 271, 278, 286, 296, 304, 308, 312]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 345 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/318 places, 200/202 transitions.
Applied a total of 0 rules in 15 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 299/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-04
Stuttering criterion allowed to conclude after 2559 steps with 0 reset in 8 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-04 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p0))||F(p1))&&(F(!p2)||X((X(p0)||G(!p1))))&&(!p1||X(p0))))))'
Support contains 8 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 18:00:08] [INFO ] Computed 118 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:00:09] [INFO ] Implicit Places using invariants in 254 ms returned [203, 208, 214, 221, 224, 228, 230, 232, 243, 249, 270, 280, 288, 298, 306, 310]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 256 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/318 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 302/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 590 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-05
Product exploration explored 100000 steps with 11239 reset in 258 ms.
Product exploration explored 100000 steps with 11144 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 201 ms. Reduced automaton from 16 states, 45 edges and 3 AP (stutter sensitive) to 16 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 633 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
RANDOM walk for 3613 steps (0 resets) in 44 ms. (80 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p0), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 562 ms. Reduced automaton from 16 states, 45 edges and 3 AP (stutter sensitive) to 16 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 551 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
Stuttering acceptance computed with spot in 569 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
// Phase 1: matrix 202 rows 302 cols
[2025-06-03 18:00:12] [INFO ] Computed 102 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:00:13] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2025-06-03 18:00:22] [INFO ] [Real]Absence check using state equation in 9615 ms returned sat
[2025-06-03 18:00:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:00:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 30 ms returned sat
[2025-06-03 18:00:32] [INFO ] [Nat]Absence check using state equation in 9788 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2025-06-03 18:00:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 743 ms
[2025-06-03 18:00:33] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-03 18:00:37] [INFO ] Added : 100 causal constraints over 20 iterations in 4290 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 8 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 18:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:00:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-03 18:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:00:38] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-03 18:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 102/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:40] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:41] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:45] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:45] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:45] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:48] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:50] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:51] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:52] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:52] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:00:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 19/503 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 202/504 variables, 302/805 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/504 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 805 constraints, problems are : Problem set: 0 solved, 200 unsolved in 29849 ms.
Refiners :[Domain max(s): 302/302 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 102/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 99/503 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 202/504 variables, 302/805 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 200/1005 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 1005 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30015 ms.
Refiners :[Domain max(s): 302/302 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59913ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 59914ms
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 302/302 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 165 ms. Reduced automaton from 16 states, 45 edges and 3 AP (stutter sensitive) to 16 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 567 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
RANDOM walk for 5341 steps (1 resets) in 42 ms. (124 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p2) p0))), (F p0), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 19 factoid took 571 ms. Reduced automaton from 16 states, 45 edges and 3 AP (stutter sensitive) to 16 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 552 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
Stuttering acceptance computed with spot in 560 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
[2025-06-03 18:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:01:41] [INFO ] [Real]Absence check using 102 positive place invariants in 28 ms returned sat
[2025-06-03 18:01:50] [INFO ] [Real]Absence check using state equation in 9504 ms returned sat
[2025-06-03 18:01:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:01:50] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2025-06-03 18:02:00] [INFO ] [Nat]Absence check using state equation in 9704 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:00] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:01] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
[2025-06-03 18:02:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2025-06-03 18:02:01] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-03 18:02:05] [INFO ] Added : 100 causal constraints over 20 iterations in 4418 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 597 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
Product exploration explored 100000 steps with 11156 reset in 304 ms.
Product exploration explored 100000 steps with 11079 reset in 304 ms.
Applying partial POR strategy [false, true, true, false, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 750 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), false, false, (AND (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2 (NOT p0)), false]
Support contains 8 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 30 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:02:07] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
// Phase 1: matrix 202 rows 302 cols
[2025-06-03 18:02:07] [INFO ] Computed 102 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 102/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:09] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 8 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:09] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:09] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/424 constraints. Problems are: Problem set: 2 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/444 constraints. Problems are: Problem set: 2 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/464 constraints. Problems are: Problem set: 2 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:19] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 20/484 constraints. Problems are: Problem set: 2 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:21] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:22] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:02:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 17/501 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 202/504 variables, 302/803 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/803 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/504 variables, 0/803 constraints. Problems are: Problem set: 2 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 803 constraints, problems are : Problem set: 2 solved, 198 unsolved in 28573 ms.
Refiners :[Domain max(s): 302/302 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 100/400 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 97/497 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 2/302 variables, 2/499 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 2/501 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 202/504 variables, 302/803 constraints. Problems are: Problem set: 2 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 198/1001 constraints. Problems are: Problem set: 2 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 1001 constraints, problems are : Problem set: 2 solved, 198 unsolved in 30026 ms.
Refiners :[Domain max(s): 302/302 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 198/200 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58621ms problems are : Problem set: 2 solved, 198 unsolved
Search for dead transitions found 2 dead transitions in 58622ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 302/302 places, 200/202 transitions.
Graph (complete) has 802 edges and 302 vertex of which 300 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 300 /302 variables (removed 2) and now considering 200/200 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 300/302 places, 200/202 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58671 ms. Remains : 300/302 places, 200/202 transitions.
Built C files in :
/tmp/ltsmin4586220843673749630
[2025-06-03 18:03:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4586220843673749630
Running compilation step : cd /tmp/ltsmin4586220843673749630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 376 ms.
Running link step : cd /tmp/ltsmin4586220843673749630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4586220843673749630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10088551109249133166.hoa' '--buchi-type=spotba'
LTSmin run took 1032 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R100C002-LTLFireability-05 finished in 179164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(F(p0)) U (X(X(p1))||(p0 U p2)))))'
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 18:03:08] [INFO ] Computed 118 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:03:08] [INFO ] Implicit Places using invariants in 190 ms returned [203, 214, 221, 224, 228, 230, 232, 243, 249, 270, 273, 280, 288, 298, 306, 310, 314]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 192 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-06
Product exploration explored 100000 steps with 24934 reset in 271 ms.
Product exploration explored 100000 steps with 25057 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 167 ms. Reduced automaton from 10 states, 48 edges and 3 AP (stutter sensitive) to 10 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
RANDOM walk for 40000 steps (12 resets) in 268 ms. (148 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
// Phase 1: matrix 202 rows 301 cols
[2025-06-03 18:03:10] [INFO ] Computed 101 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 30/67 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 30/97 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 18/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 23/120 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 15/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 13/133 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/133 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/133 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 10/143 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/143 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/143 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/143 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 10/153 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/153 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/153 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/153 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 5/158 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/158 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/158 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/158 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 5/163 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/163 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/163 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/163 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 5/168 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/168 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/168 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/168 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 5/173 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/173 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/173 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/173 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 5/178 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/178 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/178 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/178 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 5/183 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/183 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/183 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/183 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/188 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/188 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/188 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/188 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 5/193 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/193 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/193 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 5/198 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/198 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/198 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/198 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (OVERLAPS) 5/203 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/203 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/203 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 5/208 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/208 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/208 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/208 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 5/213 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/213 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/213 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/213 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 5/218 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/218 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/218 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 5/223 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/223 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/223 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/223 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 5/228 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/228 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/228 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/228 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 5/233 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/233 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/233 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/233 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 5/238 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/238 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/238 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/238 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 5/243 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/243 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/243 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (OVERLAPS) 5/248 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/248 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/248 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/248 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (OVERLAPS) 5/253 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/253 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/253 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/253 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 5/258 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/258 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/258 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/258 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (OVERLAPS) 5/263 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/263 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/263 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/263 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 119 (OVERLAPS) 5/268 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/268 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/268 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/268 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 123 (OVERLAPS) 5/273 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/273 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/273 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/273 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 127 (OVERLAPS) 5/278 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/278 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/278 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/278 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 131 (OVERLAPS) 5/283 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/283 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/283 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/283 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 135 (OVERLAPS) 5/288 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/288 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/288 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/288 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 139 (OVERLAPS) 5/293 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/293 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/293 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/293 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 143 (OVERLAPS) 5/298 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/298 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/298 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/298 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 147 (OVERLAPS) 5/303 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/303 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/303 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/303 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 151 (OVERLAPS) 5/308 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/308 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/308 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/308 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 155 (OVERLAPS) 5/313 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/313 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/313 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/313 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 159 (OVERLAPS) 5/318 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/318 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/318 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 163 (OVERLAPS) 5/323 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/323 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/323 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/323 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 167 (OVERLAPS) 5/328 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/328 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/328 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/328 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 171 (OVERLAPS) 5/333 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/333 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/333 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/333 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 175 (OVERLAPS) 5/338 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/338 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/338 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/338 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 179 (OVERLAPS) 5/343 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/343 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/343 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/343 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 183 (OVERLAPS) 5/348 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/348 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/348 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/348 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 187 (OVERLAPS) 5/353 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/353 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/353 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/353 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 191 (OVERLAPS) 5/358 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/358 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/358 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/358 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 195 (OVERLAPS) 5/363 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/363 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/363 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/363 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 199 (OVERLAPS) 5/368 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/368 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/368 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/368 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 203 (OVERLAPS) 5/373 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/373 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/373 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/373 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 207 (OVERLAPS) 5/378 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/378 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/378 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/378 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 211 (OVERLAPS) 5/383 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/383 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/383 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/383 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 215 (OVERLAPS) 5/388 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/388 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/388 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/388 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 219 (OVERLAPS) 5/393 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/393 variables, 3/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/393 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/393 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 223 (OVERLAPS) 5/398 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/398 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/398 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/398 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 227 (OVERLAPS) 5/403 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/403 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/403 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/403 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 231 (OVERLAPS) 5/408 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/408 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/408 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/408 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 235 (OVERLAPS) 5/413 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/413 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/413 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/413 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 239 (OVERLAPS) 5/418 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/418 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/418 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/418 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 243 (OVERLAPS) 5/423 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/423 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/423 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/423 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 247 (OVERLAPS) 5/428 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/428 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/428 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/428 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 251 (OVERLAPS) 5/433 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/433 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/433 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/433 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 255 (OVERLAPS) 5/438 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/438 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/438 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/438 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 259 (OVERLAPS) 5/443 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/443 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/443 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/443 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 263 (OVERLAPS) 5/448 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/448 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/448 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/448 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 267 (OVERLAPS) 5/453 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/453 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/453 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/453 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 271 (OVERLAPS) 5/458 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/458 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/458 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/458 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 275 (OVERLAPS) 5/463 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/463 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/463 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/463 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 279 (OVERLAPS) 5/468 variables, 3/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/468 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/468 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/468 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 283 (OVERLAPS) 5/473 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/473 variables, 3/660 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/473 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/473 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 287 (OVERLAPS) 5/478 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/478 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/478 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/478 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 291 (OVERLAPS) 5/483 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/483 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/483 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/483 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 295 (OVERLAPS) 5/488 variables, 3/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/488 variables, 3/681 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/488 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/488 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 299 (OVERLAPS) 5/493 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/493 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/493 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/493 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 303 (OVERLAPS) 5/498 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/498 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5013ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 299 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 299 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 295 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 293 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 293 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 289 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 287 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 287 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 283 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 281 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 281 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 277 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 275 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 275 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 271 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 269 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 269 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 265 transition count 178
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 6 with 2 rules applied. Total rules applied 62 place count 264 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 264 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 65 place count 262 transition count 176
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 7 with 2 rules applied. Total rules applied 67 place count 261 transition count 175
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 68 place count 261 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 70 place count 259 transition count 174
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 8 with 2 rules applied. Total rules applied 72 place count 258 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 73 place count 258 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 75 place count 256 transition count 172
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 9 with 2 rules applied. Total rules applied 77 place count 255 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 78 place count 255 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 80 place count 253 transition count 170
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 10 with 2 rules applied. Total rules applied 82 place count 252 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 83 place count 252 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 85 place count 250 transition count 168
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 11 with 2 rules applied. Total rules applied 87 place count 249 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 88 place count 249 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 90 place count 247 transition count 166
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 12 with 2 rules applied. Total rules applied 92 place count 246 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 93 place count 246 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 95 place count 244 transition count 164
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 13 with 2 rules applied. Total rules applied 97 place count 243 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 98 place count 243 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 100 place count 241 transition count 162
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 14 with 2 rules applied. Total rules applied 102 place count 240 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 103 place count 240 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 105 place count 238 transition count 160
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 15 with 2 rules applied. Total rules applied 107 place count 237 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 108 place count 237 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 110 place count 235 transition count 158
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 16 with 2 rules applied. Total rules applied 112 place count 234 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 113 place count 234 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 115 place count 232 transition count 156
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 17 with 2 rules applied. Total rules applied 117 place count 231 transition count 155
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 118 place count 231 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 120 place count 229 transition count 154
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 18 with 2 rules applied. Total rules applied 122 place count 228 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 123 place count 228 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 125 place count 226 transition count 152
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 19 with 2 rules applied. Total rules applied 127 place count 225 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 128 place count 225 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 130 place count 223 transition count 150
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 20 with 2 rules applied. Total rules applied 132 place count 222 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 133 place count 222 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 135 place count 220 transition count 148
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 21 with 2 rules applied. Total rules applied 137 place count 219 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 138 place count 219 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 140 place count 217 transition count 146
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 22 with 2 rules applied. Total rules applied 142 place count 216 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 143 place count 216 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 145 place count 214 transition count 144
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 23 with 2 rules applied. Total rules applied 147 place count 213 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 148 place count 213 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 150 place count 211 transition count 142
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 24 with 2 rules applied. Total rules applied 152 place count 210 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 153 place count 210 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 155 place count 208 transition count 140
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 25 with 2 rules applied. Total rules applied 157 place count 207 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 158 place count 207 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 160 place count 205 transition count 138
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 26 with 2 rules applied. Total rules applied 162 place count 204 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 163 place count 204 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 165 place count 202 transition count 136
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 27 with 2 rules applied. Total rules applied 167 place count 201 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 168 place count 201 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 170 place count 199 transition count 134
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 28 with 2 rules applied. Total rules applied 172 place count 198 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 173 place count 198 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 175 place count 196 transition count 132
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 29 with 2 rules applied. Total rules applied 177 place count 195 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 178 place count 195 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 180 place count 193 transition count 130
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 30 with 2 rules applied. Total rules applied 182 place count 192 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 183 place count 192 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 185 place count 190 transition count 128
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 31 with 2 rules applied. Total rules applied 187 place count 189 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 188 place count 189 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 190 place count 187 transition count 126
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 32 with 2 rules applied. Total rules applied 192 place count 186 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 193 place count 186 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 195 place count 184 transition count 124
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 33 with 2 rules applied. Total rules applied 197 place count 183 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 198 place count 183 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 200 place count 181 transition count 122
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 34 with 2 rules applied. Total rules applied 202 place count 180 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 203 place count 180 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 205 place count 178 transition count 120
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 35 with 2 rules applied. Total rules applied 207 place count 177 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 208 place count 177 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 210 place count 175 transition count 118
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 36 with 2 rules applied. Total rules applied 212 place count 174 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 213 place count 174 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 215 place count 172 transition count 116
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 37 with 2 rules applied. Total rules applied 217 place count 171 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 218 place count 171 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 220 place count 169 transition count 114
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 38 with 2 rules applied. Total rules applied 222 place count 168 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 223 place count 168 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 225 place count 166 transition count 112
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 39 with 2 rules applied. Total rules applied 227 place count 165 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 228 place count 165 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 230 place count 163 transition count 110
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 40 with 2 rules applied. Total rules applied 232 place count 162 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 233 place count 162 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 235 place count 160 transition count 108
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 41 with 2 rules applied. Total rules applied 237 place count 159 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 238 place count 159 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 240 place count 157 transition count 106
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 42 with 2 rules applied. Total rules applied 242 place count 156 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 243 place count 156 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 245 place count 154 transition count 104
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 43 with 2 rules applied. Total rules applied 247 place count 153 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 248 place count 153 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 250 place count 151 transition count 102
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 44 with 2 rules applied. Total rules applied 252 place count 150 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 253 place count 150 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 255 place count 148 transition count 100
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 45 with 2 rules applied. Total rules applied 257 place count 147 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 258 place count 147 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 45 with 2 rules applied. Total rules applied 260 place count 145 transition count 98
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 46 with 2 rules applied. Total rules applied 262 place count 144 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 263 place count 144 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 265 place count 142 transition count 96
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 47 with 2 rules applied. Total rules applied 267 place count 141 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 47 with 1 rules applied. Total rules applied 268 place count 141 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 270 place count 139 transition count 94
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 48 with 2 rules applied. Total rules applied 272 place count 138 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 48 with 1 rules applied. Total rules applied 273 place count 138 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 48 with 2 rules applied. Total rules applied 275 place count 136 transition count 92
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 49 with 2 rules applied. Total rules applied 277 place count 135 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 49 with 1 rules applied. Total rules applied 278 place count 135 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 280 place count 133 transition count 90
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 50 with 2 rules applied. Total rules applied 282 place count 132 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 50 with 1 rules applied. Total rules applied 283 place count 132 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 50 with 2 rules applied. Total rules applied 285 place count 130 transition count 88
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 51 with 2 rules applied. Total rules applied 287 place count 129 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 51 with 1 rules applied. Total rules applied 288 place count 129 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 51 with 2 rules applied. Total rules applied 290 place count 127 transition count 86
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 52 with 2 rules applied. Total rules applied 292 place count 126 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 52 with 1 rules applied. Total rules applied 293 place count 126 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 52 with 2 rules applied. Total rules applied 295 place count 124 transition count 84
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 53 with 2 rules applied. Total rules applied 297 place count 123 transition count 83
Free-agglomeration rule applied 1 times.
Iterating global reduction 53 with 1 rules applied. Total rules applied 298 place count 123 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 300 place count 121 transition count 82
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 54 with 2 rules applied. Total rules applied 302 place count 120 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 54 with 1 rules applied. Total rules applied 303 place count 120 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 305 place count 118 transition count 80
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 55 with 2 rules applied. Total rules applied 307 place count 117 transition count 79
Free-agglomeration rule applied 1 times.
Iterating global reduction 55 with 1 rules applied. Total rules applied 308 place count 117 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 55 with 2 rules applied. Total rules applied 310 place count 115 transition count 78
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 56 with 2 rules applied. Total rules applied 312 place count 114 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 56 with 1 rules applied. Total rules applied 313 place count 114 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 56 with 2 rules applied. Total rules applied 315 place count 112 transition count 76
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 57 with 2 rules applied. Total rules applied 317 place count 111 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 57 with 1 rules applied. Total rules applied 318 place count 111 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 57 with 2 rules applied. Total rules applied 320 place count 109 transition count 74
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 58 with 2 rules applied. Total rules applied 322 place count 108 transition count 73
Free-agglomeration rule applied 1 times.
Iterating global reduction 58 with 1 rules applied. Total rules applied 323 place count 108 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 58 with 2 rules applied. Total rules applied 325 place count 106 transition count 72
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 59 with 2 rules applied. Total rules applied 327 place count 105 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 59 with 1 rules applied. Total rules applied 328 place count 105 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 59 with 2 rules applied. Total rules applied 330 place count 103 transition count 70
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 60 with 2 rules applied. Total rules applied 332 place count 102 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 60 with 1 rules applied. Total rules applied 333 place count 102 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 60 with 2 rules applied. Total rules applied 335 place count 100 transition count 68
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 61 with 2 rules applied. Total rules applied 337 place count 99 transition count 67
Free-agglomeration rule applied 1 times.
Iterating global reduction 61 with 1 rules applied. Total rules applied 338 place count 99 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 61 with 2 rules applied. Total rules applied 340 place count 97 transition count 66
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 62 with 2 rules applied. Total rules applied 342 place count 96 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 62 with 1 rules applied. Total rules applied 343 place count 96 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 62 with 2 rules applied. Total rules applied 345 place count 94 transition count 64
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 63 with 2 rules applied. Total rules applied 347 place count 93 transition count 63
Free-agglomeration rule applied 1 times.
Iterating global reduction 63 with 1 rules applied. Total rules applied 348 place count 93 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 63 with 2 rules applied. Total rules applied 350 place count 91 transition count 62
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 64 with 2 rules applied. Total rules applied 352 place count 90 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 64 with 1 rules applied. Total rules applied 353 place count 90 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 64 with 2 rules applied. Total rules applied 355 place count 88 transition count 60
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 65 with 2 rules applied. Total rules applied 357 place count 87 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 65 with 1 rules applied. Total rules applied 358 place count 87 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 65 with 2 rules applied. Total rules applied 360 place count 85 transition count 58
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 66 with 2 rules applied. Total rules applied 362 place count 84 transition count 57
Free-agglomeration rule applied 1 times.
Iterating global reduction 66 with 1 rules applied. Total rules applied 363 place count 84 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 66 with 2 rules applied. Total rules applied 365 place count 82 transition count 56
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 67 with 2 rules applied. Total rules applied 367 place count 81 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 67 with 1 rules applied. Total rules applied 368 place count 81 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 67 with 2 rules applied. Total rules applied 370 place count 79 transition count 54
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 68 with 2 rules applied. Total rules applied 372 place count 78 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 68 with 1 rules applied. Total rules applied 373 place count 78 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 68 with 2 rules applied. Total rules applied 375 place count 76 transition count 52
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 69 with 2 rules applied. Total rules applied 377 place count 75 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 69 with 1 rules applied. Total rules applied 378 place count 75 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 69 with 2 rules applied. Total rules applied 380 place count 73 transition count 50
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 70 with 2 rules applied. Total rules applied 382 place count 72 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 70 with 1 rules applied. Total rules applied 383 place count 72 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 70 with 2 rules applied. Total rules applied 385 place count 70 transition count 48
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 71 with 2 rules applied. Total rules applied 387 place count 69 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 71 with 1 rules applied. Total rules applied 388 place count 69 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 71 with 2 rules applied. Total rules applied 390 place count 67 transition count 46
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 72 with 2 rules applied. Total rules applied 392 place count 66 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 72 with 1 rules applied. Total rules applied 393 place count 66 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 72 with 2 rules applied. Total rules applied 395 place count 64 transition count 44
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 73 with 2 rules applied. Total rules applied 397 place count 63 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 73 with 1 rules applied. Total rules applied 398 place count 63 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 73 with 2 rules applied. Total rules applied 400 place count 61 transition count 42
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 74 with 2 rules applied. Total rules applied 402 place count 60 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 74 with 1 rules applied. Total rules applied 403 place count 60 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 74 with 2 rules applied. Total rules applied 405 place count 58 transition count 40
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 75 with 2 rules applied. Total rules applied 407 place count 57 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 75 with 1 rules applied. Total rules applied 408 place count 57 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 75 with 2 rules applied. Total rules applied 410 place count 55 transition count 38
Applied a total of 410 rules in 250 ms. Remains 55 /301 variables (removed 246) and now considering 38/202 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 55/301 places, 38/202 transitions.
RANDOM walk for 40000 steps (418 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 46 ms. (851 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (87 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (99 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (86 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (84 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
// Phase 1: matrix 38 rows 55 cols
[2025-06-03 18:03:15] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/77 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/90 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 140 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/57 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 20/77 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/90 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 3/93 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/93 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 464 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 351 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 55/55 places, 38/38 transitions.
RANDOM walk for 40000 steps (419 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (88 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (99 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (83 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1092101 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 4
Probabilistic random walk after 1092101 steps, saw 191060 distinct states, run finished after 3006 ms. (steps per millisecond=363 ) properties seen :0
[2025-06-03 18:03:19] [INFO ] Invariant cache hit.
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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/77 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/90 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 107 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/57 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 20/77 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/90 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 3/93 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/93 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 416 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 55/55 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-03 18:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:03:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-03 18:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:03:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:03:20] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-03 18:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 38/93 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 144 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1227 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 38/93 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 36/180 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 181 constraints, problems are : Problem set: 0 solved, 36 unsolved in 978 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2214ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2324 ms. Remains : 55/55 places, 38/38 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 20 factoid took 384 ms. Reduced automaton from 10 states, 48 edges and 3 AP (stutter sensitive) to 10 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Stuttering acceptance computed with spot in 415 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2025-06-03 18:03:24] [INFO ] Computed 101 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:03:24] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 18:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:03:24] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-03 18:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 101/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:26] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:26] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:26] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:26] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:28] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:28] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:29] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:31] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:35] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:03:39] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 19/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 202/503 variables, 301/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/503 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 802 constraints, problems are : Problem set: 0 solved, 200 unsolved in 28882 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 101/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 99/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 202/503 variables, 301/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 200/1002 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 1002 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30010 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58926ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 58933ms
Finished structural reductions in LTL mode , in 1 iterations and 59625 ms. Remains : 301/301 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 167 ms. Reduced automaton from 10 states, 48 edges and 3 AP (stutter sensitive) to 10 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
RANDOM walk for 40000 steps (12 resets) in 394 ms. (101 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
[2025-06-03 18:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 30/67 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 30/97 variables, 18/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 18/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 23/120 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 15/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 13/133 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/133 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/133 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 10/143 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/143 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/143 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/143 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 10/153 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/153 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/153 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/153 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 5/158 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/158 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/158 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/158 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 5/163 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/163 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/163 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/163 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 5/168 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/168 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/168 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/168 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 5/173 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/173 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/173 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/173 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 5/178 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/178 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/178 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/178 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 5/183 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/183 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/183 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/183 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/188 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/188 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/188 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/188 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 5/193 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/193 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/193 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 5/198 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/198 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/198 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/198 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (OVERLAPS) 5/203 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/203 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/203 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/203 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 5/208 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/208 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/208 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/208 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 5/213 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/213 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/213 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/213 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 5/218 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/218 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/218 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 5/223 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/223 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/223 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/223 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 5/228 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/228 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/228 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/228 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 5/233 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/233 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/233 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/233 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 5/238 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/238 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/238 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/238 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 5/243 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/243 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/243 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (OVERLAPS) 5/248 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/248 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/248 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/248 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (OVERLAPS) 5/253 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/253 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/253 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/253 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 5/258 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/258 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/258 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/258 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (OVERLAPS) 5/263 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/263 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/263 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/263 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 119 (OVERLAPS) 5/268 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/268 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/268 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/268 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 123 (OVERLAPS) 5/273 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/273 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/273 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/273 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 127 (OVERLAPS) 5/278 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/278 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/278 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/278 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 131 (OVERLAPS) 5/283 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/283 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/283 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/283 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 135 (OVERLAPS) 5/288 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/288 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/288 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/288 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 139 (OVERLAPS) 5/293 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/293 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/293 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/293 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 143 (OVERLAPS) 5/298 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/298 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/298 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/298 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 147 (OVERLAPS) 5/303 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/303 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/303 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/303 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 151 (OVERLAPS) 5/308 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/308 variables, 3/429 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/308 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/308 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 155 (OVERLAPS) 5/313 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/313 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/313 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/313 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 159 (OVERLAPS) 5/318 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/318 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/318 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 163 (OVERLAPS) 5/323 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/323 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/323 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/323 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 167 (OVERLAPS) 5/328 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/328 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/328 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/328 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 171 (OVERLAPS) 5/333 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/333 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/333 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/333 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 175 (OVERLAPS) 5/338 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/338 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/338 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/338 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 179 (OVERLAPS) 5/343 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/343 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/343 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/343 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 183 (OVERLAPS) 5/348 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/348 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/348 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/348 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 187 (OVERLAPS) 5/353 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/353 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/353 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/353 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 191 (OVERLAPS) 5/358 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/358 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/358 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/358 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 195 (OVERLAPS) 5/363 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/363 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/363 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/363 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 199 (OVERLAPS) 5/368 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/368 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/368 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/368 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 203 (OVERLAPS) 5/373 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/373 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/373 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/373 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 207 (OVERLAPS) 5/378 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/378 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/378 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/378 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 211 (OVERLAPS) 5/383 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/383 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/383 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/383 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 215 (OVERLAPS) 5/388 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/388 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/388 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/388 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 219 (OVERLAPS) 5/393 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/393 variables, 3/548 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/393 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/393 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 223 (OVERLAPS) 5/398 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/398 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/398 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/398 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 227 (OVERLAPS) 5/403 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/403 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/403 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/403 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 231 (OVERLAPS) 5/408 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/408 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/408 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/408 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 235 (OVERLAPS) 5/413 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/413 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/413 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/413 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 239 (OVERLAPS) 5/418 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/418 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/418 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/418 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 243 (OVERLAPS) 5/423 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/423 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/423 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/423 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 247 (OVERLAPS) 5/428 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/428 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/428 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/428 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 251 (OVERLAPS) 5/433 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/433 variables, 3/604 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/433 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/433 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 255 (OVERLAPS) 5/438 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/438 variables, 3/611 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/438 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/438 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 259 (OVERLAPS) 5/443 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/443 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/443 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/443 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 263 (OVERLAPS) 5/448 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/448 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/448 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/448 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 267 (OVERLAPS) 5/453 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/453 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/453 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/453 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 271 (OVERLAPS) 5/458 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/458 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/458 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/458 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 275 (OVERLAPS) 5/463 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/463 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/463 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/463 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 279 (OVERLAPS) 5/468 variables, 3/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/468 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/468 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/468 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 283 (OVERLAPS) 5/473 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/473 variables, 3/660 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/473 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/473 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 287 (OVERLAPS) 5/478 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/478 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/478 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/478 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 291 (OVERLAPS) 5/483 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/483 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/483 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/483 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 295 (OVERLAPS) 5/488 variables, 3/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/488 variables, 3/681 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/488 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/488 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 299 (OVERLAPS) 5/493 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/493 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/493 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/493 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 303 (OVERLAPS) 5/498 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/498 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/498 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/498 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 307 (OVERLAPS) 5/503 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/503 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/503 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/503 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 311 (OVERLAPS) 0/503 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 703 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4028 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 30/67 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 30/97 variables, 18/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/97 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/97 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 23/120 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/120 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 13/133 variables, 9/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/133 variables, 9/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/133 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:29] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/133 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/133 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 10/143 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/143 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/143 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/143 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 10/153 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/153 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/153 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/153 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 5/158 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/158 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/158 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/158 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 5/163 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/163 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/163 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/163 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 5/168 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/168 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/168 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/168 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 5/173 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/173 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/173 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/173 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (OVERLAPS) 5/178 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/178 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/178 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/178 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 5/183 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/183 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/183 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/183 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 5/188 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/188 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/188 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/188 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (OVERLAPS) 5/193 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/193 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/193 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/193 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (OVERLAPS) 5/198 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/198 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/198 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/198 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 5/203 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/203 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/203 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/203 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 5/208 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/208 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/208 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/208 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 5/213 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/213 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/213 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/213 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 83 (OVERLAPS) 5/218 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/218 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/218 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/218 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 87 (OVERLAPS) 5/223 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/223 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/223 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/223 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 91 (OVERLAPS) 5/228 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/228 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/228 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/228 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 95 (OVERLAPS) 5/233 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/233 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/233 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/233 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 99 (OVERLAPS) 5/238 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/238 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/238 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/238 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 103 (OVERLAPS) 5/243 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/243 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/243 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/243 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 107 (OVERLAPS) 5/248 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/248 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/248 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/248 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 111 (OVERLAPS) 5/253 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/253 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/253 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/253 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 115 (OVERLAPS) 5/258 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/258 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/258 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/258 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 119 (OVERLAPS) 5/263 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/263 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/263 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/263 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 123 (OVERLAPS) 5/268 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/268 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/268 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/268 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 127 (OVERLAPS) 5/273 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/273 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/273 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/273 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 131 (OVERLAPS) 5/278 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/278 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/278 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/278 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 135 (OVERLAPS) 5/283 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/283 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/283 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/283 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 139 (OVERLAPS) 5/288 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/288 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/288 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/288 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 143 (OVERLAPS) 5/293 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/293 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/293 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/293 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 147 (OVERLAPS) 5/298 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/298 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/298 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/503 variables, and 427 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5008 ms.
Refiners :[Domain max(s): 178/301 constraints, Positive P Invariants (semi-flows): 60/101 constraints, State Equation: 178/301 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9043ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 299 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 299 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 295 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 293 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 293 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 289 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 287 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 287 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 283 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 281 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 281 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 277 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 275 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 275 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 271 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 269 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 269 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 265 transition count 178
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 6 with 2 rules applied. Total rules applied 62 place count 264 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 264 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 65 place count 262 transition count 176
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 7 with 2 rules applied. Total rules applied 67 place count 261 transition count 175
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 68 place count 261 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 70 place count 259 transition count 174
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 8 with 2 rules applied. Total rules applied 72 place count 258 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 73 place count 258 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 75 place count 256 transition count 172
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 9 with 2 rules applied. Total rules applied 77 place count 255 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 78 place count 255 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 80 place count 253 transition count 170
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 10 with 2 rules applied. Total rules applied 82 place count 252 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 83 place count 252 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 85 place count 250 transition count 168
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 11 with 2 rules applied. Total rules applied 87 place count 249 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 88 place count 249 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 90 place count 247 transition count 166
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 12 with 2 rules applied. Total rules applied 92 place count 246 transition count 165
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 93 place count 246 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 95 place count 244 transition count 164
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 13 with 2 rules applied. Total rules applied 97 place count 243 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 98 place count 243 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 100 place count 241 transition count 162
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 14 with 2 rules applied. Total rules applied 102 place count 240 transition count 161
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 103 place count 240 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 105 place count 238 transition count 160
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 15 with 2 rules applied. Total rules applied 107 place count 237 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 108 place count 237 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 110 place count 235 transition count 158
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 16 with 2 rules applied. Total rules applied 112 place count 234 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 113 place count 234 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 115 place count 232 transition count 156
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 17 with 2 rules applied. Total rules applied 117 place count 231 transition count 155
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 118 place count 231 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 120 place count 229 transition count 154
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 18 with 2 rules applied. Total rules applied 122 place count 228 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 123 place count 228 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 125 place count 226 transition count 152
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 19 with 2 rules applied. Total rules applied 127 place count 225 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 128 place count 225 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 130 place count 223 transition count 150
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 20 with 2 rules applied. Total rules applied 132 place count 222 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 133 place count 222 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 135 place count 220 transition count 148
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 21 with 2 rules applied. Total rules applied 137 place count 219 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 138 place count 219 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 140 place count 217 transition count 146
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 22 with 2 rules applied. Total rules applied 142 place count 216 transition count 145
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 143 place count 216 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 145 place count 214 transition count 144
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 23 with 2 rules applied. Total rules applied 147 place count 213 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 148 place count 213 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 150 place count 211 transition count 142
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 24 with 2 rules applied. Total rules applied 152 place count 210 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 153 place count 210 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 155 place count 208 transition count 140
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 25 with 2 rules applied. Total rules applied 157 place count 207 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 158 place count 207 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 160 place count 205 transition count 138
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 26 with 2 rules applied. Total rules applied 162 place count 204 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 163 place count 204 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 165 place count 202 transition count 136
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 27 with 2 rules applied. Total rules applied 167 place count 201 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 168 place count 201 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 170 place count 199 transition count 134
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 28 with 2 rules applied. Total rules applied 172 place count 198 transition count 133
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 173 place count 198 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 175 place count 196 transition count 132
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 29 with 2 rules applied. Total rules applied 177 place count 195 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 178 place count 195 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 180 place count 193 transition count 130
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 30 with 2 rules applied. Total rules applied 182 place count 192 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 183 place count 192 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 185 place count 190 transition count 128
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 31 with 2 rules applied. Total rules applied 187 place count 189 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 188 place count 189 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 190 place count 187 transition count 126
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 32 with 2 rules applied. Total rules applied 192 place count 186 transition count 125
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 193 place count 186 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 195 place count 184 transition count 124
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 33 with 2 rules applied. Total rules applied 197 place count 183 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 198 place count 183 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 200 place count 181 transition count 122
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 34 with 2 rules applied. Total rules applied 202 place count 180 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 203 place count 180 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 205 place count 178 transition count 120
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 35 with 2 rules applied. Total rules applied 207 place count 177 transition count 119
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 208 place count 177 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 210 place count 175 transition count 118
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 36 with 2 rules applied. Total rules applied 212 place count 174 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 36 with 1 rules applied. Total rules applied 213 place count 174 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 215 place count 172 transition count 116
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 37 with 2 rules applied. Total rules applied 217 place count 171 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 37 with 1 rules applied. Total rules applied 218 place count 171 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 220 place count 169 transition count 114
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 38 with 2 rules applied. Total rules applied 222 place count 168 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 38 with 1 rules applied. Total rules applied 223 place count 168 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 225 place count 166 transition count 112
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 39 with 2 rules applied. Total rules applied 227 place count 165 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 39 with 1 rules applied. Total rules applied 228 place count 165 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 39 with 2 rules applied. Total rules applied 230 place count 163 transition count 110
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 40 with 2 rules applied. Total rules applied 232 place count 162 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 40 with 1 rules applied. Total rules applied 233 place count 162 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 235 place count 160 transition count 108
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 41 with 2 rules applied. Total rules applied 237 place count 159 transition count 107
Free-agglomeration rule applied 1 times.
Iterating global reduction 41 with 1 rules applied. Total rules applied 238 place count 159 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 240 place count 157 transition count 106
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 42 with 2 rules applied. Total rules applied 242 place count 156 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 42 with 1 rules applied. Total rules applied 243 place count 156 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 245 place count 154 transition count 104
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 43 with 2 rules applied. Total rules applied 247 place count 153 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 43 with 1 rules applied. Total rules applied 248 place count 153 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 43 with 2 rules applied. Total rules applied 250 place count 151 transition count 102
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 44 with 2 rules applied. Total rules applied 252 place count 150 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 44 with 1 rules applied. Total rules applied 253 place count 150 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 255 place count 148 transition count 100
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 45 with 2 rules applied. Total rules applied 257 place count 147 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 45 with 1 rules applied. Total rules applied 258 place count 147 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 45 with 2 rules applied. Total rules applied 260 place count 145 transition count 98
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 46 with 2 rules applied. Total rules applied 262 place count 144 transition count 97
Free-agglomeration rule applied 1 times.
Iterating global reduction 46 with 1 rules applied. Total rules applied 263 place count 144 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 46 with 2 rules applied. Total rules applied 265 place count 142 transition count 96
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 47 with 2 rules applied. Total rules applied 267 place count 141 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 47 with 1 rules applied. Total rules applied 268 place count 141 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 270 place count 139 transition count 94
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 48 with 2 rules applied. Total rules applied 272 place count 138 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 48 with 1 rules applied. Total rules applied 273 place count 138 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 48 with 2 rules applied. Total rules applied 275 place count 136 transition count 92
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 49 with 2 rules applied. Total rules applied 277 place count 135 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 49 with 1 rules applied. Total rules applied 278 place count 135 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 280 place count 133 transition count 90
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 50 with 2 rules applied. Total rules applied 282 place count 132 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 50 with 1 rules applied. Total rules applied 283 place count 132 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 50 with 2 rules applied. Total rules applied 285 place count 130 transition count 88
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 51 with 2 rules applied. Total rules applied 287 place count 129 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 51 with 1 rules applied. Total rules applied 288 place count 129 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 51 with 2 rules applied. Total rules applied 290 place count 127 transition count 86
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 52 with 2 rules applied. Total rules applied 292 place count 126 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 52 with 1 rules applied. Total rules applied 293 place count 126 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 52 with 2 rules applied. Total rules applied 295 place count 124 transition count 84
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 53 with 2 rules applied. Total rules applied 297 place count 123 transition count 83
Free-agglomeration rule applied 1 times.
Iterating global reduction 53 with 1 rules applied. Total rules applied 298 place count 123 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 300 place count 121 transition count 82
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 54 with 2 rules applied. Total rules applied 302 place count 120 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 54 with 1 rules applied. Total rules applied 303 place count 120 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 305 place count 118 transition count 80
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 55 with 2 rules applied. Total rules applied 307 place count 117 transition count 79
Free-agglomeration rule applied 1 times.
Iterating global reduction 55 with 1 rules applied. Total rules applied 308 place count 117 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 55 with 2 rules applied. Total rules applied 310 place count 115 transition count 78
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 56 with 2 rules applied. Total rules applied 312 place count 114 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 56 with 1 rules applied. Total rules applied 313 place count 114 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 56 with 2 rules applied. Total rules applied 315 place count 112 transition count 76
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 57 with 2 rules applied. Total rules applied 317 place count 111 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 57 with 1 rules applied. Total rules applied 318 place count 111 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 57 with 2 rules applied. Total rules applied 320 place count 109 transition count 74
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 58 with 2 rules applied. Total rules applied 322 place count 108 transition count 73
Free-agglomeration rule applied 1 times.
Iterating global reduction 58 with 1 rules applied. Total rules applied 323 place count 108 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 58 with 2 rules applied. Total rules applied 325 place count 106 transition count 72
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 59 with 2 rules applied. Total rules applied 327 place count 105 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 59 with 1 rules applied. Total rules applied 328 place count 105 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 59 with 2 rules applied. Total rules applied 330 place count 103 transition count 70
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 60 with 2 rules applied. Total rules applied 332 place count 102 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 60 with 1 rules applied. Total rules applied 333 place count 102 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 60 with 2 rules applied. Total rules applied 335 place count 100 transition count 68
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 61 with 2 rules applied. Total rules applied 337 place count 99 transition count 67
Free-agglomeration rule applied 1 times.
Iterating global reduction 61 with 1 rules applied. Total rules applied 338 place count 99 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 61 with 2 rules applied. Total rules applied 340 place count 97 transition count 66
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 62 with 2 rules applied. Total rules applied 342 place count 96 transition count 65
Free-agglomeration rule applied 1 times.
Iterating global reduction 62 with 1 rules applied. Total rules applied 343 place count 96 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 62 with 2 rules applied. Total rules applied 345 place count 94 transition count 64
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 63 with 2 rules applied. Total rules applied 347 place count 93 transition count 63
Free-agglomeration rule applied 1 times.
Iterating global reduction 63 with 1 rules applied. Total rules applied 348 place count 93 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 63 with 2 rules applied. Total rules applied 350 place count 91 transition count 62
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 64 with 2 rules applied. Total rules applied 352 place count 90 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 64 with 1 rules applied. Total rules applied 353 place count 90 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 64 with 2 rules applied. Total rules applied 355 place count 88 transition count 60
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 65 with 2 rules applied. Total rules applied 357 place count 87 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 65 with 1 rules applied. Total rules applied 358 place count 87 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 65 with 2 rules applied. Total rules applied 360 place count 85 transition count 58
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 66 with 2 rules applied. Total rules applied 362 place count 84 transition count 57
Free-agglomeration rule applied 1 times.
Iterating global reduction 66 with 1 rules applied. Total rules applied 363 place count 84 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 66 with 2 rules applied. Total rules applied 365 place count 82 transition count 56
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 67 with 2 rules applied. Total rules applied 367 place count 81 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 67 with 1 rules applied. Total rules applied 368 place count 81 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 67 with 2 rules applied. Total rules applied 370 place count 79 transition count 54
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 68 with 2 rules applied. Total rules applied 372 place count 78 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 68 with 1 rules applied. Total rules applied 373 place count 78 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 68 with 2 rules applied. Total rules applied 375 place count 76 transition count 52
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 69 with 2 rules applied. Total rules applied 377 place count 75 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 69 with 1 rules applied. Total rules applied 378 place count 75 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 69 with 2 rules applied. Total rules applied 380 place count 73 transition count 50
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 70 with 2 rules applied. Total rules applied 382 place count 72 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 70 with 1 rules applied. Total rules applied 383 place count 72 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 70 with 2 rules applied. Total rules applied 385 place count 70 transition count 48
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 71 with 2 rules applied. Total rules applied 387 place count 69 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 71 with 1 rules applied. Total rules applied 388 place count 69 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 71 with 2 rules applied. Total rules applied 390 place count 67 transition count 46
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 72 with 2 rules applied. Total rules applied 392 place count 66 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 72 with 1 rules applied. Total rules applied 393 place count 66 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 72 with 2 rules applied. Total rules applied 395 place count 64 transition count 44
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 73 with 2 rules applied. Total rules applied 397 place count 63 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 73 with 1 rules applied. Total rules applied 398 place count 63 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 73 with 2 rules applied. Total rules applied 400 place count 61 transition count 42
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 74 with 2 rules applied. Total rules applied 402 place count 60 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 74 with 1 rules applied. Total rules applied 403 place count 60 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 74 with 2 rules applied. Total rules applied 405 place count 58 transition count 40
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 75 with 2 rules applied. Total rules applied 407 place count 57 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 75 with 1 rules applied. Total rules applied 408 place count 57 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 75 with 2 rules applied. Total rules applied 410 place count 55 transition count 38
Applied a total of 410 rules in 455 ms. Remains 55 /301 variables (removed 246) and now considering 38/202 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 55/301 places, 38/202 transitions.
RANDOM walk for 40000 steps (416 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 50 ms. (784 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (86 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (96 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (86 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
// Phase 1: matrix 38 rows 55 cols
[2025-06-03 18:04:34] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/77 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/90 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 104 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/57 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 20/77 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/90 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 3/93 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/93 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 463 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 55/55 places, 38/38 transitions.
RANDOM walk for 40000 steps (416 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (85 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1816415 steps, run timeout after 3001 ms. (steps per millisecond=605 ) properties seen :0 out of 4
Probabilistic random walk after 1816415 steps, saw 313346 distinct states, run finished after 3001 ms. (steps per millisecond=605 ) properties seen :0
[2025-06-03 18:04:38] [INFO ] Invariant cache hit.
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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/57 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/77 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/90 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/93 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/93 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/93 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/93 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 103 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 20/57 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 20/77 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/90 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 3/93 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/93 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 136 constraints, problems are : Problem set: 0 solved, 4 unsolved in 460 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 55/55 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-03 18:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 18:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:04:39] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-03 18:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 38/93 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 144 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1197 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 38/93 variables, 55/144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 36/180 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 181 constraints, problems are : Problem set: 0 solved, 36 unsolved in 981 ms.
Refiners :[Domain max(s): 55/55 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2358 ms. Remains : 55/55 places, 38/38 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 20 factoid took 469 ms. Reduced automaton from 10 states, 48 edges and 3 AP (stutter sensitive) to 10 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Stuttering acceptance computed with spot in 370 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Stuttering acceptance computed with spot in 382 ms :[(OR p1 p2), (OR (AND p0 p1) (AND p0 p2)), p1, p2, (AND p0 p1), (AND p0 p1), p1, p1, (AND p1 p2), (AND p0 p1)]
Product exploration explored 100000 steps with 25010 reset in 267 ms.
Product exploration explored 100000 steps with 24990 reset in 320 ms.
Built C files in :
/tmp/ltsmin18032734591123902027
[2025-06-03 18:04:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18032734591123902027
Running compilation step : cd /tmp/ltsmin18032734591123902027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 351 ms.
Running link step : cd /tmp/ltsmin18032734591123902027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18032734591123902027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3819602990381939979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 301 cols
[2025-06-03 18:04:58] [INFO ] Computed 101 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:59] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-03 18:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:59] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-03 18:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 101/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:02] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:03] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:03] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:05] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 19/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 202/503 variables, 301/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/503 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 802 constraints, problems are : Problem set: 0 solved, 200 unsolved in 29110 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 101/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 99/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 202/503 variables, 301/802 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 200/1002 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 1002 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30024 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59166ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 59167ms
Finished structural reductions in LTL mode , in 1 iterations and 59817 ms. Remains : 301/301 places, 202/202 transitions.
Built C files in :
/tmp/ltsmin2956930624545810921
[2025-06-03 18:05:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2956930624545810921
Running compilation step : cd /tmp/ltsmin2956930624545810921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 378 ms.
Running link step : cd /tmp/ltsmin2956930624545810921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2956930624545810921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14890710632611225973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 18:06:14] [INFO ] Flatten gal took : 13 ms
[2025-06-03 18:06:14] [INFO ] Flatten gal took : 12 ms
[2025-06-03 18:06:14] [INFO ] Time to serialize gal into /tmp/LTL17801900193503406262.gal : 2 ms
[2025-06-03 18:06:14] [INFO ] Time to serialize properties into /tmp/LTL354515738750071.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17801900193503406262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3546422519051723463.hoa' '-atoms' '/tmp/LTL354515738750071.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...314
Loading property file /tmp/LTL354515738750071.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3546422519051723463.hoa
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:06:29] [INFO ] Flatten gal took : 18 ms
[2025-06-03 18:06:29] [INFO ] Flatten gal took : 10 ms
[2025-06-03 18:06:29] [INFO ] Time to serialize gal into /tmp/LTL8728458247706153577.gal : 2 ms
[2025-06-03 18:06:29] [INFO ] Time to serialize properties into /tmp/LTL17179650620567428270.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8728458247706153577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17179650620567428270.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(!((X(F("((p_0_13==1)&&(r_0_14==1))")))U((X(X("(((r_0_6==1)&&(r_1_6==1))&&(p_1_7==1))")))||(("((p_0_13==1)&&(r_0_14==1))")U("((p_0...184
Formula 0 simplified : G(XF"((p_0_13==1)&&(r_0_14==1))" U (XX"(((r_0_6==1)&&(r_1_6==1))&&(p_1_7==1))" | ("((p_0_13==1)&&(r_0_14==1))" U "((p_0_22==1)&&(r_0...167
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:06:44] [INFO ] Flatten gal took : 14 ms
[2025-06-03 18:06:44] [INFO ] Applying decomposition
[2025-06-03 18:06:44] [INFO ] Flatten gal took : 8 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/graph770174109307668976.txt' '-o' '/tmp/graph770174109307668976.bin' '-w' '/tmp/graph770174109307668976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph770174109307668976.bin' '-l' '-1' '-v' '-w' '/tmp/graph770174109307668976.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:06:44] [INFO ] Decomposing Gal with order
[2025-06-03 18:06:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:06:44] [INFO ] Flatten gal took : 14 ms
[2025-06-03 18:06:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 18:06:44] [INFO ] Time to serialize gal into /tmp/LTL9800278796075962504.gal : 4 ms
[2025-06-03 18:06:44] [INFO ] Time to serialize properties into /tmp/LTL12577879325357593850.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9800278796075962504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12577879325357593850.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(!((X(F("((i2.i0.i1.u13.p_0_13==1)&&(i2.i0.i2.u14.r_0_14==1))")))U((X(X("(((i1.u6.r_0_6==1)&&(i1.u100.r_1_6==1))&&(i1.u7.p_1_7==1)...282
Formula 0 simplified : G(XF"((i2.i0.i1.u13.p_0_13==1)&&(i2.i0.i2.u14.r_0_14==1))" U (XX"(((i1.u6.r_0_6==1)&&(i1.u100.r_1_6==1))&&(i1.u7.p_1_7==1))" | ("((i...265
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-06 finished in 231365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 5 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 18:06:59] [INFO ] Computed 118 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:06:59] [INFO ] Implicit Places using invariants in 235 ms returned [203, 208, 214, 221, 224, 228, 230, 232, 243, 249, 270, 273, 288, 298, 306, 310, 314]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 236 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-07
Product exploration explored 100000 steps with 38 reset in 328 ms.
Product exploration explored 100000 steps with 38 reset in 386 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 1092 steps (0 resets) in 9 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 2 out of 301 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 299 transition count 200
Applied a total of 4 rules in 6 ms. Remains 299 /301 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 299 cols
[2025-06-03 18:07:00] [INFO ] Computed 101 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:07:00] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-03 18:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:07:01] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:07:01] [INFO ] Redundant transitions in 3 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 18:07:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:03] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:04] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:05] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:05] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:06] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:07] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:09] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:09] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:10] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:11] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:07:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 15/495 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/499 variables, 299/794 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 794 constraints, problems are : Problem set: 0 solved, 198 unsolved in 29216 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 299/299 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 101/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 95/495 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/499 variables, 299/794 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 198/992 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 992 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59244ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 59245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 299/301 places, 200/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59909 ms. Remains : 299/301 places, 200/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
RANDOM walk for 1166 steps (0 resets) in 8 ms. (129 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Product exploration explored 100000 steps with 38 reset in 326 ms.
Product exploration explored 100000 steps with 38 reset in 378 ms.
Built C files in :
/tmp/ltsmin12690199629294686335
[2025-06-03 18:08:01] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 18:08:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:01] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 18:08:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:01] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 18:08:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12690199629294686335
Running compilation step : cd /tmp/ltsmin12690199629294686335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin12690199629294686335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12690199629294686335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14358668506943146762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-03 18:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:08:16] [INFO ] Implicit Places using invariants in 158 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/299 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 298/299 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin13197465075501484613
[2025-06-03 18:08:16] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 18:08:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:16] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 18:08:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:16] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 18:08:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:08:16] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13197465075501484613
Running compilation step : cd /tmp/ltsmin13197465075501484613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 433 ms.
Running link step : cd /tmp/ltsmin13197465075501484613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13197465075501484613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12274429341382133911.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 18:08:32] [INFO ] Flatten gal took : 11 ms
[2025-06-03 18:08:32] [INFO ] Flatten gal took : 8 ms
[2025-06-03 18:08:32] [INFO ] Time to serialize gal into /tmp/LTL6559405204070044357.gal : 2 ms
[2025-06-03 18:08:32] [INFO ] Time to serialize properties into /tmp/LTL18136664064640521788.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6559405204070044357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12776871064604820458.hoa' '-atoms' '/tmp/LTL18136664064640521788.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18136664064640521788.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12776871064604820458.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:08:47] [INFO ] Flatten gal took : 7 ms
[2025-06-03 18:08:47] [INFO ] Flatten gal took : 8 ms
[2025-06-03 18:08:47] [INFO ] Time to serialize gal into /tmp/LTL15434528563262519657.gal : 1 ms
[2025-06-03 18:08:47] [INFO ] Time to serialize properties into /tmp/LTL16680971294446381427.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15434528563262519657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16680971294446381427.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p_0_31==0)||(r_0_32==0))")))||("(((r_0_67==1)&&(r_1_67==1))&&(p_1_68==1))"))))
Formula 0 simplified : X(!"(((r_0_67==1)&&(r_1_67==1))&&(p_1_68==1))" & GF!"((p_0_31==0)||(r_0_32==0))")
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:09:02] [INFO ] Flatten gal took : 7 ms
[2025-06-03 18:09:02] [INFO ] Applying decomposition
[2025-06-03 18:09:02] [INFO ] Flatten gal took : 8 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/graph8206170275893458134.txt' '-o' '/tmp/graph8206170275893458134.bin' '-w' '/tmp/graph8206170275893458134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8206170275893458134.bin' '-l' '-1' '-v' '-w' '/tmp/graph8206170275893458134.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:09:02] [INFO ] Decomposing Gal with order
[2025-06-03 18:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:09:02] [INFO ] Flatten gal took : 22 ms
[2025-06-03 18:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 18:09:02] [INFO ] Time to serialize gal into /tmp/LTL3238627354374391416.gal : 3 ms
[2025-06-03 18:09:02] [INFO ] Time to serialize properties into /tmp/LTL11443321920755408567.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3238627354374391416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11443321920755408567.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i3.i1.i1.u31.p_0_31==0)||(i4.i0.i0.u32.r_0_32==0))")))||("(((i9.u67.r_0_67==1)&&(i9.u99.r_1_67==1))&&(i9.u68.p_1_68==1))"...159
Formula 0 simplified : X(!"(((i9.u67.r_0_67==1)&&(i9.u99.r_1_67==1))&&(i9.u68.p_1_68==1))" & GF!"((i3.i1.i1.u31.p_0_31==0)||(i4.i0.i0.u32.r_0_32==0))")
Reverse transition relation is NOT exact ! Due to transitions i0.t102_t101, i14.t99_t100, Intersection with reachable at each step enabled. (destroyed/rev...189
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-07 finished in 137996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 316 transition count 200
Applied a total of 4 rules in 6 ms. Remains 316 /318 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 316 cols
[2025-06-03 18:09:17] [INFO ] Computed 118 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:17] [INFO ] Implicit Places using invariants in 205 ms returned [201, 206, 212, 219, 222, 228, 230, 241, 247, 268, 271, 278, 286, 304, 308, 312]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 216 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/318 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 300/318 places, 200/202 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-09
Product exploration explored 100000 steps with 38 reset in 329 ms.
Product exploration explored 100000 steps with 38 reset in 381 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 372 steps (0 resets) in 5 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2025-06-03 18:09:18] [INFO ] Computed 102 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-03 18:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:19] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:09:19] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 18:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:23] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:23] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:29] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:29] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:29] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:34] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 15/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 797 constraints, problems are : Problem set: 0 solved, 198 unsolved in 29191 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 198/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 995 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30010 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59223ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 59224ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59893 ms. Remains : 300/300 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 309 steps (0 resets) in 5 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38 reset in 332 ms.
Product exploration explored 100000 steps with 38 reset in 384 ms.
Built C files in :
/tmp/ltsmin13684165413593599440
[2025-06-03 18:10:19] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 18:10:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:10:19] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 18:10:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:10:19] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 18:10:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:10:19] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13684165413593599440
Running compilation step : cd /tmp/ltsmin13684165413593599440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin13684165413593599440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13684165413593599440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12757482844230725675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-03 18:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:10:34] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-03 18:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:10:35] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:10:35] [INFO ] Redundant transitions in 0 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 18:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:37] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:38] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:39] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:39] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:39] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:41] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:41] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:41] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:43] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:44] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:46] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:47] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:47] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:47] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:47] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:49] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 15/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/500 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 797 constraints, problems are : Problem set: 0 solved, 198 unsolved in 28686 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 102/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/500 variables, 300/797 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 198/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 995 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 102/102 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58719ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 58721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59372 ms. Remains : 300/300 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin12922308286048533369
[2025-06-03 18:11:34] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 18:11:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:11:34] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 18:11:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:11:34] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 18:11:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:11:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12922308286048533369
Running compilation step : cd /tmp/ltsmin12922308286048533369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin12922308286048533369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12922308286048533369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12913230959021656183.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 18:11:49] [INFO ] Flatten gal took : 11 ms
[2025-06-03 18:11:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 18:11:49] [INFO ] Time to serialize gal into /tmp/LTL11775108641357651487.gal : 1 ms
[2025-06-03 18:11:49] [INFO ] Time to serialize properties into /tmp/LTL3985593554155688578.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11775108641357651487.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15094386778948636240.hoa' '-atoms' '/tmp/LTL3985593554155688578.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3985593554155688578.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15094386778948636240.hoa
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:12:04] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:12:04] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:12:04] [INFO ] Time to serialize gal into /tmp/LTL6749862818707768523.gal : 1 ms
[2025-06-03 18:12:04] [INFO ] Time to serialize properties into /tmp/LTL12141210155071663537.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6749862818707768523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12141210155071663537.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((r_0_83==0)||(r_1_83==0))||((p_1_84==0)||(((r_0_22==1)&&(r_1_22==1))&&(p_1_23==1))))"))))
Formula 0 simplified : GF!"(((r_0_83==0)||(r_1_83==0))||((p_1_84==0)||(((r_0_22==1)&&(r_1_22==1))&&(p_1_23==1))))"
Reverse transition relation is NOT exact ! Due to transitions t99.t100, t102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:12:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:12:19] [INFO ] Applying decomposition
[2025-06-03 18:12:19] [INFO ] Flatten gal took : 6 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/graph2903444338448908372.txt' '-o' '/tmp/graph2903444338448908372.bin' '-w' '/tmp/graph2903444338448908372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2903444338448908372.bin' '-l' '-1' '-v' '-w' '/tmp/graph2903444338448908372.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:12:19] [INFO ] Decomposing Gal with order
[2025-06-03 18:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:12:19] [INFO ] Flatten gal took : 11 ms
[2025-06-03 18:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 18:12:19] [INFO ] Time to serialize gal into /tmp/LTL8166308098415751478.gal : 3 ms
[2025-06-03 18:12:19] [INFO ] Time to serialize properties into /tmp/LTL4872212438159423943.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8166308098415751478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4872212438159423943.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i10.u83.r_0_83==0)||(i10.u100.r_1_83==0))||((i10.u84.p_1_84==0)||(((i2.u22.r_0_22==1)&&(i2.u99.r_1_22==1))&&(i2.u23.p_1_23=...166
Formula 0 simplified : GF!"(((i10.u83.r_0_83==0)||(i10.u100.r_1_83==0))||((i10.u84.p_1_84==0)||(((i2.u22.r_0_22==1)&&(i2.u99.r_1_22==1))&&(i2.u23.p_1_23==1...160
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.t102_t101, i12.t99_t100, Intersection with reachable at each step enabled. (destroy...195
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-09 finished in 197132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (F(p0)&&p1))&&(G((F(p2) U p3)) U p3)))'
Support contains 12 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 318 cols
[2025-06-03 18:12:34] [INFO ] Computed 118 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:12:34] [INFO ] Implicit Places using invariants in 190 ms returned [203, 208, 214, 221, 224, 228, 230, 232, 249, 270, 273, 280, 298, 314]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 199 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 304/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p3) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p3), (NOT p3), (NOT p3), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-10
Entered a terminal (fully accepting) state of product in 63 steps with 2 reset in 1 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-10 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0||G(p1))) U X(p2))&&(G(p2)||X(p3))))'
Support contains 9 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 18:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:12:35] [INFO ] Implicit Places using invariants in 186 ms returned [203, 208, 221, 224, 228, 230, 232, 243, 249, 270, 273, 280, 288, 298, 306, 310, 314]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 188 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), (NOT p3), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2552 steps with 1 reset in 15 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-11 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 7 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 318 /318 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 18:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:12:35] [INFO ] Implicit Places using invariants in 181 ms returned [208, 214, 221, 224, 228, 230, 232, 243, 249, 270, 273, 280, 288, 298, 306, 310, 314]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 181 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/318 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 301/318 places, 202/202 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-12
Stuttering criterion allowed to conclude after 2550 steps with 0 reset in 15 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-12 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)||G(p1)))'
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 202/202 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 317 transition count 201
Applied a total of 2 rules in 7 ms. Remains 317 /318 variables (removed 1) and now considering 201/202 (removed 1) transitions.
// Phase 1: matrix 201 rows 317 cols
[2025-06-03 18:12:35] [INFO ] Computed 118 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:12:36] [INFO ] Implicit Places using invariants in 212 ms returned [202, 207, 213, 220, 227, 229, 231, 242, 248, 269, 272, 279, 287, 297, 305, 309, 313]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 231 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/318 places, 201/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 300/318 places, 201/202 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-15
Stuttering criterion allowed to conclude after 2551 steps with 0 reset in 14 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-15 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(F(p0)) U (X(X(p1))||(p0 U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-06-03 18:12:36] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
[2025-06-03 18:12:36] [INFO ] Applying decomposition
[2025-06-03 18:12:36] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin8378023653543231437
[2025-06-03 18:12:36] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2025-06-03 18:12:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:12:36] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2025-06-03 18:12:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:12:36] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2025-06-03 18:12:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:12:36] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8378023653543231437
Running compilation step : cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph2545273256856018884.txt' '-o' '/tmp/graph2545273256856018884.bin' '-w' '/tmp/graph2545273256856018884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2545273256856018884.bin' '-l' '-1' '-v' '-w' '/tmp/graph2545273256856018884.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:12:36] [INFO ] Decomposing Gal with order
[2025-06-03 18:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:12:36] [INFO ] Flatten gal took : 17 ms
[2025-06-03 18:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 18:12:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13306162731418376916.gal : 3 ms
[2025-06-03 18:12:36] [INFO ] Time to serialize properties into /tmp/LTLFireability1698140640979368877.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13306162731418376916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1698140640979368877.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F(("((i3.u17.r_0_17==0)||(i3.u103.r_1_17==0))")||(("(i3.u18.p_1_18==0)")||(G("(((i4.u24.r_0_24==1)&&(i4.u107.r_1_24==1))&&(i4.u25...175
Formula 0 simplified : G(F!"(((i4.u24.r_0_24==1)&&(i4.u107.r_1_24==1))&&(i4.u25.p_1_25==1))" & FG(!"((i3.u17.r_0_17==0)||(i3.u103.r_1_17==0))" & !"(i3.u18....168
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Compilation finished in 661 ms.
Running link step : cd /tmp/ltsmin8378023653543231437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Computing Next relation with stutter on 99 deadlock states
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(X(<>((LTLAPp2==true))) U (X(X((LTLAPp3==true)))||((LTLAPp2==true) U (LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: LTL layer: formula: <>(!(X(<>((LTLAPp2==true))) U (X(X((LTLAPp3==true)))||((LTLAPp2==true) U (LTLAPp4==true)))))
pins2lts-mc-linux64( 7/ 8), 0.004: "<>(!(X(<>((LTLAPp2==true))) U (X(X((LTLAPp3==true)))||((LTLAPp2==true) U (LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.097: There are 211 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.097: State length is 319, there are 252 groups
pins2lts-mc-linux64( 0/ 8), 0.097: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.097: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.097: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.097: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.181: [Blue] ~27 levels ~960 states ~2216 transitions
pins2lts-mc-linux64( 6/ 8), 0.237: [Blue] ~46 levels ~1920 states ~4400 transitions
pins2lts-mc-linux64( 6/ 8), 0.327: [Blue] ~81 levels ~3840 states ~8432 transitions
pins2lts-mc-linux64( 6/ 8), 0.543: [Blue] ~149 levels ~7680 states ~17000 transitions
pins2lts-mc-linux64( 2/ 8), 0.881: [Blue] ~215 levels ~15360 states ~32200 transitions
pins2lts-mc-linux64( 2/ 8), 1.420: [Blue] ~329 levels ~30720 states ~57632 transitions
pins2lts-mc-linux64( 2/ 8), 2.224: [Blue] ~780 levels ~61440 states ~121944 transitions
pins2lts-mc-linux64( 2/ 8), 5.033: [Blue] ~2126 levels ~122880 states ~241616 transitions
pins2lts-mc-linux64( 2/ 8), 8.858: [Blue] ~2951 levels ~245760 states ~534704 transitions
pins2lts-mc-linux64( 2/ 8), 15.587: [Blue] ~2951 levels ~491520 states ~1281152 transitions
pins2lts-mc-linux64( 2/ 8), 24.848: [Blue] ~2951 levels ~983040 states ~3065680 transitions
pins2lts-mc-linux64( 2/ 8), 36.962: [Blue] ~2951 levels ~1966080 states ~6485584 transitions
pins2lts-mc-linux64( 2/ 8), 51.697: [Blue] ~2951 levels ~3932160 states ~14792472 transitions
pins2lts-mc-linux64( 2/ 8), 82.320: [Blue] ~2951 levels ~7864320 states ~32662832 transitions
pins2lts-mc-linux64( 2/ 8), 139.472: [Blue] ~2951 levels ~15728640 states ~65089304 transitions
pins2lts-mc-linux64( 4/ 8), 177.587: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 177.697:
pins2lts-mc-linux64( 0/ 8), 177.697: Explored 18292309 states 80920427 transitions, fanout: 4.424
pins2lts-mc-linux64( 0/ 8), 177.697: Total exploration time 177.550 sec (177.460 sec minimum, 177.505 sec on average)
pins2lts-mc-linux64( 0/ 8), 177.697: States per second: 103026, Transitions per second: 455761
pins2lts-mc-linux64( 0/ 8), 177.697:
pins2lts-mc-linux64( 0/ 8), 177.697: State space has 17910675 states, 6323435 are accepting
pins2lts-mc-linux64( 0/ 8), 177.697: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 177.697: blue states: 18292309 (102.13%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 177.697: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 177.697: all-red states: 13020374 (72.70%), bogus 211634 (1.18%)
pins2lts-mc-linux64( 0/ 8), 177.697:
pins2lts-mc-linux64( 0/ 8), 177.697: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 177.697:
pins2lts-mc-linux64( 0/ 8), 177.697: Queue width: 8B, total height: 25204, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 177.697: Tree memory: 392.6MB, 23.0 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 177.697: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 177.697: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 177.697: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 177.697: Est. total memory use: 392.8MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(X(<>((LTLAPp2==true))) U (X(X((LTLAPp3==true)))||((LTLAPp2==true) U (LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8378023653543231437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(X(<>((LTLAPp2==true))) U (X(X((LTLAPp3==true)))||((LTLAPp2==true) U (LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
70153 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,701.603,2238152,1,0,6.74285e+06,75,765,1.35933e+06,49,105,514577
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R100C002-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!((X(F("((i2.u13.p_0_13==1)&&(i2.u14.r_0_14==1))")))U((X(X("(((i1.u6.r_0_6==1)&&(i1.u101.r_1_6==1))&&(i1.u7.p_1_7==1))")))||(("((...246
Formula 1 simplified : G(XF"((i2.u13.p_0_13==1)&&(i2.u14.r_0_14==1))" U (XX"(((i1.u6.r_0_6==1)&&(i1.u101.r_1_6==1))&&(i1.u7.p_1_7==1))" | ("((i2.u13.p_0_13...229
Computing Next relation with stutter on 99 deadlock states
Detected timeout of ITS tools.
[2025-06-03 18:37:59] [INFO ] Applying decomposition
[2025-06-03 18:37:59] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:37:59] [INFO ] Decomposing Gal with order
[2025-06-03 18:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:37:59] [INFO ] Flatten gal took : 27 ms
[2025-06-03 18:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 18:37:59] [INFO ] Time to serialize gal into /tmp/LTLFireability998043812537859397.gal : 2 ms
[2025-06-03 18:37:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1219289939091145087.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability998043812537859397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1219289939091145087.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 3 LTL properties
Checking formula 0 : !((F(!((X(F("((u87.p_0_13==1)&&(u86.r_0_14==1))")))U((X(X("(((u94.r_0_6==1)&&(u107.r_1_6==1))&&(u93.p_1_7==1))")))||(("((u87.p_0_13==1...221
Formula 0 simplified : G(XF"((u87.p_0_13==1)&&(u86.r_0_14==1))" U (XX"(((u94.r_0_6==1)&&(u107.r_1_6==1))&&(u93.p_1_7==1))" | ("((u87.p_0_13==1)&&(u86.r_0_1...204
Reverse transition relation is NOT exact ! Due to transitions u1.t100, u100.t101, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 99 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLFireability"
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 ResAllocation-PT-R100C002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889263700188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;