Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 184K 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 MedleyA-PT-19-LTLFireability-00
FORMULA_NAME MedleyA-PT-19-LTLFireability-01
FORMULA_NAME MedleyA-PT-19-LTLFireability-02
FORMULA_NAME MedleyA-PT-19-LTLFireability-03
FORMULA_NAME MedleyA-PT-19-LTLFireability-04
FORMULA_NAME MedleyA-PT-19-LTLFireability-05
FORMULA_NAME MedleyA-PT-19-LTLFireability-06
FORMULA_NAME MedleyA-PT-19-LTLFireability-07
FORMULA_NAME MedleyA-PT-19-LTLFireability-08
FORMULA_NAME MedleyA-PT-19-LTLFireability-09
FORMULA_NAME MedleyA-PT-19-LTLFireability-10
FORMULA_NAME MedleyA-PT-19-LTLFireability-11
FORMULA_NAME MedleyA-PT-19-LTLFireability-12
FORMULA_NAME MedleyA-PT-19-LTLFireability-13
FORMULA_NAME MedleyA-PT-19-LTLFireability-14
FORMULA_NAME MedleyA-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779701472200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:31:13] [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-25 09:31:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:31:14] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2026-05-25 09:31:14] [INFO ] Transformed 272 places.
[2026-05-25 09:31:14] [INFO ] Transformed 586 transitions.
[2026-05-25 09:31:14] [INFO ] Found NUPN structural information;
[2026-05-25 09:31:14] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 78 place count 191 transition count 496
Iterating global reduction 1 with 76 rules applied. Total rules applied 154 place count 191 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 156 place count 189 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 189 transition count 492
Applied a total of 158 rules in 65 ms. Remains 189 /269 variables (removed 80) and now considering 492/583 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18196189326683886661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10086573747227305570.kers'
[2026-05-25 09:31:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18196189326683886661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10086573747227305570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 492 rows 189 cols 2699 entries
Finished phase 1 with 159 SingleSign rule and 8 generalized
[2026-05-25 09:31:14] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-10086573747227305570.kers
Total runtime 15 ms.
[2026-05-25 09:31:14] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-25 09:31:14] [INFO ] Invariant cache hit.
[2026-05-25 09:31:15] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2026-05-25 09:31:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/189 variables, 8/22 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/30 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/30 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 492/681 variables, 189/219 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 6/225 constraints. Problems are: Problem set: 120 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/681 variables, and 225 constraints, problems are : Problem set: 120 solved, 371 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 14/14 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 8/22 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 14/36 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/36 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 492/681 variables, 189/225 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/681 variables, 371/596 constraints. Problems are: Problem set: 120 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 13/609 constraints. Problems are: Problem set: 120 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 609 constraints, problems are : Problem set: 120 solved, 371 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 371/491 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60725ms problems are : Problem set: 120 solved, 371 unsolved
Search for dead transitions found 120 dead transitions in 60745ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/269 places, 372/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 189 /189 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61669 ms. Remains : 189/269 places, 372/583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6179890549114598026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14332754105066340250.kers'
[2026-05-25 09:32:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6179890549114598026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14332754105066340250.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 189 cols 1771 entries
Finished phase 1 with 159 SingleSign rule and 8 generalized
[2026-05-25 09:32:16] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14332754105066340250.kers
Total runtime 2 ms.
[2026-05-25 09:32:16] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:32:16] [INFO ] Invariant cache hit.
[2026-05-25 09:32:16] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2026-05-25 09:32:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/561 variables, 189/219 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 228 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/561 variables, 189/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 371/596 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 8/604 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 605 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 189/189 places, 372/372 transitions.
Support contains 36 out of 189 places after structural reductions.
[2026-05-25 09:33:17] [INFO ] Flatten gal took : 64 ms
[2026-05-25 09:33:17] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:33:17] [INFO ] Input system was already deterministic with 372 transitions.
Support contains 35 out of 189 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (23 resets) in 1647 ms. (24 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (13 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (11 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
[2026-05-25 09:33:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/92 variables, 8/8 constraints. Problems are: Problem set: 6 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 19 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 82/174 variables, 13/21 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/176 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 362/538 variables, 176/198 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/198 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 15/553 variables, 8/206 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/206 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 8/561 variables, 5/211 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 1/212 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 1/213 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/213 constraints. Problems are: Problem set: 8 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/561 variables, 0/213 constraints. Problems are: Problem set: 8 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 213 constraints, problems are : Problem set: 8 solved, 17 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/91 variables, 8/8 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 16 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 3 (OVERLAPS) 83/174 variables, 13/21 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/176 variables, 1/22 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 362/538 variables, 176/198 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 6/204 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/205 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 2/207 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 1/208 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/208 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 15/553 variables, 8/216 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 8/224 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 1/225 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 0/225 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 8/561 variables, 5/230 constraints. Problems are: Problem set: 11 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/561 variables, 0/230 constraints. Problems are: Problem set: 11 solved, 14 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 230 constraints, problems are : Problem set: 11 solved, 14 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 14/25 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 7865ms problems are : Problem set: 11 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 372/372 transitions.
Graph (complete) has 662 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 187 transition count 344
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 162 transition count 340
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 160 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 159 transition count 339
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 60 place count 159 transition count 332
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 74 place count 152 transition count 332
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 79 place count 147 transition count 324
Iterating global reduction 4 with 5 rules applied. Total rules applied 84 place count 147 transition count 324
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 135 place count 121 transition count 299
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 121 transition count 298
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 152 place count 113 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 195 place count 113 transition count 309
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 113 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 112 transition count 308
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 203 place count 112 transition count 302
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 209 place count 106 transition count 302
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 222 place count 106 transition count 347
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 245 place count 93 transition count 337
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 256 place count 93 transition count 337
Applied a total of 256 rules in 90 ms. Remains 93 /189 variables (removed 96) and now considering 337/372 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 93/189 places, 337/372 transitions.
RANDOM walk for 40000 steps (16 resets) in 526 ms. (75 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40001 steps (21 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (25 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (27 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (49 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (22 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (42 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (336 resets) in 38 ms. (1025 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14256493229444881253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15930200505881830785.kers'
[2026-05-25 09:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14256493229444881253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15930200505881830785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 337 rows 93 cols 2044 entries
Finished phase 1 with 65 SingleSign rule and 6 generalized
[2026-05-25 09:33:26] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15930200505881830785.kers
Total runtime 2 ms.
[2026-05-25 09:33:26] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 24/92 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 337/429 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/430 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/430 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 135 constraints, problems are : Problem set: 0 solved, 10 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 24/92 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 337/429 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/430 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/430 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 146 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3368ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 8 properties in 1521 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 337/337 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 93 transition count 335
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 91 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 91 transition count 333
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 89 transition count 333
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 27 place count 79 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 79 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 77 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 48 place count 77 transition count 322
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 77 transition count 320
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 75 transition count 319
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 75 transition count 390
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 80 place count 71 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 71 transition count 370
Applied a total of 81 rules in 58 ms. Remains 71 /93 variables (removed 22) and now considering 370/337 (removed -33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 71/93 places, 370/337 transitions.
RANDOM walk for 40000 steps (5572 resets) in 257 ms. (155 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (658 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1981286084393360978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11258196048566632356.kers'
[2026-05-25 09:33:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1981286084393360978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11258196048566632356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 71 cols 2103 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-05-25 09:33:31] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11258196048566632356.kers
Total runtime 2 ms.
[2026-05-25 09:33:31] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/58 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/70 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 370/440 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 170/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/441 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/441 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/58 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/70 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 370/440 variables, 70/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 170/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/441 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/441 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1440 steps, including 167 resets, run visited all 1 properties in 17 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 24 ms.
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-19-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 662 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
FORMULA MedleyA-PT-19-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p0&&X(p1))))||(p2&&F(p3)))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 11 ms. Remains 185 /189 variables (removed 4) and now considering 366/372 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3006134386222601474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3050768798941415815.kers'
[2026-05-25 09:33:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3006134386222601474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3050768798941415815.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 366 rows 185 cols 1759 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:33:32] [INFO ] Computed 22 invariants in 19 ms
Computed 22 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-3050768798941415815.kers
Total runtime 19 ms.
[2026-05-25 09:33:32] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-25 09:33:32] [INFO ] Invariant cache hit.
[2026-05-25 09:33:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
(s60 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 229 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/227 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/592 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 6/598 constraints. Problems are: Problem set: 0 solved, 365 unsolved
SMT process timed out in 60326ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 185/189 places, 366/372 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p0&&X(p1))))||(F(p2)&&p3))))'
Stuttering acceptance computed with spot in 507 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 216 ms.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 8 factoid took 92 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (19 resets) in 444 ms. (89 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40000 steps (13 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (22 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (22 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
[2026-05-25 09:34:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/151 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/157 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 348/505 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 25/530 variables, 16/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/532 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 13/545 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/551 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/151 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/157 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 348/505 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 25/530 variables, 16/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 13/545 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 6/551 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2264ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 599 steps, including 6 resets, run visited all 3 properties in 6 ms. (steps per millisecond=99 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
Knowledge based reduction with 8 factoid took 218 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 3186 ms.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 185 /185 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-25 09:34:37] [INFO ] Invariant cache hit.
[2026-05-25 09:34:37] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:34:37] [INFO ] Invariant cache hit.
[2026-05-25 09:34:38] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 185/185 places, 366/366 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (14 resets) in 126 ms. (314 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (14 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (15 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (25 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
[2026-05-25 09:34:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/151 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/157 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 348/505 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 25/530 variables, 16/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/532 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 13/545 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/551 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/551 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/151 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/157 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 348/505 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 25/530 variables, 16/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/532 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 13/545 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 6/551 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/551 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 8396 steps, including 120 resets, run visited all 3 properties in 106 ms. (steps per millisecond=79 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 105 ms.
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 2718 ms.
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Spot run failed in 95 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/ltsmin15003512126923816781
[2026-05-25 09:34:42] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15003512126923816781
Running compilation step : cd /tmp/ltsmin15003512126923816781;'/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 723 ms.
Running link step : cd /tmp/ltsmin15003512126923816781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin15003512126923816781;'/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/stateBased8673911246841333413.hoa' '--buchi-type=spotba'
LTSmin run took 96 ms.
FORMULA MedleyA-PT-19-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-00 finished in 70250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(X(X(F(p2))))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 17 ms. Remains 184 /189 variables (removed 5) and now considering 365/372 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17624703470395799695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-622085204141206996.kers'
[2026-05-25 09:34:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17624703470395799695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-622085204141206996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 184 cols 1757 entries
Finished phase 1 with 154 SingleSign rule and 8 generalized
[2026-05-25 09:34:42] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-622085204141206996.kers
Total runtime 2 ms.
[2026-05-25 09:34:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:34:43] [INFO ] Invariant cache hit.
[2026-05-25 09:34:43] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:34:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 225 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 590 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 184/189 places, 365/372 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(X(X(F(p2))))))'
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-03
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-03 finished in 60887 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)&&F(G(p1)))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Graph (complete) has 662 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 186 transition count 339
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 156 transition count 333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 153 transition count 333
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 70 place count 153 transition count 323
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 90 place count 143 transition count 323
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 97 place count 136 transition count 311
Iterating global reduction 3 with 7 rules applied. Total rules applied 104 place count 136 transition count 311
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 170 place count 102 transition count 279
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 180 place count 97 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 200 place count 97 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 96 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 95 transition count 297
Applied a total of 203 rules in 64 ms. Remains 95 /189 variables (removed 94) and now considering 297/372 (removed 75) transitions.
[2026-05-25 09:35:43] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5251172996873544886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16449751308755856510.kers'
[2026-05-25 09:35:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5251172996873544886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16449751308755856510.kers]
Normalized transition count is 295 out of 296 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 95 cols 1516 entries
Finished phase 1 with 69 SingleSign rule and 6 generalized
[2026-05-25 09:35:43] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16449751308755856510.kers
Total runtime 2 ms.
[2026-05-25 09:35:43] [INFO ] Implicit Places using invariants in 75 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/189 places, 297/372 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 94/189 places, 297/372 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-06 finished in 308 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(((p1||F(!p2))&&p0)))'
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Graph (complete) has 662 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 186 transition count 341
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 63 place count 158 transition count 335
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 155 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 154 transition count 334
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 68 place count 154 transition count 325
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 86 place count 145 transition count 325
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 94 place count 137 transition count 312
Iterating global reduction 4 with 8 rules applied. Total rules applied 102 place count 137 transition count 312
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 61 rules applied. Total rules applied 163 place count 105 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 100 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 193 place count 100 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 99 transition count 302
Applied a total of 195 rules in 68 ms. Remains 99 /189 variables (removed 90) and now considering 302/372 (removed 70) transitions.
[2026-05-25 09:35:44] [INFO ] Flow matrix only has 301 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6107964317959026419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7005335099254270404.kers'
[2026-05-25 09:35:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6107964317959026419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7005335099254270404.kers]
Normalized transition count is 300 out of 301 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 300 rows 99 cols 1573 entries
Finished phase 1 with 75 SingleSign rule and 5 generalized
[2026-05-25 09:35:44] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7005335099254270404.kers
Total runtime 2 ms.
[2026-05-25 09:35:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 09:35:44] [INFO ] Flow matrix only has 301 transitions (discarded 1 similar events)
[2026-05-25 09:35:44] [INFO ] Invariant cache hit.
[2026-05-25 09:35:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-25 09:35:44] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2026-05-25 09:35:44] [INFO ] Redundant transitions in 75 ms returned []
Running 293 sub problems to find dead transitions.
[2026-05-25 09:35:44] [INFO ] Flow matrix only has 301 transitions (discarded 1 similar events)
[2026-05-25 09:35:44] [INFO ] Invariant cache hit.
[2026-05-25 09:35:44] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 300/398 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 65/182 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 184 constraints, problems are : Problem set: 0 solved, 293 unsolved in 21502 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 300/398 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 65/182 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 293/475 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 65/66 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51795ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 51796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/189 places, 302/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52190 ms. Remains : 99/189 places, 302/372 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(((p1||F(p2))&&p0)))'
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-09
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-09 finished in 52329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U ((p1 U p2)&&X(p3))) U X(X(G(!p0)))))'
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 367
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 367
Applied a total of 8 rules in 2 ms. Remains 185 /189 variables (removed 4) and now considering 367/372 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4519445227675522751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11085913086610647568.kers'
[2026-05-25 09:36:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4519445227675522751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11085913086610647568.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 185 cols 1761 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:36:36] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11085913086610647568.kers
Total runtime 5 ms.
[2026-05-25 09:36:36] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 09:36:36] [INFO ] Invariant cache hit.
[2026-05-25 09:36:36] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-25 09:36:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/589 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 366 unsolved
SMT process timed out in 60226ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 367/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 185/189 places, 367/372 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U ((p1 U p2)&&X(p3))) U X(X(G(!p0)))))'
Stuttering acceptance computed with spot in 486 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-10
Product exploration explored 100000 steps with 25006 reset in 137 ms.
Product exploration explored 100000 steps with 25100 reset in 135 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 651 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 31 factoid took 341 ms. Reduced automaton from 12 states, 36 edges and 4 AP (stutter sensitive) to 12 states, 36 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (21 resets) in 453 ms. (88 steps per ms) remains 13/21 properties
BEST_FIRST walk for 40002 steps (13 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (16 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (29 resets) in 447 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (18 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (15 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (16 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (14 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (23 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (34 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (23 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (9 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
[2026-05-25 09:37:39] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 115/156 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 9/165 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 354/519 variables, 165/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 20/539 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 11/551 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 1/552 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 210 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3274 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 115/156 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 9/165 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 354/519 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 20/539 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 1/540 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/540 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 11/551 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/185 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8331ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 367/367 transitions.
Graph (complete) has 651 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 183 transition count 332
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 151 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 148 transition count 326
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 75 place count 148 transition count 316
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 95 place count 138 transition count 316
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 135 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 135 transition count 310
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 157 place count 106 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 106 transition count 282
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 172 place count 99 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 99 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 226 place count 99 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 98 transition count 282
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 98 transition count 278
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 236 place count 94 transition count 278
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 254 place count 94 transition count 428
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 314 place count 76 transition count 386
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 76 transition count 386
Applied a total of 316 rules in 94 ms. Remains 76 /185 variables (removed 109) and now considering 386/367 (removed -19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 76/185 places, 386/367 transitions.
RANDOM walk for 40000 steps (12 resets) in 305 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (323 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (33 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (13 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (347 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (32 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (347 resets) in 54 ms. (727 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (21 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (21 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (21 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (25 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (32 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (21 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 594738 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :8 out of 13
Probabilistic random walk after 594738 steps, saw 106159 distinct states, run finished after 3010 ms. (steps per millisecond=197 ) properties seen :8
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-472697361825784713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16401415006138545426.kers'
[2026-05-25 09:37:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-472697361825784713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16401415006138545426.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 76 cols 2238 entries
Finished phase 1 with 50 SingleSign rule and 5 generalized
[2026-05-25 09:37:51] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16401415006138545426.kers
Total runtime 2 ms.
[2026-05-25 09:37:51] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1944ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 108 ms.
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 76/76 places, 386/386 transitions.
RANDOM walk for 40000 steps (37 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (33 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (333 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (34 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (34 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 657493 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 5
Probabilistic random walk after 657493 steps, saw 116738 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-25 09:37:56] [INFO ] Invariant cache hit.
[2026-05-25 09:37:56] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1798ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 76/76 places, 386/386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2026-05-25 09:37:58] [INFO ] Invariant cache hit.
[2026-05-25 09:37:58] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:37:58] [INFO ] Invariant cache hit.
[2026-05-25 09:37:58] [INFO ] State equation strengthened by 138 read => feed constraints.
[2026-05-25 09:37:58] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2026-05-25 09:37:59] [INFO ] Redundant transitions in 78 ms returned []
Running 382 sub problems to find dead transitions.
[2026-05-25 09:37:59] [INFO ] Invariant cache hit.
[2026-05-25 09:37:59] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/462 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 138/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 382 unsolved in 23375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/462 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 138/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 382/617 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 619 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53709ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 53723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54332 ms. Remains : 76/76 places, 386/386 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 20 edges and 76 vertex of which 2 / 76 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 460 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 69 transition count 361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 68 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 68 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 68 transition count 307
Free-agglomeration rule (complex) applied 3 times with reduction of 12 identical transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 68 transition count 311
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 65 transition count 307
Applied a total of 55 rules in 18 ms. Remains 65 /76 variables (removed 11) and now considering 307/386 (removed 79) transitions.
Running SMT prover for 5 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1449008861317856208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6533368886081552681.kers'
[2026-05-25 09:38:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1449008861317856208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6533368886081552681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 65 cols 1712 entries
Finished phase 1 with 43 SingleSign rule and 5 generalized
[2026-05-25 09:38:52] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6533368886081552681.kers
Total runtime 3 ms.
[2026-05-25 09:38:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-25 09:38:52] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-25 09:38:53] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-25 09:38:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-25 09:38:53] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 09:38:53] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2026-05-25 09:38:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:38:53] [INFO ] After 103ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-25 09:38:53] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-25 09:38:53] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 774 ms.
Knowledge based reduction with 31 factoid took 498 ms. Reduced automaton from 12 states, 36 edges and 4 AP (stutter sensitive) to 12 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 594 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Knowledge-based reduction took 76698 ms.
Stuttering acceptance computed with spot in 589 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 367/367 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10097740037703400631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12349242081793863586.kers'
[2026-05-25 09:38:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10097740037703400631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12349242081793863586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 185 cols 1761 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:38:55] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12349242081793863586.kers
Total runtime 3 ms.
[2026-05-25 09:38:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:38:55] [INFO ] Invariant cache hit.
[2026-05-25 09:38:55] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-25 09:38:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/589 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 366 unsolved
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 185/185 places, 367/367 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 651 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 31 factoid took 224 ms. Reduced automaton from 12 states, 36 edges and 4 AP (stutter sensitive) to 12 states, 36 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (19 resets) in 403 ms. (99 steps per ms) remains 13/21 properties
BEST_FIRST walk for 40002 steps (37 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (27 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (10 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (30 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (19 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (20 resets) in 68 ms. (579 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (18 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (11 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (17 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (25 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (14 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
[2026-05-25 09:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 115/156 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 9/165 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 354/519 variables, 165/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 20/539 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/540 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 11/551 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 1/552 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 210 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3363 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 115/156 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 9/165 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 354/519 variables, 165/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/519 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 20/539 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/539 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/539 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/539 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 1/540 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/540 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/540 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 11/551 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/185 constraints, PredecessorRefiner: 13/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8386ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 367/367 transitions.
Graph (complete) has 651 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 183 transition count 332
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 72 place count 151 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 148 transition count 326
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 75 place count 148 transition count 316
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 95 place count 138 transition count 316
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 135 transition count 310
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 135 transition count 310
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 157 place count 106 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 106 transition count 282
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 172 place count 99 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 99 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 226 place count 99 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 98 transition count 282
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 98 transition count 278
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 236 place count 94 transition count 278
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 6 with 18 rules applied. Total rules applied 254 place count 94 transition count 428
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 314 place count 76 transition count 386
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 76 transition count 386
Applied a total of 316 rules in 67 ms. Remains 76 /185 variables (removed 109) and now considering 386/367 (removed -19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 76/185 places, 386/367 transitions.
RANDOM walk for 40000 steps (32 resets) in 279 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (328 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (27 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (15 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (353 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (21 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (338 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (27 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (13 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (14 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (48 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (13 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (21 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 675074 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :8 out of 13
Probabilistic random walk after 675074 steps, saw 120501 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :8
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13146224917426937107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10677130922808452219.kers'
[2026-05-25 09:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13146224917426937107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10677130922808452219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 76 cols 2238 entries
Finished phase 1 with 50 SingleSign rule and 5 generalized
[2026-05-25 09:40:08] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10677130922808452219.kers
Total runtime 2 ms.
[2026-05-25 09:40:08] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2276ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/76 places, 386/386 transitions.
RANDOM walk for 40000 steps (35 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (29 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (346 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (41 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (27 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (51 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 625451 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 5
Probabilistic random walk after 625451 steps, saw 110596 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2026-05-25 09:40:14] [INFO ] Invariant cache hit.
[2026-05-25 09:40:14] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/73 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 386/461 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 138/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/462 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/462 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 239 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1727ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 76/76 places, 386/386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 386/386 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2026-05-25 09:40:16] [INFO ] Invariant cache hit.
[2026-05-25 09:40:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:40:16] [INFO ] Invariant cache hit.
[2026-05-25 09:40:16] [INFO ] State equation strengthened by 138 read => feed constraints.
[2026-05-25 09:40:16] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2026-05-25 09:40:16] [INFO ] Redundant transitions in 134 ms returned []
Running 382 sub problems to find dead transitions.
[2026-05-25 09:40:16] [INFO ] Invariant cache hit.
[2026-05-25 09:40:16] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/462 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 138/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 235 constraints, problems are : Problem set: 0 solved, 382 unsolved in 21931 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 386/462 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 138/235 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 382/617 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 619 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 76/76 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52323ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 52324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53044 ms. Remains : 76/76 places, 386/386 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 20 edges and 76 vertex of which 2 / 76 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 460 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 69 transition count 361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 68 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 68 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 45 place count 68 transition count 307
Free-agglomeration rule (complex) applied 3 times with reduction of 12 identical transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 68 transition count 311
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 65 transition count 307
Applied a total of 55 rules in 16 ms. Remains 65 /76 variables (removed 11) and now considering 307/386 (removed 79) transitions.
Running SMT prover for 5 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16862836407091908034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6994513386245084828.kers'
[2026-05-25 09:41:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16862836407091908034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6994513386245084828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 65 cols 1712 entries
Finished phase 1 with 43 SingleSign rule and 5 generalized
[2026-05-25 09:41:09] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6994513386245084828.kers
Total runtime 2 ms.
[2026-05-25 09:41:09] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-25 09:41:09] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 14 ms returned sat
[2026-05-25 09:41:09] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-25 09:41:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-25 09:41:09] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-25 09:41:09] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2026-05-25 09:41:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 09:41:09] [INFO ] After 104ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-25 09:41:10] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-25 09:41:10] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 975 ms.
Knowledge based reduction with 31 factoid took 625 ms. Reduced automaton from 12 states, 36 edges and 4 AP (stutter sensitive) to 12 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 689 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Knowledge-based reduction took 75731 ms.
Stuttering acceptance computed with spot in 460 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 448 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2) p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), p0, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Product exploration explored 100000 steps with 24974 reset in 134 ms.
Product exploration explored 100000 steps with 25055 reset in 124 ms.
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/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/ltsmin256045177374809453
[2026-05-25 09:41:12] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin256045177374809453
Running compilation step : cd /tmp/ltsmin256045177374809453;'/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 738 ms.
Running link step : cd /tmp/ltsmin256045177374809453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin256045177374809453;'/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/stateBased2083501614950118430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 367/367 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18045330373724651690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3022994991978020555.kers'
[2026-05-25 09:41:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18045330373724651690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3022994991978020555.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 185 cols 1761 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:41:27] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3022994991978020555.kers
Total runtime 2 ms.
[2026-05-25 09:41:27] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:41:27] [INFO ] Invariant cache hit.
[2026-05-25 09:41:28] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-25 09:41:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 226 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/589 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 366 unsolved
SMT process timed out in 60221ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 185/185 places, 367/367 transitions.
Built C files in :
/tmp/ltsmin6862234561526828346
[2026-05-25 09:42:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6862234561526828346
Running compilation step : cd /tmp/ltsmin6862234561526828346;'/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 617 ms.
Running link step : cd /tmp/ltsmin6862234561526828346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6862234561526828346;'/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/stateBased12155199191610926971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:42:43] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:42:43] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:42:43] [INFO ] Time to serialize gal into /tmp/LTL626240163209415103.gal : 5 ms
[2026-05-25 09:42:43] [INFO ] Time to serialize properties into /tmp/LTL1188946583529191730.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL626240163209415103.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10903605272957487313.hoa' '-atoms' '/tmp/LTL1188946583529191730.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1188946583529191730.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10903605272957487313.hoa
Detected timeout of ITS tools.
[2026-05-25 09:42:58] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:42:58] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:42:58] [INFO ] Time to serialize gal into /tmp/LTL2507862394223839700.gal : 4 ms
[2026-05-25 09:42:58] [INFO ] Time to serialize properties into /tmp/LTL929693640330044672.ltl : 13 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/LTL2507862394223839700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL929693640330044672.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((F("(((p16==1)&&(p32==1))&&((p238==1)&&(p259==1)))"))U((("(p147==1)")U("(p222==1)"))&&(X("(((p26==1)&&(p78==1))&&((p238==1)&&(p259...231
Formula 0 simplified : (G!"(((p16==1)&&(p32==1))&&((p238==1)&&(p259==1)))" R ((!"(p147==1)" R !"(p222==1)") | X!"(((p26==1)&&(p78==1))&&((p238==1)&&(p259==...216
Detected timeout of ITS tools.
[2026-05-25 09:43:13] [INFO ] Flatten gal took : 37 ms
[2026-05-25 09:43:13] [INFO ] Applying decomposition
[2026-05-25 09:43:13] [INFO ] Flatten gal took : 19 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/graph16898483995162496478.txt' '-o' '/tmp/graph16898483995162496478.bin' '-w' '/tmp/graph16898483995162496478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16898483995162496478.bin' '-l' '-1' '-v' '-w' '/tmp/graph16898483995162496478.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:43:13] [INFO ] Decomposing Gal with order
[2026-05-25 09:43:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:43:14] [INFO ] Removed a total of 623 redundant transitions.
[2026-05-25 09:43:14] [INFO ] Flatten gal took : 82 ms
[2026-05-25 09:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 9 ms.
[2026-05-25 09:43:14] [INFO ] Time to serialize gal into /tmp/LTL3982689766510574920.gal : 3 ms
[2026-05-25 09:43:14] [INFO ] Time to serialize properties into /tmp/LTL15586951617125541825.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/LTL3982689766510574920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15586951617125541825.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("(((i0.u2.p16==1)&&(i0.u4.p32==1))&&((i1.u53.p238==1)&&(i1.u58.p259==1)))"))U((("(i4.u35.p147==1)")U("(i8.u49.p222==1)"))&&(X("...324
Formula 0 simplified : (G!"(((i0.u2.p16==1)&&(i0.u4.p32==1))&&((i1.u53.p238==1)&&(i1.u58.p259==1)))" R ((!"(i4.u35.p147==1)" R !"(i8.u49.p222==1)") | X!"((...309
Reverse transition relation is NOT exact ! Due to transitions t29, t81, t130, i0.u47.t54, i1.t143, i1.t141, i1.t138, i1.t137, i1.t129, i1.u3.t167, i1.u14.t...977
Computing Next relation with stutter on 4850 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1018 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.2222,410796,1,0,858276,5036,3365,1.76762e+06,590,26461,1330170
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-19-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-19-LTLFireability-10 finished in 410143 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(p0))))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 9 ms. Remains 184 /189 variables (removed 5) and now considering 365/372 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10908149372771125497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10179518558798903795.kers'
[2026-05-25 09:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10908149372771125497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10179518558798903795.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 184 cols 1757 entries
Finished phase 1 with 154 SingleSign rule and 8 generalized
[2026-05-25 09:43:26] [INFO ] Computed 22 invariants in 16 ms
Computed 22 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10179518558798903795.kers
Total runtime 18 ms.
[2026-05-25 09:43:26] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-25 09:43:26] [INFO ] Invariant cache hit.
[2026-05-25 09:43:27] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:43:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 225 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 590 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60743 ms. Remains : 184/189 places, 365/372 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(p0))))'
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-14 finished in 61070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 372/372 transitions.
Graph (complete) has 662 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 186 transition count 339
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 156 transition count 333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 153 transition count 333
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 70 place count 153 transition count 321
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 94 place count 141 transition count 321
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 134 transition count 309
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 134 transition count 308
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 133 transition count 308
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 177 place count 98 transition count 276
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 187 place count 93 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 207 place count 93 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 92 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 91 transition count 294
Applied a total of 210 rules in 40 ms. Remains 91 /189 variables (removed 98) and now considering 294/372 (removed 78) transitions.
[2026-05-25 09:44:27] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4180979620547389503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13810173182653642666.kers'
[2026-05-25 09:44:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4180979620547389503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13810173182653642666.kers]
Normalized transition count is 292 out of 293 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 91 cols 1310 entries
Finished phase 1 with 67 SingleSign rule and 5 generalized
[2026-05-25 09:44:27] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13810173182653642666.kers
Total runtime 1 ms.
[2026-05-25 09:44:27] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 09:44:27] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2026-05-25 09:44:27] [INFO ] Invariant cache hit.
[2026-05-25 09:44:27] [INFO ] State equation strengthened by 136 read => feed constraints.
[2026-05-25 09:44:28] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2026-05-25 09:44:28] [INFO ] Redundant transitions in 42 ms returned []
Running 286 sub problems to find dead transitions.
[2026-05-25 09:44:28] [INFO ] Flow matrix only has 293 transitions (discarded 1 similar events)
[2026-05-25 09:44:28] [INFO ] Invariant cache hit.
[2026-05-25 09:44:28] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 292/383 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 135/245 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 246 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24435 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 292/383 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 135/245 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 286/531 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/384 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 532 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54610ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 54611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/189 places, 294/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55003 ms. Remains : 91/189 places, 294/372 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-15
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-15 finished in 55095 ms.
All properties solved by simple procedures.
Total runtime 848821 ms.

BK_STOP 1779702322802

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r178-oct2-177969020000244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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