Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 417K 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-02b-LTLCardinality-00
FORMULA_NAME ASLink-PT-02b-LTLCardinality-01
FORMULA_NAME ASLink-PT-02b-LTLCardinality-02
FORMULA_NAME ASLink-PT-02b-LTLCardinality-03
FORMULA_NAME ASLink-PT-02b-LTLCardinality-04
FORMULA_NAME ASLink-PT-02b-LTLCardinality-05
FORMULA_NAME ASLink-PT-02b-LTLCardinality-06
FORMULA_NAME ASLink-PT-02b-LTLCardinality-07
FORMULA_NAME ASLink-PT-02b-LTLCardinality-08
FORMULA_NAME ASLink-PT-02b-LTLCardinality-09
FORMULA_NAME ASLink-PT-02b-LTLCardinality-10
FORMULA_NAME ASLink-PT-02b-LTLCardinality-11
FORMULA_NAME ASLink-PT-02b-LTLCardinality-12
FORMULA_NAME ASLink-PT-02b-LTLCardinality-13
FORMULA_NAME ASLink-PT-02b-LTLCardinality-14
FORMULA_NAME ASLink-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748569083631

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 01:38:04] [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 01:38:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:38:05] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-05-30 01:38:05] [INFO ] Transformed 1242 places.
[2025-05-30 01:38:05] [INFO ] Transformed 1621 transitions.
[2025-05-30 01:38:05] [INFO ] Found NUPN structural information;
[2025-05-30 01:38:05] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ASLink-PT-02b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 1169 transition count 1548
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 1169 transition count 1548
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 173 place count 1142 transition count 1503
Iterating global reduction 0 with 27 rules applied. Total rules applied 200 place count 1142 transition count 1503
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 208 place count 1142 transition count 1495
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 214 place count 1136 transition count 1489
Iterating global reduction 1 with 6 rules applied. Total rules applied 220 place count 1136 transition count 1489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 224 place count 1132 transition count 1478
Iterating global reduction 1 with 4 rules applied. Total rules applied 228 place count 1132 transition count 1478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 231 place count 1129 transition count 1475
Iterating global reduction 1 with 3 rules applied. Total rules applied 234 place count 1129 transition count 1475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 237 place count 1126 transition count 1465
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 1126 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 241 place count 1125 transition count 1457
Iterating global reduction 1 with 1 rules applied. Total rules applied 242 place count 1125 transition count 1457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 1124 transition count 1456
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 1124 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 245 place count 1123 transition count 1448
Iterating global reduction 1 with 1 rules applied. Total rules applied 246 place count 1123 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 247 place count 1122 transition count 1440
Iterating global reduction 1 with 1 rules applied. Total rules applied 248 place count 1122 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 1121 transition count 1439
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 1121 transition count 1439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 251 place count 1120 transition count 1431
Iterating global reduction 1 with 1 rules applied. Total rules applied 252 place count 1120 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 253 place count 1119 transition count 1423
Iterating global reduction 1 with 1 rules applied. Total rules applied 254 place count 1119 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 255 place count 1118 transition count 1422
Iterating global reduction 1 with 1 rules applied. Total rules applied 256 place count 1118 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 1117 transition count 1414
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 1117 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 1116 transition count 1406
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 1116 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 1115 transition count 1405
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 1115 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 263 place count 1114 transition count 1397
Iterating global reduction 1 with 1 rules applied. Total rules applied 264 place count 1114 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 265 place count 1113 transition count 1389
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 1113 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 267 place count 1112 transition count 1388
Iterating global reduction 1 with 1 rules applied. Total rules applied 268 place count 1112 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 269 place count 1111 transition count 1380
Iterating global reduction 1 with 1 rules applied. Total rules applied 270 place count 1111 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 271 place count 1110 transition count 1372
Iterating global reduction 1 with 1 rules applied. Total rules applied 272 place count 1110 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 1109 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 274 place count 1109 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 275 place count 1108 transition count 1363
Iterating global reduction 1 with 1 rules applied. Total rules applied 276 place count 1108 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 277 place count 1107 transition count 1355
Iterating global reduction 1 with 1 rules applied. Total rules applied 278 place count 1107 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 279 place count 1106 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 280 place count 1106 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 281 place count 1105 transition count 1346
Iterating global reduction 1 with 1 rules applied. Total rules applied 282 place count 1105 transition count 1346
Applied a total of 282 rules in 1262 ms. Remains 1105 /1242 variables (removed 137) and now considering 1346/1621 (removed 275) transitions.
// Phase 1: matrix 1346 rows 1105 cols
[2025-05-30 01:38:06] [INFO ] Computed 121 invariants in 82 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:07] [INFO ] Implicit Places using invariants in 935 ms returned [938, 949, 960, 968, 976, 984, 992, 1003, 1011, 1019, 1030]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 971 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1094/1242 places, 1346/1621 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1082 transition count 1334
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1082 transition count 1334
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 1071 transition count 1323
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 1071 transition count 1323
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 1063 transition count 1315
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 1063 transition count 1315
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1059 transition count 1311
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1059 transition count 1311
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1057 transition count 1309
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1057 transition count 1309
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1055 transition count 1307
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1055 transition count 1307
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1053 transition count 1305
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1053 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1051 transition count 1303
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1051 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1050 transition count 1302
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1050 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1049 transition count 1301
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1049 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1048 transition count 1300
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1048 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1047 transition count 1299
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1047 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1046 transition count 1298
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1046 transition count 1298
Applied a total of 96 rules in 377 ms. Remains 1046 /1094 variables (removed 48) and now considering 1298/1346 (removed 48) transitions.
// Phase 1: matrix 1298 rows 1046 cols
[2025-05-30 01:38:07] [INFO ] Computed 110 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:08] [INFO ] Implicit Places using invariants in 595 ms returned []
[2025-05-30 01:38:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:11] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3287 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1046/1242 places, 1298/1621 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5911 ms. Remains : 1046/1242 places, 1298/1621 transitions.
Support contains 26 out of 1046 places after structural reductions.
[2025-05-30 01:38:11] [INFO ] Flatten gal took : 113 ms
[2025-05-30 01:38:11] [INFO ] Flatten gal took : 69 ms
[2025-05-30 01:38:11] [INFO ] Input system was already deterministic with 1298 transitions.
Support contains 22 out of 1046 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (161 resets) in 927 ms. (43 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40002 steps (31 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (27 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (29 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
[2025-05-30 01:38:12] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 283/369 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 677/1046 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1046 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1298/2344 variables, 1046/1156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2344 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2344 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2344/2344 variables, and 1156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 1046/1046 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 283/369 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 677/1046 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:13] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:13] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:14] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1046 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1046 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1298/2344 variables, 1046/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2344 variables, 4/1163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:15] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:15] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:15] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:16] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:16] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:16] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:16] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:17] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 36 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2344 variables, 8/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2344 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2344/2344 variables, and 1171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 1046/1046 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6031ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1046 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1046 transition count 1115
Reduce places removed 183 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 188 rules applied. Total rules applied 371 place count 863 transition count 1110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 374 place count 860 transition count 1110
Performed 275 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 275 Pre rules applied. Total rules applied 374 place count 860 transition count 835
Deduced a syphon composed of 275 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 573 rules applied. Total rules applied 947 place count 562 transition count 835
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 965 place count 560 transition count 819
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 981 place count 544 transition count 819
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 981 place count 544 transition count 811
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1005 place count 528 transition count 811
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1005 place count 528 transition count 803
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1021 place count 520 transition count 803
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1024 place count 517 transition count 800
Iterating global reduction 5 with 3 rules applied. Total rules applied 1027 place count 517 transition count 800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1028 place count 517 transition count 799
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1028 place count 517 transition count 797
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1033 place count 514 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1033 place count 514 transition count 796
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1036 place count 512 transition count 796
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1037 place count 511 transition count 795
Iterating global reduction 6 with 1 rules applied. Total rules applied 1038 place count 511 transition count 795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1039 place count 510 transition count 794
Iterating global reduction 6 with 1 rules applied. Total rules applied 1040 place count 510 transition count 794
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 6 with 170 rules applied. Total rules applied 1210 place count 424 transition count 710
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1213 place count 421 transition count 707
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 1217 place count 420 transition count 707
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1218 place count 420 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1219 place count 419 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1219 place count 419 transition count 705
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1221 place count 418 transition count 705
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1222 place count 417 transition count 704
Iterating global reduction 8 with 1 rules applied. Total rules applied 1223 place count 417 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1225 place count 417 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1226 place count 416 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1228 place count 415 transition count 707
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1232 place count 415 transition count 703
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1236 place count 411 transition count 703
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1237 place count 411 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1238 place count 410 transition count 702
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1240 place count 410 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1241 place count 409 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 1247 place count 405 transition count 699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1249 place count 403 transition count 699
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 6 Pre rules applied. Total rules applied 1249 place count 403 transition count 693
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 13 rules applied. Total rules applied 1262 place count 396 transition count 693
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 1265 place count 393 transition count 693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 1265 place count 393 transition count 692
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1267 place count 392 transition count 692
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1277 place count 387 transition count 687
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1279 place count 385 transition count 685
Iterating global reduction 15 with 2 rules applied. Total rules applied 1281 place count 385 transition count 685
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1283 place count 385 transition count 683
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1285 place count 383 transition count 683
Applied a total of 1285 rules in 457 ms. Remains 383 /1046 variables (removed 663) and now considering 683/1298 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 383/1046 places, 683/1298 transitions.
RANDOM walk for 40000 steps (666 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (203 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (199 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (208 resets) in 130 ms. (305 steps per ms) remains 3/4 properties
// Phase 1: matrix 683 rows 383 cols
[2025-05-30 01:38:18] [INFO ] Computed 64 invariants in 5 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/222 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/226 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 142/368 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/372 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/383 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 683/1066 variables, 383/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1066 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1066 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 447 constraints, problems are : Problem set: 0 solved, 3 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 383/383 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 131/150 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/222 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/226 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 142/368 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/372 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/383 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 683/1066 variables, 383/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1066 variables, 3/450 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 01:38:20] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:20] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:20] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1066 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1066 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1066 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1066/1066 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1757ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1260 ms.
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 683/683 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 383 transition count 682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 382 transition count 682
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 382 transition count 680
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 6 place count 380 transition count 680
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 380 transition count 680
Applied a total of 7 rules in 32 ms. Remains 380 /383 variables (removed 3) and now considering 680/683 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 380/383 places, 680/683 transitions.
RANDOM walk for 40000 steps (651 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (218 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 561247 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 2
Probabilistic random walk after 561247 steps, saw 138639 distinct states, run finished after 3028 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 680 rows 380 cols
[2025-05-30 01:38:25] [INFO ] Computed 64 invariants in 7 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 112/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/199 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/204 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/357 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/361 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/380 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 680/1060 variables, 380/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1060 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1060 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1060/1060 variables, and 444 constraints, problems are : Problem set: 0 solved, 2 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 380/380 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) 9/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 112/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/199 variables, 10/19 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 01:38:25] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/204 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 153/357 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/361 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 19/380 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/380 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 680/1060 variables, 380/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1060 variables, 2/447 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 01:38:26] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:26] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:26] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1060 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1060 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1060 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1060/1060 variables, and 450 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1637ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 680/680 transitions.
Applied a total of 0 rules in 11 ms. Remains 380 /380 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 380/380 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 680/680 transitions.
Applied a total of 0 rules in 9 ms. Remains 380 /380 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2025-05-30 01:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:27] [INFO ] Implicit Places using invariants in 279 ms returned [19, 20, 33, 69, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 266, 277, 278, 279, 297, 319, 320, 321, 322]
[2025-05-30 01:38:27] [INFO ] Actually due to overlaps returned [297, 279, 171, 33, 154, 151, 277, 319, 152, 278, 320, 262, 263, 19, 20, 69, 189, 321, 266, 322]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 281 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/380 places, 680/680 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 358 transition count 643
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 321 transition count 641
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 78 place count 321 transition count 626
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 109 place count 305 transition count 626
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 301 transition count 618
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 129 place count 293 transition count 618
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 290 transition count 615
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 290 transition count 615
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 138 place count 290 transition count 612
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 168 place count 275 transition count 597
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 170 place count 273 transition count 595
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 273 transition count 595
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 174 place count 273 transition count 593
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 178 place count 271 transition count 594
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 182 place count 271 transition count 590
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 187 place count 266 transition count 590
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 191 place count 266 transition count 590
Applied a total of 191 rules in 65 ms. Remains 266 /360 variables (removed 94) and now considering 590/680 (removed 90) transitions.
// Phase 1: matrix 590 rows 266 cols
[2025-05-30 01:38:27] [INFO ] Computed 36 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:27] [INFO ] Implicit Places using invariants in 198 ms returned [82, 102, 110, 116, 117, 120, 121, 174, 190, 196, 199, 201]
[2025-05-30 01:38:27] [INFO ] Actually due to overlaps returned [120, 121, 117, 190, 196, 201, 82, 102, 110, 116, 174]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 200 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/380 places, 590/680 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 249 transition count 584
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 249 transition count 584
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 246 transition count 581
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 246 transition count 581
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 244 transition count 579
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 244 transition count 579
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 243 transition count 578
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 243 transition count 578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 242 transition count 577
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 242 transition count 577
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 34 place count 238 transition count 573
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 238 transition count 567
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 232 transition count 567
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 232 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 230 transition count 565
Applied a total of 50 rules in 60 ms. Remains 230 /255 variables (removed 25) and now considering 565/590 (removed 25) transitions.
// Phase 1: matrix 565 rows 230 cols
[2025-05-30 01:38:27] [INFO ] Computed 25 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:27] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 01:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:28] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 230/380 places, 565/680 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1188 ms. Remains : 230/380 places, 565/680 transitions.
RANDOM walk for 40000 steps (996 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (243 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (338 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 17015 steps, run visited all 2 properties in 77 ms. (steps per millisecond=220 )
Probabilistic random walk after 17015 steps, saw 10418 distinct states, run finished after 82 ms. (steps per millisecond=207 ) properties seen :2
FORMULA ASLink-PT-02b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1046 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1045 transition count 1113
Reduce places removed 184 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 189 rules applied. Total rules applied 373 place count 861 transition count 1108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 376 place count 858 transition count 1108
Performed 279 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 279 Pre rules applied. Total rules applied 376 place count 858 transition count 829
Deduced a syphon composed of 279 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 3 with 581 rules applied. Total rules applied 957 place count 556 transition count 829
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 975 place count 554 transition count 813
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 991 place count 538 transition count 813
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 991 place count 538 transition count 805
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1015 place count 522 transition count 805
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1015 place count 522 transition count 797
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1031 place count 514 transition count 797
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1033 place count 512 transition count 795
Iterating global reduction 5 with 2 rules applied. Total rules applied 1035 place count 512 transition count 795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1036 place count 511 transition count 794
Iterating global reduction 5 with 1 rules applied. Total rules applied 1037 place count 511 transition count 794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1038 place count 510 transition count 793
Iterating global reduction 5 with 1 rules applied. Total rules applied 1039 place count 510 transition count 793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 173 rules applied. Total rules applied 1212 place count 422 transition count 708
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1215 place count 419 transition count 705
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 1219 place count 418 transition count 705
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 1220 place count 418 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1221 place count 417 transition count 704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1221 place count 417 transition count 703
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 1223 place count 416 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 415 transition count 702
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 415 transition count 702
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 1227 place count 415 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1228 place count 414 transition count 700
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1234 place count 411 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1235 place count 410 transition count 726
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 1241 place count 406 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1243 place count 404 transition count 724
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1243 place count 404 transition count 718
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 13 rules applied. Total rules applied 1256 place count 397 transition count 718
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 1261 place count 392 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1261 place count 392 transition count 717
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1263 place count 391 transition count 717
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 12 with 14 rules applied. Total rules applied 1277 place count 384 transition count 710
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1281 place count 380 transition count 706
Iterating global reduction 12 with 4 rules applied. Total rules applied 1285 place count 380 transition count 706
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1287 place count 378 transition count 704
Iterating global reduction 12 with 2 rules applied. Total rules applied 1289 place count 378 transition count 704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1291 place count 378 transition count 702
Applied a total of 1291 rules in 179 ms. Remains 378 /1046 variables (removed 668) and now considering 702/1298 (removed 596) transitions.
// Phase 1: matrix 702 rows 378 cols
[2025-05-30 01:38:29] [INFO ] Computed 63 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:29] [INFO ] Implicit Places using invariants in 275 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 260, 271, 272, 274, 292, 313, 314, 315, 316, 377]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 277 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/1046 places, 702/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 352 transition count 660
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 310 transition count 660
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 84 place count 310 transition count 645
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 115 place count 294 transition count 645
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 161 place count 271 transition count 622
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 266 transition count 635
Applied a total of 171 rules in 26 ms. Remains 266 /352 variables (removed 86) and now considering 635/702 (removed 67) transitions.
[2025-05-30 01:38:29] [INFO ] Flow matrix only has 631 transitions (discarded 4 similar events)
// Phase 1: matrix 631 rows 266 cols
[2025-05-30 01:38:29] [INFO ] Computed 36 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:29] [INFO ] Implicit Places using invariants in 184 ms returned [88, 94, 99, 174, 180, 185, 249, 252, 255, 258, 261]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 186 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 255/1046 places, 635/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 255 transition count 631
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 251 transition count 631
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 243 transition count 616
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 243 transition count 616
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 243 transition count 610
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 34 place count 239 transition count 606
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 239 transition count 606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 237 transition count 604
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 237 transition count 604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 235 transition count 602
Applied a total of 46 rules in 29 ms. Remains 235 /255 variables (removed 20) and now considering 602/635 (removed 33) transitions.
[2025-05-30 01:38:29] [INFO ] Flow matrix only has 598 transitions (discarded 4 similar events)
// Phase 1: matrix 598 rows 235 cols
[2025-05-30 01:38:29] [INFO ] Computed 25 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:29] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 01:38:29] [INFO ] Flow matrix only has 598 transitions (discarded 4 similar events)
[2025-05-30 01:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 01:38:30] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 235/1046 places, 602/1298 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1435 ms. Remains : 235/1046 places, 602/1298 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-01
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-02b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-01 finished in 1648 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&&X(F(p1))) U X((F(!p2) U p3)))))'
Support contains 6 out of 1046 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1043 transition count 1295
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1043 transition count 1295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 1043 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1042 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1042 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 1042 transition count 1292
Applied a total of 10 rules in 92 ms. Remains 1042 /1046 variables (removed 4) and now considering 1292/1298 (removed 6) transitions.
// Phase 1: matrix 1292 rows 1042 cols
[2025-05-30 01:38:30] [INFO ] Computed 110 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:31] [INFO ] Implicit Places using invariants in 541 ms returned []
[2025-05-30 01:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:33] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2551 ms to find 0 implicit places.
Running 1291 sub problems to find dead transitions.
[2025-05-30 01:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1041 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1041/2334 variables, and 65 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1042 constraints, PredecessorRefiner: 1291/1291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1041 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
(s495 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 13)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 3)
(s45 1)
(s46 1)
(s47 6)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 10)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 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 0)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 5)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 9)
(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 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 1)
(s269 1)
(s270 0)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 1)
(s281 1)
(s282 0)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 1)
(s305 1)
(s306 0)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 0)
(s337 1)
(s338 1)
(s339 0)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 0)
(s348 1)
(s349 1)
(s350 0)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 0)
(s361 4)
(s362 0)
(s363 0)
(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 31)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 5)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 5)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 2)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 4)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 101)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 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 0)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 0)
(s453 1)
(s454 1)
(s455 0)
(s456 0)
(s457 1)
(s458 1)
(s459 0)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 1)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 1)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1041/2334 variables, and 65 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1042 constraints, PredecessorRefiner: 0/1291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1291 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 1042/1046 places, 1292/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63116 ms. Remains : 1042/1046 places, 1292/1298 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), p2, (AND p2 (NOT p1))]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 327 ms.
Product exploration explored 100000 steps with 33333 reset in 294 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 28 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02b-LTLCardinality-02 finished in 64169 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))'
Support contains 2 out of 1046 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1042 transition count 1294
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1042 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 1042 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1041 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1041 transition count 1292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 1041 transition count 1291
Applied a total of 12 rules in 97 ms. Remains 1041 /1046 variables (removed 5) and now considering 1291/1298 (removed 7) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2025-05-30 01:39:34] [INFO ] Computed 110 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:35] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-05-30 01:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:37] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 3043 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2025-05-30 01:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
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 13.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 3.0)
(s46 1.0)
(s47 6.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 10.0)
(s58 1.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 0.0)
(s99 5.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1046 places, 1291/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63492 ms. Remains : 1041/1046 places, 1291/1298 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-03 finished in 63624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 1046 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1043 transition count 1295
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1043 transition count 1295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 1043 transition count 1294
Applied a total of 7 rules in 51 ms. Remains 1043 /1046 variables (removed 3) and now considering 1294/1298 (removed 4) transitions.
// Phase 1: matrix 1294 rows 1043 cols
[2025-05-30 01:40:38] [INFO ] Computed 110 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:40:38] [INFO ] Implicit Places using invariants in 577 ms returned []
[2025-05-30 01:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:40:41] [INFO ] Implicit Places using invariants and state equation in 2909 ms returned []
Implicit Place search using SMT with State Equation took 3487 ms to find 0 implicit places.
Running 1293 sub problems to find dead transitions.
[2025-05-30 01:40:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/2337 variables, and 62 constraints, problems are : Problem set: 0 solved, 1293 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 62/83 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 1293/1293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1042 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/2337 variables, and 62 constraints, problems are : Problem set: 0 solved, 1293 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 62/83 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 0/1293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 1293 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 1043/1046 places, 1294/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63822 ms. Remains : 1043/1046 places, 1294/1298 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-09
Stuttering criterion allowed to conclude after 485 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-09 finished in 64024 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)&&F(G(p1)))))'
Support contains 4 out of 1046 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1045 transition count 1113
Reduce places removed 184 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 189 rules applied. Total rules applied 373 place count 861 transition count 1108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 376 place count 858 transition count 1108
Performed 278 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 278 Pre rules applied. Total rules applied 376 place count 858 transition count 830
Deduced a syphon composed of 278 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 3 with 579 rules applied. Total rules applied 955 place count 557 transition count 830
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 17 rules applied. Total rules applied 972 place count 555 transition count 815
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 16 rules applied. Total rules applied 988 place count 540 transition count 814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 989 place count 539 transition count 814
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 989 place count 539 transition count 806
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1013 place count 523 transition count 806
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1013 place count 523 transition count 798
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1029 place count 515 transition count 798
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1032 place count 512 transition count 795
Iterating global reduction 6 with 3 rules applied. Total rules applied 1035 place count 512 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1036 place count 512 transition count 794
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1036 place count 512 transition count 792
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 1041 place count 509 transition count 792
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1041 place count 509 transition count 791
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1044 place count 507 transition count 791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1045 place count 506 transition count 790
Iterating global reduction 7 with 1 rules applied. Total rules applied 1046 place count 506 transition count 790
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1047 place count 505 transition count 789
Iterating global reduction 7 with 1 rules applied. Total rules applied 1048 place count 505 transition count 789
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 164 rules applied. Total rules applied 1212 place count 422 transition count 708
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1215 place count 419 transition count 705
Ensure Unique test removed 1 places
Iterating global reduction 7 with 4 rules applied. Total rules applied 1219 place count 418 transition count 705
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 1 rules applied. Total rules applied 1220 place count 418 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1221 place count 417 transition count 704
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1221 place count 417 transition count 703
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1223 place count 416 transition count 703
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1224 place count 415 transition count 702
Iterating global reduction 9 with 1 rules applied. Total rules applied 1225 place count 415 transition count 702
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 9 with 2 rules applied. Total rules applied 1227 place count 415 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1228 place count 414 transition count 700
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 11 with 2 rules applied. Total rules applied 1230 place count 413 transition count 705
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1232 place count 411 transition count 703
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1238 place count 407 transition count 701
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1240 place count 405 transition count 701
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1240 place count 405 transition count 695
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1253 place count 398 transition count 695
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 1258 place count 393 transition count 695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1258 place count 393 transition count 694
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1260 place count 392 transition count 694
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 14 with 14 rules applied. Total rules applied 1274 place count 385 transition count 687
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1278 place count 381 transition count 683
Iterating global reduction 14 with 4 rules applied. Total rules applied 1282 place count 381 transition count 683
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1284 place count 379 transition count 681
Iterating global reduction 14 with 2 rules applied. Total rules applied 1286 place count 379 transition count 681
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1288 place count 379 transition count 679
Applied a total of 1288 rules in 163 ms. Remains 379 /1046 variables (removed 667) and now considering 679/1298 (removed 619) transitions.
// Phase 1: matrix 679 rows 379 cols
[2025-05-30 01:41:42] [INFO ] Computed 62 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:42] [INFO ] Implicit Places using invariants in 357 ms returned [19, 20, 33, 69, 89, 140, 150, 151, 153, 170, 188, 208, 259, 260, 263, 274, 275, 276, 294, 316, 317, 318, 319]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 359 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/1046 places, 679/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 356 transition count 644
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 321 transition count 644
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 70 place count 321 transition count 629
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 306 transition count 629
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 303 transition count 623
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 297 transition count 623
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 295 transition count 621
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 295 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 295 transition count 619
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 157 place count 277 transition count 601
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 5 with 4 rules applied. Total rules applied 161 place count 275 transition count 602
Applied a total of 161 rules in 32 ms. Remains 275 /356 variables (removed 81) and now considering 602/679 (removed 77) transitions.
// Phase 1: matrix 602 rows 275 cols
[2025-05-30 01:41:42] [INFO ] Computed 36 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:43] [INFO ] Implicit Places using invariants in 372 ms returned [100, 108, 114, 189, 195, 200, 268, 272]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 373 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 267/1046 places, 602/1298 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 267 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 266 transition count 601
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 262 transition count 597
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 262 transition count 597
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 258 transition count 593
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 258 transition count 593
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 255 transition count 590
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 255 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 254 transition count 589
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 254 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 253 transition count 588
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 253 transition count 588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 251 transition count 586
Applied a total of 32 rules in 29 ms. Remains 251 /267 variables (removed 16) and now considering 586/602 (removed 16) transitions.
// Phase 1: matrix 586 rows 251 cols
[2025-05-30 01:41:43] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:43] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-30 01:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:43] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 251/1046 places, 586/1298 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1545 ms. Remains : 251/1046 places, 586/1298 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-11
Product exploration explored 100000 steps with 2324 reset in 186 ms.
Stack based approach found an accepted trace after 10198 steps with 203 reset with depth 19 and stack size 19 in 20 ms.
FORMULA ASLink-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-11 finished in 1859 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(F(p1))))))'
Support contains 4 out of 1046 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1046/1046 places, 1298/1298 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1042 transition count 1294
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1042 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 1042 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1041 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1041 transition count 1292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 1041 transition count 1291
Applied a total of 12 rules in 71 ms. Remains 1041 /1046 variables (removed 5) and now considering 1291/1298 (removed 7) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2025-05-30 01:41:44] [INFO ] Computed 110 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:44] [INFO ] Implicit Places using invariants in 571 ms returned []
[2025-05-30 01:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:47] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2819 ms to find 0 implicit places.
Running 1290 sub problems to find dead transitions.
[2025-05-30 01:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1040 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/2332 variables, and 65 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 65/80 constraints, State Equation: 0/1041 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 1041/1046 places, 1291/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63181 ms. Remains : 1041/1046 places, 1291/1298 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-02b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-LTLCardinality-15 finished in 63390 ms.
All properties solved by simple procedures.
Total runtime 282689 ms.

BK_STOP 1748569367549

--------------------
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-02b"
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-02b, 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-174853729000307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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