About the Execution of ITS-Tools for ASLink-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | T?FTFFFFFFFFF??F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729200396.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-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729200396
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 757K 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-08a-LTLFireability-00
FORMULA_NAME ASLink-PT-08a-LTLFireability-01
FORMULA_NAME ASLink-PT-08a-LTLFireability-02
FORMULA_NAME ASLink-PT-08a-LTLFireability-03
FORMULA_NAME ASLink-PT-08a-LTLFireability-04
FORMULA_NAME ASLink-PT-08a-LTLFireability-05
FORMULA_NAME ASLink-PT-08a-LTLFireability-06
FORMULA_NAME ASLink-PT-08a-LTLFireability-07
FORMULA_NAME ASLink-PT-08a-LTLFireability-08
FORMULA_NAME ASLink-PT-08a-LTLFireability-09
FORMULA_NAME ASLink-PT-08a-LTLFireability-10
FORMULA_NAME ASLink-PT-08a-LTLFireability-11
FORMULA_NAME ASLink-PT-08a-LTLFireability-12
FORMULA_NAME ASLink-PT-08a-LTLFireability-13
FORMULA_NAME ASLink-PT-08a-LTLFireability-14
FORMULA_NAME ASLink-PT-08a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748601747364
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 10:42:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:42:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:42:28] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-05-30 10:42:28] [INFO ] Transformed 1796 places.
[2025-05-30 10:42:28] [INFO ] Transformed 2646 transitions.
[2025-05-30 10:42:28] [INFO ] Found NUPN structural information;
[2025-05-30 10:42:28] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1736 transition count 2563
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1735 transition count 2563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 1735 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1734 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1734 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1733 transition count 2545
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1733 transition count 2545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1732 transition count 2537
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1732 transition count 2537
Applied a total of 81 rules in 1071 ms. Remains 1732 /1796 variables (removed 64) and now considering 2537/2618 (removed 81) transitions.
// Phase 1: matrix 2537 rows 1732 cols
[2025-05-30 10:42:30] [INFO ] Computed 297 invariants in 92 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:42:32] [INFO ] Implicit Places using invariants in 1557 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 821, 950, 966, 971, 972, 992, 1010, 1139, 1155, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1368, 1386, 1515, 1520, 1532, 1537, 1538, 1539, 1572, 1575, 1593, 1594, 1595, 1596, 1613, 1621, 1629, 1635, 1641, 1647, 1653, 1661, 1667, 1673, 1681]
Discarding 76 places :
Implicit Place search using SMT only with invariants took 2216 ms to find 76 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1656/1796 places, 2537/2618 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1643 transition count 2524
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1643 transition count 2524
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1633 transition count 2514
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1633 transition count 2514
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1628 transition count 2509
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1628 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1626 transition count 2507
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1626 transition count 2507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1624 transition count 2505
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1624 transition count 2505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1623 transition count 2504
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1623 transition count 2504
Applied a total of 66 rules in 458 ms. Remains 1623 /1656 variables (removed 33) and now considering 2504/2537 (removed 33) transitions.
// Phase 1: matrix 2504 rows 1623 cols
[2025-05-30 10:42:32] [INFO ] Computed 221 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:42:33] [INFO ] Implicit Places using invariants in 958 ms returned []
[2025-05-30 10:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:42:37] [INFO ] Implicit Places using invariants and state equation in 3660 ms returned []
Implicit Place search using SMT with State Equation took 4620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1623/1796 places, 2504/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8379 ms. Remains : 1623/1796 places, 2504/2618 transitions.
Support contains 69 out of 1623 places after structural reductions.
[2025-05-30 10:42:37] [INFO ] Flatten gal took : 203 ms
[2025-05-30 10:42:38] [INFO ] Flatten gal took : 125 ms
[2025-05-30 10:42:38] [INFO ] Input system was already deterministic with 2504 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (178 resets) in 1270 ms. (31 steps per ms) remains 23/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
[2025-05-30 10:42:38] [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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 322/368 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 304/672 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 912/1584 variables, 164/209 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1584 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 39/1623 variables, 12/221 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1623 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 2504/4127 variables, 1623/1844 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:42:44] [INFO ] Deduced a trap composed of 61 places in 1392 ms of which 32 ms to minimize.
SMT process timed out in 5814ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 292 rules applied. Total rules applied 292 place count 1623 transition count 2212
Reduce places removed 292 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 294 rules applied. Total rules applied 586 place count 1331 transition count 2210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 588 place count 1329 transition count 2210
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 211 Pre rules applied. Total rules applied 588 place count 1329 transition count 1999
Deduced a syphon composed of 211 places in 2 ms
Ensure Unique test removed 68 places
Reduce places removed 279 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1078 place count 1050 transition count 1999
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 20 rules applied. Total rules applied 1098 place count 1039 transition count 1990
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1107 place count 1030 transition count 1990
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 1107 place count 1030 transition count 1962
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1163 place count 1002 transition count 1962
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1170 place count 995 transition count 1948
Iterating global reduction 5 with 7 rules applied. Total rules applied 1177 place count 995 transition count 1948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 1181 place count 995 transition count 1944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1182 place count 994 transition count 1944
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1182 place count 994 transition count 1943
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1184 place count 993 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1185 place count 992 transition count 1935
Iterating global reduction 7 with 1 rules applied. Total rules applied 1186 place count 992 transition count 1935
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 6 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 7 with 164 rules applied. Total rules applied 1350 place count 910 transition count 1853
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1357 place count 910 transition count 1846
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1364 place count 903 transition count 1846
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1402 place count 903 transition count 1808
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 1441 place count 864 transition count 1808
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1445 place count 864 transition count 1804
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1467 place count 864 transition count 1804
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1471 place count 864 transition count 1804
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1473 place count 864 transition count 1802
Applied a total of 1473 rules in 616 ms. Remains 864 /1623 variables (removed 759) and now considering 1802/2504 (removed 702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 864/1623 places, 1802/2504 transitions.
RANDOM walk for 40000 steps (492 resets) in 621 ms. (64 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 253962 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 22
Probabilistic random walk after 253962 steps, saw 48617 distinct states, run finished after 3005 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 1802 rows 864 cols
[2025-05-30 10:42:48] [INFO ] Computed 141 invariants in 18 ms
[2025-05-30 10:42:48] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 68/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 81/194 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 589/783 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 81/864 variables, 23/141 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/864 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 1802/2666 variables, 864/1005 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2666 variables, 39/1044 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2666 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/2666 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2666/2666 variables, and 1044 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4672 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 864/864 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 68/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 81/194 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 589/783 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:42:54] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:42:54] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 81/864 variables, 23/143 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/864 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 10 (OVERLAPS) 1802/2666 variables, 864/1007 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2666 variables, 39/1046 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2666 variables, 4/1050 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2666 variables, 0/1050 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2666 variables, 0/1050 constraints. Problems are: Problem set: 18 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2666/2666 variables, and 1050 constraints, problems are : Problem set: 18 solved, 4 unsolved in 16845 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 113/113 constraints, State Equation: 864/864 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/22 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21580ms problems are : Problem set: 18 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4275 ms.
Support contains 8 out of 864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 864/864 places, 1802/1802 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 863 transition count 1794
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 863 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 862 transition count 1786
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 862 transition count 1786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 861 transition count 1778
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 861 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 860 transition count 1770
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 860 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 859 transition count 1762
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 859 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 858 transition count 1754
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 858 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 857 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 857 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 856 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 856 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 855 transition count 1730
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 855 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 854 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 854 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 853 transition count 1714
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 853 transition count 1714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 850 transition count 1711
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 850 transition count 1710
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 850 transition count 1709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 849 transition count 1709
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 848 transition count 1708
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 40 place count 840 transition count 1708
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 40 place count 840 transition count 1693
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 77 place count 818 transition count 1693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 84 place count 811 transition count 1686
Iterating global reduction 2 with 7 rules applied. Total rules applied 91 place count 811 transition count 1686
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 98 place count 811 transition count 1679
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 810 transition count 1678
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 810 transition count 1677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 809 transition count 1677
Applied a total of 102 rules in 517 ms. Remains 809 /864 variables (removed 55) and now considering 1677/1802 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 809/864 places, 1677/1802 transitions.
RANDOM walk for 40000 steps (607 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (81 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 325337 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 4
Probabilistic random walk after 325337 steps, saw 63596 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 1677 rows 809 cols
[2025-05-30 10:43:18] [INFO ] Computed 126 invariants in 20 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 170/200 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/217 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 252/469 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 64/533 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 210/743 variables, 39/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/756 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/756 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 53/809 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/809 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1677/2486 variables, 809/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2486 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2486 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2486/2486 variables, and 935 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 170/200 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 17/217 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 252/469 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 64/533 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 210/743 variables, 39/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/756 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/756 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 53/809 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/809 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1677/2486 variables, 809/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2486 variables, 4/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2486 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2486 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2486/2486 variables, and 939 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 103/103 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5157ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2260 ms.
Support contains 6 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 1677/1677 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 809 transition count 1676
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 807 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 806 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 806 transition count 1675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 806 transition count 1674
Applied a total of 6 rules in 90 ms. Remains 806 /809 variables (removed 3) and now considering 1674/1677 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 806/809 places, 1674/1677 transitions.
RANDOM walk for 40000 steps (573 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (85 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 344857 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 3
Probabilistic random walk after 344857 steps, saw 67101 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
// Phase 1: matrix 1674 rows 806 cols
[2025-05-30 10:43:28] [INFO ] Computed 125 invariants in 22 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 122/139 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/411 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/459 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 259/718 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/734 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/734 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 72/806 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1674/2480 variables, 806/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2480 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2480 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2480/2480 variables, and 931 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 806/806 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 122/139 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/411 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/459 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 259/718 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/718 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 16/734 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/734 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 72/806 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/806 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1674/2480 variables, 806/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2480 variables, 3/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2480 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2480 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2480/2480 variables, and 934 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 806/806 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2625ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5959 ms.
Support contains 6 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1674/1674 transitions.
Applied a total of 0 rules in 30 ms. Remains 806 /806 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 806/806 places, 1674/1674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1674/1674 transitions.
Applied a total of 0 rules in 29 ms. Remains 806 /806 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2025-05-30 10:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:38] [INFO ] Implicit Places using invariants in 618 ms returned [71, 88, 94, 97, 99, 100, 160, 177, 183, 186, 188, 195, 196, 248, 265, 271, 274, 276, 277, 282, 283, 335, 352, 358, 361, 363, 364, 369, 370, 388, 423, 444, 452, 458, 459, 464, 465, 520, 536, 544, 550, 553, 555, 556, 560, 565, 566, 567, 619, 636, 642, 645, 647, 648, 653, 654, 706, 723, 729, 732, 734, 735, 763]
[2025-05-30 10:43:38] [INFO ] Actually due to overlaps returned [277, 364, 459, 560, 648, 735, 388, 567, 763, 88, 94, 99, 177, 183, 188, 265, 271, 276, 352, 358, 363, 636, 642, 647, 723, 729, 734, 71, 100, 160, 248, 335, 423, 444, 452, 458, 520, 556, 619, 706]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 620 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 766/806 places, 1674/1674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 766 transition count 1670
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 762 transition count 1670
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 35 place count 735 transition count 1643
Iterating global reduction 2 with 27 rules applied. Total rules applied 62 place count 735 transition count 1643
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 727 transition count 1635
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 727 transition count 1635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 726 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 726 transition count 1634
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 132 place count 700 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 699 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 699 transition count 1606
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 156 place count 699 transition count 1584
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 178 place count 677 transition count 1584
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 185 place count 677 transition count 1577
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 192 place count 670 transition count 1577
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 670 transition count 1577
Applied a total of 193 rules in 211 ms. Remains 670 /766 variables (removed 96) and now considering 1577/1674 (removed 97) transitions.
// Phase 1: matrix 1577 rows 670 cols
[2025-05-30 10:43:38] [INFO ] Computed 85 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:38] [INFO ] Implicit Places using invariants in 486 ms returned [163, 164, 234, 235, 305, 306, 376, 377, 446, 454, 460, 463, 465, 470, 471, 541, 542]
[2025-05-30 10:43:38] [INFO ] Actually due to overlaps returned [163, 234, 305, 376, 470, 541, 164, 235, 306, 377, 471, 542, 454, 460, 465, 446]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 490 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 654/806 places, 1577/1674 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 650 transition count 1573
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 650 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 649 transition count 1572
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 649 transition count 1572
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 648 transition count 1571
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 648 transition count 1568
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 645 transition count 1568
Applied a total of 18 rules in 105 ms. Remains 645 /654 variables (removed 9) and now considering 1568/1577 (removed 9) transitions.
// Phase 1: matrix 1568 rows 645 cols
[2025-05-30 10:43:38] [INFO ] Computed 69 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:39] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-05-30 10:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:40] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 645/806 places, 1568/1674 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3336 ms. Remains : 645/806 places, 1568/1674 transitions.
RANDOM walk for 40000 steps (683 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (111 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 217988 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 217988 steps, saw 149110 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-30 10:43:43] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 283/298 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/308 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 243/551 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/585 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 60/645 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1568/2213 variables, 645/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2213 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2213 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 714 constraints, problems are : Problem set: 0 solved, 3 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 645/645 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 283/298 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/308 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 243/551 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/585 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 60/645 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/645 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1568/2213 variables, 645/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2213 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2213 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2213 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 717 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2036ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1371 ms.
Support contains 6 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1568/1568 transitions.
Applied a total of 0 rules in 25 ms. Remains 645 /645 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 645/645 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1568/1568 transitions.
Applied a total of 0 rules in 23 ms. Remains 645 /645 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2025-05-30 10:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:47] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-05-30 10:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:43:49] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:43:49] [INFO ] Redundant transitions in 125 ms returned []
Running 1530 sub problems to find dead transitions.
[2025-05-30 10:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 644/2213 variables, and 63 constraints, problems are : Problem set: 0 solved, 1530 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 53/56 constraints, State Equation: 0/645 constraints, PredecessorRefiner: 1530/1530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1530 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1530 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:44:39] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 14 ms to minimize.
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:44:48] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 timeout
0)
(s73 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/2213 variables, and 65 constraints, problems are : Problem set: 4 solved, 1526 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 53/56 constraints, State Equation: 0/645 constraints, PredecessorRefiner: 0/1530 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 4 solved, 1526 unsolved
Search for dead transitions found 4 dead transitions in 60635ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 645/645 places, 1564/1568 transitions.
Applied a total of 0 rules in 24 ms. Remains 645 /645 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:44:49] [INFO ] Redundant transitions in 34 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62674 ms. Remains : 645/645 places, 1564/1568 transitions.
Successfully simplified 19 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-08a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F(p1)))'
Support contains 6 out of 1623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 301 place count 1623 transition count 2203
Reduce places removed 301 places and 0 transitions.
Iterating post reduction 1 with 301 rules applied. Total rules applied 602 place count 1322 transition count 2203
Performed 212 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 212 Pre rules applied. Total rules applied 602 place count 1322 transition count 1991
Deduced a syphon composed of 212 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 2 with 493 rules applied. Total rules applied 1095 place count 1041 transition count 1991
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 20 rules applied. Total rules applied 1115 place count 1030 transition count 1982
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1124 place count 1021 transition count 1982
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1124 place count 1021 transition count 1954
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1180 place count 993 transition count 1954
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1186 place count 987 transition count 1941
Iterating global reduction 4 with 6 rules applied. Total rules applied 1192 place count 987 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 1196 place count 987 transition count 1937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1197 place count 986 transition count 1937
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1197 place count 986 transition count 1936
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 1199 place count 985 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1200 place count 984 transition count 1928
Iterating global reduction 6 with 1 rules applied. Total rules applied 1201 place count 984 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1202 place count 983 transition count 1920
Iterating global reduction 6 with 1 rules applied. Total rules applied 1203 place count 983 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1204 place count 982 transition count 1912
Iterating global reduction 6 with 1 rules applied. Total rules applied 1205 place count 982 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1206 place count 981 transition count 1904
Iterating global reduction 6 with 1 rules applied. Total rules applied 1207 place count 981 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1208 place count 980 transition count 1896
Iterating global reduction 6 with 1 rules applied. Total rules applied 1209 place count 980 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1210 place count 979 transition count 1888
Iterating global reduction 6 with 1 rules applied. Total rules applied 1211 place count 979 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1212 place count 978 transition count 1880
Iterating global reduction 6 with 1 rules applied. Total rules applied 1213 place count 978 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1214 place count 977 transition count 1872
Iterating global reduction 6 with 1 rules applied. Total rules applied 1215 place count 977 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1216 place count 976 transition count 1864
Iterating global reduction 6 with 1 rules applied. Total rules applied 1217 place count 976 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1218 place count 975 transition count 1856
Iterating global reduction 6 with 1 rules applied. Total rules applied 1219 place count 975 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1220 place count 974 transition count 1848
Iterating global reduction 6 with 1 rules applied. Total rules applied 1221 place count 974 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1222 place count 973 transition count 1840
Iterating global reduction 6 with 1 rules applied. Total rules applied 1223 place count 973 transition count 1840
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 6 with 172 rules applied. Total rules applied 1395 place count 887 transition count 1754
Applied a total of 1395 rules in 525 ms. Remains 887 /1623 variables (removed 736) and now considering 1754/2504 (removed 750) transitions.
// Phase 1: matrix 1754 rows 887 cols
[2025-05-30 10:44:50] [INFO ] Computed 141 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:44:51] [INFO ] Implicit Places using invariants in 631 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 284, 290, 295, 311, 381, 387, 392, 408, 426, 483, 491, 497, 513, 606, 624, 625, 695, 701, 706, 722, 792, 798, 803, 822, 884]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 633 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 854/1623 places, 1754/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 854 transition count 1749
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 849 transition count 1749
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 10 place count 849 transition count 1729
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 50 place count 829 transition count 1729
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 64 place count 815 transition count 1715
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 815 transition count 1715
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 92 place count 801 transition count 1701
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 801 transition count 1701
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 794 transition count 1694
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 794 transition count 1694
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 158 place count 775 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 774 transition count 1673
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 774 transition count 1673
Applied a total of 160 rules in 390 ms. Remains 774 /854 variables (removed 80) and now considering 1673/1754 (removed 81) transitions.
// Phase 1: matrix 1673 rows 774 cols
[2025-05-30 10:44:51] [INFO ] Computed 108 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:44:52] [INFO ] Implicit Places using invariants in 522 ms returned [93, 96, 177, 180, 261, 264, 345, 348, 429, 432, 516, 522, 527, 529, 532, 613, 616, 697, 700]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 524 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/1623 places, 1673/2504 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 755 transition count 1665
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 747 transition count 1665
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 26 place count 737 transition count 1655
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 737 transition count 1655
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 44 place count 737 transition count 1647
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 735 transition count 1645
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 735 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 734 transition count 1644
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 734 transition count 1644
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 732 transition count 1642
Applied a total of 54 rules in 98 ms. Remains 732 /755 variables (removed 23) and now considering 1642/1673 (removed 31) transitions.
// Phase 1: matrix 1642 rows 732 cols
[2025-05-30 10:44:52] [INFO ] Computed 89 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:44:52] [INFO ] Implicit Places using invariants in 461 ms returned [72, 151, 231, 311, 391, 474, 558, 638]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 462 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 724/1623 places, 1642/2504 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 716 transition count 1634
Applied a total of 16 rules in 41 ms. Remains 716 /724 variables (removed 8) and now considering 1634/1642 (removed 8) transitions.
// Phase 1: matrix 1634 rows 716 cols
[2025-05-30 10:44:52] [INFO ] Computed 81 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:44:53] [INFO ] Implicit Places using invariants in 460 ms returned []
[2025-05-30 10:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:44:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 10:44:55] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 716/1623 places, 1634/2504 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4951 ms. Remains : 716/1623 places, 1634/2504 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-01
Product exploration explored 100000 steps with 1208 reset in 393 ms.
Product exploration explored 100000 steps with 1227 reset in 356 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 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 42 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (496 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428400 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428400 steps, saw 87216 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2025-05-30 10:44:59] [INFO ] Invariant cache hit.
[2025-05-30 10:44:59] [INFO ] State equation strengthened by 7 read => feed constraints.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/201 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/706 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/716 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1634/2350 variables, 716/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2350 variables, 7/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2350 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 804 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 716/716 constraints, ReadFeed: 7/7 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/201 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/706 variables, 57/76 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 10:45:00] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/716 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/716 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1634/2350 variables, 716/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 7/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2350 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2350 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2350/2350 variables, and 806 constraints, problems are : Problem set: 0 solved, 1 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 716/716 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 2 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 1634/1634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 715 transition count 1633
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 715 transition count 1633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 714 transition count 1632
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 36 place count 714 transition count 1600
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 75 place count 682 transition count 1593
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 97 place count 682 transition count 1571
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 119 place count 660 transition count 1571
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 660 transition count 1571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 659 transition count 1570
Applied a total of 121 rules in 140 ms. Remains 659 /716 variables (removed 57) and now considering 1570/1634 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 659/716 places, 1570/1634 transitions.
RANDOM walk for 40000 steps (627 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (113 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 293926 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 293926 steps, saw 106519 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 1570 rows 659 cols
[2025-05-30 10:45:04] [INFO ] Computed 81 invariants in 17 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/81 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/345 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/405 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/580 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/585 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/659 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1570/2229 variables, 659/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2229 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2229 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2229/2229 variables, and 740 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 659/659 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/81 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/345 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/405 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/580 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/585 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/659 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1570/2229 variables, 659/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2229 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2229 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2229 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2229/2229 variables, and 741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 2 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1570/1570 transitions.
Applied a total of 0 rules in 21 ms. Remains 659 /659 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 659/659 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1570/1570 transitions.
Applied a total of 0 rules in 21 ms. Remains 659 /659 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2025-05-30 10:45:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:45:06] [INFO ] Implicit Places using invariants in 480 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 451, 452, 522, 523, 616]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 482 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 644/659 places, 1570/1570 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 637 transition count 1563
Applied a total of 14 rules in 41 ms. Remains 637 /644 variables (removed 7) and now considering 1563/1570 (removed 7) transitions.
// Phase 1: matrix 1563 rows 637 cols
[2025-05-30 10:45:06] [INFO ] Computed 66 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:45:06] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-05-30 10:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:45:07] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 637/659 places, 1563/1570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2244 ms. Remains : 637/659 places, 1563/1570 transitions.
RANDOM walk for 40000 steps (691 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (112 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268225 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268225 steps, saw 177467 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2025-05-30 10:45:10] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/105 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 249/403 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1563/2200 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2200 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2200 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2200/2200 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/105 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 249/403 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1563/2200 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2200 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2200 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2200 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2200/2200 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 637/637 places, 1563/1563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
[2025-05-30 10:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:45:12] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-30 10:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:45:13] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:45:13] [INFO ] Redundant transitions in 26 ms returned []
Running 1525 sub problems to find dead transitions.
[2025-05-30 10:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:45:30] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2200 variables, and 62 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1525/1525 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:46:04] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 15 ms to minimize.
Problem TDEAD1114 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1226 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/636 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2200 variables, and 63 constraints, problems are : Problem set: 4 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1525 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 4 solved, 1521 unsolved
Search for dead transitions found 4 dead transitions in 60526ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/637 places, 1559/1563 transitions.
Applied a total of 0 rules in 21 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:46:14] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62310 ms. Remains : 637/637 places, 1559/1563 transitions.
RANDOM walk for 40000 steps (637 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (113 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 272100 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 272100 steps, saw 180028 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 1559 rows 637 cols
[2025-05-30 10:46:17] [INFO ] Computed 66 invariants in 20 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/403 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1559/2196 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2196 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/403 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1559/2196 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2196 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2196 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 637/637 places, 1559/1559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 21 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
[2025-05-30 10:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:46:19] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-05-30 10:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:46:20] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:46:20] [INFO ] Redundant transitions in 31 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-05-30 10:46: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/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60578ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62295 ms. Remains : 637/637 places, 1559/1559 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 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 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 2 out of 716 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 : 716/716 places, 1634/1634 transitions.
Applied a total of 0 rules in 30 ms. Remains 716 /716 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
// Phase 1: matrix 1634 rows 716 cols
[2025-05-30 10:47:21] [INFO ] Computed 81 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:47:21] [INFO ] Implicit Places using invariants in 479 ms returned []
[2025-05-30 10:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:47:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 10:47:23] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:47:23] [INFO ] Redundant transitions in 56 ms returned []
Running 1633 sub problems to find dead transitions.
[2025-05-30 10:47:23] [INFO ] Invariant cache hit.
[2025-05-30 10:47:23] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1633 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 715/2350 variables, and 45 constraints, problems are : Problem set: 0 solved, 1633 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 45/67 constraints, State Equation: 0/716 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1633/1633 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1633 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1633 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 15)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(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 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(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 3)
(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 0)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 3)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 8)
(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 3)
(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 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(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 3)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 8)
(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 3)
(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 0)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(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 3)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 8)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 3)
(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 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 1)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(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 3)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 8)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 3)
(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 0)
(s431 1)
(s432 0)
(s433 1)
(s434 0)
(s435 1)
(s436 1)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 7)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 8)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/2350 variables, and 45 constraints, problems are : Problem set: 0 solved, 1633 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 45/67 constraints, State Equation: 0/716 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1633 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 1633 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62896 ms. Remains : 716/716 places, 1634/1634 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 57 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (488 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (85 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320549 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320549 steps, saw 67754 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2025-05-30 10:48:27] [INFO ] Invariant cache hit.
[2025-05-30 10:48:27] [INFO ] State equation strengthened by 7 read => feed constraints.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/201 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/706 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/716 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1634/2350 variables, 716/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2350 variables, 7/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2350 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 804 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 716/716 constraints, ReadFeed: 7/7 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/201 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 505/706 variables, 57/76 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 10:48:28] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/706 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/716 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/716 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1634/2350 variables, 716/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2350 variables, 7/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2350 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2350 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2350/2350 variables, and 806 constraints, problems are : Problem set: 0 solved, 1 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 716/716 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 2 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 1634/1634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 715 transition count 1633
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 715 transition count 1633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 714 transition count 1632
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 36 place count 714 transition count 1600
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 75 place count 682 transition count 1593
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 97 place count 682 transition count 1571
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 119 place count 660 transition count 1571
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 660 transition count 1571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 659 transition count 1570
Applied a total of 121 rules in 147 ms. Remains 659 /716 variables (removed 57) and now considering 1570/1634 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 659/716 places, 1570/1634 transitions.
RANDOM walk for 40000 steps (671 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (117 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214648 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 214648 steps, saw 87533 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1570 rows 659 cols
[2025-05-30 10:48:32] [INFO ] Computed 81 invariants in 15 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/81 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/345 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/405 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/580 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/585 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/659 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1570/2229 variables, 659/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2229 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2229 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2229/2229 variables, and 740 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 659/659 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/81 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/345 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/405 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 175/580 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/585 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/659 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/659 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1570/2229 variables, 659/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2229 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2229 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2229 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2229/2229 variables, and 741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 659/659 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1570/1570 transitions.
Applied a total of 0 rules in 20 ms. Remains 659 /659 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 659/659 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1570/1570 transitions.
Applied a total of 0 rules in 32 ms. Remains 659 /659 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2025-05-30 10:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:48:33] [INFO ] Implicit Places using invariants in 469 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 372, 373, 451, 452, 522, 523, 616]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 471 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 644/659 places, 1570/1570 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 637 transition count 1563
Applied a total of 14 rules in 36 ms. Remains 637 /644 variables (removed 7) and now considering 1563/1570 (removed 7) transitions.
// Phase 1: matrix 1563 rows 637 cols
[2025-05-30 10:48:34] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:48:34] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-05-30 10:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:48:35] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 637/659 places, 1563/1570 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2254 ms. Remains : 637/659 places, 1563/1570 transitions.
RANDOM walk for 40000 steps (693 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (117 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 202796 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 202796 steps, saw 134370 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2025-05-30 10:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/105 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 249/403 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1563/2200 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2200 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2200 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2200/2200 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/105 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/154 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 249/403 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1563/2200 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2200 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2200 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2200 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2200/2200 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 637/637 places, 1563/1563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
[2025-05-30 10:48:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:48:40] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-05-30 10:48:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:48:41] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:48:41] [INFO ] Redundant transitions in 31 ms returned []
Running 1525 sub problems to find dead transitions.
[2025-05-30 10:48: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/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:48:59] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2200 variables, and 62 constraints, problems are : Problem set: 0 solved, 1525 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1525/1525 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1525 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:49:32] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 14 ms to minimize.
Problem TDEAD1114 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1226 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/636 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2200 variables, and 63 constraints, problems are : Problem set: 4 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1525 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60509ms problems are : Problem set: 4 solved, 1521 unsolved
Search for dead transitions found 4 dead transitions in 60515ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/637 places, 1559/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:49:42] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62319 ms. Remains : 637/637 places, 1559/1563 transitions.
RANDOM walk for 40000 steps (652 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207346 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 207346 steps, saw 137353 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 1559 rows 637 cols
[2025-05-30 10:49:45] [INFO ] Computed 66 invariants in 20 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/403 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1559/2196 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2196 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/134 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/403 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/425 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 150/575 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/580 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/580 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 57/637 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1559/2196 variables, 637/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2196 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2196 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 704 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1196ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 2 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 19 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 637/637 places, 1559/1559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 22 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
[2025-05-30 10:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:49:47] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-05-30 10:49:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:49:48] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:49:48] [INFO ] Redundant transitions in 31 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-05-30 10:49:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60476ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62218 ms. Remains : 637/637 places, 1559/1559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1227 reset in 249 ms.
Product exploration explored 100000 steps with 1200 reset in 267 ms.
Built C files in :
/tmp/ltsmin3986273456184957022
[2025-05-30 10:50:49] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2025-05-30 10:50:49] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3986273456184957022
Running compilation step : cd /tmp/ltsmin3986273456184957022;'/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/ltsmin3986273456184957022;'/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/ltsmin3986273456184957022;'/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 2 out of 716 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 716/716 places, 1634/1634 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 1632
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 713 transition count 1631
Applied a total of 4 rules in 56 ms. Remains 713 /716 variables (removed 3) and now considering 1631/1634 (removed 3) transitions.
// Phase 1: matrix 1631 rows 713 cols
[2025-05-30 10:50:52] [INFO ] Computed 81 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:50:53] [INFO ] Implicit Places using invariants in 463 ms returned [670]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 712/716 places, 1631/1634 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 1624
Applied a total of 14 rules in 39 ms. Remains 705 /712 variables (removed 7) and now considering 1624/1631 (removed 7) transitions.
// Phase 1: matrix 1624 rows 705 cols
[2025-05-30 10:50:53] [INFO ] Computed 80 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:50:53] [INFO ] Implicit Places using invariants in 452 ms returned []
[2025-05-30 10:50:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:50:55] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 705/716 places, 1624/1634 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2384 ms. Remains : 705/716 places, 1624/1634 transitions.
Built C files in :
/tmp/ltsmin5085213988536456433
[2025-05-30 10:50:55] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2025-05-30 10:50:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5085213988536456433
Running compilation step : cd /tmp/ltsmin5085213988536456433;'/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/ltsmin5085213988536456433;'/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/ltsmin5085213988536456433;'/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 10:50:58] [INFO ] Flatten gal took : 59 ms
[2025-05-30 10:50:58] [INFO ] Flatten gal took : 58 ms
[2025-05-30 10:50:58] [INFO ] Time to serialize gal into /tmp/LTL6326533478060948884.gal : 20 ms
[2025-05-30 10:50:58] [INFO ] Time to serialize properties into /tmp/LTL4713300589543173096.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/LTL6326533478060948884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2044452971685659478.hoa' '-atoms' '/tmp/LTL4713300589543173096.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...317
Loading property file /tmp/LTL4713300589543173096.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2044452971685659478.hoa
Detected timeout of ITS tools.
[2025-05-30 10:51:13] [INFO ] Flatten gal took : 54 ms
[2025-05-30 10:51:13] [INFO ] Flatten gal took : 53 ms
[2025-05-30 10:51:13] [INFO ] Time to serialize gal into /tmp/LTL5103517025563181355.gal : 10 ms
[2025-05-30 10:51:13] [INFO ] Time to serialize properties into /tmp/LTL5524659843660313513.ltl : 3 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/LTL5103517025563181355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5524659843660313513.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...275
Read 1 LTL properties
Checking formula 0 : !(((G("((p1010==0)||(p1081==0))"))&&(F("(((p1629!=1)||(p1726!=1))||((p236==1)&&(p475==1)))"))))
Formula 0 simplified : F!"((p1010==0)||(p1081==0))" | G!"(((p1629!=1)||(p1726!=1))||((p236==1)&&(p475==1)))"
Detected timeout of ITS tools.
[2025-05-30 10:51:28] [INFO ] Flatten gal took : 48 ms
[2025-05-30 10:51:28] [INFO ] Applying decomposition
[2025-05-30 10:51:28] [INFO ] Flatten gal took : 47 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/graph18270169894159616115.txt' '-o' '/tmp/graph18270169894159616115.bin' '-w' '/tmp/graph18270169894159616115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18270169894159616115.bin' '-l' '-1' '-v' '-w' '/tmp/graph18270169894159616115.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:51:29] [INFO ] Decomposing Gal with order
[2025-05-30 10:51:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:51:29] [INFO ] Removed a total of 3216 redundant transitions.
[2025-05-30 10:51:29] [INFO ] Flatten gal took : 151 ms
[2025-05-30 10:51:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 55 ms.
[2025-05-30 10:51:29] [INFO ] Time to serialize gal into /tmp/LTL13674973790496656125.gal : 15 ms
[2025-05-30 10:51:29] [INFO ] Time to serialize properties into /tmp/LTL10249675399743141112.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/LTL13674973790496656125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10249675399743141112.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...256
Read 1 LTL properties
Checking formula 0 : !(((G("((i11.u104.p1010==0)||(i11.u104.p1081==0))"))&&(F("(((i15.i1.u162.p1629!=1)||(i15.i1.u162.p1726!=1))||((i4.u28.p236==1)&&(i4.u5...172
Formula 0 simplified : F!"((i11.u104.p1010==0)||(i11.u104.p1081==0))" | G!"(((i15.i1.u162.p1629!=1)||(i15.i1.u162.p1726!=1))||((i4.u28.p236==1)&&(i4.u57.p4...164
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLFireability-01 finished in 414295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1620 transition count 2489
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1620 transition count 2489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1618 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1618 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1617 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1617 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1616 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1616 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1615 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1615 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1614 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1614 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1613 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1613 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1612 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1612 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1611 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1611 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1610 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1610 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1609 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1609 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1608 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1608 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1607 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1607 transition count 2392
Applied a total of 32 rules in 685 ms. Remains 1607 /1623 variables (removed 16) and now considering 2392/2504 (removed 112) transitions.
// Phase 1: matrix 2392 rows 1607 cols
[2025-05-30 10:51:45] [INFO ] Computed 221 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:46] [INFO ] Implicit Places using invariants in 916 ms returned [770, 935, 1117, 1497]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 918 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1623 places, 2392/2504 transitions.
Applied a total of 0 rules in 47 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1653 ms. Remains : 1603/1623 places, 2392/2504 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 789 ms.
Product exploration explored 100000 steps with 33333 reset in 800 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-08a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLFireability-03 finished in 3423 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 U ((!p0&&G(F(!p1)))||G(!p0)))))'
Support contains 5 out of 1623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 1622 transition count 2205
Reduce places removed 306 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 313 rules applied. Total rules applied 611 place count 1316 transition count 2198
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 619 place count 1309 transition count 2197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 1308 transition count 2197
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 228 Pre rules applied. Total rules applied 620 place count 1308 transition count 1969
Deduced a syphon composed of 228 places in 1 ms
Ensure Unique test removed 66 places
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 4 with 522 rules applied. Total rules applied 1142 place count 1014 transition count 1969
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 45 rules applied. Total rules applied 1187 place count 994 transition count 1944
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1212 place count 969 transition count 1944
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 1212 place count 969 transition count 1916
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1268 place count 941 transition count 1916
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1284 place count 925 transition count 1888
Iterating global reduction 6 with 16 rules applied. Total rules applied 1300 place count 925 transition count 1888
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 13 rules applied. Total rules applied 1313 place count 924 transition count 1876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1314 place count 923 transition count 1876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1314 place count 923 transition count 1875
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1316 place count 922 transition count 1875
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1317 place count 921 transition count 1867
Iterating global reduction 8 with 1 rules applied. Total rules applied 1318 place count 921 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1319 place count 920 transition count 1859
Iterating global reduction 8 with 1 rules applied. Total rules applied 1320 place count 920 transition count 1859
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1321 place count 919 transition count 1851
Iterating global reduction 8 with 1 rules applied. Total rules applied 1322 place count 919 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1323 place count 918 transition count 1843
Iterating global reduction 8 with 1 rules applied. Total rules applied 1324 place count 918 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1325 place count 917 transition count 1835
Iterating global reduction 8 with 1 rules applied. Total rules applied 1326 place count 917 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1327 place count 916 transition count 1827
Iterating global reduction 8 with 1 rules applied. Total rules applied 1328 place count 916 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1329 place count 915 transition count 1819
Iterating global reduction 8 with 1 rules applied. Total rules applied 1330 place count 915 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1331 place count 914 transition count 1811
Iterating global reduction 8 with 1 rules applied. Total rules applied 1332 place count 914 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1333 place count 913 transition count 1803
Iterating global reduction 8 with 1 rules applied. Total rules applied 1334 place count 913 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1335 place count 912 transition count 1795
Iterating global reduction 8 with 1 rules applied. Total rules applied 1336 place count 912 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1337 place count 911 transition count 1787
Iterating global reduction 8 with 1 rules applied. Total rules applied 1338 place count 911 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1339 place count 910 transition count 1779
Iterating global reduction 8 with 1 rules applied. Total rules applied 1340 place count 910 transition count 1779
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 8 with 150 rules applied. Total rules applied 1490 place count 835 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1491 place count 834 transition count 1703
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 834 transition count 1703
Applied a total of 1492 rules in 409 ms. Remains 834 /1623 variables (removed 789) and now considering 1703/2504 (removed 801) transitions.
// Phase 1: matrix 1703 rows 834 cols
[2025-05-30 10:51:48] [INFO ] Computed 126 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:48] [INFO ] Implicit Places using invariants in 578 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 395, 430, 451, 460, 468, 470, 479, 532, 579, 640, 657, 663, 668, 670, 730, 747, 753, 758, 760, 789, 831]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 580 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 794/1623 places, 1703/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 794 transition count 1694
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 785 transition count 1694
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 31 place count 772 transition count 1681
Iterating global reduction 2 with 13 rules applied. Total rules applied 44 place count 772 transition count 1681
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 759 transition count 1668
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 759 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 753 transition count 1662
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 753 transition count 1662
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 134 place count 727 transition count 1636
Applied a total of 134 rules in 97 ms. Remains 727 /794 variables (removed 67) and now considering 1636/1703 (removed 67) transitions.
// Phase 1: matrix 1636 rows 727 cols
[2025-05-30 10:51:49] [INFO ] Computed 86 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:49] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-05-30 10:51:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:51] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 727/1623 places, 1636/2504 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3183 ms. Remains : 727/1623 places, 1636/2504 transitions.
Stuttering acceptance computed with spot in 95 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-07
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-07 finished in 3298 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 1 out of 1623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 301 place count 1622 transition count 2202
Reduce places removed 309 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 316 rules applied. Total rules applied 617 place count 1313 transition count 2195
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 624 place count 1306 transition count 2195
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 624 place count 1306 transition count 1967
Deduced a syphon composed of 228 places in 1 ms
Ensure Unique test removed 68 places
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 3 with 524 rules applied. Total rules applied 1148 place count 1010 transition count 1967
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 45 rules applied. Total rules applied 1193 place count 990 transition count 1942
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 1218 place count 965 transition count 1942
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1218 place count 965 transition count 1913
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1276 place count 936 transition count 1913
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1292 place count 920 transition count 1885
Iterating global reduction 5 with 16 rules applied. Total rules applied 1308 place count 920 transition count 1885
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 5 with 13 rules applied. Total rules applied 1321 place count 919 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1322 place count 918 transition count 1873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1322 place count 918 transition count 1872
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 1324 place count 917 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1325 place count 916 transition count 1864
Iterating global reduction 7 with 1 rules applied. Total rules applied 1326 place count 916 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1327 place count 915 transition count 1856
Iterating global reduction 7 with 1 rules applied. Total rules applied 1328 place count 915 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1329 place count 914 transition count 1848
Iterating global reduction 7 with 1 rules applied. Total rules applied 1330 place count 914 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1331 place count 913 transition count 1840
Iterating global reduction 7 with 1 rules applied. Total rules applied 1332 place count 913 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1333 place count 912 transition count 1832
Iterating global reduction 7 with 1 rules applied. Total rules applied 1334 place count 912 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1335 place count 911 transition count 1824
Iterating global reduction 7 with 1 rules applied. Total rules applied 1336 place count 911 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1337 place count 910 transition count 1816
Iterating global reduction 7 with 1 rules applied. Total rules applied 1338 place count 910 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1339 place count 909 transition count 1808
Iterating global reduction 7 with 1 rules applied. Total rules applied 1340 place count 909 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1341 place count 908 transition count 1800
Iterating global reduction 7 with 1 rules applied. Total rules applied 1342 place count 908 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1343 place count 907 transition count 1792
Iterating global reduction 7 with 1 rules applied. Total rules applied 1344 place count 907 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1345 place count 906 transition count 1784
Iterating global reduction 7 with 1 rules applied. Total rules applied 1346 place count 906 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1347 place count 905 transition count 1776
Iterating global reduction 7 with 1 rules applied. Total rules applied 1348 place count 905 transition count 1776
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 7 with 158 rules applied. Total rules applied 1506 place count 826 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1507 place count 825 transition count 1696
Iterating global reduction 7 with 1 rules applied. Total rules applied 1508 place count 825 transition count 1696
Applied a total of 1508 rules in 395 ms. Remains 825 /1623 variables (removed 798) and now considering 1696/2504 (removed 808) transitions.
// Phase 1: matrix 1696 rows 825 cols
[2025-05-30 10:51:51] [INFO ] Computed 124 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:52] [INFO ] Implicit Places using invariants in 583 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 249, 266, 272, 277, 279, 339, 356, 362, 367, 369, 395, 430, 451, 459, 465, 467, 476, 529, 546, 570, 579, 631, 648, 654, 659, 661, 721, 738, 744, 749, 751, 780, 822]
[2025-05-30 10:51:52] [INFO ] Actually due to overlaps returned [395, 780, 476, 579, 189, 279, 369, 467, 570, 661, 751, 72, 89, 95, 100, 159, 176, 182, 187, 249, 266, 272, 277, 339, 356, 362, 367, 430, 451, 459, 465, 529, 631, 648, 654, 659, 721, 738, 744, 749, 822]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 585 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 784/1623 places, 1696/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 784 transition count 1687
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 775 transition count 1687
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 775 transition count 1683
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 771 transition count 1683
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 40 place count 757 transition count 1669
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 757 transition count 1669
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 68 place count 743 transition count 1655
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 743 transition count 1655
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 736 transition count 1648
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 736 transition count 1648
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 148 place count 710 transition count 1622
Applied a total of 148 rules in 114 ms. Remains 710 /784 variables (removed 74) and now considering 1622/1696 (removed 74) transitions.
// Phase 1: matrix 1622 rows 710 cols
[2025-05-30 10:51:52] [INFO ] Computed 83 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:52] [INFO ] Implicit Places using invariants in 453 ms returned [470, 478, 484, 489]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 455 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 706/1623 places, 1622/2504 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 704 transition count 1620
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 704 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 702 transition count 1618
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 702 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 701 transition count 1617
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 701 transition count 1617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 700 transition count 1616
Applied a total of 12 rules in 84 ms. Remains 700 /706 variables (removed 6) and now considering 1616/1622 (removed 6) transitions.
// Phase 1: matrix 1616 rows 700 cols
[2025-05-30 10:51:52] [INFO ] Computed 79 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:53] [INFO ] Implicit Places using invariants in 445 ms returned []
[2025-05-30 10:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:54] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 700/1623 places, 1616/2504 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3649 ms. Remains : 700/1623 places, 1616/2504 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-09
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-09 finished in 3745 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(F(p0)))'
Support contains 8 out of 1623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1621 transition count 2497
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1621 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1620 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1620 transition count 2496
Applied a total of 6 rules in 137 ms. Remains 1620 /1623 variables (removed 3) and now considering 2496/2504 (removed 8) transitions.
// Phase 1: matrix 2496 rows 1620 cols
[2025-05-30 10:51:55] [INFO ] Computed 221 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:56] [INFO ] Implicit Places using invariants in 992 ms returned [770, 935, 1117, 1510]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 994 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1616/1623 places, 2496/2504 transitions.
Applied a total of 0 rules in 47 ms. Remains 1616 /1616 variables (removed 0) and now considering 2496/2496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1180 ms. Remains : 1616/1623 places, 2496/2504 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-10
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-10 finished in 1286 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 1623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1620 transition count 2489
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1620 transition count 2489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1618 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1618 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1617 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1617 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1616 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1616 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1615 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1615 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1614 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1614 transition count 2448
Applied a total of 18 rules in 318 ms. Remains 1614 /1623 variables (removed 9) and now considering 2448/2504 (removed 56) transitions.
// Phase 1: matrix 2448 rows 1614 cols
[2025-05-30 10:51:56] [INFO ] Computed 221 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:57] [INFO ] Implicit Places using invariants in 983 ms returned [770, 935, 1117, 1504]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 985 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1610/1623 places, 2448/2504 transitions.
Applied a total of 0 rules in 47 ms. Remains 1610 /1610 variables (removed 0) and now considering 2448/2448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1351 ms. Remains : 1610/1623 places, 2448/2504 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-11 finished in 1463 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 1623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 302 place count 1622 transition count 2201
Reduce places removed 310 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 317 rules applied. Total rules applied 619 place count 1312 transition count 2194
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 626 place count 1305 transition count 2194
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 229 Pre rules applied. Total rules applied 626 place count 1305 transition count 1965
Deduced a syphon composed of 229 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 527 rules applied. Total rules applied 1153 place count 1007 transition count 1965
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 44 rules applied. Total rules applied 1197 place count 987 transition count 1941
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 25 rules applied. Total rules applied 1222 place count 963 transition count 1940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1223 place count 962 transition count 1940
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1223 place count 962 transition count 1911
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1281 place count 933 transition count 1911
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1296 place count 918 transition count 1884
Iterating global reduction 6 with 15 rules applied. Total rules applied 1311 place count 918 transition count 1884
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
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 12 rules applied. Total rules applied 1323 place count 917 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1324 place count 916 transition count 1873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1324 place count 916 transition count 1872
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 1326 place count 915 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1327 place count 914 transition count 1864
Iterating global reduction 8 with 1 rules applied. Total rules applied 1328 place count 914 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1329 place count 913 transition count 1856
Iterating global reduction 8 with 1 rules applied. Total rules applied 1330 place count 913 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1331 place count 912 transition count 1848
Iterating global reduction 8 with 1 rules applied. Total rules applied 1332 place count 912 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1333 place count 911 transition count 1840
Iterating global reduction 8 with 1 rules applied. Total rules applied 1334 place count 911 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1335 place count 910 transition count 1832
Iterating global reduction 8 with 1 rules applied. Total rules applied 1336 place count 910 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1337 place count 909 transition count 1824
Iterating global reduction 8 with 1 rules applied. Total rules applied 1338 place count 909 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1339 place count 908 transition count 1816
Iterating global reduction 8 with 1 rules applied. Total rules applied 1340 place count 908 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1341 place count 907 transition count 1808
Iterating global reduction 8 with 1 rules applied. Total rules applied 1342 place count 907 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1343 place count 906 transition count 1800
Iterating global reduction 8 with 1 rules applied. Total rules applied 1344 place count 906 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1345 place count 905 transition count 1792
Iterating global reduction 8 with 1 rules applied. Total rules applied 1346 place count 905 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1347 place count 904 transition count 1784
Iterating global reduction 8 with 1 rules applied. Total rules applied 1348 place count 904 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1349 place count 903 transition count 1776
Iterating global reduction 8 with 1 rules applied. Total rules applied 1350 place count 903 transition count 1776
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 8 with 156 rules applied. Total rules applied 1506 place count 825 transition count 1698
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1507 place count 824 transition count 1697
Iterating global reduction 8 with 1 rules applied. Total rules applied 1508 place count 824 transition count 1697
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1510 place count 824 transition count 1697
Applied a total of 1510 rules in 432 ms. Remains 824 /1623 variables (removed 799) and now considering 1697/2504 (removed 807) transitions.
// Phase 1: matrix 1697 rows 824 cols
[2025-05-30 10:51:58] [INFO ] Computed 123 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:58] [INFO ] Implicit Places using invariants in 569 ms returned [72, 89, 95, 100, 177, 183, 188, 191, 251, 268, 274, 279, 281, 341, 358, 364, 369, 371, 397, 432, 453, 461, 467, 469, 478, 531, 569, 578, 630, 647, 653, 658, 660, 720, 737, 743, 748, 750, 779, 821]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 571 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 784/1623 places, 1697/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 784 transition count 1688
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 775 transition count 1688
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 775 transition count 1684
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 771 transition count 1684
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 40 place count 757 transition count 1670
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 757 transition count 1670
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 68 place count 743 transition count 1656
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 743 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 736 transition count 1649
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 736 transition count 1649
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 146 place count 711 transition count 1624
Applied a total of 146 rules in 103 ms. Remains 711 /784 variables (removed 73) and now considering 1624/1697 (removed 73) transitions.
// Phase 1: matrix 1624 rows 711 cols
[2025-05-30 10:51:58] [INFO ] Computed 83 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:59] [INFO ] Implicit Places using invariants in 461 ms returned [479, 485, 490]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 463 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 708/1623 places, 1624/2504 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 706 transition count 1622
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 706 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 704 transition count 1620
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 704 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 703 transition count 1619
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 703 transition count 1619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 702 transition count 1618
Applied a total of 12 rules in 94 ms. Remains 702 /708 variables (removed 6) and now considering 1618/1624 (removed 6) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2025-05-30 10:51:59] [INFO ] Computed 80 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:51:59] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-05-30 10:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:52:01] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 702/1623 places, 1618/2504 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3561 ms. Remains : 702/1623 places, 1618/2504 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-13
Product exploration explored 100000 steps with 1326 reset in 239 ms.
Product exploration explored 100000 steps with 1280 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (511 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (85 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 358539 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 358539 steps, saw 65758 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-05-30 10:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1618/2320 variables, 702/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 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 10:52:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/702 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/702 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1618/2320 variables, 702/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2320 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 647 transition count 1555
Applied a total of 119 rules in 83 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (671 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (118 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 223997 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 223997 steps, saw 154019 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2025-05-30 10:52:10] [INFO ] Computed 80 invariants in 19 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11798 steps, including 988 resets, run visited all 1 properties in 28 ms. (steps per millisecond=421 )
Parikh walk visited 1 properties in 32 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2025-05-30 10:52:16] [INFO ] Computed 80 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:52:16] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-05-30 10:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:52:18] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:52:18] [INFO ] Redundant transitions in 39 ms returned []
Running 1572 sub problems to find dead transitions.
[2025-05-30 10:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
(s201 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62457 ms. Remains : 702/702 places, 1618/1618 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (489 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (85 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 357535 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 357535 steps, saw 65633 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-05-30 10:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 49/702 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/702 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1618/2320 variables, 702/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/2320 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2320/2320 variables, and 782 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/134 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/337 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/341 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 149/490 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/495 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 124/619 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/653 variables, 5/71 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 10:53:22] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/653 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 49/702 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/702 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1618/2320 variables, 702/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2320 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2320/2320 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 702 transition count 1586
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 670 transition count 1578
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 670 transition count 1555
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 647 transition count 1555
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 647 transition count 1555
Applied a total of 119 rules in 85 ms. Remains 647 /702 variables (removed 55) and now considering 1555/1618 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 647/702 places, 1555/1618 transitions.
RANDOM walk for 40000 steps (689 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (110 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 224316 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 224316 steps, saw 154249 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 1555 rows 647 cols
[2025-05-30 10:53:27] [INFO ] Computed 80 invariants in 21 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2202 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2202/2202 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/304 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/306 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/443 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/446 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 118/564 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/612 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/612 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 35/647 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1555/2202 variables, 647/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2202 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2202 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2202/2202 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5102ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12179 steps, including 994 resets, run visited all 1 properties in 28 ms. (steps per millisecond=434 )
Parikh walk visited 1 properties in 28 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1257 reset in 237 ms.
Product exploration explored 100000 steps with 1314 reset in 247 ms.
Built C files in :
/tmp/ltsmin16364072340052591720
[2025-05-30 10:53:33] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2025-05-30 10:53:33] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16364072340052591720
Running compilation step : cd /tmp/ltsmin16364072340052591720;'/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 2952 ms.
Running link step : cd /tmp/ltsmin16364072340052591720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16364072340052591720;'/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/stateBased12747454595418345629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1618/1618 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
// Phase 1: matrix 1618 rows 702 cols
[2025-05-30 10:53:48] [INFO ] Computed 80 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:53:48] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-05-30 10:53:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:53:50] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:53:50] [INFO ] Redundant transitions in 31 ms returned []
Running 1572 sub problems to find dead transitions.
[2025-05-30 10:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 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 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2320 variables, and 74 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 64/67 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62408 ms. Remains : 702/702 places, 1618/1618 transitions.
Built C files in :
/tmp/ltsmin18431593871430158138
[2025-05-30 10:54:50] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2025-05-30 10:54:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18431593871430158138
Running compilation step : cd /tmp/ltsmin18431593871430158138;'/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 2944 ms.
Running link step : cd /tmp/ltsmin18431593871430158138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18431593871430158138;'/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/stateBased6366322232523942130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 10:55:06] [INFO ] Flatten gal took : 47 ms
[2025-05-30 10:55:06] [INFO ] Flatten gal took : 45 ms
[2025-05-30 10:55:06] [INFO ] Time to serialize gal into /tmp/LTL10470851880466700902.gal : 11 ms
[2025-05-30 10:55:06] [INFO ] Time to serialize properties into /tmp/LTL14137376856623703696.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/LTL10470851880466700902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18168874919159675167.hoa' '-atoms' '/tmp/LTL14137376856623703696.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/LTL14137376856623703696.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18168874919159675167.hoa
Detected timeout of ITS tools.
[2025-05-30 10:55:21] [INFO ] Flatten gal took : 43 ms
[2025-05-30 10:55:21] [INFO ] Flatten gal took : 46 ms
[2025-05-30 10:55:21] [INFO ] Time to serialize gal into /tmp/LTL4940898098377696764.gal : 7 ms
[2025-05-30 10:55:21] [INFO ] Time to serialize properties into /tmp/LTL5189669966039919133.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/LTL4940898098377696764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5189669966039919133.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p267!=1)||(p286!=1))"))))
Formula 0 simplified : FG!"((p267!=1)||(p286!=1))"
Detected timeout of ITS tools.
[2025-05-30 10:55:36] [INFO ] Flatten gal took : 44 ms
[2025-05-30 10:55:36] [INFO ] Applying decomposition
[2025-05-30 10:55:36] [INFO ] Flatten gal took : 42 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/graph16627568957022353474.txt' '-o' '/tmp/graph16627568957022353474.bin' '-w' '/tmp/graph16627568957022353474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16627568957022353474.bin' '-l' '-1' '-v' '-w' '/tmp/graph16627568957022353474.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:55:36] [INFO ] Decomposing Gal with order
[2025-05-30 10:55:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:55:36] [INFO ] Removed a total of 3195 redundant transitions.
[2025-05-30 10:55:36] [INFO ] Flatten gal took : 80 ms
[2025-05-30 10:55:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 25 ms.
[2025-05-30 10:55:36] [INFO ] Time to serialize gal into /tmp/LTL17787130831163237733.gal : 10 ms
[2025-05-30 10:55:36] [INFO ] Time to serialize properties into /tmp/LTL4258382033354516451.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/LTL17787130831163237733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4258382033354516451.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u36.p267!=1)||(i4.u44.p286!=1))"))))
Formula 0 simplified : FG!"((i1.u36.p267!=1)||(i4.u44.p286!=1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLFireability-13 finished in 234066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 3 out of 1623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 298 rules applied. Total rules applied 298 place count 1622 transition count 2205
Reduce places removed 305 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 311 rules applied. Total rules applied 609 place count 1317 transition count 2199
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 616 place count 1311 transition count 2198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 1310 transition count 2198
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 227 Pre rules applied. Total rules applied 617 place count 1310 transition count 1971
Deduced a syphon composed of 227 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 523 rules applied. Total rules applied 1140 place count 1014 transition count 1971
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 4 with 42 rules applied. Total rules applied 1182 place count 995 transition count 1948
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1205 place count 972 transition count 1948
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1205 place count 972 transition count 1919
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1263 place count 943 transition count 1919
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1278 place count 928 transition count 1892
Iterating global reduction 6 with 15 rules applied. Total rules applied 1293 place count 928 transition count 1892
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
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 12 rules applied. Total rules applied 1305 place count 927 transition count 1881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1306 place count 926 transition count 1881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1306 place count 926 transition count 1880
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1308 place count 925 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1309 place count 924 transition count 1872
Iterating global reduction 8 with 1 rules applied. Total rules applied 1310 place count 924 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1311 place count 923 transition count 1864
Iterating global reduction 8 with 1 rules applied. Total rules applied 1312 place count 923 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1313 place count 922 transition count 1856
Iterating global reduction 8 with 1 rules applied. Total rules applied 1314 place count 922 transition count 1856
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1315 place count 921 transition count 1848
Iterating global reduction 8 with 1 rules applied. Total rules applied 1316 place count 921 transition count 1848
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1317 place count 920 transition count 1840
Iterating global reduction 8 with 1 rules applied. Total rules applied 1318 place count 920 transition count 1840
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1319 place count 919 transition count 1832
Iterating global reduction 8 with 1 rules applied. Total rules applied 1320 place count 919 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1321 place count 918 transition count 1824
Iterating global reduction 8 with 1 rules applied. Total rules applied 1322 place count 918 transition count 1824
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1323 place count 917 transition count 1816
Iterating global reduction 8 with 1 rules applied. Total rules applied 1324 place count 917 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1325 place count 916 transition count 1808
Iterating global reduction 8 with 1 rules applied. Total rules applied 1326 place count 916 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1327 place count 915 transition count 1800
Iterating global reduction 8 with 1 rules applied. Total rules applied 1328 place count 915 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1329 place count 914 transition count 1792
Iterating global reduction 8 with 1 rules applied. Total rules applied 1330 place count 914 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1331 place count 913 transition count 1784
Iterating global reduction 8 with 1 rules applied. Total rules applied 1332 place count 913 transition count 1784
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 8 with 160 rules applied. Total rules applied 1492 place count 833 transition count 1704
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1493 place count 832 transition count 1703
Iterating global reduction 8 with 1 rules applied. Total rules applied 1494 place count 832 transition count 1703
Applied a total of 1494 rules in 405 ms. Remains 832 /1623 variables (removed 791) and now considering 1703/2504 (removed 801) transitions.
// Phase 1: matrix 1703 rows 832 cols
[2025-05-30 10:55:52] [INFO ] Computed 125 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:52] [INFO ] Implicit Places using invariants in 567 ms returned [72, 89, 95, 100, 178, 184, 189, 259, 276, 282, 287, 289, 349, 366, 372, 377, 379, 405, 440, 461, 469, 475, 477, 486, 539, 577, 586, 638, 655, 661, 666, 668, 728, 745, 751, 756, 758, 787, 829]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 569 ms to find 39 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 793/1623 places, 1703/2504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 793 transition count 1694
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 784 transition count 1694
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 784 transition count 1690
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 780 transition count 1690
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 40 place count 766 transition count 1676
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 766 transition count 1676
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 68 place count 752 transition count 1662
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 752 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 745 transition count 1655
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 745 transition count 1655
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 146 place count 720 transition count 1630
Applied a total of 146 rules in 100 ms. Remains 720 /793 variables (removed 73) and now considering 1630/1703 (removed 73) transitions.
// Phase 1: matrix 1630 rows 720 cols
[2025-05-30 10:55:52] [INFO ] Computed 86 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:53] [INFO ] Implicit Places using invariants in 464 ms returned [488, 494, 499]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 466 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 717/1623 places, 1630/2504 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 715 transition count 1628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 715 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 713 transition count 1626
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 713 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 712 transition count 1625
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 712 transition count 1625
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 711 transition count 1624
Applied a total of 12 rules in 86 ms. Remains 711 /717 variables (removed 6) and now considering 1624/1630 (removed 6) transitions.
// Phase 1: matrix 1624 rows 711 cols
[2025-05-30 10:55:53] [INFO ] Computed 83 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:53] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-05-30 10:55:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:55:55] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 711/1623 places, 1624/2504 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3445 ms. Remains : 711/1623 places, 1624/2504 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-14
Product exploration explored 100000 steps with 1260 reset in 248 ms.
Product exploration explored 100000 steps with 1296 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (486 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351612 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351612 steps, saw 65051 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2025-05-30 10:55:59] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/245 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/250 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/424 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/433 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 193/626 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/660 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/711 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1624/2335 variables, 711/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2335 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2335 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2335/2335 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 711/711 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/245 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/250 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/424 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/433 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 193/626 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/660 variables, 5/73 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 10:56:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/660 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 51/711 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1624/2335 variables, 711/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2335 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2335 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2335 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2335/2335 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 711/711 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1624/1624 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 711 transition count 1592
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 71 place count 679 transition count 1585
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 96 place count 679 transition count 1560
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 123 place count 653 transition count 1559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 123 place count 653 transition count 1558
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 651 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 650 transition count 1557
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 650 transition count 1557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 650 transition count 1556
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 650 transition count 1556
Applied a total of 130 rules in 104 ms. Remains 650 /711 variables (removed 61) and now considering 1556/1624 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 650/711 places, 1556/1624 transitions.
RANDOM walk for 40000 steps (680 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (111 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 219385 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 219385 steps, saw 150715 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1556 rows 650 cols
[2025-05-30 10:56:04] [INFO ] Computed 81 invariants in 13 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/118 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/236 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/238 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/378 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/383 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/536 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/562 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 54/616 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/634 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/650 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/650 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1556/2206 variables, 650/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2206 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2206 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2206/2206 variables, and 731 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 650/650 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/118 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/236 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/238 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/378 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/383 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/536 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/562 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 54/616 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/634 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/650 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/650 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1556/2206 variables, 650/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2206 variables, 1/732 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 10:56:05] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 19 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2206 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2206 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2206 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2206/2206 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 650/650 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1556/1556 transitions.
Applied a total of 0 rules in 21 ms. Remains 650 /650 variables (removed 0) and now considering 1556/1556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 650/650 places, 1556/1556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1556/1556 transitions.
Applied a total of 0 rules in 20 ms. Remains 650 /650 variables (removed 0) and now considering 1556/1556 (removed 0) transitions.
[2025-05-30 10:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:06] [INFO ] Implicit Places using invariants in 438 ms returned [143, 166, 167, 237, 238, 308, 309, 379, 380, 450, 451, 521, 522]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 439 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/650 places, 1556/1556 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 636 transition count 1555
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 636 transition count 1554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 635 transition count 1554
Applied a total of 4 rules in 54 ms. Remains 635 /637 variables (removed 2) and now considering 1554/1556 (removed 2) transitions.
// Phase 1: matrix 1554 rows 635 cols
[2025-05-30 10:56:06] [INFO ] Computed 68 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:06] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-05-30 10:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:08] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 635/650 places, 1554/1556 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2222 ms. Remains : 635/650 places, 1554/1556 transitions.
RANDOM walk for 40000 steps (671 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (115 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231687 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 231687 steps, saw 159547 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2025-05-30 10:56:11] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/173 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/313 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/315 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/449 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/453 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/552 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/600 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/600 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/635 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1554/2189 variables, 635/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2189 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2189 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 635/635 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/173 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/313 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/315 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/449 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/453 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/552 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/600 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/600 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/635 variables, 9/68 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 10:56:12] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/635 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1554/2189 variables, 635/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2189 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2189 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2189 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 3 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1554/1554 transitions.
Applied a total of 0 rules in 20 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 635/635 places, 1554/1554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1554/1554 transitions.
Applied a total of 0 rules in 19 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
[2025-05-30 10:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:13] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-30 10:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:56:14] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:56:15] [INFO ] Redundant transitions in 29 ms returned []
Running 1516 sub problems to find dead transitions.
[2025-05-30 10:56:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1516 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 634/2189 variables, and 64 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 54/55 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/2189 variables, and 64 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 54/55 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62231 ms. Remains : 635/635 places, 1554/1554 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 10:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:57:15] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:57:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-30 10:57:15] [INFO ] [Nat]Absence check using 13 positive and 55 generalized place invariants in 19 ms returned sat
[2025-05-30 10:57:16] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 10:57:16] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 10:57:16] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 797 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Support contains 3 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1624/1624 transitions.
Applied a total of 0 rules in 26 ms. Remains 711 /711 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
// Phase 1: matrix 1624 rows 711 cols
[2025-05-30 10:57:16] [INFO ] Computed 83 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:57:16] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-30 10:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:57:18] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:57:18] [INFO ] Redundant transitions in 33 ms returned []
Running 1578 sub problems to find dead transitions.
[2025-05-30 10:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/2335 variables, and 77 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 66/69 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/2335 variables, and 77 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 66/69 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62412 ms. Remains : 711/711 places, 1624/1624 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (501 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346718 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346718 steps, saw 64606 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-05-30 10:58:22] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/245 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/250 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/424 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/433 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 193/626 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/660 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 51/711 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1624/2335 variables, 711/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2335 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2335 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2335/2335 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 711/711 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/245 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/250 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 174/424 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/433 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 193/626 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 34/660 variables, 5/73 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 10:58:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/660 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/660 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 51/711 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1624/2335 variables, 711/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2335 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2335 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2335 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2335/2335 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 711/711 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 3 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1624/1624 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 711 transition count 1592
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 71 place count 679 transition count 1585
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 96 place count 679 transition count 1560
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 123 place count 653 transition count 1559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 123 place count 653 transition count 1558
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 651 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 650 transition count 1557
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 650 transition count 1557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 650 transition count 1556
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 650 transition count 1556
Applied a total of 130 rules in 108 ms. Remains 650 /711 variables (removed 61) and now considering 1556/1624 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 650/711 places, 1556/1624 transitions.
RANDOM walk for 40000 steps (655 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (111 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 221313 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 221313 steps, saw 152100 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1556 rows 650 cols
[2025-05-30 10:58:27] [INFO ] Computed 81 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/118 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/236 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/238 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/378 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/383 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/536 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/562 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 54/616 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/634 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/650 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/650 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1556/2206 variables, 650/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2206 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2206 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2206/2206 variables, and 731 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 650/650 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/118 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/236 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/238 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/378 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/383 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 153/536 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/562 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/562 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 54/616 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/634 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/634 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/650 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/650 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1556/2206 variables, 650/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2206 variables, 1/732 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 10:58:28] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 20 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2206 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2206 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2206 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2206/2206 variables, and 733 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 650/650 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1556/1556 transitions.
Applied a total of 0 rules in 20 ms. Remains 650 /650 variables (removed 0) and now considering 1556/1556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 650/650 places, 1556/1556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1556/1556 transitions.
Applied a total of 0 rules in 30 ms. Remains 650 /650 variables (removed 0) and now considering 1556/1556 (removed 0) transitions.
[2025-05-30 10:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:29] [INFO ] Implicit Places using invariants in 458 ms returned [143, 166, 167, 237, 238, 308, 309, 379, 380, 450, 451, 521, 522]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 459 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 637/650 places, 1556/1556 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 636 transition count 1555
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 636 transition count 1554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 635 transition count 1554
Applied a total of 4 rules in 56 ms. Remains 635 /637 variables (removed 2) and now considering 1554/1556 (removed 2) transitions.
// Phase 1: matrix 1554 rows 635 cols
[2025-05-30 10:58:29] [INFO ] Computed 68 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:30] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-05-30 10:58:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:31] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 635/650 places, 1554/1556 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2334 ms. Remains : 635/650 places, 1554/1556 transitions.
RANDOM walk for 40000 steps (675 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (109 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226912 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 226912 steps, saw 156115 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2025-05-30 10:58: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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/173 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/313 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/315 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/449 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/453 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/552 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/600 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/600 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/635 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1554/2189 variables, 635/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2189 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2189 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2189/2189 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 635/635 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/173 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 138/313 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/315 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 134/449 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/453 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 99/552 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 48/600 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/600 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/635 variables, 9/68 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 10:58:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/635 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/635 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1554/2189 variables, 635/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2189 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2189 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2189 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2189/2189 variables, and 705 constraints, problems are : Problem set: 0 solved, 1 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1892ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 3 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1554/1554 transitions.
Applied a total of 0 rules in 20 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 635/635 places, 1554/1554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1554/1554 transitions.
Applied a total of 0 rules in 19 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
[2025-05-30 10:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:37] [INFO ] Implicit Places using invariants in 404 ms returned []
[2025-05-30 10:58:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:58:38] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:58:38] [INFO ] Redundant transitions in 30 ms returned []
Running 1516 sub problems to find dead transitions.
[2025-05-30 10:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/2189 variables, and 64 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 54/55 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/634 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/2189 variables, and 64 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 54/55 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60507ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62303 ms. Remains : 635/635 places, 1554/1554 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 635 /635 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 10:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:59:39] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 10:59:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-30 10:59:39] [INFO ] [Nat]Absence check using 13 positive and 55 generalized place invariants in 20 ms returned sat
[2025-05-30 10:59:39] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 10:59:39] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 10:59:39] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 833 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1301 reset in 250 ms.
Product exploration explored 100000 steps with 1230 reset in 262 ms.
Built C files in :
/tmp/ltsmin11199090360012502203
[2025-05-30 10:59:40] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2025-05-30 10:59:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11199090360012502203
Running compilation step : cd /tmp/ltsmin11199090360012502203;'/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/ltsmin11199090360012502203;'/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/ltsmin11199090360012502203;'/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 3 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1624/1624 transitions.
Applied a total of 0 rules in 27 ms. Remains 711 /711 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
// Phase 1: matrix 1624 rows 711 cols
[2025-05-30 10:59:43] [INFO ] Computed 83 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:59:44] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-05-30 10:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:59:45] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:59:45] [INFO ] Redundant transitions in 33 ms returned []
Running 1578 sub problems to find dead transitions.
[2025-05-30 10:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/2335 variables, and 77 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 66/69 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 1578/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 1578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/2335 variables, and 77 constraints, problems are : Problem set: 0 solved, 1578 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 66/69 constraints, State Equation: 0/711 constraints, PredecessorRefiner: 0/1578 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1578 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62431 ms. Remains : 711/711 places, 1624/1624 transitions.
Built C files in :
/tmp/ltsmin17487941151603024082
[2025-05-30 11:00:46] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2025-05-30 11:00:46] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17487941151603024082
Running compilation step : cd /tmp/ltsmin17487941151603024082;'/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 2995 ms.
Running link step : cd /tmp/ltsmin17487941151603024082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17487941151603024082;'/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/stateBased7328058632257875764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 11:01:01] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:01:01] [INFO ] Flatten gal took : 42 ms
[2025-05-30 11:01:01] [INFO ] Time to serialize gal into /tmp/LTL14271807041193740141.gal : 7 ms
[2025-05-30 11:01:01] [INFO ] Time to serialize properties into /tmp/LTL4879518431253335501.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/LTL14271807041193740141.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8738406594103737805.hoa' '-atoms' '/tmp/LTL4879518431253335501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4879518431253335501.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8738406594103737805.hoa
Detected timeout of ITS tools.
[2025-05-30 11:01:16] [INFO ] Flatten gal took : 42 ms
[2025-05-30 11:01:16] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:01:16] [INFO ] Time to serialize gal into /tmp/LTL4304995926216319479.gal : 7 ms
[2025-05-30 11:01:16] [INFO ] Time to serialize properties into /tmp/LTL14135306735594633060.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/LTL4304995926216319479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14135306735594633060.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("(((p212==0)||(p400==0))||(p403==0))")))
Formula 0 simplified : F!"(((p212==0)||(p400==0))||(p403==0))"
Detected timeout of ITS tools.
[2025-05-30 11:01:31] [INFO ] Flatten gal took : 40 ms
[2025-05-30 11:01:31] [INFO ] Applying decomposition
[2025-05-30 11:01:31] [INFO ] Flatten gal took : 40 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/graph12350213208366607948.txt' '-o' '/tmp/graph12350213208366607948.bin' '-w' '/tmp/graph12350213208366607948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12350213208366607948.bin' '-l' '-1' '-v' '-w' '/tmp/graph12350213208366607948.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:01:31] [INFO ] Decomposing Gal with order
[2025-05-30 11:01:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:01:31] [INFO ] Removed a total of 3206 redundant transitions.
[2025-05-30 11:01:31] [INFO ] Flatten gal took : 70 ms
[2025-05-30 11:01:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 21 ms.
[2025-05-30 11:01:31] [INFO ] Time to serialize gal into /tmp/LTL6236075604947047858.gal : 10 ms
[2025-05-30 11:01:31] [INFO ] Time to serialize properties into /tmp/LTL7430819146801857642.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/LTL6236075604947047858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7430819146801857642.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("(((i1.u25.p212==0)||(i1.u25.p400==0))||(i1.u25.p403==0))")))
Formula 0 simplified : F!"(((i1.u25.p212==0)||(i1.u25.p400==0))||(i1.u25.p403==0))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLFireability-14 finished in 355000 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(X(X(p0)))))'
Support contains 1 out of 1623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1623/1623 places, 2504/2504 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1620 transition count 2489
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1620 transition count 2489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1618 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1618 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1617 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1617 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1616 transition count 2464
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1616 transition count 2464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1615 transition count 2456
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1615 transition count 2456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1614 transition count 2448
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1614 transition count 2448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1613 transition count 2440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1613 transition count 2440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1612 transition count 2432
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1612 transition count 2432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1611 transition count 2424
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1611 transition count 2424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1610 transition count 2416
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1610 transition count 2416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1609 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1609 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1608 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1608 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1607 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1607 transition count 2392
Applied a total of 32 rules in 630 ms. Remains 1607 /1623 variables (removed 16) and now considering 2392/2504 (removed 112) transitions.
// Phase 1: matrix 2392 rows 1607 cols
[2025-05-30 11:01:47] [INFO ] Computed 221 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:01:48] [INFO ] Implicit Places using invariants in 944 ms returned [770, 935, 1117, 1497]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 946 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1623 places, 2392/2504 transitions.
Applied a total of 0 rules in 48 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1624 ms. Remains : 1603/1623 places, 2392/2504 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLFireability-15 finished in 1847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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' '!(G(p0))'
[2025-05-30 11:01:49] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin592441261704207009
[2025-05-30 11:01:49] [INFO ] Too many transitions (2504) to apply POR reductions. Disabling POR matrices.
[2025-05-30 11:01:49] [INFO ] Applying decomposition
[2025-05-30 11:01:49] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin592441261704207009
Running compilation step : cd /tmp/ltsmin592441261704207009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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 11:01:49] [INFO ] Flatten gal took : 58 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/graph7662851483813337338.txt' '-o' '/tmp/graph7662851483813337338.bin' '-w' '/tmp/graph7662851483813337338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7662851483813337338.bin' '-l' '-1' '-v' '-w' '/tmp/graph7662851483813337338.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:01:49] [INFO ] Decomposing Gal with order
[2025-05-30 11:01:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:01:49] [INFO ] Removed a total of 3474 redundant transitions.
[2025-05-30 11:01:49] [INFO ] Flatten gal took : 102 ms
[2025-05-30 11:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 31 ms.
[2025-05-30 11:01:49] [INFO ] Time to serialize gal into /tmp/LTLFireability7733544098914057000.gal : 13 ms
[2025-05-30 11:01:49] [INFO ] Time to serialize properties into /tmp/LTLFireability8134602640941424008.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/LTLFireability7733544098914057000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8134602640941424008.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...276
Read 3 LTL properties
Checking formula 0 : !(((G("((i12.u287.p1010==0)||(i12.u287.p1081==0))"))&&(F("(((i17.u463.p1629!=1)||(i17.u467.p1726!=1))||((i4.u66.p236==1)&&(i4.u133.p47...167
Formula 0 simplified : F!"((i12.u287.p1010==0)||(i12.u287.p1081==0))" | G!"(((i17.u463.p1629!=1)||(i17.u467.p1726!=1))||((i4.u66.p236==1)&&(i4.u133.p475==1...159
Compilation finished in 5378 ms.
Running link step : cd /tmp/ltsmin592441261704207009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin592441261704207009;'/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))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin592441261704207009;'/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))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin592441261704207009;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin592441261704207009;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin592441261704207009;'/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' '[]((LTLAPp3==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin592441261704207009;'/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' '[]((LTLAPp3==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin592441261704207009;'/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))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 11:28:16] [INFO ] Applying decomposition
[2025-05-30 11:28:16] [INFO ] Flatten gal took : 115 ms
[2025-05-30 11:28:16] [INFO ] Decomposing Gal with order
[2025-05-30 11:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:28:17] [INFO ] Removed a total of 2879 redundant transitions.
[2025-05-30 11:28:17] [INFO ] Flatten gal took : 316 ms
[2025-05-30 11:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1044 labels/synchronizations in 95 ms.
[2025-05-30 11:28:17] [INFO ] Time to serialize gal into /tmp/LTLFireability11265649116258929490.gal : 26 ms
[2025-05-30 11:28:17] [INFO ] Time to serialize properties into /tmp/LTLFireability10870745841795851605.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/LTLFireability11265649116258929490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10870745841795851605.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 3 LTL properties
Checking formula 0 : !(((G("((u179.p1010==0)||(i45.i1.u344.p1081==0))"))&&(F("(((u285.p1629!=1)||(i69.u304.p1726!=1))||((u39.p236==1)&&(u76.p475==1)))"))))
Formula 0 simplified : F!"((u179.p1010==0)||(i45.i1.u344.p1081==0))" | G!"(((u285.p1629!=1)||(i69.u304.p1726!=1))||((u39.p236==1)&&(u76.p475==1)))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-08a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;