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-177946993600172.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-d1m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:48 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-d1m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779577917201

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-d1m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 23:11:59] [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-23 23:11:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 23:12:00] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2026-05-23 23:12:00] [INFO ] Transformed 1440 places.
[2026-05-23 23:12:00] [INFO ] Transformed 672 transitions.
[2026-05-23 23:12:00] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 576 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 15 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-03 TRUE 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 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 178 place count 249 transition count 432
Iterating global reduction 1 with 77 rules applied. Total rules applied 255 place count 249 transition count 432
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 275 place count 249 transition count 412
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 335 place count 189 transition count 352
Iterating global reduction 2 with 60 rules applied. Total rules applied 395 place count 189 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 189 transition count 351
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 420 place count 165 transition count 317
Iterating global reduction 3 with 24 rules applied. Total rules applied 444 place count 165 transition count 317
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 468 place count 165 transition count 293
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 471 place count 162 transition count 289
Iterating global reduction 4 with 3 rules applied. Total rules applied 474 place count 162 transition count 289
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 476 place count 160 transition count 287
Iterating global reduction 4 with 2 rules applied. Total rules applied 478 place count 160 transition count 287
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 479 place count 159 transition count 286
Iterating global reduction 4 with 1 rules applied. Total rules applied 480 place count 159 transition count 286
Applied a total of 480 rules in 287 ms. Remains 159 /347 variables (removed 188) and now considering 286/672 (removed 386) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12135482272797946084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1582855180090797138.kers'
[2026-05-23 23:12:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12135482272797946084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1582855180090797138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 159 cols 852 entries
Finished phase 1 with 155 SingleSign rule and 2 generalized
[2026-05-23 23:12:00] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1582855180090797138.kers
Total runtime 3 ms.
[2026-05-23 23:12:01] [INFO ] Implicit Places using invariants in 693 ms returned []
[2026-05-23 23:12:01] [INFO ] Invariant cache hit.
[2026-05-23 23:12:02] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-23 23:12:03] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2026-05-23 23:12:03] [INFO ] Invariant cache hit.
[2026-05-23 23:12:03] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/445 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 135/296 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 296 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/445 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 135/296 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 285/581 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 581 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60906ms
Starting structural reductions in LTL mode, iteration 1 : 159/347 places, 286/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63544 ms. Remains : 159/347 places, 286/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2026-05-23 23:13:04] [INFO ] Invariant cache hit.
[2026-05-23 23:13:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-23 23:13:04] [INFO ] Invariant cache hit.
[2026-05-23 23:13:04] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-23 23:13:05] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 159/159 places, 286/286 transitions.
Support contains 36 out of 159 places after structural reductions.
[2026-05-23 23:13:05] [INFO ] Flatten gal took : 92 ms
[2026-05-23 23:13:05] [INFO ] Flatten gal took : 50 ms
[2026-05-23 23:13:05] [INFO ] Input system was already deterministic with 286 transitions.
RANDOM walk for 40000 steps (9235 resets) in 4086 ms. (9 steps per ms) remains 25/31 properties
BEST_FIRST walk for 4003 steps (201 resets) in 65 ms. (60 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (364 resets) in 92 ms. (43 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (208 resets) in 71 ms. (55 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (396 resets) in 108 ms. (36 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (201 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (192 resets) in 35 ms. (111 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (389 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (439 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (169 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (168 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (380 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (192 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (176 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (177 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (413 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (189 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (191 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (393 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (187 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (204 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (187 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (181 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (168 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
[2026-05-23 23:13:07] [INFO ] Invariant cache hit.
[2026-05-23 23:13:07] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 51/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 39/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 246/365 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 95/216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 80/445 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 40/296 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 296 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 51/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 39/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 246/365 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 95/216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 80/445 variables, 40/263 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 40/303 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 23/326 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 326 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8047ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 286/286 transitions.
Graph (complete) has 552 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 158 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 153 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 153 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 151 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 151 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 150 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 150 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 150 transition count 264
Applied a total of 23 rules in 68 ms. Remains 150 /159 variables (removed 9) and now considering 264/286 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 150/159 places, 264/286 transitions.
RANDOM walk for 40000 steps (9220 resets) in 610 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (158 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (409 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (203 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (413 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (208 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (409 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (414 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (211 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (189 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (177 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (373 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (173 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (201 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (205 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (376 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (194 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (210 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (198 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (392 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (188 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (174 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (180 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (186 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (183 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 19405 steps, run visited all 24 properties in 240 ms. (steps per millisecond=80 )
Probabilistic random walk after 19405 steps, saw 8700 distinct states, run finished after 246 ms. (steps per millisecond=78 ) properties seen :24
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 603 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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((G(!p0)||G(F(!p1))||(!p2&&F(!p1)&&F(!p3))||(F(!p1)&&G(!p2))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 211
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 211
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 136 transition count 209
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 121 transition count 189
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 121 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 121 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 111 transition count 165
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 111 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 111 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 106 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 106 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 123 place count 106 transition count 148
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 103 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 103 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 101 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 101 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 134 place count 101 transition count 142
Applied a total of 134 rules in 61 ms. Remains 101 /159 variables (removed 58) and now considering 142/286 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13641142967021432642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13058688114379746413.kers'
[2026-05-23 23:13:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13641142967021432642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13058688114379746413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 101 cols 463 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-23 23:13:16] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13058688114379746413.kers
Total runtime 2 ms.
[2026-05-23 23:13:16] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 23:13:16] [INFO ] Invariant cache hit.
[2026-05-23 23:13:16] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-23 23:13:17] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2026-05-23 23:13:17] [INFO ] Redundant transitions in 4 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-23 23:13:17] [INFO ] Invariant cache hit.
[2026-05-23 23:13:17] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/243 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 47/150 constraints. Problems are: Problem set: 0 solved, 141 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 150 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/243 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 47/150 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 141/291 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 291 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39699ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 39700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/159 places, 142/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40381 ms. Remains : 101/159 places, 142/286 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((G(p0)||G(F(p1))||(F(p1)&&F(p2)&&p3)||(F(p1)&&G(p3))))))'
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-00
Product exploration explored 100000 steps with 23006 reset in 601 ms.
Product exploration explored 100000 steps with 22959 reset in 275 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 351 edges and 101 vertex of which 100 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 9 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9143 resets) in 1178 ms. (33 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 412 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1862 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
[2026-05-23 23:13:58] [INFO ] Invariant cache hit.
[2026-05-23 23:13:58] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 111/182 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 57/239 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/243 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 150 constraints, problems are : Problem set: 0 solved, 3 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 111/182 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 57/239 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/243 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/243 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 399 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 142/142 transitions.
Graph (complete) has 323 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 98 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 98 transition count 135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 96 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 96 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 94 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 94 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 93 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 92 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 92 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 91 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 91 transition count 119
Applied a total of 23 rules in 41 ms. Remains 91 /101 variables (removed 10) and now considering 119/142 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 91/101 places, 119/142 transitions.
RANDOM walk for 40000 steps (9127 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1943 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 29977 steps, run visited all 3 properties in 155 ms. (steps per millisecond=193 )
Probabilistic random walk after 29977 steps, saw 13083 distinct states, run finished after 156 ms. (steps per millisecond=192 ) properties seen :3
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3404 ms.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 101 /101 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2026-05-23 23:14:01] [INFO ] Invariant cache hit.
[2026-05-23 23:14:01] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 23:14:01] [INFO ] Invariant cache hit.
[2026-05-23 23:14:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-23 23:14:02] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2026-05-23 23:14:02] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 690 ms. Remains : 101/101 places, 142/142 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 351 edges and 101 vertex of which 100 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 9 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9168 resets) in 253 ms. (157 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1879 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1838 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
[2026-05-23 23:14:02] [INFO ] Invariant cache hit.
[2026-05-23 23:14:02] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 111/182 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 57/239 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/243 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 150 constraints, problems are : Problem set: 0 solved, 3 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/71 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 111/182 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 57/239 variables, 28/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/243 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/243 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 142/142 transitions.
Graph (complete) has 323 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 98 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 98 transition count 135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 96 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 96 transition count 131
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 94 transition count 129
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 94 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 93 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 92 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 92 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 91 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 91 transition count 119
Applied a total of 23 rules in 28 ms. Remains 91 /101 variables (removed 10) and now considering 119/142 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 91/101 places, 119/142 transitions.
RANDOM walk for 40000 steps (9191 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1870 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 29977 steps, run visited all 3 properties in 204 ms. (steps per millisecond=146 )
Probabilistic random walk after 29977 steps, saw 13083 distinct states, run finished after 204 ms. (steps per millisecond=146 ) properties seen :3
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3454 ms.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22982 reset in 202 ms.
Product exploration explored 100000 steps with 23029 reset in 323 ms.
Built C files in :
/tmp/ltsmin3345698611227934957
[2026-05-23 23:14:06] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2026-05-23 23:14:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:14:06] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2026-05-23 23:14:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:14:06] [INFO ] Computing Do-Not-Accords matrix : 142 transitions.
[2026-05-23 23:14:06] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:14:06] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3345698611227934957
Running compilation step : cd /tmp/ltsmin3345698611227934957;'/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 747 ms.
Running link step : cd /tmp/ltsmin3345698611227934957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin3345698611227934957;'/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/stateBased3282039444973195856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 142/142 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 97 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 97 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 95 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 95 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 94 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 93 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 93 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 92 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 92 transition count 121
Applied a total of 20 rules in 18 ms. Remains 92 /101 variables (removed 9) and now considering 121/142 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16980757164177690619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10471480971321446621.kers'
[2026-05-23 23:14:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16980757164177690619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10471480971321446621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 92 cols 396 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-23 23:14:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10471480971321446621.kers
Total runtime 1 ms.
[2026-05-23 23:14:21] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-23 23:14:21] [INFO ] Invariant cache hit.
[2026-05-23 23:14:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 23:14:22] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2026-05-23 23:14:22] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2026-05-23 23:14:22] [INFO ] Invariant cache hit.
[2026-05-23 23:14:22] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/213 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 143 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/213 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 120/263 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 263 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 41285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/101 places, 121/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41782 ms. Remains : 92/101 places, 121/142 transitions.
Built C files in :
/tmp/ltsmin16608686451385092295
[2026-05-23 23:15:03] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2026-05-23 23:15:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:15:03] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2026-05-23 23:15:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:15:03] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2026-05-23 23:15:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:15:03] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16608686451385092295
Running compilation step : cd /tmp/ltsmin16608686451385092295;'/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 648 ms.
Running link step : cd /tmp/ltsmin16608686451385092295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16608686451385092295;'/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/stateBased3385993039980926297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 23:15:18] [INFO ] Flatten gal took : 10 ms
[2026-05-23 23:15:18] [INFO ] Flatten gal took : 10 ms
[2026-05-23 23:15:18] [INFO ] Time to serialize gal into /tmp/LTL17096916278452718672.gal : 4 ms
[2026-05-23 23:15:18] [INFO ] Time to serialize properties into /tmp/LTL9705762274169203373.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/LTL17096916278452718672.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9757734124221156322.hoa' '-atoms' '/tmp/LTL9705762274169203373.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...318
Loading property file /tmp/LTL9705762274169203373.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9757734124221156322.hoa
Detected timeout of ITS tools.
[2026-05-23 23:15:33] [INFO ] Flatten gal took : 13 ms
[2026-05-23 23:15:33] [INFO ] Flatten gal took : 11 ms
[2026-05-23 23:15:33] [INFO ] Time to serialize gal into /tmp/LTL8754183683396003110.gal : 3 ms
[2026-05-23 23:15:33] [INFO ] Time to serialize properties into /tmp/LTL5971147270363412505.ltl : 30 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/LTL8754183683396003110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5971147270363412505.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("((s1<1)||(l1305<1))"))||(G(F("((s1<1)||(l1291<1))"))))||((((F("((s1<1)||(l1291<1))"))&&(F("((s1<1)||(l1307<1))")))&&("((p6...236
Formula 0 simplified : G(F!"((s1<1)||(l1305<1))" & FG!"((s1<1)||(l1291<1))")
Detected timeout of ITS tools.
[2026-05-23 23:15:48] [INFO ] Flatten gal took : 10 ms
[2026-05-23 23:15:48] [INFO ] Applying decomposition
[2026-05-23 23:15:48] [INFO ] Flatten gal took : 9 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/graph5689482610104075692.txt' '-o' '/tmp/graph5689482610104075692.bin' '-w' '/tmp/graph5689482610104075692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5689482610104075692.bin' '-l' '-1' '-v' '-w' '/tmp/graph5689482610104075692.weights' '-q' '0' '-e' '0.001'
[2026-05-23 23:15:48] [INFO ] Decomposing Gal with order
[2026-05-23 23:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 23:15:48] [INFO ] Removed a total of 130 redundant transitions.
[2026-05-23 23:15:49] [INFO ] Flatten gal took : 264 ms
[2026-05-23 23:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 25 ms.
[2026-05-23 23:15:49] [INFO ] Time to serialize gal into /tmp/LTL2760853659079640486.gal : 9 ms
[2026-05-23 23:15:49] [INFO ] Time to serialize properties into /tmp/LTL14459556803402242777.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/LTL2760853659079640486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14459556803402242777.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(((G("((i2.u0.s1<1)||(i2.u0.l1305<1))"))||(G(F("((i2.u0.s1<1)||(i4.u18.l1291<1))"))))||((((F("((i2.u0.s1<1)||(i4.u18.l1291<1))")...323
Formula 0 simplified : G(F!"((i2.u0.s1<1)||(i2.u0.l1305<1))" & FG!"((i2.u0.s1<1)||(i4.u18.l1291<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-00 finished in 167962 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 U p1))&&F((p2||G(p1)))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 210
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 210
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 136 transition count 208
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 120 transition count 183
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 120 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 120 transition count 175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 108 transition count 160
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 108 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 108 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 124 place count 101 transition count 141
Iterating global reduction 3 with 7 rules applied. Total rules applied 131 place count 101 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 138 place count 101 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 98 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 98 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 95 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 95 transition count 123
Applied a total of 150 rules in 9 ms. Remains 95 /159 variables (removed 64) and now considering 123/286 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5237133108530206761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13029757228045785577.kers'
[2026-05-23 23:16:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5237133108530206761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13029757228045785577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 95 cols 405 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-23 23:16:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13029757228045785577.kers
Total runtime 1 ms.
[2026-05-23 23:16:04] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 23:16:04] [INFO ] Invariant cache hit.
[2026-05-23 23:16:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 23:16:04] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-23 23:16:04] [INFO ] Invariant cache hit.
[2026-05-23 23:16:04] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 136 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/258 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 258 constraints, problems are : Problem set: 0 solved, 122 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: 39/39 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37104ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 37105ms
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 123/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37573 ms. Remains : 95/159 places, 123/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&F((p2||G(p1)))))'
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-04 finished in 37845 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((X((X(p1)&&p0))||(X(X(X(F(p3))))&&p2))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 208
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 137 transition count 206
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 61 place count 122 transition count 184
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 122 transition count 184
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 122 transition count 177
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 96 place count 109 transition count 160
Iterating global reduction 2 with 13 rules applied. Total rules applied 109 place count 109 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 109 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 101 transition count 140
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 101 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 135 place count 101 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 97 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 97 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 95 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 95 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 95 transition count 128
Applied a total of 148 rules in 14 ms. Remains 95 /159 variables (removed 64) and now considering 128/286 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17973698357487045583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7283042321016621621.kers'
[2026-05-23 23:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17973698357487045583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7283042321016621621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 95 cols 411 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-23 23:16:42] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7283042321016621621.kers
Total runtime 2 ms.
[2026-05-23 23:16:42] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-23 23:16:42] [INFO ] Invariant cache hit.
[2026-05-23 23:16:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 23:16:42] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-23 23:16:42] [INFO ] Invariant cache hit.
[2026-05-23 23:16:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/223 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 45/142 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 142 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/223 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 45/142 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 127/269 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 269 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36941ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 36941ms
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 128/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37729 ms. Remains : 95/159 places, 128/286 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((X((X(p1)&&p0))||(X(X(X(F(p3))))&&p2))))'
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-05 finished in 38078 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((X(X(X(p0)))||((!p1||X(!p2)) U (G((!p1||X(!p2)))||(!p3&&(!p1||X(!p2))))))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 213
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 210
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 120 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 120 transition count 184
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 91 place count 120 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 107 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 107 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 107 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 99 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 99 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 141 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 94 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 91 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 91 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 159 place count 91 transition count 123
Applied a total of 159 rules in 12 ms. Remains 91 /159 variables (removed 68) and now considering 123/286 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6004879133274061737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12331318578655128983.kers'
[2026-05-23 23:17:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6004879133274061737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12331318578655128983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 91 cols 389 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-23 23:17:20] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12331318578655128983.kers
Total runtime 2 ms.
[2026-05-23 23:17:20] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-23 23:17:20] [INFO ] Invariant cache hit.
[2026-05-23 23:17:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 23:17:20] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-23 23:17:20] [INFO ] Invariant cache hit.
[2026-05-23 23:17:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/214 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 139 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/214 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 46/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 122/261 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/214 variables, and 261 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37942ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 37943ms
Starting structural reductions in LTL mode, iteration 1 : 91/159 places, 123/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38726 ms. Remains : 91/159 places, 123/286 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((X(X(X(p0)))||((!p1||X(!p2)) U (G((!p1||X(!p2)))||(!p3&&(!p1||X(!p2))))))))'
Stuttering acceptance computed with spot in 669 ms :[(AND (NOT p0) p1 p2), (AND p2 (NOT p0)), (AND (NOT p0) p1 p2), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND (NOT p0) p1 p2), (AND p2 (NOT p0)), false, (AND p2 p0), (AND p0 p1 p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-06
Product exploration explored 100000 steps with 22971 reset in 459 ms.
Product exploration explored 100000 steps with 22974 reset in 356 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 314 edges and 91 vertex of which 90 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 7 factoid took 150 ms. Reduced automaton from 12 states, 18 edges and 4 AP (stutter sensitive) to 12 states, 18 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (9112 resets) in 266 ms. (149 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (4030 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1938 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (4003 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1915 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1912 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
[2026-05-23 23:18:00] [INFO ] Invariant cache hit.
[2026-05-23 23:18:00] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/38 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 90/152 variables, 62/64 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 13/77 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 58/210 variables, 27/104 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 31/135 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/214 variables, 2/137 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 2/139 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/214 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 139 constraints, problems are : Problem set: 3 solved, 5 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 90/152 variables, 62/68 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 13/81 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 58/210 variables, 27/108 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 31/139 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 5/144 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/214 variables, 2/146 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 2/148 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 148 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2989ms problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 660 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Graph (complete) has 290 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 119
Applied a total of 6 rules in 16 ms. Remains 89 /91 variables (removed 2) and now considering 119/123 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 89/91 places, 119/123 transitions.
RANDOM walk for 40000 steps (9213 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3982 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3935 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1886 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 16157 steps, run visited all 5 properties in 137 ms. (steps per millisecond=117 )
Probabilistic random walk after 16157 steps, saw 7799 distinct states, run finished after 137 ms. (steps per millisecond=117 ) properties seen :5
Found 3 invariant AP formulas.
Knowledge based reduction with 10 factoid took 266 ms. Reduced automaton from 12 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND p1 p2), p2]
Knowledge-based reduction took 5104 ms.
Stuttering acceptance computed with spot in 373 ms :[(OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND p1 p2), p2]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-23 23:18:05] [INFO ] Invariant cache hit.
[2026-05-23 23:18:06] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 23:18:06] [INFO ] Invariant cache hit.
[2026-05-23 23:18:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 23:18:06] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 91/91 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 314 edges and 91 vertex of which 90 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 6 factoid took 108 ms. Reduced automaton from 9 states, 12 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (9216 resets) in 141 ms. (281 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (3983 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1934 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
[2026-05-23 23:18:06] [INFO ] Invariant cache hit.
[2026-05-23 23:18:06] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 90/152 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 58/210 variables, 27/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/214 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 141 constraints, problems are : Problem set: 0 solved, 3 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 90/152 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 58/210 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 31/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/214 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/214 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2145ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 421 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 123/123 transitions.
Graph (complete) has 290 edges and 91 vertex of which 90 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 119
Applied a total of 6 rules in 13 ms. Remains 89 /91 variables (removed 2) and now considering 119/123 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 89/91 places, 119/123 transitions.
RANDOM walk for 40000 steps (9136 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3940 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1856 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 16157 steps, run visited all 3 properties in 83 ms. (steps per millisecond=194 )
Probabilistic random walk after 16157 steps, saw 7799 distinct states, run finished after 84 ms. (steps per millisecond=192 ) properties seen :3
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 9 states, 12 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND p1 p2), p2]
Knowledge-based reduction took 3578 ms.
Stuttering acceptance computed with spot in 377 ms :[(OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND p1 p2), p2]
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1 p2) (AND p1 p2 p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) p2), (AND p1 p2), p2]
Product exploration explored 100000 steps with 23016 reset in 185 ms.
Product exploration explored 100000 steps with 22941 reset in 265 ms.
Spot run failed in 148 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/ltsmin13749622214983966456
[2026-05-23 23:18:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13749622214983966456
Running compilation step : cd /tmp/ltsmin13749622214983966456;'/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 531 ms.
Running link step : cd /tmp/ltsmin13749622214983966456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13749622214983966456;'/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/stateBased12432330819655519467.hoa' '--buchi-type=spotba'
LTSmin run took 500 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-06 finished in 52597 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((X(X(p0))&&F(p1)))) U G(p1))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 207
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 135 transition count 205
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 117 transition count 177
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 117 transition count 177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 117 transition count 170
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 106 place count 104 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 119 place count 104 transition count 153
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 104 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 97 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 97 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 141 place count 97 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 92 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 92 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 155 place count 88 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 88 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 161 place count 88 transition count 116
Applied a total of 161 rules in 8 ms. Remains 88 /159 variables (removed 71) and now considering 116/286 (removed 170) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7647644100718971740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10690765835767432132.kers'
[2026-05-23 23:18:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7647644100718971740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10690765835767432132.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 88 cols 375 entries
Finished phase 1 with 83 SingleSign rule and 3 generalized
[2026-05-23 23:18:12] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10690765835767432132.kers
Total runtime 2 ms.
[2026-05-23 23:18:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-23 23:18:12] [INFO ] Invariant cache hit.
[2026-05-23 23:18:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 23:18:13] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-23 23:18:13] [INFO ] Invariant cache hit.
[2026-05-23 23:18:13] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 129 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/204 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 244 constraints, problems are : Problem set: 0 solved, 115 unsolved in 21012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28150ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 28151ms
Starting structural reductions in LTL mode, iteration 1 : 88/159 places, 116/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28839 ms. Remains : 88/159 places, 116/286 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((X(X(p0))&&F(p1)))) U G(p1))))'
Stuttering acceptance computed with spot in 535 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-07 finished in 29439 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 134 transition count 202
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 134 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 134 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 116 transition count 173
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 116 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 116 transition count 165
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 102 transition count 146
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 102 transition count 146
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 102 transition count 140
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 94 transition count 125
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 94 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 89 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 89 transition count 117
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 86 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 86 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 86 transition count 111
Applied a total of 168 rules in 33 ms. Remains 86 /159 variables (removed 73) and now considering 111/286 (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-10238276998975642695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6036457488269672770.kers'
[2026-05-23 23:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10238276998975642695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6036457488269672770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 86 cols 358 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 23:18:42] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6036457488269672770.kers
Total runtime 2 ms.
[2026-05-23 23:18:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 23:18:42] [INFO ] Invariant cache hit.
[2026-05-23 23:18:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 23:18:42] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2026-05-23 23:18:42] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-23 23:18:42] [INFO ] Invariant cache hit.
[2026-05-23 23:18:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 126 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 110/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 236 constraints, problems are : Problem set: 0 solved, 110 unsolved in 23727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28126ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 28126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 111/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28617 ms. Remains : 86/159 places, 111/286 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 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-08 finished in 28754 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((G(!p0) U p1)))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 211
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 211
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 135 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 118 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 118 transition count 182
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 91 place count 118 transition count 175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 106 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 106 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 106 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 127 place count 100 transition count 142
Iterating global reduction 3 with 6 rules applied. Total rules applied 133 place count 100 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 135 place count 100 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 139 place count 96 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 96 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 146 place count 93 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 149 place count 93 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 151 place count 93 transition count 126
Applied a total of 151 rules in 14 ms. Remains 93 /159 variables (removed 66) and now considering 126/286 (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-643463298961189904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3508784171692281147.kers'
[2026-05-23 23:19:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-643463298961189904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3508784171692281147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 93 cols 400 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 23:19:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3508784171692281147.kers
Total runtime 3 ms.
[2026-05-23 23:19:11] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-23 23:19:11] [INFO ] Invariant cache hit.
[2026-05-23 23:19:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 23:19:11] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-23 23:19:11] [INFO ] Invariant cache hit.
[2026-05-23 23:19:11] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 148 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/219 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 46/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 125/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 273 constraints, problems are : Problem set: 0 solved, 125 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43278ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 43278ms
Starting structural reductions in LTL mode, iteration 1 : 93/159 places, 126/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43904 ms. Remains : 93/159 places, 126/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-09
Stuttering criterion allowed to conclude after 21 steps with 4 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-09 finished in 44060 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)||((p1||(F(!p2) U p3)) U X(p4))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 213
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 137 transition count 212
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 121 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 121 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 85 place count 121 transition count 181
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 110 transition count 165
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 110 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 113 place count 110 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 105 transition count 149
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 105 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 105 transition count 148
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 101 transition count 144
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 101 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 99 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 99 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 99 transition count 140
Applied a total of 138 rules in 9 ms. Remains 99 /159 variables (removed 60) and now considering 140/286 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5652247122512371226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-722152884461423859.kers'
[2026-05-23 23:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5652247122512371226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-722152884461423859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 99 cols 439 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-23 23:19:55] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-722152884461423859.kers
Total runtime 4 ms.
[2026-05-23 23:19:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 23:19:55] [INFO ] Invariant cache hit.
[2026-05-23 23:19:55] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-23 23:19:55] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-23 23:19:55] [INFO ] Invariant cache hit.
[2026-05-23 23:19:55] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 155 constraints, problems are : Problem set: 0 solved, 139 unsolved in 8046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 139/294 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 294 constraints, problems are : Problem set: 0 solved, 139 unsolved in 22519 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30646ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 30648ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 140/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31323 ms. Remains : 99/159 places, 140/286 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)||((p1||(F(!p2) U p3)) U X(p4))))'
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) p3 p2 (NOT p4)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-10 finished in 31634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 133 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 133 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 133 transition count 199
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 115 transition count 171
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 115 transition count 171
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 99 place count 115 transition count 162
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 102 transition count 144
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 102 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 130 place count 102 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 94 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 94 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 94 transition count 121
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 89 transition count 116
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 89 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 86 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 86 transition count 110
Applied a total of 168 rules in 10 ms. Remains 86 /159 variables (removed 73) and now considering 110/286 (removed 176) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16544414983947778350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9642994223627508489.kers'
[2026-05-23 23:20:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16544414983947778350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9642994223627508489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 86 cols 354 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 23:20:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9642994223627508489.kers
Total runtime 2 ms.
[2026-05-23 23:20:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 23:20:26] [INFO ] Invariant cache hit.
[2026-05-23 23:20:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 23:20:27] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-23 23:20:27] [INFO ] Invariant cache hit.
[2026-05-23 23:20:27] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 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/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/196 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 29636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38221ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 38221ms
Starting structural reductions in LTL mode, iteration 1 : 86/159 places, 110/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38671 ms. Remains : 86/159 places, 110/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-11
Product exploration explored 100000 steps with 23008 reset in 361 ms.
Product exploration explored 100000 steps with 22821 reset in 458 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9233 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3871 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5412 steps, run visited all 1 properties in 21 ms. (steps per millisecond=257 )
Probabilistic random walk after 5412 steps, saw 2573 distinct states, run finished after 21 ms. (steps per millisecond=257 ) properties seen :1
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 431 ms.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-23 23:21:06] [INFO ] Invariant cache hit.
[2026-05-23 23:21:07] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-23 23:21:07] [INFO ] Invariant cache hit.
[2026-05-23 23:21:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 23:21:07] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 86/86 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9201 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3992 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5412 steps, run visited all 1 properties in 23 ms. (steps per millisecond=235 )
Probabilistic random walk after 5412 steps, saw 2573 distinct states, run finished after 23 ms. (steps per millisecond=235 ) properties seen :1
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 372 ms.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22995 reset in 160 ms.
Product exploration explored 100000 steps with 22886 reset in 196 ms.
Spot run failed in 62 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/ltsmin9527895333661205796
[2026-05-23 23:21:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9527895333661205796
Running compilation step : cd /tmp/ltsmin9527895333661205796;'/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 332 ms.
Running link step : cd /tmp/ltsmin9527895333661205796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9527895333661205796;'/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/stateBased5710137552826212863.hoa' '--buchi-type=spotba'
LTSmin run took 29 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-11 finished in 42393 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 133 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 133 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 133 transition count 199
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 114 transition count 170
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 114 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 101 place count 114 transition count 161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 114 place count 101 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 127 place count 101 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 101 transition count 137
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 140 place count 94 transition count 123
Iterating global reduction 3 with 7 rules applied. Total rules applied 147 place count 94 transition count 123
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 94 transition count 121
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 89 transition count 116
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 89 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 163 place count 85 transition count 107
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 85 transition count 104
Applied a total of 170 rules in 25 ms. Remains 85 /159 variables (removed 74) and now considering 104/286 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3862462302089456574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17450837671568061752.kers'
[2026-05-23 23:21:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3862462302089456574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17450837671568061752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 85 cols 343 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-23 23:21:09] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17450837671568061752.kers
Total runtime 2 ms.
[2026-05-23 23:21:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 23:21:09] [INFO ] Invariant cache hit.
[2026-05-23 23:21:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 23:21:09] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2026-05-23 23:21:09] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-23 23:21:09] [INFO ] Invariant cache hit.
[2026-05-23 23:21:09] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5943 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 24469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30463ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 30464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/159 places, 104/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30878 ms. Remains : 85/159 places, 104/286 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 58 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-12
Product exploration explored 100000 steps with 22925 reset in 271 ms.
Product exploration explored 100000 steps with 22994 reset in 488 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 75 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 10237 steps (2356 resets) in 31 ms. (319 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 77 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 49 ms :[(NOT p0)]
Knowledge-based reduction took 220 ms.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2026-05-23 23:21:41] [INFO ] Invariant cache hit.
[2026-05-23 23:21:41] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-23 23:21:41] [INFO ] Invariant cache hit.
[2026-05-23 23:21:41] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 23:21:41] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2026-05-23 23:21:41] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 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 69 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 9211 steps (2087 resets) in 31 ms. (287 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 77 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 43 ms :[(NOT p0)]
Knowledge-based reduction took 210 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22928 reset in 273 ms.
Product exploration explored 100000 steps with 23039 reset in 327 ms.
Built C files in :
/tmp/ltsmin8464781281375246948
[2026-05-23 23:21:42] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2026-05-23 23:21:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:21:42] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2026-05-23 23:21:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:21:42] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2026-05-23 23:21:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:21:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8464781281375246948
Running compilation step : cd /tmp/ltsmin8464781281375246948;'/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 530 ms.
Running link step : cd /tmp/ltsmin8464781281375246948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8464781281375246948;'/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/stateBased17777389168211052638.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-12 finished in 34198 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&&G(p1)) U X(X((G(p0)||p2)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 218
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 218
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 136 transition count 215
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 119 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 119 transition count 188
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 119 transition count 178
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 107 transition count 163
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 107 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 107 transition count 158
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 99 transition count 143
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 99 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 145 place count 99 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 148 place count 96 transition count 133
Iterating global reduction 4 with 3 rules applied. Total rules applied 151 place count 96 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 94 transition count 126
Applied a total of 155 rules in 9 ms. Remains 94 /159 variables (removed 65) and now considering 126/286 (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-12673865416759759184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18395165240068840452.kers'
[2026-05-23 23:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12673865416759759184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18395165240068840452.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 94 cols 404 entries
Finished phase 1 with 90 SingleSign rule and 2 generalized
[2026-05-23 23:21:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18395165240068840452.kers
Total runtime 1 ms.
[2026-05-23 23:21:43] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-23 23:21:43] [INFO ] Invariant cache hit.
[2026-05-23 23:21:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 23:21:43] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-23 23:21:43] [INFO ] Invariant cache hit.
[2026-05-23 23:21:43] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 45/141 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 146 constraints, problems are : Problem set: 0 solved, 125 unsolved in 12531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/220 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 45/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 125/271 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 220/220 variables, and 271 constraints, problems are : Problem set: 0 solved, 125 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42595ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 42595ms
Starting structural reductions in LTL mode, iteration 1 : 94/159 places, 126/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43281 ms. Remains : 94/159 places, 126/286 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&&G(p1)) U X(X((G(p0)||p2)))))'
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-13 finished in 43768 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)&&(F(p1)||X(F((p2&&X(p2)))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 136 transition count 211
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 118 transition count 183
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 118 transition count 183
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 92 place count 118 transition count 174
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 104 place count 106 transition count 157
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 106 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 122 place count 106 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 99 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 99 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 139 place count 99 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 95 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 95 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 93 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 93 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 93 transition count 128
Applied a total of 154 rules in 9 ms. Remains 93 /159 variables (removed 66) and now considering 128/286 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4817261600942250718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7828549641154698301.kers'
[2026-05-23 23:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4817261600942250718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7828549641154698301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 93 cols 400 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 23:22:27] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7828549641154698301.kers
Total runtime 2 ms.
[2026-05-23 23:22:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 23:22:27] [INFO ] Invariant cache hit.
[2026-05-23 23:22:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 23:22:27] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-23 23:22:27] [INFO ] Invariant cache hit.
[2026-05-23 23:22:27] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 145 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 127/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 272 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27900ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 27901ms
Starting structural reductions in LTL mode, iteration 1 : 93/159 places, 128/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28391 ms. Remains : 93/159 places, 128/286 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(p1)||X(F((p2&&X(p2)))))))'
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-14
Product exploration explored 100000 steps with 39976 reset in 397 ms.
Product exploration explored 100000 steps with 40043 reset in 389 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 323 edges and 93 vertex of which 92 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 11 ms. Proved property starting from automaton with 5 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-14 finished in 29383 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 286/286 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 134 transition count 210
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 134 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 134 transition count 207
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 115 transition count 178
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 115 transition count 178
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 115 transition count 168
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 115 place count 101 transition count 149
Iterating global reduction 2 with 14 rules applied. Total rules applied 129 place count 101 transition count 149
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 101 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 144 place count 93 transition count 127
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 93 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 160 place count 88 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 165 place count 88 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 169 place count 84 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 84 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 176 place count 84 transition count 107
Applied a total of 176 rules in 14 ms. Remains 84 /159 variables (removed 75) and now considering 107/286 (removed 179) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-669909950885590237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16103129134847552719.kers'
[2026-05-23 23:22:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-669909950885590237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16103129134847552719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 84 cols 344 entries
Finished phase 1 with 80 SingleSign rule and 2 generalized
[2026-05-23 23:22:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16103129134847552719.kers
Total runtime 2 ms.
[2026-05-23 23:22:56] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-23 23:22:56] [INFO ] Invariant cache hit.
[2026-05-23 23:22:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 23:22:56] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2026-05-23 23:22:56] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 23:22:56] [INFO ] Invariant cache hit.
[2026-05-23 23:22:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 20767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25857ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/159 places, 107/286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26310 ms. Remains : 84/159 places, 107/286 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 55 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-15 finished in 26405 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((G(!p0)||G(F(!p1))||(!p2&&F(!p1)&&F(!p3))||(F(!p1)&&G(!p2))))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 23:23:22] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4299979671531526768
[2026-05-23 23:23:23] [INFO ] Computing symmetric may disable matrix : 286 transitions.
[2026-05-23 23:23:23] [INFO ] Applying decomposition
[2026-05-23 23:23:23] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:23:23] [INFO ] Flatten gal took : 21 ms
[2026-05-23 23:23:23] [INFO ] Computing symmetric may enable matrix : 286 transitions.
[2026-05-23 23:23:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph15077981688996180859.txt' '-o' '/tmp/graph15077981688996180859.bin' '-w' '/tmp/graph15077981688996180859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15077981688996180859.bin' '-l' '-1' '-v' '-w' '/tmp/graph15077981688996180859.weights' '-q' '0' '-e' '0.001'
[2026-05-23 23:23:23] [INFO ] Computing Do-Not-Accords matrix : 286 transitions.
[2026-05-23 23:23:23] [INFO ] Decomposing Gal with order
[2026-05-23 23:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 23:23:23] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 23:23:23] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4299979671531526768
Running compilation step : cd /tmp/ltsmin4299979671531526768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 23:23:23] [INFO ] Removed a total of 317 redundant transitions.
[2026-05-23 23:23:23] [INFO ] Flatten gal took : 109 ms
[2026-05-23 23:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 25 ms.
[2026-05-23 23:23:23] [INFO ] Time to serialize gal into /tmp/LTLFireability11300907882706895587.gal : 14 ms
[2026-05-23 23:23:23] [INFO ] Time to serialize properties into /tmp/LTLFireability14516919341672796848.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/LTLFireability11300907882706895587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14516919341672796848.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F(((G(!("((i0.u0.s1>=1)&&(i3.u2.l1305>=1))")))||(G(F(!("((i0.u0.s1>=1)&&(i0.u19.l1291>=1))")))))||((((!("((i3.u2.p60>=1)&&(i8.u15...360
Formula 0 simplified : G(F"((i0.u0.s1>=1)&&(i3.u2.l1305>=1))" & FG"((i0.u0.s1>=1)&&(i0.u19.l1291>=1))")
Compilation finished in 1155 ms.
Running link step : cd /tmp/ltsmin4299979671531526768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4299979671531526768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](!(LTLAPp0==true))||[](<>(!(LTLAPp1==true)))||(!(LTLAPp2==true)&&<>(!(LTLAPp1==true))&&<>(!(LTLAPp3==true)))||(<>(!(LTLAPp1==true))&&[](!(LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 23:47:15] [INFO ] Flatten gal took : 601 ms
[2026-05-23 23:47:16] [INFO ] Time to serialize gal into /tmp/LTLFireability8267860509955734712.gal : 142 ms
[2026-05-23 23:47:16] [INFO ] Time to serialize properties into /tmp/LTLFireability2811063474962089103.ltl : 33 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/LTLFireability8267860509955734712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2811063474962089103.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...297
Read 1 LTL properties
Checking formula 0 : !((G(F(((G(!("((s1>=1)&&(l1305>=1))")))||(G(F(!("((s1>=1)&&(l1291>=1))")))))||((((!("((p60>=1)&&(l620>=1))"))&&(F(!("((s1>=1)&&(l1291>...271
Formula 0 simplified : G(F"((s1>=1)&&(l1305>=1))" & FG"((s1>=1)&&(l1291>=1))")
Detected timeout of ITS tools.
[2026-05-24 00:11:08] [INFO ] Flatten gal took : 931 ms
[2026-05-24 00:11:10] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-24 00:11:11] [INFO ] Transformed 159 places.
[2026-05-24 00:11:11] [INFO ] Transformed 286 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 00:11:11] [INFO ] Time to serialize gal into /tmp/LTLFireability1217884855285559206.gal : 22 ms
[2026-05-24 00:11:11] [INFO ] Time to serialize properties into /tmp/LTLFireability6845472414440342107.ltl : 11 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/LTLFireability1217884855285559206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6845472414440342107.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((G(!("((s1>=1)&&(l1305>=1))")))||(G(F(!("((s1>=1)&&(l1291>=1))")))))||((((!("((p60>=1)&&(l620>=1))"))&&(F(!("((s1>=1)&&(l1291>...271
Formula 0 simplified : G(F"((s1>=1)&&(l1305>=1))" & FG"((s1>=1)&&(l1291>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-d1m08"
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-d1m08, 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-177946993600172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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