Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000323.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 ASLink-PT-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 544K 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 ASLink-PT-03b-LTLCardinality-00
FORMULA_NAME ASLink-PT-03b-LTLCardinality-01
FORMULA_NAME ASLink-PT-03b-LTLCardinality-02
FORMULA_NAME ASLink-PT-03b-LTLCardinality-03
FORMULA_NAME ASLink-PT-03b-LTLCardinality-04
FORMULA_NAME ASLink-PT-03b-LTLCardinality-05
FORMULA_NAME ASLink-PT-03b-LTLCardinality-06
FORMULA_NAME ASLink-PT-03b-LTLCardinality-07
FORMULA_NAME ASLink-PT-03b-LTLCardinality-08
FORMULA_NAME ASLink-PT-03b-LTLCardinality-09
FORMULA_NAME ASLink-PT-03b-LTLCardinality-10
FORMULA_NAME ASLink-PT-03b-LTLCardinality-11
FORMULA_NAME ASLink-PT-03b-LTLCardinality-12
FORMULA_NAME ASLink-PT-03b-LTLCardinality-13
FORMULA_NAME ASLink-PT-03b-LTLCardinality-14
FORMULA_NAME ASLink-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748573660523

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 02:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 02:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:54:21] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-05-30 02:54:21] [INFO ] Transformed 1638 places.
[2025-05-30 02:54:21] [INFO ] Transformed 2094 transitions.
[2025-05-30 02:54:21] [INFO ] Found NUPN structural information;
[2025-05-30 02:54:21] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-03b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1638 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 1543 transition count 1999
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 1543 transition count 1999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 191 place count 1543 transition count 1998
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 222 place count 1512 transition count 1949
Iterating global reduction 1 with 31 rules applied. Total rules applied 253 place count 1512 transition count 1949
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 264 place count 1512 transition count 1938
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 269 place count 1507 transition count 1933
Iterating global reduction 2 with 5 rules applied. Total rules applied 274 place count 1507 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 276 place count 1505 transition count 1924
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 1505 transition count 1924
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 280 place count 1503 transition count 1922
Iterating global reduction 2 with 2 rules applied. Total rules applied 282 place count 1503 transition count 1922
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 284 place count 1501 transition count 1913
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 1501 transition count 1913
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 287 place count 1500 transition count 1905
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 1500 transition count 1905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 289 place count 1499 transition count 1904
Iterating global reduction 2 with 1 rules applied. Total rules applied 290 place count 1499 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 291 place count 1498 transition count 1896
Iterating global reduction 2 with 1 rules applied. Total rules applied 292 place count 1498 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 293 place count 1497 transition count 1888
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 1497 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 295 place count 1496 transition count 1887
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 1496 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 1495 transition count 1879
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 1495 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 299 place count 1494 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 1494 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 301 place count 1493 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 302 place count 1493 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 1492 transition count 1862
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 1492 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 305 place count 1491 transition count 1854
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 1491 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 1490 transition count 1853
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 1490 transition count 1853
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 309 place count 1489 transition count 1845
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 1489 transition count 1845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 311 place count 1488 transition count 1837
Iterating global reduction 2 with 1 rules applied. Total rules applied 312 place count 1488 transition count 1837
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 313 place count 1487 transition count 1836
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 1487 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 1486 transition count 1828
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 1486 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 317 place count 1485 transition count 1820
Iterating global reduction 2 with 1 rules applied. Total rules applied 318 place count 1485 transition count 1820
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 319 place count 1484 transition count 1819
Iterating global reduction 2 with 1 rules applied. Total rules applied 320 place count 1484 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 321 place count 1483 transition count 1811
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 1483 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 323 place count 1482 transition count 1803
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 1482 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 1481 transition count 1802
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 1481 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 1480 transition count 1794
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 1480 transition count 1794
Applied a total of 328 rules in 2103 ms. Remains 1480 /1638 variables (removed 158) and now considering 1794/2094 (removed 300) transitions.
// Phase 1: matrix 1794 rows 1480 cols
[2025-05-30 02:54:24] [INFO ] Computed 160 invariants in 101 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:54:25] [INFO ] Implicit Places using invariants in 1252 ms returned [1314, 1325, 1336, 1344, 1352, 1360, 1368, 1387, 1395, 1406]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1464 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1470/1638 places, 1794/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1458 transition count 1782
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1458 transition count 1782
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1448 transition count 1772
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1448 transition count 1772
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1440 transition count 1764
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1440 transition count 1764
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1436 transition count 1760
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1436 transition count 1760
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1434 transition count 1758
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1434 transition count 1758
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1432 transition count 1756
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1432 transition count 1756
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1430 transition count 1754
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1430 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1429 transition count 1753
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1429 transition count 1753
Applied a total of 82 rules in 393 ms. Remains 1429 /1470 variables (removed 41) and now considering 1753/1794 (removed 41) transitions.
// Phase 1: matrix 1753 rows 1429 cols
[2025-05-30 02:54:26] [INFO ] Computed 150 invariants in 75 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:54:27] [INFO ] Implicit Places using invariants in 914 ms returned []
[2025-05-30 02:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:54:30] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1429/1638 places, 1753/2094 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8341 ms. Remains : 1429/1638 places, 1753/2094 transitions.
Support contains 34 out of 1429 places after structural reductions.
[2025-05-30 02:54:30] [INFO ] Flatten gal took : 141 ms
[2025-05-30 02:54:31] [INFO ] Flatten gal took : 85 ms
[2025-05-30 02:54:31] [INFO ] Input system was already deterministic with 1753 transitions.
RANDOM walk for 40000 steps (114 resets) in 1190 ms. (33 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40004 steps (20 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (21 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (19 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (18 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
[2025-05-30 02:54:31] [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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 434/483 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 925/1408 variables, 109/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 21/1429 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1429 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1753/3182 variables, 1429/1579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3182 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3182 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3182/3182 variables, and 1579 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 112/112 constraints, State Equation: 1429/1429 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 434/483 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 925/1408 variables, 109/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:34] [INFO ] Deduced a trap composed of 22 places in 400 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:34] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:35] [INFO ] Deduced a trap composed of 100 places in 319 ms of which 70 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 21/1429 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1429 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1753/3182 variables, 1429/1582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3182 variables, 4/1586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:38] [INFO ] Deduced a trap composed of 49 places in 381 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:38] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:38] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 32 ms to minimize.
SMT process timed out in 6979ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 262 place count 1429 transition count 1491
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 265 rules applied. Total rules applied 527 place count 1167 transition count 1488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 529 place count 1165 transition count 1488
Performed 377 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 377 Pre rules applied. Total rules applied 529 place count 1165 transition count 1111
Deduced a syphon composed of 377 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 410 places and 0 transitions.
Iterating global reduction 3 with 787 rules applied. Total rules applied 1316 place count 755 transition count 1111
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 23 rules applied. Total rules applied 1339 place count 752 transition count 1091
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 21 rules applied. Total rules applied 1360 place count 732 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1361 place count 731 transition count 1090
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1361 place count 731 transition count 1077
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1400 place count 705 transition count 1077
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1400 place count 705 transition count 1065
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1424 place count 693 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1427 place count 690 transition count 1062
Iterating global reduction 6 with 3 rules applied. Total rules applied 1430 place count 690 transition count 1062
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1430 place count 690 transition count 1061
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1432 place count 689 transition count 1061
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 6 with 233 rules applied. Total rules applied 1665 place count 572 transition count 945
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1669 place count 568 transition count 941
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1674 place count 567 transition count 941
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1674 place count 567 transition count 940
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1676 place count 566 transition count 940
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1678 place count 564 transition count 938
Iterating global reduction 6 with 2 rules applied. Total rules applied 1680 place count 564 transition count 938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1682 place count 564 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1683 place count 563 transition count 936
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1685 place count 562 transition count 942
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1689 place count 562 transition count 938
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1693 place count 558 transition count 938
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1695 place count 558 transition count 936
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1697 place count 556 transition count 936
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1699 place count 556 transition count 936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1700 place count 555 transition count 935
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 6 rules applied. Total rules applied 1706 place count 550 transition count 934
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 1708 place count 549 transition count 933
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1709 place count 548 transition count 933
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 1709 place count 548 transition count 925
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 17 rules applied. Total rules applied 1726 place count 539 transition count 925
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 1730 place count 535 transition count 925
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1730 place count 535 transition count 924
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1732 place count 534 transition count 924
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 1744 place count 528 transition count 918
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1746 place count 526 transition count 916
Iterating global reduction 14 with 2 rules applied. Total rules applied 1748 place count 526 transition count 916
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1750 place count 526 transition count 914
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1752 place count 524 transition count 914
Applied a total of 1752 rules in 537 ms. Remains 524 /1429 variables (removed 905) and now considering 914/1753 (removed 839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 524/1429 places, 914/1753 transitions.
RANDOM walk for 40000 steps (562 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (153 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (150 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (155 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (140 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 401777 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 4
Probabilistic random walk after 401777 steps, saw 93572 distinct states, run finished after 3005 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 914 rows 524 cols
[2025-05-30 02:54:42] [INFO ] Computed 89 invariants in 9 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/97 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 17/114 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 287/401 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 43/444 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 77/521 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/523 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/523 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/524 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 914/1438 variables, 524/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1438 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1438 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1438/1438 variables, and 613 constraints, problems are : Problem set: 0 solved, 4 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 524/524 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/97 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 17/114 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 287/401 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 43/444 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 77/521 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/523 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/523 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/524 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/524 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 914/1438 variables, 524/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1438 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:44] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:54:45] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 12 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1438 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1438 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1438 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1438/1438 variables, and 620 constraints, problems are : Problem set: 0 solved, 4 unsolved in 26808 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27488ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 22845 ms.
Support contains 10 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 914/914 transitions.
Applied a total of 0 rules in 16 ms. Remains 524 /524 variables (removed 0) and now considering 914/914 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 524/524 places, 914/914 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 914/914 transitions.
Applied a total of 0 rules in 15 ms. Remains 524 /524 variables (removed 0) and now considering 914/914 (removed 0) transitions.
[2025-05-30 02:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:55:33] [INFO ] Implicit Places using invariants in 381 ms returned [1, 18, 19, 50, 68, 149, 158, 159, 160, 161, 163, 180, 198, 271, 275, 276, 287, 288, 290, 307, 325, 395, 399, 400, 403, 414, 415, 416, 434, 438, 456, 457, 458, 459, 484]
[2025-05-30 02:55:33] [INFO ] Actually due to overlaps returned [434, 416, 50, 180, 307, 163, 290, 160, 287, 414, 456, 161, 288, 415, 457, 1, 18, 158, 275, 276, 399, 400, 68, 198, 325, 438, 458, 19, 159, 403, 459, 484]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 383 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 492/524 places, 914/914 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 490 transition count 863
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 57 rules applied. Total rules applied 110 place count 439 transition count 857
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 434 transition count 857
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 115 place count 434 transition count 836
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 158 place count 412 transition count 836
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 170 place count 408 transition count 828
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 178 place count 400 transition count 828
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 183 place count 395 transition count 823
Iterating global reduction 5 with 5 rules applied. Total rules applied 188 place count 395 transition count 823
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 191 place count 395 transition count 820
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 192 place count 394 transition count 818
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 394 transition count 818
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 247 place count 367 transition count 791
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 249 place count 365 transition count 789
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 365 transition count 789
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 253 place count 365 transition count 787
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 257 place count 363 transition count 788
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 258 place count 363 transition count 787
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 265 place count 363 transition count 780
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 273 place count 355 transition count 780
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 281 place count 355 transition count 780
Applied a total of 281 rules in 101 ms. Remains 355 /492 variables (removed 137) and now considering 780/914 (removed 134) transitions.
// Phase 1: matrix 780 rows 355 cols
[2025-05-30 02:55:33] [INFO ] Computed 49 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:55:33] [INFO ] Implicit Places using invariants in 262 ms returned [98, 104, 107, 109, 117, 120, 121, 174, 193, 199, 202, 204, 209, 210, 262, 280, 286, 289, 291]
[2025-05-30 02:55:33] [INFO ] Actually due to overlaps returned [120, 209, 121, 210, 98, 104, 109, 199, 204, 280, 286, 291, 117, 174, 193, 262]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 265 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 339/524 places, 780/914 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 328 transition count 769
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 328 transition count 769
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 326 transition count 767
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 326 transition count 767
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 36 place count 321 transition count 762
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 321 transition count 753
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 312 transition count 753
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 312 transition count 752
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 311 transition count 752
Applied a total of 56 rules in 59 ms. Remains 311 /339 variables (removed 28) and now considering 752/780 (removed 28) transitions.
// Phase 1: matrix 752 rows 311 cols
[2025-05-30 02:55:33] [INFO ] Computed 33 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:55:34] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-30 02:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:55:34] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 311/524 places, 752/914 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1606 ms. Remains : 311/524 places, 752/914 transitions.
RANDOM walk for 40000 steps (912 resets) in 146 ms. (272 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (266 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (275 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (244 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
[2025-05-30 02:55:34] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 179/254 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 35/289 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 22/311 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 752/1063 variables, 311/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1063 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1063 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 344 constraints, problems are : Problem set: 0 solved, 3 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 179/254 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:35] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 35/289 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 22/311 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:35] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/311 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 752/1063 variables, 311/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1063 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:55:37] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1063 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1063 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1063 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 350 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11218 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11570ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 10847 ms.
Support contains 8 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 752/752 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 309 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 308 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 308 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 307 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 307 transition count 748
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 306 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 306 transition count 746
Applied a total of 11 rules in 33 ms. Remains 306 /311 variables (removed 5) and now considering 746/752 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 306/311 places, 746/752 transitions.
RANDOM walk for 40000 steps (891 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (274 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (277 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (260 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 346471 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 3
Probabilistic random walk after 346471 steps, saw 141514 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 746 rows 306 cols
[2025-05-30 02:56:00] [INFO ] Computed 33 invariants in 7 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 194/253 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 36/289 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/306 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 746/1052 variables, 306/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1052 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1052 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 339 constraints, problems are : Problem set: 0 solved, 3 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 194/253 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 36/289 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/306 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:00] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 746/1052 variables, 306/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1052 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:03] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 12 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1052 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1052 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1052 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 344 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4853 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5201ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2913 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 746/746 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 306/306 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 746/746 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2025-05-30 02:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:08] [INFO ] Implicit Places using invariants in 236 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 305/306 places, 746/746 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 304 transition count 745
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 303 transition count 743
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 303 transition count 743
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 303 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 302 transition count 742
Applied a total of 6 rules in 25 ms. Remains 302 /305 variables (removed 3) and now considering 742/746 (removed 4) transitions.
// Phase 1: matrix 742 rows 302 cols
[2025-05-30 02:56:08] [INFO ] Computed 32 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:08] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 02:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:09] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/306 places, 742/746 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1033 ms. Remains : 302/306 places, 742/746 transitions.
RANDOM walk for 40000 steps (828 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (254 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (281 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (229 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 382007 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 3
Probabilistic random walk after 382007 steps, saw 157608 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-30 02:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/252 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/288 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14/302 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 742/1044 variables, 302/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1044 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1044 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1044/1044 variables, and 334 constraints, problems are : Problem set: 0 solved, 3 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 207/252 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 36/288 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:13] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 14/302 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:13] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 742/1044 variables, 302/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1044 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1044 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 340 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7093 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7432ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 9906 ms.
Support contains 8 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 742/742 transitions.
Applied a total of 0 rules in 8 ms. Remains 302 /302 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 302/302 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 742/742 transitions.
Applied a total of 0 rules in 7 ms. Remains 302 /302 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2025-05-30 02:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:30] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 02:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:56:30] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:56:30] [INFO ] Redundant transitions in 42 ms returned []
Running 721 sub problems to find dead transitions.
[2025-05-30 02:56:30] [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, 5/5 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:34] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:37] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/30 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 4 (OVERLAPS) 1/302 variables, 3/33 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 717 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:56] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:57] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:56:59] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:00] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:00] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 35 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 4 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1044 variables, and 39 constraints, problems are : Problem set: 4 solved, 717 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 717 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 23/28 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 2/30 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 4 (OVERLAPS) 1/302 variables, 3/33 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 4 solved, 717 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:57:08] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/40 constraints. Problems are: Problem set: 4 solved, 717 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 717 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 9 (OVERLAPS) 742/1044 variables, 302/342 constraints. Problems are: Problem set: 52 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 1011 constraints, problems are : Problem set: 52 solved, 669 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 669/721 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 52 solved, 669 unsolved
Search for dead transitions found 52 dead transitions in 60370ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 302/302 places, 690/742 transitions.
Applied a total of 0 rules in 8 ms. Remains 302 /302 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:57:31] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61242 ms. Remains : 302/302 places, 690/742 transitions.
Computed a total of 61 stabilizing places and 61 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' '!(F(G(p0)))'
Support contains 4 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 1428 transition count 1487
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 270 rules applied. Total rules applied 535 place count 1163 transition count 1482
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 1160 transition count 1482
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 378 Pre rules applied. Total rules applied 538 place count 1160 transition count 1104
Deduced a syphon composed of 378 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1328 place count 748 transition count 1104
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 24 rules applied. Total rules applied 1352 place count 745 transition count 1083
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 22 rules applied. Total rules applied 1374 place count 724 transition count 1082
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1375 place count 723 transition count 1082
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1375 place count 723 transition count 1069
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1414 place count 697 transition count 1069
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1414 place count 697 transition count 1057
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1438 place count 685 transition count 1057
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1442 place count 681 transition count 1053
Iterating global reduction 6 with 4 rules applied. Total rules applied 1446 place count 681 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1446 place count 681 transition count 1051
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1450 place count 679 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1451 place count 678 transition count 1045
Iterating global reduction 6 with 1 rules applied. Total rules applied 1452 place count 678 transition count 1045
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 6 with 227 rules applied. Total rules applied 1679 place count 564 transition count 932
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1683 place count 560 transition count 928
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1688 place count 559 transition count 928
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1688 place count 559 transition count 927
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 1690 place count 558 transition count 927
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1692 place count 556 transition count 925
Iterating global reduction 6 with 2 rules applied. Total rules applied 1694 place count 556 transition count 925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1696 place count 556 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1697 place count 555 transition count 923
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1699 place count 554 transition count 929
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1701 place count 552 transition count 927
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 8 rules applied. Total rules applied 1709 place count 546 transition count 925
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 1712 place count 544 transition count 924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1713 place count 543 transition count 924
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 9 Pre rules applied. Total rules applied 1713 place count 543 transition count 915
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 19 rules applied. Total rules applied 1732 place count 533 transition count 915
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 1739 place count 526 transition count 915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1739 place count 526 transition count 914
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 1741 place count 525 transition count 914
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 1759 place count 516 transition count 905
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1764 place count 511 transition count 900
Iterating global reduction 12 with 5 rules applied. Total rules applied 1769 place count 511 transition count 900
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1771 place count 509 transition count 898
Iterating global reduction 12 with 2 rules applied. Total rules applied 1773 place count 509 transition count 898
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1775 place count 509 transition count 896
Applied a total of 1775 rules in 264 ms. Remains 509 /1429 variables (removed 920) and now considering 896/1753 (removed 857) transitions.
// Phase 1: matrix 896 rows 509 cols
[2025-05-30 02:57:31] [INFO ] Computed 84 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:32] [INFO ] Implicit Places using invariants in 514 ms returned [1, 18, 19, 31, 48, 66, 140, 150, 151, 153, 170, 188, 208, 260, 261, 273, 274, 276, 293, 311, 330, 383, 384, 387, 398, 399, 400, 418, 422, 440, 441, 442, 443, 469]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 515 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 475/1429 places, 896/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 475 transition count 836
Reduce places removed 60 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 122 place count 415 transition count 834
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 413 transition count 834
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 124 place count 413 transition count 815
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 163 place count 393 transition count 815
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 175 place count 389 transition count 807
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 183 place count 381 transition count 807
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 188 place count 376 transition count 802
Iterating global reduction 5 with 5 rules applied. Total rules applied 193 place count 376 transition count 802
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 196 place count 376 transition count 799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 375 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 375 transition count 797
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 250 place count 349 transition count 771
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 254 place count 347 transition count 772
Applied a total of 254 rules in 45 ms. Remains 347 /475 variables (removed 128) and now considering 772/896 (removed 124) transitions.
// Phase 1: matrix 772 rows 347 cols
[2025-05-30 02:57:32] [INFO ] Computed 45 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:32] [INFO ] Implicit Places using invariants in 387 ms returned [91, 97, 102, 179, 185, 190, 268, 274, 279, 344]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 388 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/1429 places, 772/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 336 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 330 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 330 transition count 765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 324 transition count 759
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 324 transition count 759
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 321 transition count 756
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 321 transition count 756
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 318 transition count 753
Applied a total of 38 rules in 33 ms. Remains 318 /337 variables (removed 19) and now considering 753/772 (removed 19) transitions.
// Phase 1: matrix 753 rows 318 cols
[2025-05-30 02:57:32] [INFO ] Computed 35 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:32] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 02:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:33] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 318/1429 places, 753/1753 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2072 ms. Remains : 318/1429 places, 753/1753 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-00
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-03b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLCardinality-00 finished in 2320 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(!p0)||((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(p2)))))))&&X(p3))))))'
Support contains 5 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1420 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1420 transition count 1744
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 1416 transition count 1735
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 1416 transition count 1735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1416 transition count 1734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 1413 transition count 1731
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 1413 transition count 1731
Applied a total of 33 rules in 188 ms. Remains 1413 /1429 variables (removed 16) and now considering 1731/1753 (removed 22) transitions.
// Phase 1: matrix 1731 rows 1413 cols
[2025-05-30 02:57:33] [INFO ] Computed 150 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:34] [INFO ] Implicit Places using invariants in 791 ms returned [1331]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 794 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1412/1429 places, 1731/1753 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1410 transition count 1729
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1410 transition count 1729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1408 transition count 1727
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1408 transition count 1727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1406 transition count 1725
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1406 transition count 1725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1405 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1405 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1404 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1403 transition count 1722
Applied a total of 18 rules in 324 ms. Remains 1403 /1412 variables (removed 9) and now considering 1722/1731 (removed 9) transitions.
// Phase 1: matrix 1722 rows 1403 cols
[2025-05-30 02:57:35] [INFO ] Computed 149 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:35] [INFO ] Implicit Places using invariants in 748 ms returned []
[2025-05-30 02:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:40] [INFO ] Implicit Places using invariants and state equation in 5195 ms returned []
Implicit Place search using SMT with State Equation took 5947 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1403/1429 places, 1722/1753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7254 ms. Remains : 1403/1429 places, 1722/1753 transitions.
Stuttering acceptance computed with spot in 700 ms :[p0, p0, (AND p0 (NOT p3)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), false, false, (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-04
Stuttering criterion allowed to conclude after 479 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-03b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLCardinality-04 finished in 8018 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))||(p0 U G(!p1))))'
Support contains 4 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 1428 transition count 1491
Reduce places removed 261 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 264 rules applied. Total rules applied 525 place count 1167 transition count 1488
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 528 place count 1165 transition count 1487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 529 place count 1164 transition count 1487
Performed 378 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 378 Pre rules applied. Total rules applied 529 place count 1164 transition count 1109
Deduced a syphon composed of 378 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 411 places and 0 transitions.
Iterating global reduction 4 with 789 rules applied. Total rules applied 1318 place count 753 transition count 1109
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 24 rules applied. Total rules applied 1342 place count 750 transition count 1088
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1363 place count 729 transition count 1088
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1363 place count 729 transition count 1075
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1402 place count 703 transition count 1075
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1402 place count 703 transition count 1063
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1426 place count 691 transition count 1063
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1430 place count 687 transition count 1059
Iterating global reduction 6 with 4 rules applied. Total rules applied 1434 place count 687 transition count 1059
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1434 place count 687 transition count 1057
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1438 place count 685 transition count 1057
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1439 place count 684 transition count 1051
Iterating global reduction 6 with 1 rules applied. Total rules applied 1440 place count 684 transition count 1051
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 6 with 227 rules applied. Total rules applied 1667 place count 570 transition count 938
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1671 place count 566 transition count 934
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1676 place count 565 transition count 934
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1676 place count 565 transition count 933
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 1678 place count 564 transition count 933
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1680 place count 562 transition count 931
Iterating global reduction 6 with 2 rules applied. Total rules applied 1682 place count 562 transition count 931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1684 place count 562 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1685 place count 561 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1687 place count 560 transition count 935
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1689 place count 558 transition count 933
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 7 rules applied. Total rules applied 1696 place count 553 transition count 931
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1698 place count 551 transition count 931
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 1698 place count 551 transition count 923
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1715 place count 542 transition count 923
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 10 with 6 rules applied. Total rules applied 1721 place count 536 transition count 923
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1721 place count 536 transition count 922
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 1723 place count 535 transition count 922
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1741 place count 526 transition count 913
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1746 place count 521 transition count 908
Iterating global reduction 11 with 5 rules applied. Total rules applied 1751 place count 521 transition count 908
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1754 place count 518 transition count 905
Iterating global reduction 11 with 3 rules applied. Total rules applied 1757 place count 518 transition count 905
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1760 place count 518 transition count 902
Applied a total of 1760 rules in 252 ms. Remains 518 /1429 variables (removed 911) and now considering 902/1753 (removed 851) transitions.
// Phase 1: matrix 902 rows 518 cols
[2025-05-30 02:57:41] [INFO ] Computed 87 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:42] [INFO ] Implicit Places using invariants in 401 ms returned [1, 18, 19, 31, 48, 66, 87, 145, 155, 156, 157, 158, 160, 177, 195, 215, 268, 269, 281, 282, 284, 301, 319, 338, 392, 393, 396, 407, 408, 409, 427, 431, 449, 450, 451, 452, 478]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 403 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 481/1429 places, 902/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 481 transition count 840
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 419 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 418 transition count 839
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 126 place count 418 transition count 819
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 167 place count 397 transition count 819
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 179 place count 393 transition count 811
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 187 place count 385 transition count 811
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 192 place count 380 transition count 806
Iterating global reduction 5 with 5 rules applied. Total rules applied 197 place count 380 transition count 806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 200 place count 380 transition count 803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 379 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 379 transition count 801
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 256 place count 352 transition count 774
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 260 place count 350 transition count 775
Applied a total of 260 rules in 41 ms. Remains 350 /481 variables (removed 131) and now considering 775/902 (removed 127) transitions.
// Phase 1: matrix 775 rows 350 cols
[2025-05-30 02:57:42] [INFO ] Computed 45 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:42] [INFO ] Implicit Places using invariants in 244 ms returned [88, 94, 99, 180, 186, 191, 269, 275, 282, 347]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 248 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1429 places, 775/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 339 transition count 774
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 333 transition count 768
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 333 transition count 768
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 328 transition count 763
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 328 transition count 763
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 326 transition count 761
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 326 transition count 761
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 323 transition count 758
Applied a total of 34 rules in 30 ms. Remains 323 /340 variables (removed 17) and now considering 758/775 (removed 17) transitions.
// Phase 1: matrix 758 rows 323 cols
[2025-05-30 02:57:42] [INFO ] Computed 35 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:42] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 02:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:43] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 323/1429 places, 758/1753 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1809 ms. Remains : 323/1429 places, 758/1753 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-05
Product exploration explored 100000 steps with 1991 reset in 248 ms.
Product exploration explored 100000 steps with 1966 reset in 245 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 p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (782 resets) in 174 ms. (228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (209 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (219 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (220 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2025-05-30 02:57:44] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 155/202 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/232 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/323 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 758/1081 variables, 323/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1081 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 358 constraints, problems are : Problem set: 0 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 155/202 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/232 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/323 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 758/1081 variables, 323/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1081 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 361 constraints, problems are : Problem set: 0 solved, 3 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 1777 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 758/758 transitions.
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 323 transition count 744
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 30 place count 309 transition count 742
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 309 transition count 733
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 48 place count 300 transition count 733
Applied a total of 48 rules in 31 ms. Remains 300 /323 variables (removed 23) and now considering 733/758 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 300/323 places, 733/758 transitions.
RANDOM walk for 40000 steps (921 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (249 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 603811 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 603811 steps, saw 179221 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
// Phase 1: matrix 733 rows 300 cols
[2025-05-30 02:57:50] [INFO ] Computed 35 invariants in 14 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/210 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/300 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1033 variables, 300/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1033 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1033/1033 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/210 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/300 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1033 variables, 300/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1033 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1033 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1033/1033 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 733/733 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 300/300 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2025-05-30 02:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:51] [INFO ] Implicit Places using invariants in 213 ms returned [93, 94, 167, 168]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 215 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/300 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 229 ms. Remains : 296/300 places, 733/733 transitions.
RANDOM walk for 40000 steps (932 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 603403 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 603403 steps, saw 179079 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
// Phase 1: matrix 733 rows 296 cols
[2025-05-30 02:57:54] [INFO ] Computed 31 invariants in 13 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/225 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/296 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1029 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1029 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/225 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/296 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1029 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 733/733 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 296/296 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 733/733 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2025-05-30 02:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:55] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 02:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:57:55] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:57:55] [INFO ] Redundant transitions in 6 ms returned []
Running 710 sub problems to find dead transitions.
[2025-05-30 02:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 1/296 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:14] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:15] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/1029 variables, and 33 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 1/296 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 7 (OVERLAPS) 733/1029 variables, 296/329 constraints. Problems are: Problem set: 123 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 916 constraints, problems are : Problem set: 123 solved, 587 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 587/710 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 123 solved, 587 unsolved
Search for dead transitions found 123 dead transitions in 60298ms
Found 123 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 123 transitions
Dead transitions reduction (with SMT) removed 123 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 610/733 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 610/610 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:58:56] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61120 ms. Remains : 296/296 places, 610/733 transitions.
RANDOM walk for 40000 steps (944 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (249 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 704913 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :0 out of 1
Probabilistic random walk after 704913 steps, saw 205401 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
// Phase 1: matrix 610 rows 296 cols
[2025-05-30 02:58:59] [INFO ] Computed 31 invariants in 12 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/155 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/264 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/277 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/296 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 610/906 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/906 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/906 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/155 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/264 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:59] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:59] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:59] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/277 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/296 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:59] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:58:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 610/906 variables, 296/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/906 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/906 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/906 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 610/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 610/610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 296/296 places, 610/610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 610/610 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 610/610 (removed 0) transitions.
[2025-05-30 02:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:59:00] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 02:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:59:00] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:59:01] [INFO ] Redundant transitions in 3 ms returned []
Running 587 sub problems to find dead transitions.
[2025-05-30 02:59: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/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:04] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:04] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:04] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 15 ms to minimize.
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 12 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 10 ms to minimize.
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 10 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 11 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:05] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 6 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 21 ms to minimize.
Problem TDEAD198 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 21 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 25 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 22 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:06] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 22 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:07] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 23 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:07] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 18 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:07] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 18 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:07] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 26 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 20/47 constraints. Problems are: Problem set: 132 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:09] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 16 ms to minimize.
Problem TDEAD275 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:09] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 14 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:09] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 12 ms to minimize.
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:10] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 12 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:10] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 12 ms to minimize.
Problem TDEAD404 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:10] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 12 ms to minimize.
Problem TDEAD405 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:10] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 11 ms to minimize.
Problem TDEAD406 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:10] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 20 ms to minimize.
Problem TDEAD472 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 11 ms to minimize.
Problem TDEAD486 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 11 ms to minimize.
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 8 ms to minimize.
Problem TDEAD569 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:11] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 9 ms to minimize.
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:12] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 11 ms to minimize.
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:12] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 9 ms to minimize.
Problem TDEAD599 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 16/63 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/63 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 1/296 variables, 3/66 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 1/67 constraints. Problems are: Problem set: 159 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:22] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:59:23] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 2/69 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/69 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 9 (OVERLAPS) 610/906 variables, 296/365 constraints. Problems are: Problem set: 159 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/906 variables, and 365 constraints, problems are : Problem set: 159 solved, 428 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 159 solved, 428 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 36/63 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/63 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 1/296 variables, 3/66 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 1/67 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/69 constraints. Problems are: Problem set: 159 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/69 constraints. Problems are: Problem set: 159 solved, 428 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD593 is UNSAT
At refinement iteration 8 (OVERLAPS) 610/906 variables, 296/365 constraints. Problems are: Problem set: 325 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/906 variables, 262/627 constraints. Problems are: Problem set: 325 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/906 variables, and 627 constraints, problems are : Problem set: 325 solved, 262 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 262/587 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 325 solved, 262 unsolved
Search for dead transitions found 325 dead transitions in 60165ms
Found 325 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 325 transitions
Dead transitions reduction (with SMT) removed 325 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 285/610 transitions.
Ensure Unique test removed 60 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 236 transition count 225
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 180 place count 176 transition count 225
Applied a total of 180 rules in 4 ms. Remains 176 /296 variables (removed 120) and now considering 225/285 (removed 60) transitions.
// Phase 1: matrix 225 rows 176 cols
[2025-05-30 03:00:01] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 03:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:01] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/296 places, 225/610 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61306 ms. Remains : 176/296 places, 225/610 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 758/758 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 323 cols
[2025-05-30 03:00:01] [INFO ] Computed 35 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:02] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-30 03:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:02] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:00:02] [INFO ] Redundant transitions in 4 ms returned []
Running 730 sub problems to find dead transitions.
[2025-05-30 03:00:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 2/321 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:20] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 730 unsolved
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 30183ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31069 ms. Remains : 323/323 places, 758/758 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (720 resets) in 113 ms. (350 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (219 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
[2025-05-30 03:00:33] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/202 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/232 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/323 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 758/1081 variables, 323/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1081 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/202 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/232 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 91/323 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 758/1081 variables, 323/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1081 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 758/758 transitions.
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 323 transition count 744
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 30 place count 309 transition count 742
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 309 transition count 733
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 48 place count 300 transition count 733
Applied a total of 48 rules in 26 ms. Remains 300 /323 variables (removed 23) and now considering 733/758 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 300/323 places, 733/758 transitions.
RANDOM walk for 40000 steps (904 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (251 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 612583 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 612583 steps, saw 181764 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 733 rows 300 cols
[2025-05-30 03:00:37] [INFO ] Computed 35 invariants in 19 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/210 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/300 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1033 variables, 300/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1033 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1033/1033 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/182 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/210 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/300 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1033 variables, 300/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1033 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1033 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1033/1033 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 300/300 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2025-05-30 03:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:37] [INFO ] Implicit Places using invariants in 227 ms returned [93, 94, 167, 168]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 229 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/300 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 243 ms. Remains : 296/300 places, 733/733 transitions.
RANDOM walk for 40000 steps (906 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (240 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 620420 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 620420 steps, saw 183846 distinct states, run finished after 3003 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 733 rows 296 cols
[2025-05-30 03:00:41] [INFO ] Computed 31 invariants in 9 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/225 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/296 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1029 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1029 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/194 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/225 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 71/296 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 733/1029 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 296/296 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 733/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2025-05-30 03:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:41] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 03:00:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:00:42] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:00:42] [INFO ] Redundant transitions in 5 ms returned []
Running 710 sub problems to find dead transitions.
[2025-05-30 03:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 1/296 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:01] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:01] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/1029 variables, and 33 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 1/296 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 7 (OVERLAPS) 733/1029 variables, 296/329 constraints. Problems are: Problem set: 121 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 918 constraints, problems are : Problem set: 121 solved, 589 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 589/710 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 121 solved, 589 unsolved
Search for dead transitions found 121 dead transitions in 60285ms
Found 121 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 121 transitions
Dead transitions reduction (with SMT) removed 121 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 612/733 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 612/612 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:01:42] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61112 ms. Remains : 296/296 places, 612/733 transitions.
RANDOM walk for 40000 steps (896 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (240 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 683851 steps, run timeout after 3002 ms. (steps per millisecond=227 ) properties seen :0 out of 1
Probabilistic random walk after 683851 steps, saw 199382 distinct states, run finished after 3003 ms. (steps per millisecond=227 ) properties seen :0
// Phase 1: matrix 612 rows 296 cols
[2025-05-30 03:01:45] [INFO ] Computed 31 invariants in 11 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/155 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/264 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/277 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/296 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 612/908 variables, 296/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/908 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 908/908 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/155 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/184 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/264 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:46] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:46] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/277 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/296 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:46] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 612/908 variables, 296/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/908 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/908 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 908/908 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 612/612 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 612/612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 296/296 places, 612/612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 612/612 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 612/612 (removed 0) transitions.
[2025-05-30 03:01:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:47] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-30 03:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:47] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:01:47] [INFO ] Redundant transitions in 3 ms returned []
Running 589 sub problems to find dead transitions.
[2025-05-30 03:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:50] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:50] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:50] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:51] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 12 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:51] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 12 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:51] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 13 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:51] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 11 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:51] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 10 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 10 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 10 ms to minimize.
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 6 ms to minimize.
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 29 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 27 ms to minimize.
Problem TDEAD204 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 20 ms to minimize.
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:52] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 19 ms to minimize.
Problem TDEAD207 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 20 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 24 ms to minimize.
Problem TDEAD216 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 18 ms to minimize.
Problem TDEAD217 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 22 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 18 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD553 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 20/47 constraints. Problems are: Problem set: 120 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:54] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 19 ms to minimize.
Problem TDEAD239 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:55] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 14 ms to minimize.
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:55] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 19 ms to minimize.
Problem TDEAD265 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:55] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 18 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:55] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 15 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:55] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 17 ms to minimize.
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:56] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 10 ms to minimize.
Problem TDEAD402 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 14 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:57] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 22 ms to minimize.
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:57] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 11 ms to minimize.
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:57] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 8 ms to minimize.
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD596 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:57] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 10 ms to minimize.
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 13/60 constraints. Problems are: Problem set: 157 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/60 constraints. Problems are: Problem set: 157 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 1/296 variables, 3/63 constraints. Problems are: Problem set: 157 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 1/64 constraints. Problems are: Problem set: 157 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:09] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:09] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:09] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:09] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 51 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 4/68 constraints. Problems are: Problem set: 157 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/68 constraints. Problems are: Problem set: 157 solved, 432 unsolved
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 157 solved, 432 unsolved
Search for dead transitions found 157 dead transitions in 30122ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 455/612 transitions.
Applied a total of 0 rules in 8 ms. Remains 296 /296 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:02:17] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30899 ms. Remains : 296/296 places, 455/612 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1975 reset in 191 ms.
Product exploration explored 100000 steps with 2015 reset in 200 ms.
Built C files in :
/tmp/ltsmin2770916927655067667
[2025-05-30 03:02:18] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2025-05-30 03:02:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:02:18] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2025-05-30 03:02:18] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:02:18] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2025-05-30 03:02:18] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:02:18] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2770916927655067667
Running compilation step : cd /tmp/ltsmin2770916927655067667;'/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 2077 ms.
Running link step : cd /tmp/ltsmin2770916927655067667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2770916927655067667;'/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/stateBased11360736299035770764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 323 cols
[2025-05-30 03:02:33] [INFO ] Computed 35 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:34] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-30 03:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:34] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:02:34] [INFO ] Redundant transitions in 7 ms returned []
Running 730 sub problems to find dead transitions.
[2025-05-30 03:02:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 2/321 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:52] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 730 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 30167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31068 ms. Remains : 323/323 places, 758/758 transitions.
Built C files in :
/tmp/ltsmin10403788063966477785
[2025-05-30 03:03:04] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2025-05-30 03:03:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:04] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2025-05-30 03:03:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:04] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2025-05-30 03:03:04] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:04] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10403788063966477785
Running compilation step : cd /tmp/ltsmin10403788063966477785;'/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 1992 ms.
Running link step : cd /tmp/ltsmin10403788063966477785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10403788063966477785;'/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/stateBased15471086450498981971.hoa' '--buchi-type=spotba'
LTSmin run took 5623 ms.
FORMULA ASLink-PT-03b-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03b-LTLCardinality-05 finished in 330965 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 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 1428 transition count 1487
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 270 rules applied. Total rules applied 535 place count 1163 transition count 1482
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 1160 transition count 1482
Performed 379 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 379 Pre rules applied. Total rules applied 538 place count 1160 transition count 1103
Deduced a syphon composed of 379 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1330 place count 747 transition count 1103
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1355 place count 744 transition count 1081
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1377 place count 722 transition count 1081
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1377 place count 722 transition count 1068
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1416 place count 696 transition count 1068
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1416 place count 696 transition count 1056
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1440 place count 684 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1443 place count 681 transition count 1053
Iterating global reduction 5 with 3 rules applied. Total rules applied 1446 place count 681 transition count 1053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1446 place count 681 transition count 1052
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1448 place count 680 transition count 1052
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 5 with 229 rules applied. Total rules applied 1677 place count 565 transition count 938
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1681 place count 561 transition count 934
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1686 place count 560 transition count 934
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1686 place count 560 transition count 933
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 1688 place count 559 transition count 933
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1690 place count 557 transition count 931
Iterating global reduction 5 with 2 rules applied. Total rules applied 1692 place count 557 transition count 931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1694 place count 557 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1695 place count 556 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1697 place count 555 transition count 935
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1699 place count 553 transition count 933
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 1708 place count 547 transition count 930
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1711 place count 544 transition count 930
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 1711 place count 544 transition count 921
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1730 place count 534 transition count 921
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 9 with 6 rules applied. Total rules applied 1736 place count 528 transition count 921
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1736 place count 528 transition count 920
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 1738 place count 527 transition count 920
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1756 place count 518 transition count 911
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1761 place count 513 transition count 906
Iterating global reduction 10 with 5 rules applied. Total rules applied 1766 place count 513 transition count 906
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1769 place count 510 transition count 903
Iterating global reduction 10 with 3 rules applied. Total rules applied 1772 place count 510 transition count 903
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1775 place count 510 transition count 900
Applied a total of 1775 rules in 204 ms. Remains 510 /1429 variables (removed 919) and now considering 900/1753 (removed 853) transitions.
// Phase 1: matrix 900 rows 510 cols
[2025-05-30 03:03:12] [INFO ] Computed 85 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:13] [INFO ] Implicit Places using invariants in 362 ms returned [1, 18, 19, 50, 68, 88, 137, 142, 152, 153, 155, 172, 190, 210, 262, 263, 275, 276, 278, 295, 313, 332, 384, 385, 388, 399, 400, 401, 419, 423, 441, 442, 443, 444, 470]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 364 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 475/1429 places, 900/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 475 transition count 847
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 422 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 420 transition count 845
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 110 place count 420 transition count 824
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 153 place count 398 transition count 824
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 165 place count 394 transition count 816
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 173 place count 386 transition count 816
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 178 place count 381 transition count 811
Iterating global reduction 5 with 5 rules applied. Total rules applied 183 place count 381 transition count 811
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 186 place count 381 transition count 808
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 187 place count 380 transition count 806
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 380 transition count 806
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 242 place count 353 transition count 779
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 352 transition count 777
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 352 transition count 777
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 248 place count 350 transition count 778
Applied a total of 248 rules in 50 ms. Remains 350 /475 variables (removed 125) and now considering 778/900 (removed 122) transitions.
// Phase 1: matrix 778 rows 350 cols
[2025-05-30 03:03:13] [INFO ] Computed 45 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:13] [INFO ] Implicit Places using invariants in 246 ms returned [96, 102, 107, 183, 189, 194, 271, 277, 282, 347]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 248 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1429 places, 778/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 777
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 339 transition count 777
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 333 transition count 771
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 333 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 327 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 327 transition count 765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 324 transition count 762
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 324 transition count 762
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 321 transition count 759
Applied a total of 38 rules in 31 ms. Remains 321 /340 variables (removed 19) and now considering 759/778 (removed 19) transitions.
// Phase 1: matrix 759 rows 321 cols
[2025-05-30 03:03:13] [INFO ] Computed 35 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:13] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-30 03:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:14] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 321/1429 places, 759/1753 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1678 ms. Remains : 321/1429 places, 759/1753 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-06
Product exploration explored 100000 steps with 1944 reset in 245 ms.
Product exploration explored 100000 steps with 1894 reset in 243 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 p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (739 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (209 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1503 steps, run visited all 1 properties in 17 ms. (steps per millisecond=88 )
Probabilistic random walk after 1503 steps, saw 889 distinct states, run finished after 22 ms. (steps per millisecond=68 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-03b-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03b-LTLCardinality-06 finished in 2650 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 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 1428 transition count 1487
Reduce places removed 265 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 270 rules applied. Total rules applied 535 place count 1163 transition count 1482
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 538 place count 1160 transition count 1482
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 380 Pre rules applied. Total rules applied 538 place count 1160 transition count 1102
Deduced a syphon composed of 380 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 1332 place count 746 transition count 1102
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1357 place count 743 transition count 1080
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1379 place count 721 transition count 1080
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1379 place count 721 transition count 1067
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1418 place count 695 transition count 1067
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1418 place count 695 transition count 1055
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1442 place count 683 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1445 place count 680 transition count 1052
Iterating global reduction 5 with 3 rules applied. Total rules applied 1448 place count 680 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1448 place count 680 transition count 1050
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 1452 place count 678 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1453 place count 677 transition count 1044
Iterating global reduction 5 with 1 rules applied. Total rules applied 1454 place count 677 transition count 1044
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 5 with 225 rules applied. Total rules applied 1679 place count 564 transition count 932
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1683 place count 560 transition count 928
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1688 place count 559 transition count 928
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1688 place count 559 transition count 927
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 1690 place count 558 transition count 927
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1692 place count 556 transition count 925
Iterating global reduction 5 with 2 rules applied. Total rules applied 1694 place count 556 transition count 925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1696 place count 556 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1697 place count 555 transition count 923
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1699 place count 554 transition count 929
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1701 place count 552 transition count 927
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 1710 place count 546 transition count 924
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1713 place count 543 transition count 924
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 1713 place count 543 transition count 915
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1732 place count 533 transition count 915
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 9 with 7 rules applied. Total rules applied 1739 place count 526 transition count 915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1739 place count 526 transition count 914
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 1741 place count 525 transition count 914
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1761 place count 515 transition count 904
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1766 place count 510 transition count 899
Iterating global reduction 10 with 5 rules applied. Total rules applied 1771 place count 510 transition count 899
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1774 place count 507 transition count 896
Iterating global reduction 10 with 3 rules applied. Total rules applied 1777 place count 507 transition count 896
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1780 place count 507 transition count 893
Applied a total of 1780 rules in 208 ms. Remains 507 /1429 variables (removed 922) and now considering 893/1753 (removed 860) transitions.
// Phase 1: matrix 893 rows 507 cols
[2025-05-30 03:03:15] [INFO ] Computed 84 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:15] [INFO ] Implicit Places using invariants in 399 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 258, 270, 271, 273, 290, 308, 328, 381, 382, 385, 396, 397, 398, 416, 420, 438, 439, 440, 441, 467]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 401 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/1429 places, 893/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 472 transition count 832
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 411 transition count 832
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 122 place count 411 transition count 813
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 161 place count 391 transition count 813
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 173 place count 387 transition count 805
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 379 transition count 805
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 186 place count 374 transition count 800
Iterating global reduction 4 with 5 rules applied. Total rules applied 191 place count 374 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 194 place count 374 transition count 797
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 373 transition count 795
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 373 transition count 795
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 244 place count 349 transition count 771
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 248 place count 347 transition count 772
Applied a total of 248 rules in 38 ms. Remains 347 /472 variables (removed 125) and now considering 772/893 (removed 121) transitions.
// Phase 1: matrix 772 rows 347 cols
[2025-05-30 03:03:15] [INFO ] Computed 44 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:16] [INFO ] Implicit Places using invariants in 264 ms returned [88, 94, 99, 177, 183, 188, 268, 274, 279, 344]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 265 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/1429 places, 772/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 336 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 330 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 330 transition count 765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 324 transition count 759
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 324 transition count 759
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 321 transition count 756
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 321 transition count 756
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 318 transition count 753
Applied a total of 38 rules in 30 ms. Remains 318 /337 variables (removed 19) and now considering 753/772 (removed 19) transitions.
// Phase 1: matrix 753 rows 318 cols
[2025-05-30 03:03:16] [INFO ] Computed 34 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:16] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-30 03:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:17] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 318/1429 places, 753/1753 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1768 ms. Remains : 318/1429 places, 753/1753 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-08
Product exploration explored 100000 steps with 1792 reset in 160 ms.
Stack based approach found an accepted trace after 11020 steps with 190 reset with depth 41 and stack size 41 in 22 ms.
FORMULA ASLink-PT-03b-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-03b-LTLCardinality-08 finished in 2014 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 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 262 place count 1428 transition count 1490
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 267 rules applied. Total rules applied 529 place count 1166 transition count 1485
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 532 place count 1163 transition count 1485
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 380 Pre rules applied. Total rules applied 532 place count 1163 transition count 1105
Deduced a syphon composed of 380 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 1326 place count 749 transition count 1105
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 25 rules applied. Total rules applied 1351 place count 746 transition count 1083
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1373 place count 724 transition count 1083
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1373 place count 724 transition count 1070
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1412 place count 698 transition count 1070
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1412 place count 698 transition count 1058
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1436 place count 686 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1439 place count 683 transition count 1055
Iterating global reduction 5 with 3 rules applied. Total rules applied 1442 place count 683 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1442 place count 683 transition count 1053
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 1446 place count 681 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1447 place count 680 transition count 1047
Iterating global reduction 5 with 1 rules applied. Total rules applied 1448 place count 680 transition count 1047
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 227 rules applied. Total rules applied 1675 place count 566 transition count 934
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1679 place count 562 transition count 930
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1684 place count 561 transition count 930
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1684 place count 561 transition count 929
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 1686 place count 560 transition count 929
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1688 place count 558 transition count 927
Iterating global reduction 5 with 2 rules applied. Total rules applied 1690 place count 558 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1692 place count 558 transition count 925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1693 place count 557 transition count 925
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 1695 place count 556 transition count 931
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1697 place count 554 transition count 929
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 1706 place count 548 transition count 926
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1709 place count 545 transition count 926
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 1709 place count 545 transition count 917
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1728 place count 535 transition count 917
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 9 with 7 rules applied. Total rules applied 1735 place count 528 transition count 917
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1735 place count 528 transition count 916
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 1737 place count 527 transition count 916
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1757 place count 517 transition count 906
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1763 place count 511 transition count 900
Iterating global reduction 10 with 6 rules applied. Total rules applied 1769 place count 511 transition count 900
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1772 place count 508 transition count 897
Iterating global reduction 10 with 3 rules applied. Total rules applied 1775 place count 508 transition count 897
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1778 place count 508 transition count 894
Applied a total of 1778 rules in 206 ms. Remains 508 /1429 variables (removed 921) and now considering 894/1753 (removed 859) transitions.
// Phase 1: matrix 894 rows 508 cols
[2025-05-30 03:03:17] [INFO ] Computed 84 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:17] [INFO ] Implicit Places using invariants in 372 ms returned [1, 18, 19, 31, 48, 66, 86, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 328, 380, 381, 384, 395, 396, 397, 415, 419, 437, 438, 439, 440, 468]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 373 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/1429 places, 894/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 473 transition count 834
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 413 transition count 833
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 412 transition count 833
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 122 place count 412 transition count 814
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 161 place count 392 transition count 814
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 173 place count 388 transition count 806
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 181 place count 380 transition count 806
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 186 place count 375 transition count 801
Iterating global reduction 5 with 5 rules applied. Total rules applied 191 place count 375 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 375 transition count 798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 374 transition count 796
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 374 transition count 796
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 250 place count 347 transition count 769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 254 place count 345 transition count 770
Applied a total of 254 rules in 42 ms. Remains 345 /473 variables (removed 128) and now considering 770/894 (removed 124) transitions.
// Phase 1: matrix 770 rows 345 cols
[2025-05-30 03:03:17] [INFO ] Computed 44 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:18] [INFO ] Implicit Places using invariants in 253 ms returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 342]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 254 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 335/1429 places, 770/1753 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 335 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 334 transition count 769
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 328 transition count 763
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 328 transition count 763
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 322 transition count 757
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 322 transition count 757
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 319 transition count 754
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 319 transition count 754
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 316 transition count 751
Applied a total of 38 rules in 27 ms. Remains 316 /335 variables (removed 19) and now considering 751/770 (removed 19) transitions.
// Phase 1: matrix 751 rows 316 cols
[2025-05-30 03:03:18] [INFO ] Computed 34 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:18] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 03:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:19] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 316/1429 places, 751/1753 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1694 ms. Remains : 316/1429 places, 751/1753 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-09
Product exploration explored 100000 steps with 4371 reset in 186 ms.
Product exploration explored 100000 steps with 4518 reset in 223 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 751/751 transitions.
Applied a total of 0 rules in 13 ms. Remains 316 /316 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2025-05-30 03:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:20] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-30 03:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:20] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:03:20] [INFO ] Redundant transitions in 5 ms returned []
Running 732 sub problems to find dead transitions.
[2025-05-30 03: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/312 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:35] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 732 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 30167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30977 ms. Remains : 316/316 places, 751/751 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4571 reset in 173 ms.
Product exploration explored 100000 steps with 4395 reset in 179 ms.
Built C files in :
/tmp/ltsmin13694747895229145496
[2025-05-30 03:03:52] [INFO ] Computing symmetric may disable matrix : 751 transitions.
[2025-05-30 03:03:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:52] [INFO ] Computing symmetric may enable matrix : 751 transitions.
[2025-05-30 03:03:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:52] [INFO ] Computing Do-Not-Accords matrix : 751 transitions.
[2025-05-30 03:03:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:03:52] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13694747895229145496
Running compilation step : cd /tmp/ltsmin13694747895229145496;'/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 1968 ms.
Running link step : cd /tmp/ltsmin13694747895229145496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13694747895229145496;'/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/stateBased12445639676238288760.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 751/751 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2025-05-30 03:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:04:07] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-30 03:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:04:08] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:04:08] [INFO ] Redundant transitions in 8 ms returned []
Running 732 sub problems to find dead transitions.
[2025-05-30 03:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:04:22] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 732 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 30189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30997 ms. Remains : 316/316 places, 751/751 transitions.
Built C files in :
/tmp/ltsmin8303190763300595391
[2025-05-30 03:04:38] [INFO ] Computing symmetric may disable matrix : 751 transitions.
[2025-05-30 03:04:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:04:38] [INFO ] Computing symmetric may enable matrix : 751 transitions.
[2025-05-30 03:04:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:04:38] [INFO ] Computing Do-Not-Accords matrix : 751 transitions.
[2025-05-30 03:04:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:04:38] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8303190763300595391
Running compilation step : cd /tmp/ltsmin8303190763300595391;'/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 1983 ms.
Running link step : cd /tmp/ltsmin8303190763300595391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8303190763300595391;'/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/stateBased9021067749020932030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 03:04:53] [INFO ] Flatten gal took : 35 ms
[2025-05-30 03:04:53] [INFO ] Flatten gal took : 33 ms
[2025-05-30 03:04:53] [INFO ] Time to serialize gal into /tmp/LTL14059513357850441465.gal : 9 ms
[2025-05-30 03:04:53] [INFO ] Time to serialize properties into /tmp/LTL10006445265694938116.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/LTL14059513357850441465.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13982497124268629003.hoa' '-atoms' '/tmp/LTL10006445265694938116.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...320
Loading property file /tmp/LTL10006445265694938116.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13982497124268629003.hoa
Detected timeout of ITS tools.
[2025-05-30 03:05:08] [INFO ] Flatten gal took : 33 ms
[2025-05-30 03:05:08] [INFO ] Flatten gal took : 28 ms
[2025-05-30 03:05:08] [INFO ] Time to serialize gal into /tmp/LTL4972714197134055120.gal : 7 ms
[2025-05-30 03:05:08] [INFO ] Time to serialize properties into /tmp/LTL12947039070054109504.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4972714197134055120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12947039070054109504.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("((p1461==0)||(p245==1))"))))
Formula 0 simplified : FG!"((p1461==0)||(p245==1))"
Detected timeout of ITS tools.
[2025-05-30 03:05:23] [INFO ] Flatten gal took : 28 ms
[2025-05-30 03:05:23] [INFO ] Applying decomposition
[2025-05-30 03:05:23] [INFO ] Flatten gal took : 27 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/graph3776762631785754547.txt' '-o' '/tmp/graph3776762631785754547.bin' '-w' '/tmp/graph3776762631785754547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3776762631785754547.bin' '-l' '-1' '-v' '-w' '/tmp/graph3776762631785754547.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:05:24] [INFO ] Decomposing Gal with order
[2025-05-30 03:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:05:24] [INFO ] Removed a total of 1491 redundant transitions.
[2025-05-30 03:05:24] [INFO ] Flatten gal took : 384 ms
[2025-05-30 03:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 34 ms.
[2025-05-30 03:05:24] [INFO ] Time to serialize gal into /tmp/LTL8959384740806375154.gal : 34 ms
[2025-05-30 03:05:24] [INFO ] Time to serialize properties into /tmp/LTL6022783612476600299.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/LTL8959384740806375154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6022783612476600299.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 : !((G(F("((i7.u80.p1461==0)||(i1.u24.p245==1))"))))
Formula 0 simplified : FG!"((i7.u80.p1461==0)||(i1.u24.p245==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLCardinality-09 finished in 142460 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((p0||F(G(p1))))))'
Support contains 4 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1420 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1420 transition count 1744
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1415 transition count 1734
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1415 transition count 1734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1415 transition count 1733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 1412 transition count 1730
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 1412 transition count 1730
Applied a total of 35 rules in 178 ms. Remains 1412 /1429 variables (removed 17) and now considering 1730/1753 (removed 23) transitions.
// Phase 1: matrix 1730 rows 1412 cols
[2025-05-30 03:05:39] [INFO ] Computed 150 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:40] [INFO ] Implicit Places using invariants in 887 ms returned [1330]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 916 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1411/1429 places, 1730/1753 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1409 transition count 1728
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1409 transition count 1728
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1407 transition count 1726
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1407 transition count 1726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1405 transition count 1724
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1405 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1404 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1403 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1402 transition count 1721
Applied a total of 18 rules in 286 ms. Remains 1402 /1411 variables (removed 9) and now considering 1721/1730 (removed 9) transitions.
// Phase 1: matrix 1721 rows 1402 cols
[2025-05-30 03:05:41] [INFO ] Computed 149 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:41] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-05-30 03:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:47] [INFO ] Implicit Places using invariants and state equation in 5367 ms returned []
Implicit Place search using SMT with State Equation took 6153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1402/1429 places, 1721/1753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7534 ms. Remains : 1402/1429 places, 1721/1753 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-12
Product exploration explored 100000 steps with 301 reset in 214 ms.
Product exploration explored 100000 steps with 283 reset in 241 ms.
Computed a total of 56 stabilizing places and 56 stable transitions
Computed a total of 56 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
RANDOM walk for 2453 steps (5 resets) in 10 ms. (223 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 81 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 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Support contains 2 out of 1402 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 : 1402/1402 places, 1721/1721 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 1401 transition count 1469
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 505 place count 1150 transition count 1466
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 508 place count 1148 transition count 1465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 509 place count 1147 transition count 1465
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 375 Pre rules applied. Total rules applied 509 place count 1147 transition count 1090
Deduced a syphon composed of 375 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 4 with 784 rules applied. Total rules applied 1293 place count 738 transition count 1090
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 25 rules applied. Total rules applied 1318 place count 735 transition count 1068
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1340 place count 713 transition count 1068
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 1340 place count 713 transition count 1055
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1379 place count 687 transition count 1055
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1379 place count 687 transition count 1043
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1403 place count 675 transition count 1043
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 6 with 229 rules applied. Total rules applied 1632 place count 560 transition count 929
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1636 place count 556 transition count 925
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1641 place count 555 transition count 925
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 1643 place count 554 transition count 924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1644 place count 553 transition count 924
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1646 place count 551 transition count 922
Iterating global reduction 8 with 2 rules applied. Total rules applied 1648 place count 551 transition count 922
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1650 place count 551 transition count 920
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1651 place count 550 transition count 920
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 1653 place count 549 transition count 925
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1655 place count 547 transition count 923
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 9 rules applied. Total rules applied 1664 place count 541 transition count 920
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1667 place count 538 transition count 920
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 9 Pre rules applied. Total rules applied 1667 place count 538 transition count 911
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 19 rules applied. Total rules applied 1686 place count 528 transition count 911
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 12 with 7 rules applied. Total rules applied 1693 place count 521 transition count 911
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1693 place count 521 transition count 910
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 1695 place count 520 transition count 910
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1715 place count 510 transition count 900
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1721 place count 504 transition count 894
Iterating global reduction 13 with 6 rules applied. Total rules applied 1727 place count 504 transition count 894
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1730 place count 501 transition count 891
Iterating global reduction 13 with 3 rules applied. Total rules applied 1733 place count 501 transition count 891
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1736 place count 501 transition count 888
Applied a total of 1736 rules in 178 ms. Remains 501 /1402 variables (removed 901) and now considering 888/1721 (removed 833) transitions.
// Phase 1: matrix 888 rows 501 cols
[2025-05-30 03:05:48] [INFO ] Computed 82 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:48] [INFO ] Implicit Places using invariants in 484 ms returned [1, 18, 19, 31, 48, 66, 87, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 383, 394, 395, 396, 414, 439, 440, 441, 442]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 493 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/1402 places, 888/1721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 468 transition count 830
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 410 transition count 830
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 116 place count 410 transition count 811
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 155 place count 390 transition count 811
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 167 place count 386 transition count 803
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 378 transition count 803
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 178 place count 375 transition count 800
Iterating global reduction 4 with 3 rules applied. Total rules applied 181 place count 375 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 184 place count 375 transition count 797
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 238 place count 348 transition count 770
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 242 place count 346 transition count 771
Applied a total of 242 rules in 38 ms. Remains 346 /468 variables (removed 122) and now considering 771/888 (removed 117) transitions.
// Phase 1: matrix 771 rows 346 cols
[2025-05-30 03:05:48] [INFO ] Computed 44 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:49] [INFO ] Implicit Places using invariants in 240 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 343]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 250 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 336/1402 places, 771/1721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 336 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 335 transition count 770
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 7 place count 330 transition count 765
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 330 transition count 765
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 325 transition count 760
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 325 transition count 760
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 323 transition count 758
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 323 transition count 758
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 320 transition count 755
Applied a total of 32 rules in 41 ms. Remains 320 /336 variables (removed 16) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 320 cols
[2025-05-30 03:05:49] [INFO ] Computed 34 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:49] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-30 03:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:50] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 320/1402 places, 755/1721 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1876 ms. Remains : 320/1402 places, 755/1721 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 66 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 37 ms :[(NOT p1)]
RANDOM walk for 332 steps (5 resets) in 7 ms. (41 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 80 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1779 reset in 164 ms.
Stack based approach found an accepted trace after 51641 steps with 924 reset with depth 16 and stack size 16 in 109 ms.
FORMULA ASLink-PT-03b-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-03b-LTLCardinality-12 finished in 10888 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 p1)&&F(p2)&&X(F(p3)))))'
Support contains 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1423 transition count 1747
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1423 transition count 1747
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1419 transition count 1738
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1419 transition count 1738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1419 transition count 1737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1417 transition count 1735
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1417 transition count 1735
Applied a total of 25 rules in 172 ms. Remains 1417 /1429 variables (removed 12) and now considering 1735/1753 (removed 18) transitions.
// Phase 1: matrix 1735 rows 1417 cols
[2025-05-30 03:05:50] [INFO ] Computed 150 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:51] [INFO ] Implicit Places using invariants in 789 ms returned [1335]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 799 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1416/1429 places, 1735/1753 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1414 transition count 1733
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1414 transition count 1733
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1412 transition count 1731
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1412 transition count 1731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1410 transition count 1729
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1410 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1409 transition count 1728
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1409 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1408 transition count 1727
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1408 transition count 1727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1407 transition count 1726
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1407 transition count 1726
Applied a total of 18 rules in 275 ms. Remains 1407 /1416 variables (removed 9) and now considering 1726/1735 (removed 9) transitions.
// Phase 1: matrix 1726 rows 1407 cols
[2025-05-30 03:05:51] [INFO ] Computed 149 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:52] [INFO ] Implicit Places using invariants in 802 ms returned []
[2025-05-30 03:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:55] [INFO ] Implicit Places using invariants and state equation in 3006 ms returned []
Implicit Place search using SMT with State Equation took 3827 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1407/1429 places, 1726/1753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5073 ms. Remains : 1407/1429 places, 1726/1753 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-13
Product exploration explored 100000 steps with 1342 reset in 350 ms.
Product exploration explored 100000 steps with 1343 reset in 390 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/1407 stabilizing places and 58/1726 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p0), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 123 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 325 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X p0), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 15 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p3), (NOT p3), (NOT p3)]
[2025-05-30 03:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 03:05:58] [INFO ] [Real]Absence check using 37 positive place invariants in 120 ms returned sat
[2025-05-30 03:06:05] [INFO ] [Real]Absence check using 37 positive and 112 generalized place invariants in 7215 ms returned sat
[2025-05-30 03:06:12] [INFO ] [Real]Absence check using state equation in 6934 ms returned unknown
Could not prove EG (NOT p3)
Support contains 1 out of 1407 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1407/1407 places, 1726/1726 transitions.
Applied a total of 0 rules in 41 ms. Remains 1407 /1407 variables (removed 0) and now considering 1726/1726 (removed 0) transitions.
[2025-05-30 03:06:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:06:13] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-05-30 03:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:06:16] [INFO ] Implicit Places using invariants and state equation in 2941 ms returned []
Implicit Place search using SMT with State Equation took 3783 ms to find 0 implicit places.
Running 1725 sub problems to find dead transitions.
[2025-05-30 03:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1406 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1406/3133 variables, and 84 constraints, problems are : Problem set: 0 solved, 1725 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 84/112 constraints, State Equation: 0/1407 constraints, PredecessorRefiner: 1725/1725 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1725 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1406 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1725 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1406/3133 variables, and 84 constraints, problems are : Problem set: 0 solved, 1725 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 84/112 constraints, State Equation: 0/1407 constraints, PredecessorRefiner: 0/1725 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1725 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Finished structural reductions in LTL mode , in 1 iterations and 64313 ms. Remains : 1407/1407 places, 1726/1726 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/1407 stabilizing places and 58/1726 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p3), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 316 steps (0 resets) in 4 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p3), (X (X (NOT p3))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p3), (NOT p3), (NOT p3)]
[2025-05-30 03:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 03:07:18] [INFO ] [Real]Absence check using 37 positive place invariants in 106 ms returned sat
[2025-05-30 03:07:25] [INFO ] [Real]Absence check using 37 positive and 112 generalized place invariants in 7173 ms returned sat
[2025-05-30 03:07:32] [INFO ] [Real]Absence check using state equation in 7004 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 95 ms :[(NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 1347 reset in 207 ms.
Product exploration explored 100000 steps with 1342 reset in 223 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 80 ms :[(NOT p3), (NOT p3), (NOT p3)]
Support contains 1 out of 1407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1407/1407 places, 1726/1726 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1407 transition count 1726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 251 place count 1407 transition count 1725
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 255 Pre rules applied. Total rules applied 251 place count 1407 transition count 1796
Deduced a syphon composed of 505 places in 2 ms
Iterating global reduction 2 with 255 rules applied. Total rules applied 506 place count 1407 transition count 1796
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 640 place count 1273 transition count 1662
Deduced a syphon composed of 372 places in 2 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 774 place count 1273 transition count 1662
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 774 place count 1273 transition count 1665
Deduced a syphon composed of 375 places in 2 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 777 place count 1273 transition count 1665
Performed 242 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 617 places in 1 ms
Iterating global reduction 2 with 242 rules applied. Total rules applied 1019 place count 1273 transition count 1666
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 1121 place count 1171 transition count 1562
Deduced a syphon composed of 519 places in 1 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 1223 place count 1171 transition count 1562
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1225 place count 1169 transition count 1559
Deduced a syphon composed of 519 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1227 place count 1169 transition count 1559
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1229 place count 1169 transition count 1557
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 540 places in 2 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1250 place count 1169 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1257 place count 1162 transition count 1616
Deduced a syphon composed of 533 places in 2 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 1264 place count 1162 transition count 1616
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 534 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1265 place count 1162 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1266 place count 1161 transition count 1616
Deduced a syphon composed of 533 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1267 place count 1161 transition count 1616
Deduced a syphon composed of 533 places in 2 ms
Applied a total of 1267 rules in 729 ms. Remains 1161 /1407 variables (removed 246) and now considering 1616/1726 (removed 110) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:07:33] [INFO ] Redundant transitions in 18 ms returned []
Running 1615 sub problems to find dead transitions.
// Phase 1: matrix 1616 rows 1161 cols
[2025-05-30 03:07:33] [INFO ] Computed 149 invariants in 11 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1160 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1615 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1160/2777 variables, and 100 constraints, problems are : Problem set: 0 solved, 1615 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/34 constraints, Generalized P Invariants (flows): 100/115 constraints, State Equation: 0/1161 constraints, PredecessorRefiner: 1615/1615 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1615 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1160 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 1615 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1160/2777 variables, and 100 constraints, problems are : Problem set: 0 solved, 1615 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/34 constraints, Generalized P Invariants (flows): 100/115 constraints, State Equation: 0/1161 constraints, PredecessorRefiner: 0/1615 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1615 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1161/1407 places, 1616/1726 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61272 ms. Remains : 1161/1407 places, 1616/1726 transitions.
Built C files in :
/tmp/ltsmin1374601866597222302
[2025-05-30 03:08:34] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1374601866597222302
Running compilation step : cd /tmp/ltsmin1374601866597222302;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1374601866597222302;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1374601866597222302;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 1407 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1407/1407 places, 1726/1726 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1404 transition count 1723
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1404 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1403 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1403 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1402 transition count 1721
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1402 transition count 1721
Applied a total of 10 rules in 239 ms. Remains 1402 /1407 variables (removed 5) and now considering 1721/1726 (removed 5) transitions.
// Phase 1: matrix 1721 rows 1402 cols
[2025-05-30 03:08:37] [INFO ] Computed 149 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:38] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-05-30 03:08:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:40] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 3348 ms to find 0 implicit places.
Running 1720 sub problems to find dead transitions.
[2025-05-30 03:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 84/113 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 1720/1720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1720 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1401/3123 variables, and 84 constraints, problems are : Problem set: 0 solved, 1720 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/36 constraints, Generalized P Invariants (flows): 84/113 constraints, State Equation: 0/1402 constraints, PredecessorRefiner: 0/1720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1720 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 1402/1407 places, 1721/1726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64008 ms. Remains : 1402/1407 places, 1721/1726 transitions.
Built C files in :
/tmp/ltsmin5854495363297392371
[2025-05-30 03:09:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5854495363297392371
Running compilation step : cd /tmp/ltsmin5854495363297392371;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5854495363297392371;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5854495363297392371;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 03:09:44] [INFO ] Flatten gal took : 41 ms
[2025-05-30 03:09:44] [INFO ] Flatten gal took : 40 ms
[2025-05-30 03:09:44] [INFO ] Time to serialize gal into /tmp/LTL10626176557448447121.gal : 7 ms
[2025-05-30 03:09:44] [INFO ] Time to serialize properties into /tmp/LTL3036725829469657961.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/LTL10626176557448447121.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10308325562958205968.hoa' '-atoms' '/tmp/LTL3036725829469657961.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/LTL3036725829469657961.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10308325562958205968.hoa
Detected timeout of ITS tools.
[2025-05-30 03:09:59] [INFO ] Flatten gal took : 41 ms
[2025-05-30 03:09:59] [INFO ] Flatten gal took : 39 ms
[2025-05-30 03:09:59] [INFO ] Time to serialize gal into /tmp/LTL17283293966247934005.gal : 7 ms
[2025-05-30 03:09:59] [INFO ] Time to serialize properties into /tmp/LTL15505478012105958569.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/LTL17283293966247934005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15505478012105958569.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(((("((p1254==0)||(p207==1))")U("((p544==0)||(p979==1))"))&&(F("((p1430==0)||(p1443==1))")))&&(X(F("(p619==1)"))))))
Formula 0 simplified : X((!"((p1254==0)||(p207==1))" R !"((p544==0)||(p979==1))") | G!"((p1430==0)||(p1443==1))" | XG!"(p619==1)")
Detected timeout of ITS tools.
[2025-05-30 03:10:14] [INFO ] Flatten gal took : 41 ms
[2025-05-30 03:10:14] [INFO ] Applying decomposition
[2025-05-30 03:10:14] [INFO ] Flatten gal took : 35 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/graph12819594362375643291.txt' '-o' '/tmp/graph12819594362375643291.bin' '-w' '/tmp/graph12819594362375643291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12819594362375643291.bin' '-l' '-1' '-v' '-w' '/tmp/graph12819594362375643291.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:10:15] [INFO ] Decomposing Gal with order
[2025-05-30 03:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:10:15] [INFO ] Removed a total of 1316 redundant transitions.
[2025-05-30 03:10:15] [INFO ] Flatten gal took : 126 ms
[2025-05-30 03:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2025-05-30 03:10:15] [INFO ] Time to serialize gal into /tmp/LTL16060827240164539769.gal : 15 ms
[2025-05-30 03:10:15] [INFO ] Time to serialize properties into /tmp/LTL3938653601575783717.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/LTL16060827240164539769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3938653601575783717.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(((("((i18.i1.i1.u436.p1254==0)||(i6.u65.p207==1))")U("((i14.u186.p544==0)||(i16.i1.i0.u340.p979==1))"))&&(F("((i25.i1.i1.u490.p14...226
Formula 0 simplified : X((!"((i18.i1.i1.u436.p1254==0)||(i6.u65.p207==1))" R !"((i14.u186.p544==0)||(i16.i1.i0.u340.p979==1))") | G!"((i25.i1.i1.u490.p1430...215
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03b-LTLCardinality-13 finished in 279932 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(p0)))'
Support contains 2 out of 1429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 1753/1753 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1419 transition count 1743
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1419 transition count 1743
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1414 transition count 1733
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1414 transition count 1733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1414 transition count 1732
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 1411 transition count 1729
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 1411 transition count 1729
Applied a total of 37 rules in 240 ms. Remains 1411 /1429 variables (removed 18) and now considering 1729/1753 (removed 24) transitions.
// Phase 1: matrix 1729 rows 1411 cols
[2025-05-30 03:10:30] [INFO ] Computed 150 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:31] [INFO ] Implicit Places using invariants in 941 ms returned []
[2025-05-30 03:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:37] [INFO ] Implicit Places using invariants and state equation in 5185 ms returned []
Implicit Place search using SMT with State Equation took 6164 ms to find 0 implicit places.
Running 1728 sub problems to find dead transitions.
[2025-05-30 03:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1410 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1410/3140 variables, and 85 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 85/113 constraints, State Equation: 0/1411 constraints, PredecessorRefiner: 1728/1728 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1728 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1410 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 13)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 3)
(s47 1)
(s48 6)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 14)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 1)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 16)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 10)
(s312 1)
(s313 1)
(s314 1)
(s315 0)
(s316 1)
(s317 1)
(s318 1)
(s319 0)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 7)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 4)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 9)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 9)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 6)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 4)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 28)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 0)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 6)
(s456 1)
(s457 0)
(s458 1)
(s459 1)
(s460 1)
(s461 0)
(s462 1)
(s463 1)
(s464 1)
(s465 0)
(s466 1)
(s467 1)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 0)
(s478 0)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 0)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 1)
(s613 1)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 0)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 0)
(s639 1)
(s640 1)
(s641 1)
(s642 0)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 0)
(s652 1)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 0)
(s661 0)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 0)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 2)
(s683 1)
(s684 1)
(s685 1)
(s686 0)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 1)
(s692 0)
(s693 1)
(s694 0)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 0)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 0)
(s708 1)
(s709 1)
(s710 1)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 4)
(s719 1)
(s720 0)
(s721 1)
(s722 0)
(s723 1)
(s724 0)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1410/3140 variables, and 85 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 85/113 constraints, State Equation: 0/1411 constraints, PredecessorRefiner: 0/1728 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1728 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 1411/1429 places, 1729/1753 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66812 ms. Remains : 1411/1429 places, 1729/1753 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1254 steps with 4 reset in 6 ms.
FORMULA ASLink-PT-03b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03b-LTLCardinality-15 finished in 66948 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)))'
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 p1)&&F(p2)&&X(F(p3)))))'
[2025-05-30 03:11:37] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12315994039808016629
[2025-05-30 03:11:37] [INFO ] Too many transitions (1753) to apply POR reductions. Disabling POR matrices.
[2025-05-30 03:11:37] [INFO ] Applying decomposition
[2025-05-30 03:11:37] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12315994039808016629
Running compilation step : cd /tmp/ltsmin12315994039808016629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 03:11:37] [INFO ] Flatten gal took : 36 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/graph17870062861553092832.txt' '-o' '/tmp/graph17870062861553092832.bin' '-w' '/tmp/graph17870062861553092832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17870062861553092832.bin' '-l' '-1' '-v' '-w' '/tmp/graph17870062861553092832.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:11:37] [INFO ] Decomposing Gal with order
[2025-05-30 03:11:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:11:38] [INFO ] Removed a total of 1331 redundant transitions.
[2025-05-30 03:11:38] [INFO ] Flatten gal took : 71 ms
[2025-05-30 03:11:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 26 ms.
[2025-05-30 03:11:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality14477234534313122230.gal : 13 ms
[2025-05-30 03:11:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality11131096376609525205.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/LTLCardinality14477234534313122230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11131096376609525205.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...278
Read 2 LTL properties
Checking formula 0 : !((G(F("((i29.u477.p1461==0)||(i3.i0.i0.u78.p245==1))"))))
Formula 0 simplified : FG!"((i29.u477.p1461==0)||(i3.i0.i0.u78.p245==1))"
Compilation finished in 3343 ms.
Running link step : cd /tmp/ltsmin12315994039808016629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12315994039808016629;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12315994039808016629;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12315994039808016629;'/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((((LTLAPp1==true) U (LTLAPp2==true))&&<>((LTLAPp3==true))&&X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 03:37:23] [INFO ] Applying decomposition
[2025-05-30 03:37:23] [INFO ] Flatten gal took : 127 ms
[2025-05-30 03:37:23] [INFO ] Decomposing Gal with order
[2025-05-30 03:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:37:24] [INFO ] Removed a total of 1209 redundant transitions.
[2025-05-30 03:37:24] [INFO ] Flatten gal took : 247 ms
[2025-05-30 03:37:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1842 labels/synchronizations in 122 ms.
[2025-05-30 03:37:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality12834409308293455287.gal : 25 ms
[2025-05-30 03:37:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality8165239172170916046.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/LTLCardinality12834409308293455287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8165239172170916046.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 2 LTL properties
Checking formula 0 : !((G(F("((i1.i1.u254.p1461==0)||(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u236.p245==1))"))))
Formula 0 simplified : FG!"((i1.i1.u254.p1461==0)||(i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u236.p245==1))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12315994039808016629;'/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((((LTLAPp1==true) U (LTLAPp2==true))&&<>((LTLAPp3==true))&&X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12315994039808016629;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ASLink-PT-03b"
export BK_EXAMINATION="LTLCardinality"
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 ASLink-PT-03b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729000323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;