Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200379.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 677K Mar 3 18:30 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-07a-LTLCardinality-00
FORMULA_NAME ASLink-PT-07a-LTLCardinality-01
FORMULA_NAME ASLink-PT-07a-LTLCardinality-02
FORMULA_NAME ASLink-PT-07a-LTLCardinality-03
FORMULA_NAME ASLink-PT-07a-LTLCardinality-04
FORMULA_NAME ASLink-PT-07a-LTLCardinality-05
FORMULA_NAME ASLink-PT-07a-LTLCardinality-06
FORMULA_NAME ASLink-PT-07a-LTLCardinality-07
FORMULA_NAME ASLink-PT-07a-LTLCardinality-08
FORMULA_NAME ASLink-PT-07a-LTLCardinality-09
FORMULA_NAME ASLink-PT-07a-LTLCardinality-10
FORMULA_NAME ASLink-PT-07a-LTLCardinality-11
FORMULA_NAME ASLink-PT-07a-LTLCardinality-12
FORMULA_NAME ASLink-PT-07a-LTLCardinality-13
FORMULA_NAME ASLink-PT-07a-LTLCardinality-14
FORMULA_NAME ASLink-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779480516755

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 20:08:37] [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]
[2026-05-22 20:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:08:38] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2026-05-22 20:08:38] [INFO ] Transformed 1601 places.
[2026-05-22 20:08:38] [INFO ] Transformed 2373 transitions.
[2026-05-22 20:08:38] [INFO ] Found NUPN structural information;
[2026-05-22 20:08:38] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA ASLink-PT-07a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-07a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1559 transition count 2348
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 54 place count 1547 transition count 2293
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 1546 transition count 2293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 1546 transition count 2291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1545 transition count 2283
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1545 transition count 2283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1544 transition count 2275
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1544 transition count 2275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1543 transition count 2267
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1543 transition count 2267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1542 transition count 2259
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1542 transition count 2259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1541 transition count 2251
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1541 transition count 2251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1540 transition count 2243
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1540 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1539 transition count 2235
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1539 transition count 2235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1538 transition count 2227
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1538 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1537 transition count 2219
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1537 transition count 2219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1536 transition count 2211
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1536 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1535 transition count 2203
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1535 transition count 2203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1534 transition count 2195
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1534 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1533 transition count 2187
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1533 transition count 2187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1532 transition count 2179
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1532 transition count 2179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1531 transition count 2171
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1531 transition count 2171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1530 transition count 2163
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1530 transition count 2163
Applied a total of 101 rules in 1377 ms. Remains 1530 /1601 variables (removed 71) and now considering 2163/2348 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4709690797721103117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-594717695432279293.kers'
[2026-05-22 20:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4709690797721103117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-594717695432279293.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2163 rows 1530 cols 8045 entries
Finished phase 1 with 620 SingleSign rule and 645 generalized
[2026-05-22 20:08:40] [INFO ] Computed 265 invariants in 19 ms
Computed 265 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-594717695432279293.kers
Total runtime 22 ms.
[2026-05-22 20:08:41] [INFO ] Implicit Places using invariants in 1488 ms returned [19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 966, 971, 972, 973, 991, 1009, 1138, 1154, 1159, 1160, 1161, 1179, 1197, 1326, 1331, 1343, 1348, 1349, 1350, 1368, 1370, 1373, 1391, 1392, 1393, 1394, 1411, 1419, 1427, 1433, 1439, 1445, 1451, 1459, 1465, 1471, 1479]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1522 ms to find 72 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1458/1601 places, 2163/2348 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1445 transition count 2150
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1445 transition count 2150
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1435 transition count 2140
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1435 transition count 2140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1431 transition count 2136
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1431 transition count 2136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1429 transition count 2134
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1429 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1428 transition count 2133
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1428 transition count 2133
Applied a total of 60 rules in 274 ms. Remains 1428 /1458 variables (removed 30) and now considering 2133/2163 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12438433582590883671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2527962081646668349.kers'
[2026-05-22 20:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12438433582590883671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2527962081646668349.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2133 rows 1428 cols 7409 entries
Finished phase 1 with 941 SingleSign rule and 294 generalized
[2026-05-22 20:08:41] [INFO ] Computed 193 invariants in 13 ms
Computed 193 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2527962081646668349.kers
Total runtime 17 ms.
[2026-05-22 20:08:42] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2026-05-22 20:08:42] [INFO ] Invariant cache hit.
[2026-05-22 20:08:45] [INFO ] Implicit Places using invariants and state equation in 3058 ms returned []
Implicit Place search using SMT with State Equation took 4149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1428/1601 places, 2133/2348 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7334 ms. Remains : 1428/1601 places, 2133/2348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Applied a total of 0 rules in 40 ms. Remains 1428 /1428 variables (removed 0) and now considering 2133/2133 (removed 0) transitions.
[2026-05-22 20:08:45] [INFO ] Invariant cache hit.
[2026-05-22 20:08:46] [INFO ] Implicit Places using invariants in 904 ms returned []
[2026-05-22 20:08:46] [INFO ] Invariant cache hit.
[2026-05-22 20:08:49] [INFO ] Implicit Places using invariants and state equation in 3076 ms returned []
Implicit Place search using SMT with State Equation took 3996 ms to find 0 implicit places.
Running 2132 sub problems to find dead transitions.
[2026-05-22 20:08:50] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 67.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 5.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 40.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.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 1.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 6.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 11.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 11.0)
(s133 11.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 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 7.0)
(s152 1.0)
(s153 1.0)
(s154 7.0)
(s155 1.0)
(s156 1.0)
(s157 7.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 11.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 15.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 15.0)
(s174 1.0)
(s175 15.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 6.0)
(s201 1.0)
(s202 1.0)
(s203 2.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 35.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 40.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 3.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 11.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 11.0)
(s314 11.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 7.0)
(s333 1.0)
(s334 1.0)
(s335 7.0)
(s336 1.0)
(s337 1.0)
(s338 7.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 11.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 2132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1427/3561 variables, and 151 constraints, problems are : Problem set: 0 solved, 2132 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 151/160 constraints, State Equation: 0/1428 constraints, PredecessorRefiner: 2132/2132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 2132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1427/3561 variables, and 151 constraints, problems are : Problem set: 0 solved, 2132 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 151/160 constraints, State Equation: 0/1428 constraints, PredecessorRefiner: 0/2132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61120ms problems are : Problem set: 0 solved, 2132 unsolved
Search for dead transitions found 0 dead transitions in 61167ms
Finished structural reductions in LTL mode , in 1 iterations and 65272 ms. Remains : 1428/1428 places, 2133/2133 transitions.
Support contains 15 out of 1428 places after structural reductions.
[2026-05-22 20:09:51] [INFO ] Flatten gal took : 176 ms
[2026-05-22 20:09:51] [INFO ] Flatten gal took : 90 ms
[2026-05-22 20:09:51] [INFO ] Input system was already deterministic with 2133 transitions.
RANDOM walk for 40000 steps (219 resets) in 1415 ms. (28 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
[2026-05-22 20:09:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 493/607 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 821/1428 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2133/3561 variables, 1428/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3561 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3561/3561 variables, and 1621 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 160/160 constraints, State Equation: 1428/1428 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
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 493/607 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 821/1428 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2133/3561 variables, 1428/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 3/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3561 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3561/3561 variables, and 1624 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3411 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 160/160 constraints, State Equation: 1428/1428 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5347ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2372 ms.
Support contains 4 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1428 transition count 1854
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1149 transition count 1854
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 190 Pre rules applied. Total rules applied 558 place count 1149 transition count 1664
Deduced a syphon composed of 190 places in 2 ms
Ensure Unique test removed 60 places
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 998 place count 899 transition count 1664
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 21 rules applied. Total rules applied 1019 place count 887 transition count 1655
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1028 place count 878 transition count 1655
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1028 place count 878 transition count 1627
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1084 place count 850 transition count 1627
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1090 place count 844 transition count 1621
Iterating global reduction 4 with 6 rules applied. Total rules applied 1096 place count 844 transition count 1621
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1100 place count 844 transition count 1617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1101 place count 843 transition count 1617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1101 place count 843 transition count 1616
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1103 place count 842 transition count 1616
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 5 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 1259 place count 764 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1260 place count 763 transition count 1537
Iterating global reduction 6 with 1 rules applied. Total rules applied 1261 place count 763 transition count 1537
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1268 place count 763 transition count 1530
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1275 place count 756 transition count 1530
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1303 place count 756 transition count 1502
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1332 place count 727 transition count 1502
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 1339 place count 727 transition count 1495
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1361 place count 727 transition count 1495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1362 place count 726 transition count 1494
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1369 place count 719 transition count 1494
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1369 place count 719 transition count 1480
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1404 place count 698 transition count 1480
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1411 place count 691 transition count 1473
Iterating global reduction 9 with 7 rules applied. Total rules applied 1418 place count 691 transition count 1473
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1425 place count 691 transition count 1466
Applied a total of 1425 rules in 478 ms. Remains 691 /1428 variables (removed 737) and now considering 1466/2133 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 691/1428 places, 1466/2133 transitions.
RANDOM walk for 40000 steps (639 resets) in 447 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (110 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (108 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 418125 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :2 out of 3
Probabilistic random walk after 418125 steps, saw 102281 distinct states, run finished after 3011 ms. (steps per millisecond=138 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3630781751083788907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16657557115310095330.kers'
[2026-05-22 20:10:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3630781751083788907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16657557115310095330.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 1466 rows 685 cols 5993 entries
Finished phase 1 with 253 SingleSign rule and 332 generalized
[2026-05-22 20:10:03] [INFO ] Computed 106 invariants in 13 ms
Computed 106 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-16657557115310095330.kers
Total runtime 28 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/166 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/280 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/340 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/371 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/495 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/555 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/555 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 31/586 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 79/665 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/665 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 23/688 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 3/691 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/691 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1466/2157 variables, 691/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2157 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2157 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2157/2157 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/166 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/280 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/340 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/371 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/495 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/555 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/555 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 31/586 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 79/665 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/665 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 23/688 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 3/691 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/691 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1466/2157 variables, 691/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2157 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2157 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/2157 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2157/2157 variables, and 798 constraints, problems are : Problem set: 0 solved, 1 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1984ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1466/1466 transitions.
Applied a total of 0 rules in 28 ms. Remains 691 /691 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 691/691 places, 1466/1466 transitions.
RANDOM walk for 40000 steps (604 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393365 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393365 steps, saw 97681 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2026-05-22 20:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/166 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/280 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/340 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/371 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/495 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/555 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/555 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 31/586 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 79/665 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/665 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 23/688 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 3/691 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/691 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1466/2157 variables, 691/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2157 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2157 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2157/2157 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/39 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/56 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/166 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 31/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/280 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/340 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/371 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/495 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/555 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/555 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 31/586 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/586 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 79/665 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/665 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 23/688 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 3/691 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/691 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1466/2157 variables, 691/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2157 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2157 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/2157 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2157/2157 variables, and 798 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 73/73 constraints, State Equation: 691/691 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2494ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1466/1466 transitions.
Applied a total of 0 rules in 24 ms. Remains 691 /691 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 691/691 places, 1466/1466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1466/1466 transitions.
Applied a total of 0 rules in 24 ms. Remains 691 /691 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
[2026-05-22 20:10:11] [INFO ] Invariant cache hit.
[2026-05-22 20:10:12] [INFO ] Implicit Places using invariants in 664 ms returned [0, 75, 92, 98, 101, 103, 104, 109, 110, 162, 179, 185, 188, 190, 191, 196, 197, 249, 266, 272, 275, 277, 278, 283, 284, 336, 355, 361, 364, 366, 367, 372, 373, 425, 442, 448, 451, 453, 454, 459, 460, 512, 529, 535, 538, 540, 541, 546, 547, 599, 616, 622, 625, 627, 628]
[2026-05-22 20:10:12] [INFO ] Actually due to overlaps returned [191, 278, 367, 454, 541, 628, 0, 92, 98, 103, 179, 185, 190, 266, 272, 277, 355, 361, 366, 442, 448, 453, 529, 535, 540, 616, 622, 627, 75, 104, 162, 249, 336, 425, 512, 599]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 668 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 655/691 places, 1466/1466 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 655 transition count 1464
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 653 transition count 1464
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 33 place count 624 transition count 1435
Iterating global reduction 2 with 29 rules applied. Total rules applied 62 place count 624 transition count 1435
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 2 with 1 rules applied. Total rules applied 63 place count 624 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 623 transition count 1434
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 71 place count 616 transition count 1427
Iterating global reduction 4 with 7 rules applied. Total rules applied 78 place count 616 transition count 1427
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 106 place count 602 transition count 1413
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 127 place count 602 transition count 1392
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 148 place count 581 transition count 1392
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 155 place count 581 transition count 1385
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 162 place count 574 transition count 1385
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 574 transition count 1385
Applied a total of 163 rules in 141 ms. Remains 574 /655 variables (removed 81) and now considering 1385/1466 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13715160747942975350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14180613667494067119.kers'
[2026-05-22 20:10:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13715160747942975350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14180613667494067119.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1385 rows 574 cols 5815 entries
Finished phase 1 with 195 SingleSign rule and 309 generalized
[2026-05-22 20:10:12] [INFO ] Computed 70 invariants in 17 ms
Computed 70 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-14180613667494067119.kers
Total runtime 19 ms.
[2026-05-22 20:10:13] [INFO ] Implicit Places using invariants in 519 ms returned [88, 89, 159, 160, 230, 231, 303, 304, 374, 375, 445, 446]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 524 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 562/691 places, 1385/1466 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1385 ms. Remains : 562/691 places, 1385/1466 transitions.
RANDOM walk for 40000 steps (706 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (136 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 367060 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367060 steps, saw 244629 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8321605909283655331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10896942417301731413.kers'
[2026-05-22 20:10:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8321605909283655331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10896942417301731413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1385 rows 562 cols 5653 entries
Finished phase 1 with 195 SingleSign rule and 309 generalized
[2026-05-22 20:10:16] [INFO ] Computed 58 invariants in 9 ms
Computed 58 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10896942417301731413.kers
Total runtime 14 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/52 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/93 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/305 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 93/398 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/427 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/433 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/561 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/562 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1947 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/52 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/93 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 108/305 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 93/398 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/427 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/433 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/561 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/562 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1385/1947 variables, 562/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1947 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1974ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 562/562 places, 1385/1385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 1385/1385 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
[2026-05-22 20:10:18] [INFO ] Invariant cache hit.
[2026-05-22 20:10:18] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-05-22 20:10:18] [INFO ] Invariant cache hit.
[2026-05-22 20:10:20] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2026-05-22 20:10:20] [INFO ] Redundant transitions in 134 ms returned []
Running 1351 sub problems to find dead transitions.
[2026-05-22 20:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1947 variables, and 56 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1351 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 561/1947 variables, and 56 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62194 ms. Remains : 562/562 places, 1385/1385 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 1385/1385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 20:11:20] [INFO ] Invariant cache hit.
[2026-05-22 20:11:20] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2026-05-22 20:11:20] [INFO ] [Real]Absence check using 30 positive and 28 generalized place invariants in 27 ms returned sat
[2026-05-22 20:11:21] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:11:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2026-05-22 20:11:21] [INFO ] [Nat]Absence check using 30 positive and 28 generalized place invariants in 13 ms returned sat
[2026-05-22 20:11:21] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:11:21] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:11:21] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1194 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)) U (p2&&X(X(F(p3)))))))'
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Applied a total of 0 rules in 36 ms. Remains 1428 /1428 variables (removed 0) and now considering 2133/2133 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15895122921922317004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-937051719784386926.kers'
[2026-05-22 20:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15895122921922317004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-937051719784386926.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2133 rows 1428 cols 7409 entries
Finished phase 1 with 941 SingleSign rule and 294 generalized
[2026-05-22 20:11:21] [INFO ] Computed 193 invariants in 13 ms
Computed 193 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-937051719784386926.kers
Total runtime 15 ms.
[2026-05-22 20:11:22] [INFO ] Implicit Places using invariants in 870 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 875 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1427/1428 places, 2133/2133 transitions.
Applied a total of 0 rules in 38 ms. Remains 1427 /1427 variables (removed 0) and now considering 2133/2133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 949 ms. Remains : 1427/1428 places, 2133/2133 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)&&p1) U (p2&&X(X(F(p3)))))))'
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p0), (NOT p3), (NOT p3)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-00
Product exploration explored 100000 steps with 25000 reset in 646 ms.
Product exploration explored 100000 steps with 25000 reset in 668 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 11 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 2319 steps (9 resets) in 14 ms. (154 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 315 ms.
Stuttering acceptance computed with spot in 132 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 2 out of 1427 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1427/1427 places, 2133/2133 transitions.
Applied a total of 0 rules in 38 ms. Remains 1427 /1427 variables (removed 0) and now considering 2133/2133 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15542602063540094634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4442297751572702121.kers'
[2026-05-22 20:11:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15542602063540094634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4442297751572702121.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2133 rows 1427 cols 7403 entries
Finished phase 1 with 945 SingleSign rule and 290 generalized
[2026-05-22 20:11:25] [INFO ] Computed 192 invariants in 13 ms
Computed 192 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4442297751572702121.kers
Total runtime 16 ms.
[2026-05-22 20:11:25] [INFO ] Implicit Places using invariants in 897 ms returned []
[2026-05-22 20:11:25] [INFO ] Invariant cache hit.
[2026-05-22 20:11:29] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 4874 ms to find 0 implicit places.
Running 2132 sub problems to find dead transitions.
[2026-05-22 20:11:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1426 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 2132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1426/3560 variables, and 150 constraints, problems are : Problem set: 0 solved, 2132 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 150/159 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 2132/2132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1426 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 2132 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1426/3560 variables, and 150 constraints, problems are : Problem set: 0 solved, 2132 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 150/159 constraints, State Equation: 0/1427 constraints, PredecessorRefiner: 0/2132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60660ms problems are : Problem set: 0 solved, 2132 unsolved
Search for dead transitions found 0 dead transitions in 60664ms
Finished structural reductions in LTL mode , in 1 iterations and 65580 ms. Remains : 1427/1427 places, 2133/2133 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 1348 steps (6 resets) in 10 ms. (122 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 45 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 274 ms.
Stuttering acceptance computed with spot in 141 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 25000 reset in 513 ms.
Product exploration explored 100000 steps with 25000 reset in 544 ms.
Spot run failed in 131 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4694157426974750156
[2026-05-22 20:12:32] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4694157426974750156
Running compilation step : cd /tmp/ltsmin4694157426974750156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4694157426974750156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4694157426974750156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1427/1427 places, 2133/2133 transitions.
Applied a total of 0 rules in 79 ms. Remains 1427 /1427 variables (removed 0) and now considering 2133/2133 (removed 0) transitions.
[2026-05-22 20:12:35] [INFO ] Invariant cache hit.
[2026-05-22 20:12:36] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2026-05-22 20:12:36] [INFO ] Invariant cache hit.
[2026-05-22 20:12:40] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 4954 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5034 ms. Remains : 1427/1427 places, 2133/2133 transitions.
Built C files in :
/tmp/ltsmin17355531372002470227
[2026-05-22 20:12:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17355531372002470227
Running compilation step : cd /tmp/ltsmin17355531372002470227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17355531372002470227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17355531372002470227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:12:43] [INFO ] Flatten gal took : 90 ms
[2026-05-22 20:12:43] [INFO ] Flatten gal took : 60 ms
[2026-05-22 20:12:43] [INFO ] Time to serialize gal into /tmp/LTL10532243761910507482.gal : 19 ms
[2026-05-22 20:12:43] [INFO ] Time to serialize properties into /tmp/LTL5376267588567184852.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10532243761910507482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18013944417897411304.hoa' '-atoms' '/tmp/LTL5376267588567184852.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5376267588567184852.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18013944417897411304.hoa
Detected timeout of ITS tools.
[2026-05-22 20:12:59] [INFO ] Flatten gal took : 48 ms
[2026-05-22 20:12:59] [INFO ] Flatten gal took : 47 ms
[2026-05-22 20:12:59] [INFO ] Time to serialize gal into /tmp/LTL13712484047841988404.gal : 15 ms
[2026-05-22 20:12:59] [INFO ] Time to serialize properties into /tmp/LTL9979147239997873213.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13712484047841988404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9979147239997873213.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((G("((p804==0)||(p1126==1))"))&&("(((p703==1)||(p804==0))||(p1126==1))"))U(("(p703!=1)")&&(X(X(F("((p1133==0)||(p1493==1))")))))...158
Formula 0 simplified : X((!"(((p703==1)||(p804==0))||(p1126==1))" | F!"((p804==0)||(p1126==1))") R (!"(p703!=1)" | XXG!"((p1133==0)||(p1493==1))"))
Detected timeout of ITS tools.
[2026-05-22 20:13:14] [INFO ] Flatten gal took : 41 ms
[2026-05-22 20:13:14] [INFO ] Applying decomposition
[2026-05-22 20:13:14] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5000725508660035701.txt' '-o' '/tmp/graph5000725508660035701.bin' '-w' '/tmp/graph5000725508660035701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5000725508660035701.bin' '-l' '-1' '-v' '-w' '/tmp/graph5000725508660035701.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:13:14] [INFO ] Decomposing Gal with order
[2026-05-22 20:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:13:14] [INFO ] Removed a total of 2855 redundant transitions.
[2026-05-22 20:13:14] [INFO ] Flatten gal took : 214 ms
[2026-05-22 20:13:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 27 ms.
[2026-05-22 20:13:14] [INFO ] Time to serialize gal into /tmp/LTL9537239318176492709.gal : 22 ms
[2026-05-22 20:13:14] [INFO ] Time to serialize properties into /tmp/LTL608000934213142331.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9537239318176492709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL608000934213142331.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(((G("((i6.i1.i0.u224.p804==0)||(i10.u317.p1126==1))"))&&("(((i6.i1.i3.u196.p703==1)||(i6.i1.i0.u224.p804==0))||(i10.u317.p1126==1...250
Formula 0 simplified : X((!"(((i6.i1.i3.u196.p703==1)||(i6.i1.i0.u224.p804==0))||(i10.u317.p1126==1))" | F!"((i6.i1.i0.u224.p804==0)||(i10.u317.p1126==1))"...239
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-00 finished in 128165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1427 transition count 1852
Reduce places removed 287 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 294 rules applied. Total rules applied 574 place count 1140 transition count 1845
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 581 place count 1133 transition count 1845
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 581 place count 1133 transition count 1640
Deduced a syphon composed of 205 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 471 rules applied. Total rules applied 1052 place count 867 transition count 1640
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 42 rules applied. Total rules applied 1094 place count 848 transition count 1617
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 1117 place count 825 transition count 1617
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1117 place count 825 transition count 1588
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1175 place count 796 transition count 1588
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1188 place count 783 transition count 1575
Iterating global reduction 5 with 13 rules applied. Total rules applied 1201 place count 783 transition count 1575
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 1212 place count 783 transition count 1564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1213 place count 782 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1213 place count 782 transition count 1563
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 1215 place count 781 transition count 1563
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 1357 place count 710 transition count 1492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1358 place count 709 transition count 1491
Iterating global reduction 7 with 1 rules applied. Total rules applied 1359 place count 709 transition count 1491
Applied a total of 1359 rules in 191 ms. Remains 709 /1428 variables (removed 719) and now considering 1491/2133 (removed 642) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4848956899189863528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16624262862953689107.kers'
[2026-05-22 20:13:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4848956899189863528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16624262862953689107.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1491 rows 709 cols 6044 entries
Finished phase 1 with 286 SingleSign rule and 317 generalized
[2026-05-22 20:13:30] [INFO ] Computed 106 invariants in 19 ms
Computed 106 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-16624262862953689107.kers
Total runtime 21 ms.
[2026-05-22 20:13:30] [INFO ] Implicit Places using invariants in 695 ms returned [76, 93, 99, 104, 163, 180, 186, 191, 193, 253, 270, 276, 281, 283, 343, 360, 366, 371, 373, 433, 450, 456, 461, 463, 523, 540, 546, 551, 553, 613, 630, 636, 641, 643, 706]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 697 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 674/1428 places, 1491/2133 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 674 transition count 1490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 673 transition count 1490
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 659 transition count 1476
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 659 transition count 1476
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 645 transition count 1462
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 645 transition count 1462
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 638 transition count 1455
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 638 transition count 1455
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 100 place count 624 transition count 1441
Applied a total of 100 rules in 106 ms. Remains 624 /674 variables (removed 50) and now considering 1441/1491 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5721287657184917113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18008123890148468724.kers'
[2026-05-22 20:13:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5721287657184917113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18008123890148468724.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1441 rows 624 cols 5810 entries
Finished phase 1 with 284 SingleSign rule and 269 generalized
[2026-05-22 20:13:31] [INFO ] Computed 71 invariants in 29 ms
Computed 71 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-18008123890148468724.kers
Total runtime 31 ms.
[2026-05-22 20:13:31] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-22 20:13:31] [INFO ] Invariant cache hit.
[2026-05-22 20:13:32] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 624/1428 places, 1441/2133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2913 ms. Remains : 624/1428 places, 1441/2133 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-05
Product exploration explored 100000 steps with 1321 reset in 307 ms.
Product exploration explored 100000 steps with 1354 reset in 331 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (514 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (100 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284926 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284926 steps, saw 146617 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-22 20:13:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/80 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/196 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/255 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/314 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/373 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/432 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/461 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/467 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 157/624 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1441/2065 variables, 624/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2065 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2065 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2065/2065 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/80 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/196 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/255 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/314 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/373 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/432 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/461 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/467 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 157/624 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1441/2065 variables, 624/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2065 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2065 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2065 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2065/2065 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1441/1441 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 624 transition count 1413
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 596 transition count 1406
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 596 transition count 1386
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 576 transition count 1386
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 104 place count 576 transition count 1386
Applied a total of 104 rules in 101 ms. Remains 576 /624 variables (removed 48) and now considering 1386/1441 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 576/624 places, 1386/1441 transitions.
RANDOM walk for 40000 steps (701 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (134 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 307091 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 307091 steps, saw 149425 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2556006473295440767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2769861861797671391.kers'
[2026-05-22 20:13:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2556006473295440767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2769861861797671391.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1386 rows 576 cols 5823 entries
Finished phase 1 with 234 SingleSign rule and 271 generalized
[2026-05-22 20:13:42] [INFO ] Computed 71 invariants in 29 ms
Computed 71 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-2769861861797671391.kers
Total runtime 34 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/129 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/184 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/239 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/294 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/349 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/404 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/433 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/439 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/439 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 137/576 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1386/1962 variables, 576/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1962 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1962 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/129 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/184 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/239 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/294 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/349 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/404 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/433 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/439 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/439 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 137/576 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1386/1962 variables, 576/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1962 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1962 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1962 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2324ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14504 steps, including 997 resets, run visited all 1 properties in 40 ms. (steps per millisecond=362 )
Parikh walk visited 1 properties in 48 ms.
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Knowledge-based reduction took 10781 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 1441/1441 transitions.
Applied a total of 0 rules in 38 ms. Remains 624 /624 variables (removed 0) and now considering 1441/1441 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16054195562284671072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6859220100152109300.kers'
[2026-05-22 20:13:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16054195562284671072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6859220100152109300.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1441 rows 624 cols 5810 entries
Finished phase 1 with 284 SingleSign rule and 269 generalized
[2026-05-22 20:13:44] [INFO ] Computed 71 invariants in 27 ms
Computed 71 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-6859220100152109300.kers
Total runtime 31 ms.
[2026-05-22 20:13:45] [INFO ] Implicit Places using invariants in 601 ms returned []
[2026-05-22 20:13:45] [INFO ] Invariant cache hit.
[2026-05-22 20:13:46] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2026-05-22 20:13:46] [INFO ] Redundant transitions in 34 ms returned []
Running 1400 sub problems to find dead transitions.
[2026-05-22 20:13:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/2065 variables, and 69 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/2065 variables, and 69 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60501ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 60503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62584 ms. Remains : 624/624 places, 1441/1441 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (538 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (95 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 299419 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 299419 steps, saw 153491 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-22 20:14:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/80 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/196 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/255 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/314 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/373 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/432 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/461 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/467 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 157/624 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1441/2065 variables, 624/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2065 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2065 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2065/2065 variables, and 695 constraints, problems are : Problem set: 0 solved, 1 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/80 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/137 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/196 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/255 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/314 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/373 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/373 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/432 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/461 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/467 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 157/624 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1441/2065 variables, 624/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2065 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2065 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2065 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2065/2065 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1441/1441 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 624 transition count 1413
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 596 transition count 1406
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 596 transition count 1386
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 576 transition count 1386
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 104 place count 576 transition count 1386
Applied a total of 104 rules in 77 ms. Remains 576 /624 variables (removed 48) and now considering 1386/1441 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 576/624 places, 1386/1441 transitions.
RANDOM walk for 40000 steps (680 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (130 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324617 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324617 steps, saw 156558 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18319998663509688789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-820931808896665102.kers'
[2026-05-22 20:14:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18319998663509688789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-820931808896665102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1386 rows 576 cols 5823 entries
Finished phase 1 with 234 SingleSign rule and 271 generalized
[2026-05-22 20:14:55] [INFO ] Computed 71 invariants in 23 ms
Computed 71 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-820931808896665102.kers
Total runtime 26 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/129 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/184 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/239 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/294 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/349 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/404 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/433 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/439 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/439 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 137/576 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1386/1962 variables, 576/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1962 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1962 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/76 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/129 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/184 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/239 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/294 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/349 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/404 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/433 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/439 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/439 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 137/576 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1386/1962 variables, 576/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1962 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1962 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1962 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2450ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13909 steps, including 991 resets, run visited all 1 properties in 58 ms. (steps per millisecond=239 )
Parikh walk visited 1 properties in 58 ms.
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Knowledge-based reduction took 10859 ms.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1389 reset in 249 ms.
Product exploration explored 100000 steps with 1363 reset in 231 ms.
Built C files in :
/tmp/ltsmin2990656802316615617
[2026-05-22 20:14:58] [INFO ] Computing symmetric may disable matrix : 1441 transitions.
[2026-05-22 20:14:58] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:14:58] [INFO ] Computing symmetric may enable matrix : 1441 transitions.
[2026-05-22 20:14:58] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:14:58] [INFO ] Computing Do-Not-Accords matrix : 1441 transitions.
[2026-05-22 20:14:59] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:14:59] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2990656802316615617
Running compilation step : cd /tmp/ltsmin2990656802316615617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2990656802316615617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2990656802316615617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 1441/1441 transitions.
Applied a total of 0 rules in 48 ms. Remains 624 /624 variables (removed 0) and now considering 1441/1441 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8036673304829575213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18230227567165191653.kers'
[2026-05-22 20:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8036673304829575213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18230227567165191653.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1441 rows 624 cols 5810 entries
Finished phase 1 with 284 SingleSign rule and 269 generalized
[2026-05-22 20:15:02] [INFO ] Computed 71 invariants in 14 ms
Computed 71 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-18230227567165191653.kers
Total runtime 18 ms.
[2026-05-22 20:15:02] [INFO ] Implicit Places using invariants in 621 ms returned []
[2026-05-22 20:15:02] [INFO ] Invariant cache hit.
[2026-05-22 20:15:04] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2026-05-22 20:15:04] [INFO ] Redundant transitions in 107 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2281 ms. Remains : 624/624 places, 1441/1441 transitions.
Built C files in :
/tmp/ltsmin8471997565381127017
[2026-05-22 20:15:04] [INFO ] Computing symmetric may disable matrix : 1441 transitions.
[2026-05-22 20:15:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:15:04] [INFO ] Computing symmetric may enable matrix : 1441 transitions.
[2026-05-22 20:15:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:15:04] [INFO ] Computing Do-Not-Accords matrix : 1441 transitions.
[2026-05-22 20:15:04] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:15:04] [INFO ] Built C files in 403ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8471997565381127017
Running compilation step : cd /tmp/ltsmin8471997565381127017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8471997565381127017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8471997565381127017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:15:07] [INFO ] Flatten gal took : 41 ms
[2026-05-22 20:15:07] [INFO ] Flatten gal took : 32 ms
[2026-05-22 20:15:07] [INFO ] Time to serialize gal into /tmp/LTL12692512849304706577.gal : 7 ms
[2026-05-22 20:15:07] [INFO ] Time to serialize properties into /tmp/LTL5241614543862363629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12692512849304706577.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14872126346078119.hoa' '-atoms' '/tmp/LTL5241614543862363629.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5241614543862363629.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14872126346078119.hoa
Detected timeout of ITS tools.
[2026-05-22 20:15:23] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:15:23] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:15:23] [INFO ] Time to serialize gal into /tmp/LTL12486657871539312767.gal : 6 ms
[2026-05-22 20:15:23] [INFO ] Time to serialize properties into /tmp/LTL7727351101077021081.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12486657871539312767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7727351101077021081.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p1!=1)"))))
Formula 0 simplified : GF!"(p1!=1)"
Detected timeout of ITS tools.
[2026-05-22 20:15:38] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:15:38] [INFO ] Applying decomposition
[2026-05-22 20:15:38] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17568712087520059107.txt' '-o' '/tmp/graph17568712087520059107.bin' '-w' '/tmp/graph17568712087520059107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17568712087520059107.bin' '-l' '-1' '-v' '-w' '/tmp/graph17568712087520059107.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:15:38] [INFO ] Decomposing Gal with order
[2026-05-22 20:15:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:15:38] [INFO ] Removed a total of 2859 redundant transitions.
[2026-05-22 20:15:38] [INFO ] Flatten gal took : 64 ms
[2026-05-22 20:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 24 ms.
[2026-05-22 20:15:38] [INFO ] Time to serialize gal into /tmp/LTL3290636003678487611.gal : 11 ms
[2026-05-22 20:15:38] [INFO ] Time to serialize properties into /tmp/LTL6606772624430223691.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3290636003678487611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6606772624430223691.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u8.p1!=1)"))))
Formula 0 simplified : GF!"(i0.u8.p1!=1)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-05 finished in 143448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1427 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1427 transition count 2132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1426 transition count 2131
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1426 transition count 2131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1425 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1425 transition count 2130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1424 transition count 2129
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1424 transition count 2129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1423 transition count 2128
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1423 transition count 2128
Applied a total of 10 rules in 310 ms. Remains 1423 /1428 variables (removed 5) and now considering 2128/2133 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4273755740246766772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6270937447517645672.kers'
[2026-05-22 20:15:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4273755740246766772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6270937447517645672.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2128 rows 1423 cols 7394 entries
Finished phase 1 with 936 SingleSign rule and 294 generalized
[2026-05-22 20:15:53] [INFO ] Computed 193 invariants in 17 ms
Computed 193 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-6270937447517645672.kers
Total runtime 32 ms.
[2026-05-22 20:15:54] [INFO ] Implicit Places using invariants in 1023 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1034 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1422/1428 places, 2128/2133 transitions.
Applied a total of 0 rules in 48 ms. Remains 1422 /1422 variables (removed 0) and now considering 2128/2128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1392 ms. Remains : 1422/1428 places, 2128/2133 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-13 finished in 1610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U X(p1))||X(X(F(p2)))))))'
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1427 transition count 1853
Reduce places removed 286 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 293 rules applied. Total rules applied 572 place count 1141 transition count 1846
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 579 place count 1134 transition count 1846
Performed 205 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 205 Pre rules applied. Total rules applied 579 place count 1134 transition count 1641
Deduced a syphon composed of 205 places in 2 ms
Ensure Unique test removed 61 places
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 471 rules applied. Total rules applied 1050 place count 868 transition count 1641
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 42 rules applied. Total rules applied 1092 place count 849 transition count 1618
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 1115 place count 826 transition count 1618
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1115 place count 826 transition count 1589
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1173 place count 797 transition count 1589
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1186 place count 784 transition count 1576
Iterating global reduction 5 with 13 rules applied. Total rules applied 1199 place count 784 transition count 1576
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 1210 place count 784 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1211 place count 783 transition count 1565
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1211 place count 783 transition count 1564
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 782 transition count 1564
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 21 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 1355 place count 711 transition count 1493
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1356 place count 710 transition count 1492
Iterating global reduction 7 with 1 rules applied. Total rules applied 1357 place count 710 transition count 1492
Applied a total of 1357 rules in 157 ms. Remains 710 /1428 variables (removed 718) and now considering 1492/2133 (removed 641) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17526640123756642915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13543757793251109233.kers'
[2026-05-22 20:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17526640123756642915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13543757793251109233.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1492 rows 710 cols 6046 entries
Finished phase 1 with 287 SingleSign rule and 317 generalized
[2026-05-22 20:15:55] [INFO ] Computed 106 invariants in 11 ms
Computed 106 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13543757793251109233.kers
Total runtime 12 ms.
[2026-05-22 20:15:55] [INFO ] Implicit Places using invariants in 501 ms returned [0, 76, 93, 99, 104, 163, 180, 186, 191, 193, 253, 270, 276, 281, 283, 343, 360, 366, 371, 373, 433, 450, 456, 461, 463, 524, 541, 547, 552, 554, 614, 631, 637, 642, 644, 707]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 516 ms to find 36 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 674/1428 places, 1492/2133 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 674 transition count 1488
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 670 transition count 1488
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 22 place count 656 transition count 1474
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 656 transition count 1474
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 50 place count 642 transition count 1460
Iterating global reduction 2 with 14 rules applied. Total rules applied 64 place count 642 transition count 1460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 635 transition count 1453
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 635 transition count 1453
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 106 place count 621 transition count 1439
Applied a total of 106 rules in 76 ms. Remains 621 /674 variables (removed 53) and now considering 1439/1492 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12130532877241987664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6647929992685827554.kers'
[2026-05-22 20:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12130532877241987664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6647929992685827554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1439 rows 621 cols 5800 entries
Finished phase 1 with 287 SingleSign rule and 264 generalized
[2026-05-22 20:15:55] [INFO ] Computed 70 invariants in 9 ms
Computed 70 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6647929992685827554.kers
Total runtime 12 ms.
[2026-05-22 20:15:56] [INFO ] Implicit Places using invariants in 571 ms returned []
[2026-05-22 20:15:56] [INFO ] Invariant cache hit.
[2026-05-22 20:15:57] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 621/1428 places, 1439/2133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2723 ms. Remains : 621/1428 places, 1439/2133 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U X(p1))||X(X(F(p2)))))))'
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-14
Product exploration explored 100000 steps with 2200 reset in 268 ms.
Product exploration explored 100000 steps with 2236 reset in 285 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 12 factoid took 85 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (509 resets) in 303 ms. (131 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (85 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (96 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2026-05-22 20:15:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 151/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/269 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/416 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/463 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/620 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2060/2060 variables, and 691 constraints, problems are : Problem set: 0 solved, 3 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 621/621 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 151/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/269 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/416 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/463 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/620 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2060/2060 variables, and 694 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5035ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1127 ms.
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 621 transition count 1411
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 593 transition count 1404
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 593 transition count 1384
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 573 transition count 1384
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 104 place count 573 transition count 1384
Applied a total of 104 rules in 90 ms. Remains 573 /621 variables (removed 48) and now considering 1384/1439 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 573/621 places, 1384/1439 transitions.
RANDOM walk for 40000 steps (694 resets) in 313 ms. (127 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (133 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (118 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (137 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 263961 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 3
Probabilistic random walk after 263961 steps, saw 119540 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5607623503999808401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4807877223446557774.kers'
[2026-05-22 20:16:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5607623503999808401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4807877223446557774.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1384 rows 573 cols 5813 entries
Finished phase 1 with 235 SingleSign rule and 268 generalized
[2026-05-22 20:16:08] [INFO ] Computed 70 invariants in 9 ms
Computed 70 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4807877223446557774.kers
Total runtime 11 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 137/572 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1957 variables, 573/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1957 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1957 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1957/1957 variables, and 643 constraints, problems are : Problem set: 0 solved, 3 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 137/572 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1957 variables, 573/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1957 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1957 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1957 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1957/1957 variables, and 646 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16279 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17157ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2042 ms.
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 18 ms. Remains 573 /573 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 573/573 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 573 /573 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2026-05-22 20:16:27] [INFO ] Invariant cache hit.
[2026-05-22 20:16:28] [INFO ] Implicit Places using invariants in 555 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 557 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 561/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 37 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 612 ms. Remains : 561/573 places, 1384/1384 transitions.
RANDOM walk for 40000 steps (699 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (126 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (134 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 272148 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 3
Probabilistic random walk after 272148 steps, saw 122480 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11149760653443489615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12740501400228749367.kers'
[2026-05-22 20:16:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11149760653443489615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12740501400228749367.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1384 rows 561 cols 5651 entries
Finished phase 1 with 212 SingleSign rule and 291 generalized
[2026-05-22 20:16:31] [INFO ] Computed 58 invariants in 12 ms
Computed 58 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12740501400228749367.kers
Total runtime 14 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 619 constraints, problems are : Problem set: 0 solved, 3 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1945 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 622 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6934 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7527ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1491 ms.
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 561/561 places, 1384/1384 transitions.
RANDOM walk for 40000 steps (699 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (123 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (121 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 285485 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 285485 steps, saw 127640 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-22 20:16:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1945 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15998 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16534ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1040 ms.
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 561/561 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2026-05-22 20:17:01] [INFO ] Invariant cache hit.
[2026-05-22 20:17:01] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-22 20:17:01] [INFO ] Invariant cache hit.
[2026-05-22 20:17:02] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
[2026-05-22 20:17:02] [INFO ] Redundant transitions in 20 ms returned []
Running 1350 sub problems to find dead transitions.
[2026-05-22 20:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1945 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1945 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61932 ms. Remains : 561/561 places, 1384/1384 transitions.
Knowledge based reduction with 12 factoid took 196 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false]
Knowledge-based reduction took 124878 ms.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 47 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14334819018373019444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17372462843977469430.kers'
[2026-05-22 20:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14334819018373019444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17372462843977469430.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1439 rows 621 cols 5800 entries
Finished phase 1 with 287 SingleSign rule and 264 generalized
[2026-05-22 20:18:03] [INFO ] Computed 70 invariants in 26 ms
Computed 70 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-17372462843977469430.kers
Total runtime 30 ms.
[2026-05-22 20:18:04] [INFO ] Implicit Places using invariants in 635 ms returned []
[2026-05-22 20:18:04] [INFO ] Invariant cache hit.
[2026-05-22 20:18:05] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2026-05-22 20:18:05] [INFO ] Redundant transitions in 38 ms returned []
Running 1398 sub problems to find dead transitions.
[2026-05-22 20:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2060 variables, and 68 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2060 variables, and 68 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62529 ms. Remains : 621/621 places, 1439/1439 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 13 factoid took 48 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (519 resets) in 177 ms. (224 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (89 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (98 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (97 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
[2026-05-22 20:19:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 151/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/269 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/416 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/463 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/620 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2060 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2060/2060 variables, and 691 constraints, problems are : Problem set: 0 solved, 3 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 621/621 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 151/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/269 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/416 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/463 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/620 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/621 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1439/2060 variables, 621/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2060/2060 variables, and 694 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2955 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3648ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5264 ms.
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 621 transition count 1411
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 63 place count 593 transition count 1404
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 593 transition count 1384
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 103 place count 573 transition count 1384
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 104 place count 573 transition count 1384
Applied a total of 104 rules in 90 ms. Remains 573 /621 variables (removed 48) and now considering 1384/1439 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 573/621 places, 1384/1439 transitions.
RANDOM walk for 40000 steps (713 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (124 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (128 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 247855 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 247855 steps, saw 113441 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10864085133786087601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10320845455128430897.kers'
[2026-05-22 20:19:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10864085133786087601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10320845455128430897.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1384 rows 573 cols 5813 entries
Finished phase 1 with 235 SingleSign rule and 268 generalized
[2026-05-22 20:19:18] [INFO ] Computed 70 invariants in 20 ms
Computed 70 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-10320845455128430897.kers
Total runtime 22 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 137/572 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1957 variables, 573/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1957 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1957 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1957/1957 variables, and 643 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 137/572 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1957 variables, 573/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1957 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1957 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1957 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1957/1957 variables, and 646 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7964 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9030ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 996 ms.
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 573 /573 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 573/573 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 573 /573 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2026-05-22 20:19:28] [INFO ] Invariant cache hit.
[2026-05-22 20:19:29] [INFO ] Implicit Places using invariants in 400 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 373, 374, 444, 445]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 401 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 561/573 places, 1384/1384 transitions.
Applied a total of 0 rules in 20 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 438 ms. Remains : 561/573 places, 1384/1384 transitions.
RANDOM walk for 40000 steps (690 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (119 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (125 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 275819 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 3
Probabilistic random walk after 275819 steps, saw 123731 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-261255140339180904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9655906992334633800.kers'
[2026-05-22 20:19:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-261255140339180904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9655906992334633800.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1384 rows 561 cols 5651 entries
Finished phase 1 with 212 SingleSign rule and 291 generalized
[2026-05-22 20:19:32] [INFO ] Computed 58 invariants in 9 ms
Computed 58 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9655906992334633800.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 619 constraints, problems are : Problem set: 0 solved, 3 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1945 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 622 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7481 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8013ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1532 ms.
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 561/561 places, 1384/1384 transitions.
RANDOM walk for 40000 steps (652 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (123 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 286463 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 286463 steps, saw 127934 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-22 20:19:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1945 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/255 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/391 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/435 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/560 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/561 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1384/1945 variables, 561/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1945 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1945 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1945 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16632 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17286ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1173 ms.
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 561/561 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Applied a total of 0 rules in 16 ms. Remains 561 /561 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2026-05-22 20:20:03] [INFO ] Invariant cache hit.
[2026-05-22 20:20:03] [INFO ] Implicit Places using invariants in 447 ms returned []
[2026-05-22 20:20:03] [INFO ] Invariant cache hit.
[2026-05-22 20:20:05] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2026-05-22 20:20:05] [INFO ] Redundant transitions in 46 ms returned []
Running 1350 sub problems to find dead transitions.
[2026-05-22 20:20:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/1945 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 1350/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1945 variables, and 56 constraints, problems are : Problem set: 0 solved, 1350 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 0/1350 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62288 ms. Remains : 561/561 places, 1384/1384 transitions.
Knowledge based reduction with 13 factoid took 190 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false]
Knowledge-based reduction took 119840 ms.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 2192 reset in 285 ms.
Product exploration explored 100000 steps with 2320 reset in 270 ms.
Built C files in :
/tmp/ltsmin17407184767419035635
[2026-05-22 20:21:07] [INFO ] Computing symmetric may disable matrix : 1439 transitions.
[2026-05-22 20:21:07] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:21:07] [INFO ] Computing symmetric may enable matrix : 1439 transitions.
[2026-05-22 20:21:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:21:07] [INFO ] Computing Do-Not-Accords matrix : 1439 transitions.
[2026-05-22 20:21:07] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:21:07] [INFO ] Built C files in 384ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17407184767419035635
Running compilation step : cd /tmp/ltsmin17407184767419035635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17407184767419035635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17407184767419035635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1439/1439 transitions.
Applied a total of 0 rules in 47 ms. Remains 621 /621 variables (removed 0) and now considering 1439/1439 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13845117057995664816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4849175114476278358.kers'
[2026-05-22 20:21:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13845117057995664816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4849175114476278358.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1439 rows 621 cols 5800 entries
Finished phase 1 with 287 SingleSign rule and 264 generalized
[2026-05-22 20:21:10] [INFO ] Computed 70 invariants in 11 ms
Computed 70 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-4849175114476278358.kers
Total runtime 15 ms.
[2026-05-22 20:21:11] [INFO ] Implicit Places using invariants in 606 ms returned []
[2026-05-22 20:21:11] [INFO ] Invariant cache hit.
[2026-05-22 20:21:12] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2026-05-22 20:21:12] [INFO ] Redundant transitions in 81 ms returned []
Running 1398 sub problems to find dead transitions.
[2026-05-22 20:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2060 variables, and 68 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2060 variables, and 68 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 28/30 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62769 ms. Remains : 621/621 places, 1439/1439 transitions.
Built C files in :
/tmp/ltsmin18319011766459908681
[2026-05-22 20:22:13] [INFO ] Computing symmetric may disable matrix : 1439 transitions.
[2026-05-22 20:22:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:22:13] [INFO ] Computing symmetric may enable matrix : 1439 transitions.
[2026-05-22 20:22:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:22:13] [INFO ] Computing Do-Not-Accords matrix : 1439 transitions.
[2026-05-22 20:22:13] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:22:13] [INFO ] Built C files in 320ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18319011766459908681
Running compilation step : cd /tmp/ltsmin18319011766459908681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18319011766459908681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18319011766459908681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:22:16] [INFO ] Flatten gal took : 39 ms
[2026-05-22 20:22:16] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:22:16] [INFO ] Time to serialize gal into /tmp/LTL1626816395937966773.gal : 5 ms
[2026-05-22 20:22:16] [INFO ] Time to serialize properties into /tmp/LTL4577708790886423199.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1626816395937966773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8353109950045056232.hoa' '-atoms' '/tmp/LTL4577708790886423199.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4577708790886423199.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8353109950045056232.hoa
Detected timeout of ITS tools.
[2026-05-22 20:22:31] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:22:31] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:22:31] [INFO ] Time to serialize gal into /tmp/LTL10520353780292436675.gal : 6 ms
[2026-05-22 20:22:31] [INFO ] Time to serialize properties into /tmp/LTL6964137418767432142.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10520353780292436675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6964137418767432142.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((p280==0)||(p447==1))"))U(X("(p1213==1)")))||(X(X(F("((p993==0)||(p1250==1))"))))))))
Formula 0 simplified : G(F(G!"((p280==0)||(p447==1))" R X!"(p1213==1)") & FG!"((p993==0)||(p1250==1))")
Detected timeout of ITS tools.
[2026-05-22 20:22:47] [INFO ] Flatten gal took : 57 ms
[2026-05-22 20:22:47] [INFO ] Applying decomposition
[2026-05-22 20:22:47] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15935529313896060427.txt' '-o' '/tmp/graph15935529313896060427.bin' '-w' '/tmp/graph15935529313896060427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15935529313896060427.bin' '-l' '-1' '-v' '-w' '/tmp/graph15935529313896060427.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:22:47] [INFO ] Decomposing Gal with order
[2026-05-22 20:22:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:22:47] [INFO ] Removed a total of 2873 redundant transitions.
[2026-05-22 20:22:47] [INFO ] Flatten gal took : 63 ms
[2026-05-22 20:22:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 21 ms.
[2026-05-22 20:22:47] [INFO ] Time to serialize gal into /tmp/LTL10582257344158431200.gal : 9 ms
[2026-05-22 20:22:47] [INFO ] Time to serialize properties into /tmp/LTL8599982073076394554.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10582257344158431200.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8599982073076394554.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(((F("((i2.u40.p280==0)||(i4.u64.p447==1))"))U(X("(i14.u122.p1213==1)")))||(X(X(F("((i9.u101.p993==0)||(i12.u130.p1250==1))"))))...159
Formula 0 simplified : G(F(G!"((i2.u40.p280==0)||(i4.u64.p447==1))" R X!"(i14.u122.p1213==1)") & FG!"((i9.u101.p993==0)||(i12.u130.p1250==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07a-LTLCardinality-14 finished in 427374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1428/1428 places, 2133/2133 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1427 transition count 1854
Reduce places removed 285 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 292 rules applied. Total rules applied 570 place count 1142 transition count 1847
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 578 place count 1135 transition count 1846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 579 place count 1134 transition count 1846
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 204 Pre rules applied. Total rules applied 579 place count 1134 transition count 1642
Deduced a syphon composed of 204 places in 1 ms
Ensure Unique test removed 60 places
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 4 with 468 rules applied. Total rules applied 1047 place count 870 transition count 1642
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 4 with 43 rules applied. Total rules applied 1090 place count 850 transition count 1619
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1113 place count 827 transition count 1619
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 1113 place count 827 transition count 1590
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 1171 place count 798 transition count 1590
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1184 place count 785 transition count 1577
Iterating global reduction 6 with 13 rules applied. Total rules applied 1197 place count 785 transition count 1577
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 1208 place count 785 transition count 1566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1209 place count 784 transition count 1566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1209 place count 784 transition count 1565
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 1211 place count 783 transition count 1565
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 8 with 142 rules applied. Total rules applied 1353 place count 712 transition count 1494
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1354 place count 711 transition count 1493
Iterating global reduction 8 with 1 rules applied. Total rules applied 1355 place count 711 transition count 1493
Applied a total of 1355 rules in 132 ms. Remains 711 /1428 variables (removed 717) and now considering 1493/2133 (removed 640) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16958414569268234252.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13915263116849729149.kers'
[2026-05-22 20:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16958414569268234252.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13915263116849729149.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1493 rows 711 cols 6048 entries
Finished phase 1 with 288 SingleSign rule and 317 generalized
[2026-05-22 20:23:02] [INFO ] Computed 106 invariants in 9 ms
Computed 106 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13915263116849729149.kers
Total runtime 13 ms.
[2026-05-22 20:23:03] [INFO ] Implicit Places using invariants in 508 ms returned [0, 76, 93, 99, 104, 163, 180, 186, 191, 193, 253, 270, 276, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 708]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 510 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 676/1428 places, 1493/2133 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 676 transition count 1489
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 672 transition count 1489
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 21 place count 659 transition count 1476
Iterating global reduction 2 with 13 rules applied. Total rules applied 34 place count 659 transition count 1476
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 47 place count 646 transition count 1463
Iterating global reduction 2 with 13 rules applied. Total rules applied 60 place count 646 transition count 1463
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 639 transition count 1456
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 639 transition count 1456
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 102 place count 625 transition count 1442
Applied a total of 102 rules in 80 ms. Remains 625 /676 variables (removed 51) and now considering 1442/1493 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17455046432190618026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13117949972970310514.kers'
[2026-05-22 20:23:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17455046432190618026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13117949972970310514.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1442 rows 625 cols 5809 entries
Finished phase 1 with 290 SingleSign rule and 264 generalized
[2026-05-22 20:23:03] [INFO ] Computed 71 invariants in 28 ms
Computed 71 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-13117949972970310514.kers
Total runtime 31 ms.
[2026-05-22 20:23:03] [INFO ] Implicit Places using invariants in 568 ms returned []
[2026-05-22 20:23:03] [INFO ] Invariant cache hit.
[2026-05-22 20:23:05] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 625/1428 places, 1442/2133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2641 ms. Remains : 625/1428 places, 1442/2133 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07a-LTLCardinality-15
Stuttering criterion allowed to conclude after 84 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-07a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07a-LTLCardinality-15 finished in 2754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)) U (p2&&X(X(F(p3)))))))'
Spot run failed in 46 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U X(p1))||X(X(F(p2)))))))'
Spot run failed in 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 20:23:05] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12845356050526737441
[2026-05-22 20:23:05] [INFO ] Too many transitions (2133) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:23:05] [INFO ] Applying decomposition
[2026-05-22 20:23:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12845356050526737441
Running compilation step : cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 20:23:05] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1266807672556870901.txt' '-o' '/tmp/graph1266807672556870901.bin' '-w' '/tmp/graph1266807672556870901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1266807672556870901.bin' '-l' '-1' '-v' '-w' '/tmp/graph1266807672556870901.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:23:05] [INFO ] Decomposing Gal with order
[2026-05-22 20:23:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:23:05] [INFO ] Removed a total of 2844 redundant transitions.
[2026-05-22 20:23:05] [INFO ] Flatten gal took : 81 ms
[2026-05-22 20:23:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2026-05-22 20:23:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality12687353427602506151.gal : 14 ms
[2026-05-22 20:23:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality7005264033813530102.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12687353427602506151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7005264033813530102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X((("(((i8.u192.p703==1)||(i8.u218.p804==0))||(i12.u312.p1126==1))")&&(G("((i8.u218.p804==0)||(i12.u312.p1126==1))")))U(("(i8.u192....226
Formula 0 simplified : X((!"(((i8.u192.p703==1)||(i8.u218.p804==0))||(i12.u312.p1126==1))" | F!"((i8.u218.p804==0)||(i12.u312.p1126==1))") R (!"(i8.u192.p7...215
Compilation finished in 4399 ms.
Running link step : cd /tmp/ltsmin12845356050526737441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 113 ms.
Running LTSmin : cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((((LTLAPp0==true)&&[]((LTLAPp1==true))) U ((LTLAPp2==true)&&X(X(<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 652 ms.
FORMULA ASLink-PT-07a-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([](((<>((LTLAPp5==true)) U X((LTLAPp6==true)))||X(X(<>((LTLAPp7==true)))))))' '--buchi-type=spotba'
LTSmin run took 6333 ms.
FORMULA ASLink-PT-07a-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12845356050526737441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 20:47:55] [INFO ] Applying decomposition
[2026-05-22 20:47:55] [INFO ] Flatten gal took : 49 ms
[2026-05-22 20:47:55] [INFO ] Decomposing Gal with order
[2026-05-22 20:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:47:55] [INFO ] Removed a total of 2384 redundant transitions.
[2026-05-22 20:47:55] [INFO ] Flatten gal took : 82 ms
[2026-05-22 20:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 913 labels/synchronizations in 43 ms.
[2026-05-22 20:47:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality18372034345368855126.gal : 8 ms
[2026-05-22 20:47:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality9483609251616985809.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18372034345368855126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9483609251616985809.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(u1.p1!=1)"))))
Formula 0 simplified : GF!"(u1.p1!=1)"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-07a"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-07a, 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-oct2-177944366200379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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