Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993600188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DBSingleClientW-PT-d1m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779596286492

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 04:18:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:18:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:18:09] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2026-05-24 04:18:09] [INFO ] Transformed 1440 places.
[2026-05-24 04:18:09] [INFO ] Transformed 672 transitions.
[2026-05-24 04:18:09] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 177 place count 250 transition count 427
Iterating global reduction 1 with 76 rules applied. Total rules applied 253 place count 250 transition count 427
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 265 place count 250 transition count 415
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 318 place count 197 transition count 362
Iterating global reduction 2 with 53 rules applied. Total rules applied 371 place count 197 transition count 362
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 394 place count 174 transition count 328
Iterating global reduction 2 with 23 rules applied. Total rules applied 417 place count 174 transition count 328
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 445 place count 174 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 447 place count 172 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 449 place count 172 transition count 297
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 450 place count 171 transition count 296
Iterating global reduction 3 with 1 rules applied. Total rules applied 451 place count 171 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 453 place count 171 transition count 294
Applied a total of 453 rules in 203 ms. Remains 171 /347 variables (removed 176) and now considering 294/672 (removed 378) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16797050054048437369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-356417652025735812.kers'
[2026-05-24 04:18:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16797050054048437369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-356417652025735812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 294 rows 171 cols 873 entries
Finished phase 1 with 167 SingleSign rule and 2 generalized
[2026-05-24 04:18:10] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-356417652025735812.kers
Total runtime 5 ms.
[2026-05-24 04:18:11] [INFO ] Implicit Places using invariants in 704 ms returned []
[2026-05-24 04:18:11] [INFO ] Invariant cache hit.
[2026-05-24 04:18:11] [INFO ] State equation strengthened by 140 read => feed constraints.
[2026-05-24 04:18:12] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2026-05-24 04:18:12] [INFO ] Invariant cache hit.
[2026-05-24 04:18:12] [INFO ] State equation strengthened by 140 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/465 variables, 171/173 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 140/313 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 313 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/465 variables, 171/173 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 140/313 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 293/606 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 606 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61032ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 61064ms
Starting structural reductions in LTL mode, iteration 1 : 171/347 places, 294/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63337 ms. Remains : 171/347 places, 294/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2026-05-24 04:19:13] [INFO ] Invariant cache hit.
[2026-05-24 04:19:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-24 04:19:13] [INFO ] Invariant cache hit.
[2026-05-24 04:19:13] [INFO ] State equation strengthened by 140 read => feed constraints.
[2026-05-24 04:19:14] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1479 ms. Remains : 171/171 places, 294/294 transitions.
Support contains 36 out of 171 places after structural reductions.
[2026-05-24 04:19:15] [INFO ] Flatten gal took : 98 ms
[2026-05-24 04:19:15] [INFO ] Flatten gal took : 52 ms
[2026-05-24 04:19:15] [INFO ] Input system was already deterministic with 294 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (9179 resets) in 4075 ms. (9 steps per ms) remains 28/33 properties
BEST_FIRST walk for 4002 steps (184 resets) in 55 ms. (71 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (183 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (187 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (394 resets) in 152 ms. (26 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (203 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (199 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (181 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (193 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (198 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (185 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (800 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (190 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (197 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (198 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (394 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (191 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (192 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (191 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (189 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (187 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (172 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (180 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (374 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (181 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (200 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (194 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (167 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (800 resets) in 54 ms. (72 steps per ms) remains 28/28 properties
[2026-05-24 04:19:17] [INFO ] Invariant cache hit.
[2026-05-24 04:19:17] [INFO ] State equation strengthened by 140 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 58/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 40/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 255/385 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 101/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 80/465 variables, 41/274 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 39/313 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 0/465 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 313 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 58/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 40/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 255/385 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 101/234 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 80/465 variables, 41/276 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 39/315 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 28/343 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 343 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10091ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 169 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 169 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 169 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 168 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 167 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 167 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 167 transition count 284
Applied a total of 10 rules in 62 ms. Remains 167 /171 variables (removed 4) and now considering 284/294 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 167/171 places, 284/294 transitions.
RANDOM walk for 40000 steps (9107 resets) in 749 ms. (53 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (191 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (185 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (175 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (367 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (172 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (210 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (205 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (191 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (187 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (192 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (800 resets) in 49 ms. (80 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (179 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (173 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (403 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (200 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (189 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (195 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (186 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (177 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (205 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (204 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (380 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (194 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (182 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (144 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (192 resets) in 57 ms. (69 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (800 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
Finished probabilistic random walk after 188924 steps, run visited all 28 properties in 1232 ms. (steps per millisecond=153 )
Probabilistic random walk after 188924 steps, saw 75877 distinct states, run finished after 1238 ms. (steps per millisecond=152 ) properties seen :28
Computed a total of 5 stabilizing places and 26 stable transitions
Graph (complete) has 633 edges and 171 vertex of which 170 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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((p0 U p1)) U G(X((p0 U X(p2))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 148 transition count 219
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 148 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 148 transition count 216
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 128 transition count 195
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 128 transition count 195
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 96 place count 128 transition count 188
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 114 transition count 164
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 114 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 114 transition count 158
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 105 transition count 142
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 105 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 105 transition count 140
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 156 place count 99 transition count 134
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 99 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 164 place count 99 transition count 132
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 169 place count 94 transition count 127
Iterating global reduction 5 with 5 rules applied. Total rules applied 174 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 93 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 93 transition count 125
Applied a total of 176 rules in 52 ms. Remains 93 /171 variables (removed 78) and now considering 125/294 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5910885603810526714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9899826051223546767.kers'
[2026-05-24 04:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5910885603810526714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9899826051223546767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 93 cols 393 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-24 04:19:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9899826051223546767.kers
Total runtime 2 ms.
[2026-05-24 04:19:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-24 04:19:30] [INFO ] Invariant cache hit.
[2026-05-24 04:19:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 04:19:30] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 04:19:30] [INFO ] Invariant cache hit.
[2026-05-24 04:19:30] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/218 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 143 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6876 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/218 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 124/267 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/218 variables, and 267 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36939ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 36940ms
Starting structural reductions in LTL mode, iteration 1 : 93/171 places, 125/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37592 ms. Remains : 93/171 places, 125/294 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((p0 U p1)) U G(X((p0 U X(p2))))))'
Stuttering acceptance computed with spot in 597 ms :[p2, p2, (AND p1 p2), p2, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 692 ms.
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 319 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 6 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-00 finished in 39363 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 146 transition count 210
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 146 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 146 transition count 207
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 125 transition count 186
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 125 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 125 transition count 180
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 117 place count 109 transition count 153
Iterating global reduction 2 with 16 rules applied. Total rules applied 133 place count 109 transition count 153
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 109 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 148 place count 101 transition count 131
Iterating global reduction 3 with 8 rules applied. Total rules applied 156 place count 101 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 101 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 164 place count 95 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 95 transition count 123
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 176 place count 89 transition count 117
Iterating global reduction 4 with 6 rules applied. Total rules applied 182 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 87 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 87 transition count 108
Applied a total of 187 rules in 43 ms. Remains 87 /171 variables (removed 84) and now considering 108/294 (removed 186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10032925574851835133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12867154186572318854.kers'
[2026-05-24 04:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10032925574851835133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12867154186572318854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 87 cols 359 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-24 04:20:09] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12867154186572318854.kers
Total runtime 3 ms.
[2026-05-24 04:20:09] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 04:20:09] [INFO ] Invariant cache hit.
[2026-05-24 04:20:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 04:20:09] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2026-05-24 04:20:09] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-24 04:20:09] [INFO ] Invariant cache hit.
[2026-05-24 04:20:09] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36563ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 36564ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/171 places, 108/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37084 ms. Remains : 87/171 places, 108/294 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 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-01
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-01 finished in 37194 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 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 146 transition count 214
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 146 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 146 transition count 210
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 125 transition count 188
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 125 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 125 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 117 place count 110 transition count 157
Iterating global reduction 2 with 15 rules applied. Total rules applied 132 place count 110 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 110 transition count 151
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 101 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 101 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 101 transition count 131
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 166 place count 95 transition count 125
Iterating global reduction 4 with 6 rules applied. Total rules applied 172 place count 95 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 174 place count 95 transition count 123
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 179 place count 90 transition count 118
Iterating global reduction 5 with 5 rules applied. Total rules applied 184 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 88 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 88 transition count 110
Applied a total of 188 rules in 35 ms. Remains 88 /171 variables (removed 83) and now considering 110/294 (removed 184) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8682778194848116352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12628378340646754790.kers'
[2026-05-24 04:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8682778194848116352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12628378340646754790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 88 cols 361 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-24 04:20:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12628378340646754790.kers
Total runtime 1 ms.
[2026-05-24 04:20:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 04:20:46] [INFO ] Invariant cache hit.
[2026-05-24 04:20:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-24 04:20:46] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2026-05-24 04:20:46] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-24 04:20:46] [INFO ] Invariant cache hit.
[2026-05-24 04:20:46] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37071ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 37072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/171 places, 110/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37548 ms. Remains : 88/171 places, 110/294 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 56 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02
Product exploration explored 100000 steps with 22973 reset in 554 ms.
Product exploration explored 100000 steps with 22967 reset in 346 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 50 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 (9214 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17542 steps, run visited all 1 properties in 135 ms. (steps per millisecond=129 )
Probabilistic random walk after 17542 steps, saw 8391 distinct states, run finished after 136 ms. (steps per millisecond=128 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 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 434 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-24 04:21:25] [INFO ] Invariant cache hit.
[2026-05-24 04:21:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 04:21:25] [INFO ] Invariant cache hit.
[2026-05-24 04:21:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-24 04:21:25] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2026-05-24 04:21:25] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 56 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 (9131 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1941 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17542 steps, run visited all 1 properties in 31 ms. (steps per millisecond=565 )
Probabilistic random walk after 17542 steps, saw 8391 distinct states, run finished after 31 ms. (steps per millisecond=565 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 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 239 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22939 reset in 165 ms.
Product exploration explored 100000 steps with 22966 reset in 298 ms.
Built C files in :
/tmp/ltsmin6501964826821880393
[2026-05-24 04:21:26] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2026-05-24 04:21:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:21:26] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2026-05-24 04:21:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:21:26] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2026-05-24 04:21:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:21:26] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6501964826821880393
Running compilation step : cd /tmp/ltsmin6501964826821880393;'/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'
Compilation finished in 846 ms.
Running link step : cd /tmp/ltsmin6501964826821880393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin6501964826821880393;'/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' '--hoa' '/tmp/stateBased13800446744443313321.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 41445 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' '!(((p0 U (p1 U p2))&&(G((!p1||X(!p1)))||(F(!p3)&&(!p1||X(!p1))))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 147 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 147 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 147 transition count 210
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 71 place count 126 transition count 188
Iterating global reduction 1 with 21 rules applied. Total rules applied 92 place count 126 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 98 place count 126 transition count 182
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 112 transition count 160
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 112 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 112 transition count 154
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 105 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 105 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 105 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 100 transition count 133
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 100 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 163 place count 95 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 168 place count 95 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 95 transition count 127
Applied a total of 169 rules in 18 ms. Remains 95 /171 variables (removed 76) and now considering 127/294 (removed 167) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17449960288834231764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15557135447070798785.kers'
[2026-05-24 04:21:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17449960288834231764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15557135447070798785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 95 cols 409 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-24 04:21:27] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15557135447070798785.kers
Total runtime 2 ms.
[2026-05-24 04:21:28] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-24 04:21:28] [INFO ] Invariant cache hit.
[2026-05-24 04:21:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 04:21:28] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 04:21:28] [INFO ] Invariant cache hit.
[2026-05-24 04:21:28] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/222 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 141 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/222 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 267 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39124ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 39125ms
Starting structural reductions in LTL mode, iteration 1 : 95/171 places, 127/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39962 ms. Remains : 95/171 places, 127/294 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' '!(((p0 U (p1 U p2))&&(G((X(!p1)||p3))||(F(p4)&&(X(!p1)||p5)))))'
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p2) (AND p1 (NOT p3) (NOT p4)) (AND p1 (NOT p3) (NOT p5))), true, p1, (NOT p2), (NOT p2), (AND (NOT p3) (NOT p4) p1), (AND (NOT p4) p1), (AND (NOT p3) p1), (NOT p4), (AND (NOT p3) p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-03 finished in 40527 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&&X(F(p1))&&F(p2))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 146 transition count 210
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 146 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 146 transition count 207
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 126 transition count 186
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 126 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 99 place count 126 transition count 180
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 114 place count 111 transition count 156
Iterating global reduction 2 with 15 rules applied. Total rules applied 129 place count 111 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 136 place count 111 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 103 transition count 134
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 103 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 103 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 98 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 98 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 98 transition count 125
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 170 place count 94 transition count 121
Iterating global reduction 5 with 4 rules applied. Total rules applied 174 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 93 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 93 transition count 119
Applied a total of 176 rules in 20 ms. Remains 93 /171 variables (removed 78) and now considering 119/294 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3714557133426762551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8120060686284502324.kers'
[2026-05-24 04:22:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3714557133426762551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8120060686284502324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 93 cols 386 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-24 04:22:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8120060686284502324.kers
Total runtime 1 ms.
[2026-05-24 04:22:08] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-24 04:22:08] [INFO ] Invariant cache hit.
[2026-05-24 04:22:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 04:22:08] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2026-05-24 04:22:08] [INFO ] Invariant cache hit.
[2026-05-24 04:22:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/212 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 135 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/212 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 40/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 118/253 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 253 constraints, problems are : Problem set: 0 solved, 118 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37516ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 37517ms
Starting structural reductions in LTL mode, iteration 1 : 93/171 places, 119/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38167 ms. Remains : 93/171 places, 119/294 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(F(p0))&&F(p1)&&p2)))'
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 38374 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(X(F((X(p0)&&F((G(F(!p1))||(F(!p1)&&X(!p2))))))))))'
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 147 transition count 212
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 147 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 147 transition count 210
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 71 place count 126 transition count 188
Iterating global reduction 1 with 21 rules applied. Total rules applied 92 place count 126 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 98 place count 126 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 113 place count 111 transition count 156
Iterating global reduction 2 with 15 rules applied. Total rules applied 128 place count 111 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 134 place count 111 transition count 150
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 143 place count 102 transition count 134
Iterating global reduction 3 with 9 rules applied. Total rules applied 152 place count 102 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 102 transition count 132
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 161 place count 95 transition count 125
Iterating global reduction 4 with 7 rules applied. Total rules applied 168 place count 95 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 95 transition count 123
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 176 place count 89 transition count 117
Iterating global reduction 5 with 6 rules applied. Total rules applied 182 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 183 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 88 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 88 transition count 114
Applied a total of 185 rules in 12 ms. Remains 88 /171 variables (removed 83) and now considering 114/294 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6982527591598933694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4964013437021349023.kers'
[2026-05-24 04:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6982527591598933694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4964013437021349023.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 88 cols 361 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-24 04:22:46] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4964013437021349023.kers
Total runtime 2 ms.
[2026-05-24 04:22:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-24 04:22:46] [INFO ] Invariant cache hit.
[2026-05-24 04:22:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:22:47] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-24 04:22:47] [INFO ] Invariant cache hit.
[2026-05-24 04:22:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/202 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 42/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 132 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/202 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 42/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 245 constraints, problems are : Problem set: 0 solved, 113 unsolved in 26991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32972ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 32974ms
Starting structural reductions in LTL mode, iteration 1 : 88/171 places, 114/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33584 ms. Remains : 88/171 places, 114/294 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(X(F((X(p0)&&F((G(F(p1))||(F(p1)&&X(p2))))))))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-05
Product exploration explored 100000 steps with 26669 reset in 292 ms.
Product exploration explored 100000 steps with 26627 reset in 397 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 300 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9078 resets) in 172 ms. (231 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (1922 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
[2026-05-24 04:23:21] [INFO ] Invariant cache hit.
[2026-05-24 04:23:21] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/36 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 10/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/198 variables, 26/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 30/128 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/202 variables, 2/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 2/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 132 constraints, problems are : Problem set: 2 solved, 2 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/141 variables, 59/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 10/71 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 57/198 variables, 27/98 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 30/128 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 2/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/202 variables, 2/132 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 2/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/202 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 134 constraints, problems are : Problem set: 2 solved, 2 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 485 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 114/114 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 88/88 places, 114/114 transitions.
RANDOM walk for 40000 steps (9237 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1955 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 15728 steps, run visited all 2 properties in 154 ms. (steps per millisecond=102 )
Probabilistic random walk after 15728 steps, saw 7505 distinct states, run finished after 155 ms. (steps per millisecond=101 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2026-05-24 04:23:23] [INFO ] Invariant cache hit.
[2026-05-24 04:23:23] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-24 04:23:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-24 04:23:23] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-24 04:23:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:23:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-24 04:23:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-24 04:23:24] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-24 04:23:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:23:24] [INFO ] [Nat]Added 42 Read/Feed constraints in 52 ms returned sat
[2026-05-24 04:23:24] [INFO ] Computed and/alt/rep : 33/69/33 causal constraints (skipped 80 transitions) in 23 ms.
[2026-05-24 04:23:24] [INFO ] Added : 3 causal constraints over 1 iterations in 144 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 3165 ms.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 4 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-24 04:23:24] [INFO ] Invariant cache hit.
[2026-05-24 04:23:24] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-24 04:23:24] [INFO ] Invariant cache hit.
[2026-05-24 04:23:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:23:25] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 88/88 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 300 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9183 resets) in 136 ms. (291 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2026-05-24 04:23:25] [INFO ] Invariant cache hit.
[2026-05-24 04:23:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/137 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/196 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/202 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/137 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/196 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/202 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/202 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 114/114 transitions.
Graph (complete) has 275 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 86 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 109
Applied a total of 7 rules in 18 ms. Remains 86 /88 variables (removed 2) and now considering 109/114 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 86/88 places, 109/114 transitions.
RANDOM walk for 40000 steps (9208 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1939 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14737 steps, run visited all 1 properties in 42 ms. (steps per millisecond=350 )
Probabilistic random walk after 14737 steps, saw 7035 distinct states, run finished after 42 ms. (steps per millisecond=350 ) properties seen :1
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2026-05-24 04:23:26] [INFO ] Invariant cache hit.
[2026-05-24 04:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-24 04:23:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-24 04:23:26] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-24 04:23:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:23:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-24 04:23:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-24 04:23:27] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-24 04:23:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:23:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 55 ms returned sat
[2026-05-24 04:23:27] [INFO ] Computed and/alt/rep : 33/69/33 causal constraints (skipped 80 transitions) in 21 ms.
[2026-05-24 04:23:27] [INFO ] Added : 3 causal constraints over 1 iterations in 132 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 2068 ms.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 26615 reset in 276 ms.
Product exploration explored 100000 steps with 26653 reset in 291 ms.
Spot run failed in 126 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/ltsmin11210008034773302206
[2026-05-24 04:23:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11210008034773302206
Running compilation step : cd /tmp/ltsmin11210008034773302206;'/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'
Compilation finished in 687 ms.
Running link step : cd /tmp/ltsmin11210008034773302206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11210008034773302206;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8606889990745813491.hoa' '--buchi-type=spotba'
LTSmin run took 26 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-05 finished in 42874 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(p0))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 146 transition count 214
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 146 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 146 transition count 211
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 74 place count 125 transition count 189
Iterating global reduction 1 with 21 rules applied. Total rules applied 95 place count 125 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 101 place count 125 transition count 183
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 116 place count 110 transition count 157
Iterating global reduction 2 with 15 rules applied. Total rules applied 131 place count 110 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 138 place count 110 transition count 150
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 102 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 102 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 102 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 162 place count 96 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 96 transition count 126
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 175 place count 91 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 180 place count 91 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 89 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 89 transition count 113
Applied a total of 184 rules in 67 ms. Remains 89 /171 variables (removed 82) and now considering 113/294 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14253359234679021974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2516584842871189812.kers'
[2026-05-24 04:23:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14253359234679021974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2516584842871189812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 89 cols 366 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-24 04:23:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2516584842871189812.kers
Total runtime 2 ms.
[2026-05-24 04:23:29] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 04:23:29] [INFO ] Invariant cache hit.
[2026-05-24 04:23:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 04:23:30] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2026-05-24 04:23:30] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-24 04:23:30] [INFO ] Invariant cache hit.
[2026-05-24 04:23:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/202 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 0 solved, 112 unsolved in 12030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 113/202 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 112/254 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 254 constraints, problems are : Problem set: 0 solved, 112 unsolved in 25038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37195ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 37197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/171 places, 113/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37983 ms. Remains : 89/171 places, 113/294 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(p0))'
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 38074 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(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 148 transition count 220
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 148 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 148 transition count 218
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 68 place count 128 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 88 place count 128 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 128 transition count 193
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 116 transition count 171
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 116 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 116 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 129 place count 110 transition count 156
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 110 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 141 place count 104 transition count 150
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 104 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 104 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 99 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 99 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 99 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 97 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 97 transition count 134
Applied a total of 164 rules in 37 ms. Remains 97 /171 variables (removed 74) and now considering 134/294 (removed 160) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15017796061133554528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1930152040677160272.kers'
[2026-05-24 04:24:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15017796061133554528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1930152040677160272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 97 cols 425 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-24 04:24:07] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1930152040677160272.kers
Total runtime 2 ms.
[2026-05-24 04:24:07] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 04:24:07] [INFO ] Invariant cache hit.
[2026-05-24 04:24:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 04:24:08] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2026-05-24 04:24:08] [INFO ] Redundant transitions in 7 ms returned []
Running 133 sub problems to find dead transitions.
[2026-05-24 04:24:08] [INFO ] Invariant cache hit.
[2026-05-24 04:24:08] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 148 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8536 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 133/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 281 constraints, problems are : Problem set: 0 solved, 133 unsolved in 28543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37165ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 37166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/171 places, 134/294 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37944 ms. Remains : 97/171 places, 134/294 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(((!p1 U (p2||G(!p1)))||p0))))'
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-07
Product exploration explored 100000 steps with 22969 reset in 207 ms.
Product exploration explored 100000 steps with 23013 reset in 228 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 338 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 11 factoid took 57 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9189 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4007 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 449 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1869 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1665349 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :4 out of 5
Probabilistic random walk after 1665349 steps, saw 598365 distinct states, run finished after 3004 ms. (steps per millisecond=554 ) properties seen :4
[2026-05-24 04:24:49] [INFO ] Invariant cache hit.
[2026-05-24 04:24:49] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 40/231 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/97 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 3724 ms.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-24 04:24:49] [INFO ] Invariant cache hit.
[2026-05-24 04:24:50] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 04:24:50] [INFO ] Invariant cache hit.
[2026-05-24 04:24:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 04:24:50] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2026-05-24 04:24:50] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 737 ms. Remains : 97/97 places, 134/134 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 338 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9226 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4016 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1893 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 22031 steps, run visited all 3 properties in 220 ms. (steps per millisecond=100 )
Probabilistic random walk after 22031 steps, saw 10122 distinct states, run finished after 220 ms. (steps per millisecond=100 ) properties seen :3
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 689 ms.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 23053 reset in 303 ms.
Product exploration explored 100000 steps with 23047 reset in 311 ms.
Built C files in :
/tmp/ltsmin4516531411902230889
[2026-05-24 04:24:52] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2026-05-24 04:24:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:24:52] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2026-05-24 04:24:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:24:52] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2026-05-24 04:24:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:24:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4516531411902230889
Running compilation step : cd /tmp/ltsmin4516531411902230889;'/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'
Compilation finished in 408 ms.
Running link step : cd /tmp/ltsmin4516531411902230889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4516531411902230889;'/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' '--hoa' '/tmp/stateBased7937148985979140257.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-24 04:25:07] [INFO ] Invariant cache hit.
[2026-05-24 04:25:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 04:25:07] [INFO ] Invariant cache hit.
[2026-05-24 04:25:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 04:25:07] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2026-05-24 04:25:07] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 494 ms. Remains : 97/97 places, 134/134 transitions.
Built C files in :
/tmp/ltsmin3476949449107928020
[2026-05-24 04:25:07] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2026-05-24 04:25:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:25:07] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2026-05-24 04:25:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:25:07] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2026-05-24 04:25:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 04:25:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3476949449107928020
Running compilation step : cd /tmp/ltsmin3476949449107928020;'/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'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin3476949449107928020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3476949449107928020;'/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' '--hoa' '/tmp/stateBased4160456815027568942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 04:25:22] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:25:22] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:25:22] [INFO ] Time to serialize gal into /tmp/LTL2343542350566164219.gal : 4 ms
[2026-05-24 04:25:22] [INFO ] Time to serialize properties into /tmp/LTL4817875128727011965.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2343542350566164219.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1403026140466648381.hoa' '-atoms' '/tmp/LTL4817875128727011965.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/LTL4817875128727011965.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1403026140466648381.hoa
Detected timeout of ITS tools.
[2026-05-24 04:25:37] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:25:37] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:25:37] [INFO ] Time to serialize gal into /tmp/LTL871492060956056011.gal : 2 ms
[2026-05-24 04:25:37] [INFO ] Time to serialize properties into /tmp/LTL6161268367633084822.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/LTL871492060956056011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6161268367633084822.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l1027<1))")||((!("((s1>=1)&&(l1235>=1))"))U(("((!((p107>=1)&&(l0>=1)))&&(!((s1>=1)&&(l1235>=1))))")||(G(!("((s1>=1)...178
Formula 0 simplified : FG(!"((s1<1)||(l1027<1))" & ("((s1>=1)&&(l1235>=1))" M !"((!((p107>=1)&&(l0>=1)))&&(!((s1>=1)&&(l1235>=1))))"))
Detected timeout of ITS tools.
[2026-05-24 04:25:53] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:25:53] [INFO ] Applying decomposition
[2026-05-24 04:25:53] [INFO ] Flatten gal took : 10 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/graph17630591984785601532.txt' '-o' '/tmp/graph17630591984785601532.bin' '-w' '/tmp/graph17630591984785601532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17630591984785601532.bin' '-l' '-1' '-v' '-w' '/tmp/graph17630591984785601532.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:25:53] [INFO ] Decomposing Gal with order
[2026-05-24 04:25:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:25:53] [INFO ] Removed a total of 155 redundant transitions.
[2026-05-24 04:25:53] [INFO ] Flatten gal took : 95 ms
[2026-05-24 04:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 13 ms.
[2026-05-24 04:25:53] [INFO ] Time to serialize gal into /tmp/LTL14850932028007975116.gal : 6 ms
[2026-05-24 04:25:53] [INFO ] Time to serialize properties into /tmp/LTL9152634639106472977.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14850932028007975116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9152634639106472977.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 : !((G(F(("((i0.u0.s1<1)||(i5.u12.l1027<1))")||((!("((i0.u0.s1>=1)&&(i5.u18.l1235>=1))"))U(("((!((i6.u16.p107>=1)&&(i0.u0.l0>=1)))&&(!((...243
Formula 0 simplified : FG(!"((i0.u0.s1<1)||(i5.u12.l1027<1))" & ("((i0.u0.s1>=1)&&(i5.u18.l1235>=1))" M !"((!((i6.u16.p107>=1)&&(i0.u0.l0>=1)))&&(!((i0.u0....186
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-07 finished in 120688 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(!(p0 U X((F(p1) U X(((F(p2)||p0) U p3)))))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 294/294 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 149 transition count 224
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 149 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 149 transition count 220
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 67 place count 130 transition count 200
Iterating global reduction 1 with 19 rules applied. Total rules applied 86 place count 130 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 89 place count 130 transition count 197
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 175
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 117 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 128 place count 109 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 136 place count 109 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 109 transition count 154
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 144 place count 103 transition count 148
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 103 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 103 transition count 146
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 157 place count 98 transition count 141
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 98 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 97 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 97 transition count 139
Applied a total of 164 rules in 11 ms. Remains 97 /171 variables (removed 74) and now considering 139/294 (removed 155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16276723810958119918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6240710425865586842.kers'
[2026-05-24 04:26:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16276723810958119918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6240710425865586842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 97 cols 440 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-24 04:26:08] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6240710425865586842.kers
Total runtime 2 ms.
[2026-05-24 04:26:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-24 04:26:08] [INFO ] Invariant cache hit.
[2026-05-24 04:26:08] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 04:26:08] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-24 04:26:08] [INFO ] Invariant cache hit.
[2026-05-24 04:26:08] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/236 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 151 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/236 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 138/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 289 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36292ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 36292ms
Starting structural reductions in LTL mode, iteration 1 : 97/171 places, 139/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36776 ms. Remains : 97/171 places, 139/294 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(!(p0 U X((F(p1) U X(((F(p2)||p0) U p3)))))))'
Stuttering acceptance computed with spot in 827 ms :[p3, p3, (AND p1 p3), p3, p3, (AND p1 p3), (AND p1 p3), (AND p2 p3), (AND p1 p2 p3), false, (AND p1 p2 p3), false, (AND p2 p3), (AND p1 p2 p3), false, false]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-09
Product exploration explored 100000 steps with 22834 reset in 454 ms.
Product exploration explored 100000 steps with 23077 reset in 298 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 341 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p0&&!p1&&!p3&&!p2)' '--given-formula=X(!p0)' '--given-formula=X(!p1)' '--given-formula=X(X(!(p0&&p1)))' '--given-formula=X(X(!(p1&&p3)))' '--given-formula=X(X(!p2))' '--given-formula=X(X((!p0&&!p2&&!p3)))' '--given-formula=X(X(!(p0&&!p1)))' '--given-formula=X(X(!p3))' '--given-formula=X(X(!((p0&&!p3)||(p2&&!p3))))' '--given-formula=X(X(!(p0&&p3)))' '--given-formula=X(X(!(!p1&&p3)))' '--given-formula=X(X(!p0))' '--given-formula=X(X(!(p0&&!p3)))' '--given-formula=X(X(!p1))' '-F' '/tmp/b4k17238466485795056378.hoa' '--given-strategy=auto-si' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p0&&!p1&&!p3&&!p2)' '--given-formula=X(!p0)' '--given-formula=X(!p1)' '--given-formula=X(X(!(p0&&p1)))' '--given-formula=X(X(!(p1&&p3)))' '--given-formula=X(X(!p2))' '--given-formula=X(X((!p0&&!p2&&!p3)))' '--given-formula=X(X(!(p0&&!p1)))' '--given-formula=X(X(!p3))' '--given-formula=X(X(!((p0&&!p3)||(p2&&!p3))))' '--given-formula=X(X(!(p0&&p3)))' '--given-formula=X(X(!(!p1&&p3)))' '--given-formula=X(X(!p0))' '--given-formula=X(X(!(p0&&!p3)))' '--given-formula=X(X(!p1))' '-F' '/tmp/b4k5017984549974196196.hoa' '--given-strategy=auto-small' killed by timeout after 10 SECONDS
Knowledge-based reduction took 20050 ms.
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-09 finished in 58503 ms.
Application raised an uncaught exception Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
java.lang.NullPointerException: Cannot invoke "fr.lip6.ltl.tgba.TGBA.isEmptyLanguage()" because "tgbared" is null
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeReducer.integrateKnowledge(KnowledgeReducer.java:34)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:39)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
Total runtime 537806 ms.

BK_STOP 1779596826858

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993600188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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