Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 669K 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-04b-LTLCardinality-00
FORMULA_NAME ASLink-PT-04b-LTLCardinality-01
FORMULA_NAME ASLink-PT-04b-LTLCardinality-02
FORMULA_NAME ASLink-PT-04b-LTLCardinality-03
FORMULA_NAME ASLink-PT-04b-LTLCardinality-04
FORMULA_NAME ASLink-PT-04b-LTLCardinality-05
FORMULA_NAME ASLink-PT-04b-LTLCardinality-06
FORMULA_NAME ASLink-PT-04b-LTLCardinality-07
FORMULA_NAME ASLink-PT-04b-LTLCardinality-08
FORMULA_NAME ASLink-PT-04b-LTLCardinality-09
FORMULA_NAME ASLink-PT-04b-LTLCardinality-10
FORMULA_NAME ASLink-PT-04b-LTLCardinality-11
FORMULA_NAME ASLink-PT-04b-LTLCardinality-12
FORMULA_NAME ASLink-PT-04b-LTLCardinality-13
FORMULA_NAME ASLink-PT-04b-LTLCardinality-14
FORMULA_NAME ASLink-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748579122899

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 04:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 04:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 04:25:24] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-30 04:25:24] [INFO ] Transformed 2034 places.
[2025-05-30 04:25:24] [INFO ] Transformed 2567 transitions.
[2025-05-30 04:25:24] [INFO ] Found NUPN structural information;
[2025-05-30 04:25:24] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-04b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 1913 transition count 2446
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 1913 transition count 2446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 243 place count 1913 transition count 2445
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 289 place count 1867 transition count 2371
Iterating global reduction 1 with 46 rules applied. Total rules applied 335 place count 1867 transition count 2371
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 349 place count 1867 transition count 2357
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 357 place count 1859 transition count 2349
Iterating global reduction 2 with 8 rules applied. Total rules applied 365 place count 1859 transition count 2349
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 369 place count 1855 transition count 2338
Iterating global reduction 2 with 4 rules applied. Total rules applied 373 place count 1855 transition count 2338
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 376 place count 1852 transition count 2335
Iterating global reduction 2 with 3 rules applied. Total rules applied 379 place count 1852 transition count 2335
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 382 place count 1849 transition count 2325
Iterating global reduction 2 with 3 rules applied. Total rules applied 385 place count 1849 transition count 2325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 386 place count 1848 transition count 2317
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 place count 1848 transition count 2317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 388 place count 1847 transition count 2316
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 1847 transition count 2316
Applied a total of 389 rules in 1385 ms. Remains 1847 /2034 variables (removed 187) and now considering 2316/2567 (removed 251) transitions.
// Phase 1: matrix 2316 rows 1847 cols
[2025-05-30 04:25:26] [INFO ] Computed 199 invariants in 110 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:27] [INFO ] Implicit Places using invariants in 1517 ms returned [1681, 1692, 1703, 1711, 1719, 1727, 1735, 1746, 1754, 1762, 1773]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1557 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1836/2034 places, 2316/2567 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1823 transition count 2303
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1823 transition count 2303
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 1812 transition count 2292
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 1812 transition count 2292
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 1803 transition count 2283
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 1803 transition count 2283
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1799 transition count 2279
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1799 transition count 2279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1797 transition count 2277
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1797 transition count 2277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1796 transition count 2276
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1796 transition count 2276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1795 transition count 2275
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1795 transition count 2275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1794 transition count 2274
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1794 transition count 2274
Applied a total of 84 rules in 714 ms. Remains 1794 /1836 variables (removed 42) and now considering 2274/2316 (removed 42) transitions.
// Phase 1: matrix 2274 rows 1794 cols
[2025-05-30 04:25:28] [INFO ] Computed 188 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:29] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2025-05-30 04:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:34] [INFO ] Implicit Places using invariants and state equation in 5490 ms returned []
Implicit Place search using SMT with State Equation took 6509 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1794/2034 places, 2274/2567 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10181 ms. Remains : 1794/2034 places, 2274/2567 transitions.
Support contains 37 out of 1794 places after structural reductions.
[2025-05-30 04:25:35] [INFO ] Flatten gal took : 170 ms
[2025-05-30 04:25:35] [INFO ] Flatten gal took : 117 ms
[2025-05-30 04:25:35] [INFO ] Input system was already deterministic with 2274 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 40000 steps (99 resets) in 1375 ms. (29 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40004 steps (13 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
[2025-05-30 04:25:36] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 491/707 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/707 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1053/1760 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 34/1794 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1794 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2274/4068 variables, 1794/1982 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:38] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:38] [INFO ] Deduced a trap composed of 39 places in 359 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:38] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:39] [INFO ] Deduced a trap composed of 68 places in 356 ms of which 61 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4068 variables, 4/1986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4068 variables, 0/1986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/4068 variables, 0/1986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4068/4068 variables, and 1986 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3997 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 1794/1794 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 491/707 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/707 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1053/1760 variables, 129/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1760 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:41] [INFO ] Deduced a trap composed of 16 places in 564 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:41] [INFO ] Deduced a trap composed of 22 places in 531 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:42] [INFO ] Deduced a trap composed of 26 places in 558 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:42] [INFO ] Deduced a trap composed of 42 places in 636 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:43] [INFO ] Deduced a trap composed of 44 places in 621 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:44] [INFO ] Deduced a trap composed of 52 places in 620 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:44] [INFO ] Deduced a trap composed of 59 places in 601 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:25:45] [INFO ] Deduced a trap composed of 84 places in 518 ms of which 132 ms to minimize.
SMT process timed out in 9258ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1794 transition count 1948
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 657 place count 1468 transition count 1943
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 660 place count 1465 transition count 1943
Performed 479 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 479 Pre rules applied. Total rules applied 660 place count 1465 transition count 1464
Deduced a syphon composed of 479 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 523 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 1662 place count 942 transition count 1464
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1694 place count 938 transition count 1436
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1722 place count 910 transition count 1436
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1722 place count 910 transition count 1421
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 45 rules applied. Total rules applied 1767 place count 880 transition count 1421
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 1767 place count 880 transition count 1407
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1795 place count 866 transition count 1407
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1801 place count 860 transition count 1394
Iterating global reduction 5 with 6 rules applied. Total rules applied 1807 place count 860 transition count 1394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1807 place count 860 transition count 1391
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1813 place count 857 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1815 place count 855 transition count 1382
Iterating global reduction 5 with 2 rules applied. Total rules applied 1817 place count 855 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1819 place count 853 transition count 1373
Iterating global reduction 5 with 2 rules applied. Total rules applied 1821 place count 853 transition count 1373
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1823 place count 851 transition count 1364
Iterating global reduction 5 with 2 rules applied. Total rules applied 1825 place count 851 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1826 place count 850 transition count 1356
Iterating global reduction 5 with 1 rules applied. Total rules applied 1827 place count 850 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1828 place count 849 transition count 1348
Iterating global reduction 5 with 1 rules applied. Total rules applied 1829 place count 849 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1830 place count 848 transition count 1340
Iterating global reduction 5 with 1 rules applied. Total rules applied 1831 place count 848 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1832 place count 847 transition count 1332
Iterating global reduction 5 with 1 rules applied. Total rules applied 1833 place count 847 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1834 place count 846 transition count 1324
Iterating global reduction 5 with 1 rules applied. Total rules applied 1835 place count 846 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1836 place count 845 transition count 1316
Iterating global reduction 5 with 1 rules applied. Total rules applied 1837 place count 845 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1838 place count 844 transition count 1308
Iterating global reduction 5 with 1 rules applied. Total rules applied 1839 place count 844 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1840 place count 843 transition count 1300
Iterating global reduction 5 with 1 rules applied. Total rules applied 1841 place count 843 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1842 place count 842 transition count 1292
Iterating global reduction 5 with 1 rules applied. Total rules applied 1843 place count 842 transition count 1292
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2129 place count 698 transition count 1150
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2133 place count 694 transition count 1146
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2138 place count 693 transition count 1146
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 1 rules applied. Total rules applied 2139 place count 693 transition count 1145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2140 place count 692 transition count 1145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2140 place count 692 transition count 1144
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 2142 place count 691 transition count 1144
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2144 place count 689 transition count 1142
Iterating global reduction 7 with 2 rules applied. Total rules applied 2146 place count 689 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2148 place count 689 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2149 place count 688 transition count 1140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2151 place count 687 transition count 1145
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2156 place count 687 transition count 1140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2161 place count 682 transition count 1140
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2164 place count 682 transition count 1137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2167 place count 679 transition count 1137
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 2171 place count 679 transition count 1137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2172 place count 678 transition count 1136
Reduce places removed 8 places and 0 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 11 with 12 rules applied. Total rules applied 2184 place count 670 transition count 1132
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2188 place count 666 transition count 1132
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 12 Pre rules applied. Total rules applied 2188 place count 666 transition count 1120
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 25 rules applied. Total rules applied 2213 place count 653 transition count 1120
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2218 place count 648 transition count 1120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2218 place count 648 transition count 1119
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2220 place count 647 transition count 1119
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2238 place count 638 transition count 1110
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2242 place count 634 transition count 1106
Iterating global reduction 14 with 4 rules applied. Total rules applied 2246 place count 634 transition count 1106
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2250 place count 634 transition count 1102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2254 place count 630 transition count 1102
Applied a total of 2254 rules in 932 ms. Remains 630 /1794 variables (removed 1164) and now considering 1102/2274 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 932 ms. Remains : 630/1794 places, 1102/2274 transitions.
RANDOM walk for 40000 steps (515 resets) in 372 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (111 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (112 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (113 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 473083 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 3
Probabilistic random walk after 473083 steps, saw 90926 distinct states, run finished after 3006 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 1102 rows 630 cols
[2025-05-30 04:25:49] [INFO ] Computed 108 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 116/129 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/165 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/167 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 132/299 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/347 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/350 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 178/528 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 32/560 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/564 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 64/628 variables, 17/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/630 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1102/1732 variables, 630/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1732 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1732 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1732/1732 variables, and 738 constraints, problems are : Problem set: 0 solved, 3 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 116/129 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/165 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/167 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 132/299 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 48/347 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/350 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 178/528 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 32/560 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/564 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 64/628 variables, 17/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/628 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/630 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1102/1732 variables, 630/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1732 variables, 3/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1732 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1732 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1732/1732 variables, and 741 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4333 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 77/77 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5171ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2648 ms.
Support contains 5 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1102/1102 transitions.
Applied a total of 0 rules in 23 ms. Remains 630 /630 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 630/630 places, 1102/1102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1102/1102 transitions.
Applied a total of 0 rules in 23 ms. Remains 630 /630 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
[2025-05-30 04:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:57] [INFO ] Implicit Places using invariants in 476 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 240, 260, 264, 265, 276, 277, 279, 296, 314, 383, 387, 388, 399, 400, 402, 419, 437, 489, 509, 513, 514, 517, 528, 529, 530, 548, 569, 570, 571, 572]
[2025-05-30 04:25:57] [INFO ] Actually due to overlaps returned [548, 530, 48, 169, 296, 419, 31, 152, 279, 402, 149, 276, 399, 528, 569, 150, 277, 400, 529, 570, 1, 18, 264, 265, 387, 388, 513, 514, 66, 187, 314, 437, 571, 19, 517, 572]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 480 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 594/630 places, 1102/1102 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 588 transition count 1030
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 81 rules applied. Total rules applied 159 place count 516 transition count 1021
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 164 place count 511 transition count 1021
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 164 place count 511 transition count 998
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 211 place count 487 transition count 998
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 223 place count 483 transition count 990
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 231 place count 475 transition count 990
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 234 place count 472 transition count 987
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 472 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 240 place count 472 transition count 984
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 300 place count 442 transition count 954
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 304 place count 438 transition count 950
Iterating global reduction 6 with 4 rules applied. Total rules applied 308 place count 438 transition count 950
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 312 place count 438 transition count 946
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 316 place count 436 transition count 947
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 324 place count 436 transition count 939
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 333 place count 427 transition count 939
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 344 place count 427 transition count 939
Applied a total of 344 rules in 130 ms. Remains 427 /594 variables (removed 167) and now considering 939/1102 (removed 163) transitions.
// Phase 1: matrix 939 rows 427 cols
[2025-05-30 04:25:58] [INFO ] Computed 60 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:58] [INFO ] Implicit Places using invariants in 322 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 160, 184, 187, 189, 194, 195, 248, 264, 270, 273, 275, 280, 281, 334, 358, 361, 363]
[2025-05-30 04:25:58] [INFO ] Actually due to overlaps returned [105, 194, 280, 106, 195, 281, 96, 101, 184, 189, 264, 270, 275, 358, 363, 73, 90, 102, 160, 248, 334]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 324 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 406/630 places, 939/1102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 406 transition count 938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 405 transition count 938
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 394 transition count 927
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 394 transition count 927
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 393 transition count 926
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 393 transition count 926
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 386 transition count 919
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 386 transition count 909
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 60 place count 376 transition count 909
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 376 transition count 905
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 372 transition count 905
Applied a total of 68 rules in 64 ms. Remains 372 /406 variables (removed 34) and now considering 905/939 (removed 34) transitions.
// Phase 1: matrix 905 rows 372 cols
[2025-05-30 04:25:58] [INFO ] Computed 39 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:58] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 04:25:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:25:59] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 372/630 places, 905/1102 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1949 ms. Remains : 372/630 places, 905/1102 transitions.
RANDOM walk for 40000 steps (753 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (179 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (191 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (196 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 541953 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :1 out of 3
Probabilistic random walk after 541953 steps, saw 136457 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :1
[2025-05-30 04:26:02] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 213/252 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/283 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 89/372 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 905/1277 variables, 372/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1277 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1277 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1277/1277 variables, and 411 constraints, problems are : Problem set: 0 solved, 2 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 213/252 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/283 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 89/372 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 905/1277 variables, 372/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1277 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:26:04] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1277 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1277 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1277 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1277/1277 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2610ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 404 ms.
Support contains 4 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 905/905 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 371 transition count 904
Applied a total of 2 rules in 18 ms. Remains 371 /372 variables (removed 1) and now considering 904/905 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 371/372 places, 904/905 transitions.
RANDOM walk for 40000 steps (723 resets) in 127 ms. (312 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (170 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
// Phase 1: matrix 904 rows 371 cols
[2025-05-30 04:26:05] [INFO ] Computed 39 invariants in 6 ms
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) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/153 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/165 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/178 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/212 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 126/338 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/360 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/371 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 904/1275 variables, 371/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1275 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1275 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1275/1275 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 371/371 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) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 116/153 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/165 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/178 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/212 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 126/338 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/360 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/371 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 904/1275 variables, 371/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1275 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1275 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1275 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1835ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14951 steps, including 1041 resets, run visited all 1 properties in 28 ms. (steps per millisecond=533 )
Parikh walk visited 1 properties in 32 ms.
FORMULA ASLink-PT-04b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 73 stabilizing places and 73 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(!p0))&&F(p1))||G(F(!p0)))))'
Support contains 3 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1787 transition count 2260
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1787 transition count 2260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1787 transition count 2259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 1784 transition count 2249
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 1784 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1782 transition count 2247
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1782 transition count 2247
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1780 transition count 2238
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1780 transition count 2238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1778 transition count 2229
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1778 transition count 2229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1776 transition count 2227
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1776 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1774 transition count 2218
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1774 transition count 2218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1772 transition count 2209
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2208
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2200
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2191
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2183
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2174
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2166
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1762 transition count 2157
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1762 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1761 transition count 2149
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1761 transition count 2149
Applied a total of 67 rules in 1389 ms. Remains 1761 /1794 variables (removed 33) and now considering 2149/2274 (removed 125) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2025-05-30 04:26:09] [INFO ] Computed 188 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:26:10] [INFO ] Implicit Places using invariants in 934 ms returned []
[2025-05-30 04:26:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:26:14] [INFO ] Implicit Places using invariants and state equation in 4186 ms returned []
Implicit Place search using SMT with State Equation took 5122 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2025-05-30 04:26:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
(s492 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 13)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 3)
(s48 6)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 18)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 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 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 23)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 0)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 0)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 0)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 4)
(s361 1)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 13)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 13)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 10)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 4)
(s413 1)
(s414 93)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 0)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 1)
(s465 0)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 0)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 0)
(s486 1)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 1timeout
)
(s493 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60753ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1794 places, 2149/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67294 ms. Remains : 1761/1794 places, 2149/2274 transitions.
Stuttering acceptance computed with spot in 305 ms :[p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-00
Stuttering criterion allowed to conclude after 9651 steps with 57 reset in 65 ms.
FORMULA ASLink-PT-04b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-00 finished in 67738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1794 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1793 transition count 1949
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 329 rules applied. Total rules applied 653 place count 1469 transition count 1944
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 656 place count 1466 transition count 1944
Performed 479 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 479 Pre rules applied. Total rules applied 656 place count 1466 transition count 1465
Deduced a syphon composed of 479 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 523 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 1658 place count 943 transition count 1465
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1690 place count 939 transition count 1437
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1718 place count 911 transition count 1437
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1718 place count 911 transition count 1420
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1769 place count 877 transition count 1420
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1769 place count 877 transition count 1404
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1801 place count 861 transition count 1404
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1806 place count 856 transition count 1392
Iterating global reduction 5 with 5 rules applied. Total rules applied 1811 place count 856 transition count 1392
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1811 place count 856 transition count 1390
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1815 place count 854 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1817 place count 852 transition count 1381
Iterating global reduction 5 with 2 rules applied. Total rules applied 1819 place count 852 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1820 place count 851 transition count 1380
Iterating global reduction 5 with 1 rules applied. Total rules applied 1821 place count 851 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1822 place count 850 transition count 1379
Iterating global reduction 5 with 1 rules applied. Total rules applied 1823 place count 850 transition count 1379
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 2107 place count 707 transition count 1238
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2111 place count 703 transition count 1234
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2116 place count 702 transition count 1234
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 1 rules applied. Total rules applied 2117 place count 702 transition count 1233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2118 place count 701 transition count 1233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2118 place count 701 transition count 1232
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 2120 place count 700 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2122 place count 698 transition count 1230
Iterating global reduction 7 with 2 rules applied. Total rules applied 2124 place count 698 transition count 1230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2126 place count 698 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2127 place count 697 transition count 1228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2129 place count 696 transition count 1233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2131 place count 694 transition count 1231
Reduce places removed 8 places and 0 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 9 with 12 rules applied. Total rules applied 2143 place count 686 transition count 1227
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2147 place count 682 transition count 1227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2147 place count 682 transition count 1215
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2172 place count 669 transition count 1215
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2181 place count 660 transition count 1215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2181 place count 660 transition count 1214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2183 place count 659 transition count 1214
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 2209 place count 646 transition count 1201
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2217 place count 638 transition count 1193
Iterating global reduction 12 with 8 rules applied. Total rules applied 2225 place count 638 transition count 1193
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2229 place count 634 transition count 1189
Iterating global reduction 12 with 4 rules applied. Total rules applied 2233 place count 634 transition count 1189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2237 place count 634 transition count 1185
Applied a total of 2237 rules in 415 ms. Remains 634 /1794 variables (removed 1160) and now considering 1185/2274 (removed 1089) transitions.
// Phase 1: matrix 1185 rows 634 cols
[2025-05-30 04:27:16] [INFO ] Computed 102 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:16] [INFO ] Implicit Places using invariants in 545 ms returned [1, 18, 19, 31, 48, 66, 88, 140, 150, 151, 153, 170, 188, 208, 259, 260, 272, 273, 275, 292, 310, 330, 381, 382, 394, 395, 397, 414, 432, 452, 503, 504, 507, 518, 519, 520, 549, 571, 574, 575]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 546 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 594/1794 places, 1185/2274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 594 transition count 1112
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 521 transition count 1112
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 146 place count 521 transition count 1094
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 182 place count 503 transition count 1094
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 258 place count 465 transition count 1056
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 262 place count 463 transition count 1057
Applied a total of 262 rules in 40 ms. Remains 463 /594 variables (removed 131) and now considering 1057/1185 (removed 128) transitions.
// Phase 1: matrix 1057 rows 463 cols
[2025-05-30 04:27:16] [INFO ] Computed 62 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:17] [INFO ] Implicit Places using invariants in 481 ms returned [91, 97, 102, 177, 183, 188, 265, 271, 276, 353, 359, 364, 442]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 482 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 450/1794 places, 1057/2274 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 442 transition count 1049
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 442 transition count 1049
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 434 transition count 1041
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 434 transition count 1041
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 430 transition count 1037
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 430 transition count 1037
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 426 transition count 1033
Applied a total of 48 rules in 46 ms. Remains 426 /450 variables (removed 24) and now considering 1033/1057 (removed 24) transitions.
// Phase 1: matrix 1033 rows 426 cols
[2025-05-30 04:27:17] [INFO ] Computed 49 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:17] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-05-30 04:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 04:27:18] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 426/1794 places, 1033/2274 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2905 ms. Remains : 426/1794 places, 1033/2274 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-01
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-01 finished in 2970 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' '!(((p0 U (X(p0)||p1)) U X(p2)))'
Support contains 4 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1787 transition count 2260
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1787 transition count 2260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1787 transition count 2259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 1784 transition count 2249
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 1784 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1782 transition count 2247
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1782 transition count 2247
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1780 transition count 2238
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1780 transition count 2238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1778 transition count 2229
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1778 transition count 2229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1776 transition count 2227
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1776 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1774 transition count 2218
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1774 transition count 2218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1772 transition count 2209
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2208
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2200
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2191
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2183
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2174
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2166
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1762 transition count 2157
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1762 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1761 transition count 2149
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1761 transition count 2149
Applied a total of 67 rules in 1435 ms. Remains 1761 /1794 variables (removed 33) and now considering 2149/2274 (removed 125) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2025-05-30 04:27:20] [INFO ] Computed 188 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:20] [INFO ] Implicit Places using invariants in 907 ms returned []
[2025-05-30 04:27:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:27:24] [INFO ] Implicit Places using invariants and state equation in 4053 ms returned []
Implicit Place search using SMT with State Equation took 4962 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2025-05-30 04:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 60576ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1794 places, 2149/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66984 ms. Remains : 1761/1794 places, 2149/2274 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 481 ms.
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 28 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-04b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-04b-LTLCardinality-02 finished in 68267 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(F((G(p1)&&p0))))))'
Support contains 4 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1787 transition count 2260
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1787 transition count 2260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1787 transition count 2259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 1784 transition count 2249
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 1784 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1782 transition count 2247
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1782 transition count 2247
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1780 transition count 2238
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1780 transition count 2238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1778 transition count 2229
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1778 transition count 2229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1776 transition count 2227
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1776 transition count 2227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1774 transition count 2218
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1774 transition count 2218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1772 transition count 2209
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2208
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2200
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2191
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2183
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2174
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2166
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1762 transition count 2157
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1762 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1761 transition count 2149
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1761 transition count 2149
Applied a total of 67 rules in 1416 ms. Remains 1761 /1794 variables (removed 33) and now considering 2149/2274 (removed 125) transitions.
[2025-05-30 04:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:28:29] [INFO ] Implicit Places using invariants in 924 ms returned []
[2025-05-30 04:28:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:28:33] [INFO ] Implicit Places using invariants and state equation in 4042 ms returned []
Implicit Place search using SMT with State Equation took 4969 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2025-05-30 04:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1794 places, 2149/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66938 ms. Remains : 1761/1794 places, 2149/2274 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-04
Stuttering criterion allowed to conclude after 245 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-04 finished in 67165 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&&X(p0))) U X(X((G(p0)||X(F(p1))))))))'
Support contains 3 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1788 transition count 2261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1788 transition count 2261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1788 transition count 2260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 1785 transition count 2250
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 1785 transition count 2250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1783 transition count 2248
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1783 transition count 2248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1781 transition count 2239
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1781 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1779 transition count 2230
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1779 transition count 2230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1777 transition count 2228
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1777 transition count 2228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1775 transition count 2219
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1775 transition count 2219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1773 transition count 2210
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1773 transition count 2210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1772 transition count 2209
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2201
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2193
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2184
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2176
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2167
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2159
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1762 transition count 2150
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1762 transition count 2150
Applied a total of 65 rules in 1380 ms. Remains 1762 /1794 variables (removed 32) and now considering 2150/2274 (removed 124) transitions.
// Phase 1: matrix 2150 rows 1762 cols
[2025-05-30 04:29:35] [INFO ] Computed 188 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:29:36] [INFO ] Implicit Places using invariants in 959 ms returned []
[2025-05-30 04:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:29:41] [INFO ] Implicit Places using invariants and state equation in 4950 ms returned []
Implicit Place search using SMT with State Equation took 5914 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2025-05-30 04:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 13.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 1.0)
(s49 6.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 18.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 2.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 16.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 28.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 13.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 4.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 13.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 13.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 10.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 4.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 110.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 16.0)
(s637 1.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 10.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 0.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 7.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 4.0)
(s720 1.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 9.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 9.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 6.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 4.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 1762/1794 places, 2150/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67864 ms. Remains : 1762/1794 places, 2150/2274 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-06
Product exploration explored 100000 steps with 22205 reset in 265 ms.
Product exploration explored 100000 steps with 22194 reset in 268 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 31543 steps (65 resets) in 271 ms. (115 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1762/1762 places, 2150/2150 transitions.
Applied a total of 0 rules in 67 ms. Remains 1762 /1762 variables (removed 0) and now considering 2150/2150 (removed 0) transitions.
[2025-05-30 04:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:30:44] [INFO ] Implicit Places using invariants in 858 ms returned []
[2025-05-30 04:30:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:30:49] [INFO ] Implicit Places using invariants and state equation in 4918 ms returned []
Implicit Place search using SMT with State Equation took 5795 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2025-05-30 04:30: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/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Finished structural reductions in LTL mode , in 1 iterations and 66401 ms. Remains : 1762/1762 places, 2150/2150 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 29828 steps (74 resets) in 107 ms. (276 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16690 reset in 231 ms.
Product exploration explored 100000 steps with 16696 reset in 237 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1762 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1762/1762 places, 2150/2150 transitions.
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1762 transition count 2150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 314 place count 1762 transition count 2149
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 314 place count 1762 transition count 2233
Deduced a syphon composed of 632 places in 3 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 633 place count 1762 transition count 2233
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 635 place count 1761 transition count 2233
Discarding 170 places :
Symmetric choice reduction at 3 with 170 rule applications. Total rules 805 place count 1591 transition count 2063
Deduced a syphon composed of 463 places in 3 ms
Iterating global reduction 3 with 170 rules applied. Total rules applied 975 place count 1591 transition count 2063
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 975 place count 1591 transition count 2066
Deduced a syphon composed of 466 places in 3 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 978 place count 1591 transition count 2066
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 772 places in 2 ms
Iterating global reduction 3 with 306 rules applied. Total rules applied 1284 place count 1591 transition count 2067
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 1409 place count 1466 transition count 1940
Deduced a syphon composed of 651 places in 2 ms
Iterating global reduction 3 with 125 rules applied. Total rules applied 1534 place count 1466 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1536 place count 1464 transition count 1937
Deduced a syphon composed of 651 places in 2 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1538 place count 1464 transition count 1937
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1540 place count 1464 transition count 1935
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 677 places in 2 ms
Iterating global reduction 4 with 26 rules applied. Total rules applied 1566 place count 1464 transition count 2026
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1574 place count 1456 transition count 2008
Deduced a syphon composed of 669 places in 2 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1582 place count 1456 transition count 2008
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 670 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1583 place count 1456 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1584 place count 1455 transition count 2008
Deduced a syphon composed of 669 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1585 place count 1455 transition count 2008
Deduced a syphon composed of 669 places in 2 ms
Applied a total of 1585 rules in 854 ms. Remains 1455 /1762 variables (removed 307) and now considering 2008/2150 (removed 142) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:31:53] [INFO ] Redundant transitions in 156 ms returned []
Running 2007 sub problems to find dead transitions.
// Phase 1: matrix 2008 rows 1455 cols
[2025-05-30 04:31:53] [INFO ] Computed 187 invariants in 17 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1454 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1454/3463 variables, and 129 constraints, problems are : Problem set: 0 solved, 2007 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 129/144 constraints, State Equation: 0/1455 constraints, PredecessorRefiner: 2007/2007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2007 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1454 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2007 unsolved
(s478 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 8)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 1)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 36)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 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 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 15)
(s181 1)
(s182 0)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 2)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 16)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 10)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 1)
(s265 1)
(s266 0)
(s267 1)
(s268 1)
(s269 0)
(s270 1)
(s271 1)
(s272 1)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(s285 0)
(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 2)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 5)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 0)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 80)
(s355 1)
(s356 1)
(s357 1)
(s358 16)
(s359 1)
(s360 1)
(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 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 37)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 1)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 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 1)
(s466 23)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1454/3463 variables, and 129 constraints, problems are : Problem set: 0 solved, 2007 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/43 constraints, Generalized P Invariants (flows): 129/144 constraints, State Equation: 0/1455 constraints, PredecessorRefiner: 0/2007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 2007 unsolved
Search for dead transitions found 0 dead transitions in 60671ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1455/1762 places, 2008/2150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61702 ms. Remains : 1455/1762 places, 2008/2150 transitions.
Built C files in :
/tmp/ltsmin7918764782551712961
[2025-05-30 04:32:54] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7918764782551712961
Running compilation step : cd /tmp/ltsmin7918764782551712961;'/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/ltsmin7918764782551712961;'/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/ltsmin7918764782551712961;'/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 1762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1762/1762 places, 2150/2150 transitions.
Applied a total of 0 rules in 81 ms. Remains 1762 /1762 variables (removed 0) and now considering 2150/2150 (removed 0) transitions.
// Phase 1: matrix 2150 rows 1762 cols
[2025-05-30 04:32:57] [INFO ] Computed 188 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:32:58] [INFO ] Implicit Places using invariants in 939 ms returned []
[2025-05-30 04:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:33:03] [INFO ] Implicit Places using invariants and state equation in 4959 ms returned []
Implicit Place search using SMT with State Equation took 5899 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2025-05-30 04:33:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 104 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/45 constraints, Generalized P Invariants (flows): 104/143 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in LTL mode , in 1 iterations and 66539 ms. Remains : 1762/1762 places, 2150/2150 transitions.
Built C files in :
/tmp/ltsmin16387605217815931492
[2025-05-30 04:34:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16387605217815931492
Running compilation step : cd /tmp/ltsmin16387605217815931492;'/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/ltsmin16387605217815931492;'/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/ltsmin16387605217815931492;'/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 04:34:07] [INFO ] Flatten gal took : 80 ms
[2025-05-30 04:34:07] [INFO ] Flatten gal took : 80 ms
[2025-05-30 04:34:07] [INFO ] Time to serialize gal into /tmp/LTL15112817308773427555.gal : 36 ms
[2025-05-30 04:34:07] [INFO ] Time to serialize properties into /tmp/LTL7927315779070379742.prop : 2 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/LTL15112817308773427555.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9282510586903798756.hoa' '-atoms' '/tmp/LTL7927315779070379742.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/LTL7927315779070379742.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9282510586903798756.hoa
Detected timeout of ITS tools.
[2025-05-30 04:34:22] [INFO ] Flatten gal took : 63 ms
[2025-05-30 04:34:22] [INFO ] Flatten gal took : 63 ms
[2025-05-30 04:34:22] [INFO ] Time to serialize gal into /tmp/LTL4584135240050203632.gal : 11 ms
[2025-05-30 04:34:22] [INFO ] Time to serialize properties into /tmp/LTL1275800492349502622.ltl : 5 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/LTL4584135240050203632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1275800492349502622.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 : !((X((F((X("((p1979==0)||(p1631==1))"))&&("((p1979==0)||(p1631==1))")))U(X(X((G("((p1979==0)||(p1631==1))"))||(X(F("(p1787==1)")))))))...157
Formula 0 simplified : X(G(!"((p1979==0)||(p1631==1))" | X!"((p1979==0)||(p1631==1))") R XX(F!"((p1979==0)||(p1631==1))" & XG!"(p1787==1)"))
Detected timeout of ITS tools.
[2025-05-30 04:34:37] [INFO ] Flatten gal took : 60 ms
[2025-05-30 04:34:37] [INFO ] Applying decomposition
[2025-05-30 04:34:37] [INFO ] Flatten gal took : 60 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/graph14178739859764571947.txt' '-o' '/tmp/graph14178739859764571947.bin' '-w' '/tmp/graph14178739859764571947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14178739859764571947.bin' '-l' '-1' '-v' '-w' '/tmp/graph14178739859764571947.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:34:38] [INFO ] Decomposing Gal with order
[2025-05-30 04:34:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:34:38] [INFO ] Removed a total of 1615 redundant transitions.
[2025-05-30 04:34:39] [INFO ] Flatten gal took : 595 ms
[2025-05-30 04:34:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 34 ms.
[2025-05-30 04:34:39] [INFO ] Time to serialize gal into /tmp/LTL3819474271100492794.gal : 25 ms
[2025-05-30 04:34:39] [INFO ] Time to serialize properties into /tmp/LTL6918436699781928020.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/LTL3819474271100492794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6918436699781928020.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 : !((X((F((X("((i26.u657.p1979==0)||(i21.i0.i1.u574.p1631==1))"))&&("((i26.u657.p1979==0)||(i21.i0.i1.u574.p1631==1))")))U(X(X((G("((i26...238
Formula 0 simplified : X(G(!"((i26.u657.p1979==0)||(i21.i0.i1.u574.p1631==1))" | X!"((i26.u657.p1979==0)||(i21.i0.i1.u574.p1631==1))") R XX(F!"((i26.u657.p...221
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04b-LTLCardinality-06 finished in 320299 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)&&X(F(p1)))))'
Support contains 4 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1789 transition count 2262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1789 transition count 2262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1786 transition count 2252
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1786 transition count 2252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 1784 transition count 2250
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1784 transition count 2250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1782 transition count 2241
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1782 transition count 2241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1780 transition count 2232
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1780 transition count 2232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1778 transition count 2230
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1778 transition count 2230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1776 transition count 2221
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1776 transition count 2221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1774 transition count 2212
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1774 transition count 2212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1773 transition count 2211
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1773 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1772 transition count 2203
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1772 transition count 2203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1771 transition count 2195
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1771 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1770 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1770 transition count 2194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1769 transition count 2186
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1769 transition count 2186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1768 transition count 2178
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1768 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1767 transition count 2177
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1767 transition count 2177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1766 transition count 2169
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1766 transition count 2169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1765 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1765 transition count 2161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1764 transition count 2160
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1764 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1763 transition count 2152
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1763 transition count 2152
Applied a total of 62 rules in 1618 ms. Remains 1763 /1794 variables (removed 31) and now considering 2152/2274 (removed 122) transitions.
// Phase 1: matrix 2152 rows 1763 cols
[2025-05-30 04:34:55] [INFO ] Computed 188 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:34:56] [INFO ] Implicit Places using invariants in 991 ms returned []
[2025-05-30 04:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:35:01] [INFO ] Implicit Places using invariants and state equation in 4144 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
Running 2151 sub problems to find dead transitions.
[2025-05-30 04:35:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 2151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1762/3915 variables, and 108 constraints, problems are : Problem set: 0 solved, 2151 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 108/140 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 2151/2151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 2151 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 13)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 3)
(s47 1)
(s48 1)
(s49 6)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 18)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 20)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 0)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 5)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 15)
(s283 1)
(s284 1)
(s285 1)
(s286 15)
(s287 1)
(s288 16)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 1)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 1)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 1)
(s320 0)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 0)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 4)
(s361 1)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(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 23)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 13)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 13)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 10)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 4)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 107)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 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 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 0)
(s487 1)
(s488 1)
(s489 0)
(s490 1)
(s491 1)
(s492 0)
(s493 1)
(s494 1)
(s495 0)
(s496 1)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 23)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 2)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 17)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 0)
(s643 1)
(s644 1)
(s645 1)
(s646 0)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 10)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 0)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 1)
(s693 0)
(s694 1)
(s695 1)
(s696 0)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 4)
(s721 1)
(s722 1)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 9)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 9)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 6)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 4)
(s770 1)
(s771 1)
(s772 1)
(s773 118)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 0)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 0)
(s819 0)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 0)
(s828 1)
(s829 1)
(s830 0)
(s831 0)
(s832 1)
(s833 1)
(s834 0)
(s835 1)
(s836 1)
(s837 1)
(s838 0)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 0)
(s846 1)
(s847 1)
(s848 0)
(s849 1)
(s850 1)
(s851 0)
(s852 0)
(s853 1)
(s854 0)
(s855 0)
(s856 1)
(s857 0)
(s858 0)
(s859 1)
(s860 0)
(s861 1)
(s862 0)
(s863 1)
(s864 1)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 16)
(s997 1)
(s998 1)
(s999 0)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 0)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 10)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 0)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 7)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 0)
(s1071 0)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 0)
(s1082 0)
(s1083 4)
(s1084 0)
(s1085 0)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 5)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 5)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 2)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 4)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 28)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 0)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 0)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 0)
(s1178 0)
(s1179 1)
(s1180 1)
(s1181 0)
(s1182 1)
(s1183 0)
(s1184 1)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 1)
(s1189 0)
(s1190 1)
(s1191 0)
(s1192 1)
(s1193 1)
(s1194 0)
(s1195 0)
(s1196 1)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1762/3915 variables, and 108 constraints, problems are : Problem set: 0 solved, 2151 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 108/140 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 0/2151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 2151 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Starting structural reductions in LTL mode, iteration 1 : 1763/1794 places, 2152/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67332 ms. Remains : 1763/1794 places, 2152/2274 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 5971 steps with 15 reset in 18 ms.
FORMULA ASLink-PT-04b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-07 finished in 67537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(((p0 U p1)&&X(F(!p0))) U p0)))'
Support contains 4 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1788 transition count 2261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1788 transition count 2261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1788 transition count 2260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1786 transition count 2251
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1786 transition count 2251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1784 transition count 2249
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1784 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1782 transition count 2240
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1782 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1780 transition count 2231
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1780 transition count 2231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1778 transition count 2229
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1778 transition count 2229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1776 transition count 2220
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1776 transition count 2220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1774 transition count 2211
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1774 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1773 transition count 2210
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1773 transition count 2210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1772 transition count 2202
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1772 transition count 2202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2193
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2185
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2177
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2176
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2168
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2160
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2159
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2159
Applied a total of 61 rules in 1534 ms. Remains 1764 /1794 variables (removed 30) and now considering 2159/2274 (removed 115) transitions.
// Phase 1: matrix 2159 rows 1764 cols
[2025-05-30 04:36:03] [INFO ] Computed 188 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:36:04] [INFO ] Implicit Places using invariants in 948 ms returned []
[2025-05-30 04:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:36:07] [INFO ] Implicit Places using invariants and state equation in 3499 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-05-30 04:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1763 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1763/3923 variables, and 107 constraints, problems are : Problem set: 0 solved, 2158 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 107/142 constraints, State Equation: 0/1764 constraints, PredecessorRefiner: 2158/2158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1763 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1763/3923 variables, and 107 constraints, problems are : Problem set: 0 solved, 2158 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 107/142 constraints, State Equation: 0/1764 constraints, PredecessorRefiner: 0/2158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in LTL mode, iteration 1 : 1764/1794 places, 2159/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66534 ms. Remains : 1764/1794 places, 2159/2274 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, p0, p0, false, (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-10 finished in 66708 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||(p1&&F(p0))))))'
Support contains 2 out of 1794 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 : 1794/1794 places, 2274/2274 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1793 transition count 1947
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 657 place count 1467 transition count 1942
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 660 place count 1464 transition count 1942
Performed 480 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 480 Pre rules applied. Total rules applied 660 place count 1464 transition count 1462
Deduced a syphon composed of 480 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 524 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 1664 place count 940 transition count 1462
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1696 place count 936 transition count 1434
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1724 place count 908 transition count 1434
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1724 place count 908 transition count 1418
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1772 place count 876 transition count 1418
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1772 place count 876 transition count 1403
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1802 place count 861 transition count 1403
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1808 place count 855 transition count 1390
Iterating global reduction 5 with 6 rules applied. Total rules applied 1814 place count 855 transition count 1390
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1814 place count 855 transition count 1387
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1820 place count 852 transition count 1387
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1822 place count 850 transition count 1378
Iterating global reduction 5 with 2 rules applied. Total rules applied 1824 place count 850 transition count 1378
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1826 place count 848 transition count 1369
Iterating global reduction 5 with 2 rules applied. Total rules applied 1828 place count 848 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1830 place count 846 transition count 1360
Iterating global reduction 5 with 2 rules applied. Total rules applied 1832 place count 846 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1833 place count 845 transition count 1352
Iterating global reduction 5 with 1 rules applied. Total rules applied 1834 place count 845 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1835 place count 844 transition count 1344
Iterating global reduction 5 with 1 rules applied. Total rules applied 1836 place count 844 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1837 place count 843 transition count 1336
Iterating global reduction 5 with 1 rules applied. Total rules applied 1838 place count 843 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1839 place count 842 transition count 1328
Iterating global reduction 5 with 1 rules applied. Total rules applied 1840 place count 842 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1841 place count 841 transition count 1320
Iterating global reduction 5 with 1 rules applied. Total rules applied 1842 place count 841 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1843 place count 840 transition count 1312
Iterating global reduction 5 with 1 rules applied. Total rules applied 1844 place count 840 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1845 place count 839 transition count 1304
Iterating global reduction 5 with 1 rules applied. Total rules applied 1846 place count 839 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1847 place count 838 transition count 1296
Iterating global reduction 5 with 1 rules applied. Total rules applied 1848 place count 838 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1849 place count 837 transition count 1288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1850 place count 837 transition count 1288
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 282 rules applied. Total rules applied 2132 place count 695 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2136 place count 691 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2141 place count 690 transition count 1144
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 1 rules applied. Total rules applied 2142 place count 690 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2143 place count 689 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2143 place count 689 transition count 1142
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 2145 place count 688 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2147 place count 686 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2149 place count 686 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2151 place count 686 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2152 place count 685 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2154 place count 684 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2156 place count 682 transition count 1141
Reduce places removed 8 places and 0 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 9 with 12 rules applied. Total rules applied 2168 place count 674 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2172 place count 670 transition count 1137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2172 place count 670 transition count 1125
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2197 place count 657 transition count 1125
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2206 place count 648 transition count 1125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2206 place count 648 transition count 1124
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2208 place count 647 transition count 1124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 2234 place count 634 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2242 place count 626 transition count 1103
Iterating global reduction 12 with 8 rules applied. Total rules applied 2250 place count 626 transition count 1103
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2254 place count 622 transition count 1099
Iterating global reduction 12 with 4 rules applied. Total rules applied 2258 place count 622 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2262 place count 622 transition count 1095
Applied a total of 2262 rules in 493 ms. Remains 622 /1794 variables (removed 1172) and now considering 1095/2274 (removed 1179) transitions.
// Phase 1: matrix 1095 rows 622 cols
[2025-05-30 04:37:09] [INFO ] Computed 103 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:09] [INFO ] Implicit Places using invariants in 518 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 206, 239, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 508, 519, 520, 521, 539, 560, 561, 562, 563]
[2025-05-30 04:37:09] [INFO ] Actually due to overlaps returned [539, 521, 48, 167, 293, 415, 31, 147, 150, 273, 276, 395, 398, 519, 560, 148, 274, 396, 520, 561, 1, 18, 260, 261, 382, 383, 504, 505, 562, 19, 66, 86, 137, 185, 206, 311, 331, 433, 453, 508, 563]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 519 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/1794 places, 1095/2274 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 580 transition count 1026
Reduce places removed 69 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 74 rules applied. Total rules applied 144 place count 511 transition count 1021
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 149 place count 506 transition count 1021
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 149 place count 506 transition count 998
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 196 place count 482 transition count 998
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 208 place count 478 transition count 990
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 216 place count 470 transition count 990
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 219 place count 467 transition count 987
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 467 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 467 transition count 984
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 291 place count 434 transition count 951
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 295 place count 432 transition count 952
Applied a total of 295 rules in 50 ms. Remains 432 /581 variables (removed 149) and now considering 952/1095 (removed 143) transitions.
// Phase 1: matrix 952 rows 432 cols
[2025-05-30 04:37:09] [INFO ] Computed 56 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:09] [INFO ] Implicit Places using invariants in 317 ms returned [88, 94, 99, 183, 188, 265, 271, 276, 353, 359, 364, 429]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 319 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 420/1794 places, 952/2274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 419 transition count 951
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 412 transition count 944
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 412 transition count 944
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 405 transition count 937
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 405 transition count 937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 402 transition count 934
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 402 transition count 934
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 44 place count 398 transition count 930
Applied a total of 44 rules in 43 ms. Remains 398 /420 variables (removed 22) and now considering 930/952 (removed 22) transitions.
// Phase 1: matrix 930 rows 398 cols
[2025-05-30 04:37:09] [INFO ] Computed 44 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:10] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-05-30 04:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:11] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 398/1794 places, 930/2274 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2533 ms. Remains : 398/1794 places, 930/2274 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-13
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-13 finished in 2605 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)||X(X(((G(p2)||p1) U X(p3)))))))'
Support contains 5 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1788 transition count 2261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1788 transition count 2261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1788 transition count 2260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 1785 transition count 2250
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 1785 transition count 2250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1783 transition count 2248
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1783 transition count 2248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1781 transition count 2239
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1781 transition count 2239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1779 transition count 2230
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1779 transition count 2230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1777 transition count 2228
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1777 transition count 2228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1775 transition count 2219
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1775 transition count 2219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1773 transition count 2210
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1773 transition count 2210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1772 transition count 2209
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1771 transition count 2201
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1771 transition count 2201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1770 transition count 2193
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1770 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1768 transition count 2184
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1768 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1767 transition count 2176
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1767 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1765 transition count 2167
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1765 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1764 transition count 2159
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1764 transition count 2159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1762 transition count 2150
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1762 transition count 2150
Applied a total of 65 rules in 1606 ms. Remains 1762 /1794 variables (removed 32) and now considering 2150/2274 (removed 124) transitions.
// Phase 1: matrix 2150 rows 1762 cols
[2025-05-30 04:37:12] [INFO ] Computed 188 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:13] [INFO ] Implicit Places using invariants in 939 ms returned []
[2025-05-30 04:37:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:37:18] [INFO ] Implicit Places using invariants and state equation in 5089 ms returned []
Implicit Place search using SMT with State Equation took 6031 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2025-05-30 04:37: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/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 1762/1794 places, 2150/2274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68224 ms. Remains : 1762/1794 places, 2150/2274 transitions.
Stuttering acceptance computed with spot in 649 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-15
Stuttering criterion allowed to conclude after 5177 steps with 8 reset in 31 ms.
FORMULA ASLink-PT-04b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLCardinality-15 finished in 68936 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&&X(p0))) U X(X((G(p0)||X(F(p1))))))))'
Found a Shortening insensitive property : ASLink-PT-04b-LTLCardinality-06
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1794 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1794/1794 places, 2274/2274 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1793 transition count 1947
Reduce places removed 326 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 331 rules applied. Total rules applied 657 place count 1467 transition count 1942
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 660 place count 1464 transition count 1942
Performed 480 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 480 Pre rules applied. Total rules applied 660 place count 1464 transition count 1462
Deduced a syphon composed of 480 places in 2 ms
Ensure Unique test removed 44 places
Reduce places removed 524 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 1664 place count 940 transition count 1462
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 1695 place count 936 transition count 1435
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1722 place count 909 transition count 1435
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1722 place count 909 transition count 1418
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1773 place count 875 transition count 1418
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1773 place count 875 transition count 1402
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1805 place count 859 transition count 1402
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1810 place count 854 transition count 1390
Iterating global reduction 5 with 5 rules applied. Total rules applied 1815 place count 854 transition count 1390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1815 place count 854 transition count 1388
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1819 place count 852 transition count 1388
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1821 place count 850 transition count 1379
Iterating global reduction 5 with 2 rules applied. Total rules applied 1823 place count 850 transition count 1379
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1825 place count 848 transition count 1370
Iterating global reduction 5 with 2 rules applied. Total rules applied 1827 place count 848 transition count 1370
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1829 place count 846 transition count 1361
Iterating global reduction 5 with 2 rules applied. Total rules applied 1831 place count 846 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1832 place count 845 transition count 1353
Iterating global reduction 5 with 1 rules applied. Total rules applied 1833 place count 845 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1834 place count 844 transition count 1345
Iterating global reduction 5 with 1 rules applied. Total rules applied 1835 place count 844 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1836 place count 843 transition count 1337
Iterating global reduction 5 with 1 rules applied. Total rules applied 1837 place count 843 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1838 place count 842 transition count 1329
Iterating global reduction 5 with 1 rules applied. Total rules applied 1839 place count 842 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1840 place count 841 transition count 1321
Iterating global reduction 5 with 1 rules applied. Total rules applied 1841 place count 841 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1842 place count 840 transition count 1313
Iterating global reduction 5 with 1 rules applied. Total rules applied 1843 place count 840 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1844 place count 839 transition count 1305
Iterating global reduction 5 with 1 rules applied. Total rules applied 1845 place count 839 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1846 place count 838 transition count 1297
Iterating global reduction 5 with 1 rules applied. Total rules applied 1847 place count 838 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1848 place count 837 transition count 1289
Iterating global reduction 5 with 1 rules applied. Total rules applied 1849 place count 837 transition count 1289
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 2133 place count 694 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2137 place count 690 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2142 place count 689 transition count 1144
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 1 rules applied. Total rules applied 2143 place count 689 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2144 place count 688 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2144 place count 688 transition count 1142
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 2146 place count 687 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2148 place count 685 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2150 place count 685 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2152 place count 685 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2153 place count 684 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2155 place count 683 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2157 place count 681 transition count 1141
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 10 rules applied. Total rules applied 2167 place count 674 transition count 1138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2170 place count 671 transition count 1138
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 11 Pre rules applied. Total rules applied 2170 place count 671 transition count 1127
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 23 rules applied. Total rules applied 2193 place count 659 transition count 1127
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 2201 place count 651 transition count 1127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2201 place count 651 transition count 1126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2203 place count 650 transition count 1126
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 2227 place count 638 transition count 1114
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 2234 place count 631 transition count 1107
Iterating global reduction 12 with 7 rules applied. Total rules applied 2241 place count 631 transition count 1107
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2245 place count 627 transition count 1103
Iterating global reduction 12 with 4 rules applied. Total rules applied 2249 place count 627 transition count 1103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2253 place count 627 transition count 1099
Applied a total of 2253 rules in 491 ms. Remains 627 /1794 variables (removed 1167) and now considering 1099/2274 (removed 1175) transitions.
// Phase 1: matrix 1099 rows 627 cols
[2025-05-30 04:38:21] [INFO ] Computed 104 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:21] [INFO ] Implicit Places using invariants in 469 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 450, 505, 506, 509, 523, 524, 525, 543, 564, 565, 566, 567]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 470 ms to find 41 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 586/1794 places, 1099/2274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 586 transition count 1026
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 513 transition count 1026
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 146 place count 513 transition count 1003
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 193 place count 489 transition count 1003
Discarding 4 places :
Implicit places reduction removed 4 places
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 2 with 11 rules applied. Total rules applied 204 place count 485 transition count 996
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 211 place count 478 transition count 996
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 475 transition count 993
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 475 transition count 993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 475 transition count 991
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 287 place count 441 transition count 957
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 439 transition count 958
Applied a total of 291 rules in 55 ms. Remains 439 /586 variables (removed 147) and now considering 958/1099 (removed 141) transitions.
// Phase 1: matrix 958 rows 439 cols
[2025-05-30 04:38:21] [INFO ] Computed 58 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:21] [INFO ] Implicit Places using invariants in 304 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 351, 357, 362, 436]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 305 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 426/1794 places, 958/2274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 425 transition count 957
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 417 transition count 949
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 417 transition count 949
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 409 transition count 941
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 409 transition count 941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 405 transition count 937
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 405 transition count 937
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 50 place count 401 transition count 933
Applied a total of 50 rules in 42 ms. Remains 401 /426 variables (removed 25) and now considering 933/958 (removed 25) transitions.
// Phase 1: matrix 933 rows 401 cols
[2025-05-30 04:38:21] [INFO ] Computed 45 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:22] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-05-30 04:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:22] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 401/1794 places, 933/2274 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2419 ms. Remains : 401/1794 places, 933/2274 transitions.
Running random walk in product with property : ASLink-PT-04b-LTLCardinality-06
Product exploration explored 100000 steps with 22040 reset in 260 ms.
Product exploration explored 100000 steps with 21878 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6518 steps (94 resets) in 34 ms. (186 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 933/933 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 933/933 (removed 0) transitions.
[2025-05-30 04:38:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:25] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-30 04:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:38:25] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
Running 899 sub problems to find dead transitions.
[2025-05-30 04:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (OVERLAPS) 2/398 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:38:48] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1334 variables, and 36 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/34 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 899/899 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (OVERLAPS) 2/398 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:39:21] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1334 variables, and 47 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 0/899 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 899 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in LTL mode , in 1 iterations and 61263 ms. Remains : 401/401 places, 933/933 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1980 steps (36 resets) in 12 ms. (152 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16435 reset in 231 ms.
Product exploration explored 100000 steps with 16425 reset in 351 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 933/933 transitions.
Applied a total of 0 rules in 17 ms. Remains 401 /401 variables (removed 0) and now considering 933/933 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:39:28] [INFO ] Redundant transitions in 11 ms returned []
Running 899 sub problems to find dead transitions.
[2025-05-30 04:39:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (OVERLAPS) 2/398 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:39:50] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1334 variables, and 36 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 24/34 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 899/899 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (OVERLAPS) 2/398 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:40:23] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 40 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1334 variables, and 47 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 0/899 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 899 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60250 ms. Remains : 401/401 places, 933/933 transitions.
Built C files in :
/tmp/ltsmin10046009765291450177
[2025-05-30 04:40:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10046009765291450177
Running compilation step : cd /tmp/ltsmin10046009765291450177;'/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 1560 ms.
Running link step : cd /tmp/ltsmin10046009765291450177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin10046009765291450177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9174386603889852565.hoa' '--buchi-type=spotba'
LTSmin run took 637 ms.
Treatment of property ASLink-PT-04b-LTLCardinality-06 finished in 130702 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-05-30 04:40:30] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8199893648839152745
[2025-05-30 04:40:30] [INFO ] Too many transitions (2274) to apply POR reductions. Disabling POR matrices.
[2025-05-30 04:40:30] [INFO ] Applying decomposition
[2025-05-30 04:40:30] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8199893648839152745
Running compilation step : cd /tmp/ltsmin8199893648839152745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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 04:40:30] [INFO ] Flatten gal took : 55 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/graph13532319620522657389.txt' '-o' '/tmp/graph13532319620522657389.bin' '-w' '/tmp/graph13532319620522657389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13532319620522657389.bin' '-l' '-1' '-v' '-w' '/tmp/graph13532319620522657389.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:40:31] [INFO ] Decomposing Gal with order
[2025-05-30 04:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:40:31] [INFO ] Removed a total of 1816 redundant transitions.
[2025-05-30 04:40:31] [INFO ] Flatten gal took : 92 ms
[2025-05-30 04:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 34 ms.
[2025-05-30 04:40:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality2920365301780447415.gal : 34 ms
[2025-05-30 04:40:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality10910132688436280781.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/LTLCardinality2920365301780447415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10910132688436280781.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i24.u672.p1979==0)||(i18.i2.i1.u579.p1631==1))")&&(X("((i24.u672.p1979==0)||(i18.i2.i1.u579.p1631==1))"))))U(X(X((G("((i24...238
Formula 0 simplified : X(G(!"((i24.u672.p1979==0)||(i18.i2.i1.u579.p1631==1))" | X!"((i24.u672.p1979==0)||(i18.i2.i1.u579.p1631==1))") R XX(F!"((i24.u672.p...221
Compilation finished in 4959 ms.
Running link step : cd /tmp/ltsmin8199893648839152745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8199893648839152745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(((LTLAPp0==true)&&X((LTLAPp0==true)))) U X(X(([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 05:05:34] [INFO ] Applying decomposition
[2025-05-30 05:05:34] [INFO ] Flatten gal took : 98 ms
[2025-05-30 05:05:34] [INFO ] Decomposing Gal with order
[2025-05-30 05:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:05:34] [INFO ] Removed a total of 1679 redundant transitions.
[2025-05-30 05:05:34] [INFO ] Flatten gal took : 256 ms
[2025-05-30 05:05:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2418 labels/synchronizations in 194 ms.
[2025-05-30 05:05:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality12539557060402402345.gal : 27 ms
[2025-05-30 05:05:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality8993918453770628689.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/LTLCardinality12539557060402402345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8993918453770628689.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(("((i1.i1.u234.p1979==0)||(i0.i1.i0.i0.u195.p1631==1))")&&(X("((i1.i1.u234.p1979==0)||(i0.i1.i0.i0.u195.p1631==1))"))))U(X(X((...252
Formula 0 simplified : X(G(!"((i1.i1.u234.p1979==0)||(i0.i1.i0.i0.u195.p1631==1))" | X!"((i1.i1.u234.p1979==0)||(i0.i1.i0.i0.u195.p1631==1))") R XX(F!"((i1...235

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;