Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K Mar 6 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 6 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 6 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K 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 DoubleExponent-PT-010-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779681131789

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 03:52:12] [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 03:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:52:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-25 03:52:13] [INFO ] Transformed 534 places.
[2026-05-25 03:52:13] [INFO ] Transformed 498 transitions.
[2026-05-25 03:52:13] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 498
Applied a total of 4 rules in 63 ms. Remains 530 /534 variables (removed 4) and now considering 498/498 (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-4285250027481649322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10182478305254182811.kers'
[2026-05-25 03:52:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4285250027481649322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10182478305254182811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 530 cols 1400 entries
Finished phase 1 with 448 SingleSign rule and 31 generalized
[2026-05-25 03:52:13] [INFO ] Computed 51 invariants in 17 ms
Computed 51 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-10182478305254182811.kers
Total runtime 19 ms.
[2026-05-25 03:52:13] [INFO ] Implicit Places using invariants in 435 ms returned [439]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 468 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/534 places, 498/498 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 528 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 528 transition count 497
Applied a total of 2 rules in 62 ms. Remains 528 /529 variables (removed 1) and now considering 497/498 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6376084480436237924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17402356011645209908.kers'
[2026-05-25 03:52:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6376084480436237924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17402356011645209908.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 03:52:13] [INFO ] Computed 50 invariants in 19 ms
Computed 50 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-17402356011645209908.kers
Total runtime 20 ms.
[2026-05-25 03:52:14] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-25 03:52:14] [INFO ] Invariant cache hit.
[2026-05-25 03:52:16] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 528/534 places, 497/498 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3188 ms. Remains : 528/534 places, 497/498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 20 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2026-05-25 03:52:16] [INFO ] Invariant cache hit.
[2026-05-25 03:52:16] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-25 03:52:16] [INFO ] Invariant cache hit.
[2026-05-25 03:52:19] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 03:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1025 variables, 528/579 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 579 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1025 variables, 528/579 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 496/1075 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1075 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in LTL mode , in 1 iterations and 62801 ms. Remains : 528/528 places, 497/497 transitions.
Support contains 49 out of 528 places after structural reductions.
[2026-05-25 03:53:19] [INFO ] Flatten gal took : 64 ms
[2026-05-25 03:53:19] [INFO ] Flatten gal took : 33 ms
[2026-05-25 03:53:19] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 46 out of 528 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (1324 resets) in 1389 ms. (28 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4000 steps (112 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 73 ms. (54 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (116 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (108 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (104 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (107 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (115 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (112 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (111 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (124 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (109 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (102 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (111 resets) in 51 ms. (76 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (117 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (116 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (113 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (107 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (107 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (109 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (111 resets) in 52 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (114 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (112 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (114 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (117 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (108 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 201252 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :5 out of 28
Probabilistic random walk after 201252 steps, saw 100641 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :5
[2026-05-25 03:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 345/381 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 15/396 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 66/462 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 481/943 variables, 462/512 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 79/1022 variables, 64/577 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1022 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1022 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 23 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 1022/1025 variables, and 582 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 526/528 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 345/381 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 15/396 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 66/462 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 481/943 variables, 462/513 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 12/525 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/943 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/943 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/943 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 79/1022 variables, 64/593 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1022 variables, 11/604 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1022 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1025 variables, and 610 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 526/528 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 10036ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 526 transition count 407
Reduce places removed 88 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 184 place count 438 transition count 401
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 190 place count 432 transition count 401
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 190 place count 432 transition count 376
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 240 place count 407 transition count 376
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 398 place count 328 transition count 297
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 424 place count 315 transition count 297
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 315 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 428 place count 313 transition count 295
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 467 place count 313 transition count 256
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 506 place count 274 transition count 256
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 545 place count 274 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 546 place count 273 transition count 255
Applied a total of 546 rules in 167 ms. Remains 273 /528 variables (removed 255) and now considering 255/497 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 273/528 places, 255/497 transitions.
RANDOM walk for 40000 steps (5114 resets) in 490 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (339 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (345 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (325 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (336 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (338 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (340 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (333 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (352 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (331 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (336 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (347 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (322 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (336 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (350 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (329 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (334 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (353 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (346 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (336 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (362 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (347 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (328 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (327 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 256229 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :1 out of 23
Probabilistic random walk after 256229 steps, saw 128179 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7508683850725704047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5521914159225544981.kers'
[2026-05-25 03:53:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7508683850725704047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5521914159225544981.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 255 rows 271 cols 1154 entries
Finished phase 1 with 164 SingleSign rule and 59 generalized
[2026-05-25 03:53:37] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5521914159225544981.kers
Total runtime 3 ms.
[2026-05-25 03:53:37] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 193/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 41/269 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 255/524 variables, 269/464 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/524 variables, 28/492 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/524 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 4/528 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/528 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/528 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (OVERLAPS) 0/528 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 498 constraints, problems are : Problem set: 0 solved, 22 unsolved in 23381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 273/273 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 147/147 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 193/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 63/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 41/269 variables, 21/111 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 84/195 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/269 variables, 20/495 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/528 variables, and 506 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 0/273 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 458/458 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68402ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 255/255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 272 transition count 254
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 254/255 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 272/273 places, 254/255 transitions.
RANDOM walk for 40000 steps (5159 resets) in 419 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (328 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (337 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (348 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (315 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (328 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (354 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (331 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (327 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (334 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (337 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (347 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (330 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (350 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (332 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (329 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (330 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (344 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (316 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (331 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (329 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (331 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (338 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 244814 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 22
Probabilistic random walk after 244814 steps, saw 122462 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5390854861534318313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14183082857447009629.kers'
[2026-05-25 03:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5390854861534318313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14183082857447009629.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 254 rows 270 cols 1150 entries
Finished phase 1 with 163 SingleSign rule and 59 generalized
[2026-05-25 03:54:49] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14183082857447009629.kers
Total runtime 3 ms.
[2026-05-25 03:54:49] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 193/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 40/268 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 254/522 variables, 268/398 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 29/427 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 4/526 variables, 4/431 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/526 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 433 constraints, problems are : Problem set: 0 solved, 22 unsolved in 14521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 272/272 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 193/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 45/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 40/268 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/268 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/268 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/268 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/268 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/268 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/268 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/526 variables, and 494 constraints, problems are : Problem set: 0 solved, 22 unsolved in 75006 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 0/272 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 446/446 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89540ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2026-05-25 03:56:18] [INFO ] Invariant cache hit.
[2026-05-25 03:56:19] [INFO ] Implicit Places using invariants in 688 ms returned [20, 26, 56, 81, 87, 109, 115, 139, 146, 147, 170, 176, 219, 234, 263, 269]
[2026-05-25 03:56:19] [INFO ] Actually due to overlaps returned [87, 219, 81, 146, 234]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 693 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/272 places, 254/254 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 265 transition count 252
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 265 transition count 252
Applied a total of 6 rules in 32 ms. Remains 265 /267 variables (removed 2) and now considering 252/254 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11135275902305142763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9033281426800358606.kers'
[2026-05-25 03:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11135275902305142763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9033281426800358606.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 252 rows 263 cols 1105 entries
Finished phase 1 with 165 SingleSign rule and 55 generalized
[2026-05-25 03:56:19] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9033281426800358606.kers
Total runtime 3 ms.
[2026-05-25 03:56:20] [INFO ] Implicit Places using invariants in 567 ms returned [20, 26, 56, 107, 113, 137, 144, 167, 173, 256, 262]
[2026-05-25 03:56:20] [INFO ] Actually due to overlaps returned [113, 262, 107, 256]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 571 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 261/272 places, 252/254 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 261 transition count 250
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 259 transition count 250
Applied a total of 4 rules in 20 ms. Remains 259 /261 variables (removed 2) and now considering 250/252 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11340921483099531275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7995424695613748108.kers'
[2026-05-25 03:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11340921483099531275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7995424695613748108.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 250 rows 257 cols 1073 entries
Finished phase 1 with 170 SingleSign rule and 48 generalized
[2026-05-25 03:56:20] [INFO ] Computed 41 invariants in 8 ms
Computed 41 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7995424695613748108.kers
Total runtime 9 ms.
[2026-05-25 03:56:20] [INFO ] Implicit Places using invariants in 459 ms returned [20, 26, 56, 134, 141, 164, 170]
[2026-05-25 03:56:20] [INFO ] Actually due to overlaps returned [141, 20, 26, 134]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 465 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/272 places, 250/254 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 253 transition count 248
Applied a total of 4 rules in 19 ms. Remains 253 /255 variables (removed 2) and now considering 248/250 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2587365707600494777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10265139754048280508.kers'
[2026-05-25 03:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2587365707600494777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10265139754048280508.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 248 rows 251 cols 1052 entries
Finished phase 1 with 171 SingleSign rule and 45 generalized
[2026-05-25 03:56:20] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10265139754048280508.kers
Total runtime 3 ms.
[2026-05-25 03:56:20] [INFO ] Implicit Places using invariants in 376 ms returned [53, 158, 164]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 386 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 250/272 places, 248/254 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 249 transition count 247
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 249 transition count 247
Applied a total of 3 rules in 28 ms. Remains 249 /250 variables (removed 1) and now considering 247/248 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11646263630079420343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12916652747733520008.kers'
[2026-05-25 03:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11646263630079420343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12916652747733520008.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 247 rows 247 cols 1043 entries
Finished phase 1 with 170 SingleSign rule and 45 generalized
[2026-05-25 03:56:20] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12916652747733520008.kers
Total runtime 3 ms.
[2026-05-25 03:56:21] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-25 03:56:21] [INFO ] Invariant cache hit.
[2026-05-25 03:56:21] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 03:56:23] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 249/272 places, 247/254 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 4346 ms. Remains : 249/272 places, 247/254 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 U (G(!p0)||p1)))) U (G(X(X((!p0 U (p1||G(!p0))))))||(!p2&&X(X((!p0 U (p1||G(!p0))))))))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-2156012107330937844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2360053402547060916.kers'
[2026-05-25 03:56:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2156012107330937844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2360053402547060916.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 03:56:23] [INFO ] Computed 50 invariants in 22 ms
Computed 50 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-2360053402547060916.kers
Total runtime 24 ms.
[2026-05-25 03:56:23] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-25 03:56:23] [INFO ] Invariant cache hit.
[2026-05-25 03:56:25] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2362 ms. Remains : 528/528 places, 497/497 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 U (G(!p0)||p1)))) U (G(X(X((!p0 U (p1||G(!p0))))))||(!p2&&X(X((!p0 U (p1||G(!p0))))))))))'
Stuttering acceptance computed with spot in 279 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Product exploration explored 100000 steps with 25000 reset in 200 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 11 factoid took 62 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1343 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1146 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1121 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 283567 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 4
Probabilistic random walk after 283567 steps, saw 141814 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-25 03:56:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 295/298 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/313 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 146/459 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 478/937 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 82/1019 variables, 65/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/1025 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1025 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1025 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1025 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 581 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 295/298 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/313 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 146/459 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 478/937 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 82/1019 variables, 65/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1019 variables, 9/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1025 variables, and 594 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 524/528 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/3 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 6545ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 526 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 409 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 408 transition count 377
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 238 place count 408 transition count 355
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 282 place count 386 transition count 355
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 464 place count 295 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 500 place count 277 transition count 264
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 536 place count 277 transition count 228
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 572 place count 241 transition count 228
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 614 place count 241 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 615 place count 240 transition count 227
Applied a total of 615 rules in 56 ms. Remains 240 /528 variables (removed 288) and now considering 227/497 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 240/528 places, 227/497 transitions.
RANDOM walk for 40000 steps (5158 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3453 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3389 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 345313 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 4
Probabilistic random walk after 345313 steps, saw 172745 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2263073867932475051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4284018359239478789.kers'
[2026-05-25 03:56:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2263073867932475051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4284018359239478789.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 238 cols 1427 entries
Finished phase 1 with 133 SingleSign rule and 57 generalized
[2026-05-25 03:56:39] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4284018359239478789.kers
Total runtime 3 ms.
[2026-05-25 03:56:39] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/234 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/236 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 227/463 variables, 236/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 38/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/467 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 355 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 90/234 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/236 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 227/463 variables, 236/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 38/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/467 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/467 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 369 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6493ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27798 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 240/240 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 03:57:13] [INFO ] Invariant cache hit.
[2026-05-25 03:57:14] [INFO ] Implicit Places using invariants in 1009 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 152, 157, 179, 185, 192, 206, 231, 237]
[2026-05-25 03:57:14] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 226
Applied a total of 2 rules in 16 ms. Remains 237 /238 variables (removed 1) and now considering 226/227 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17037340832615734726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16628269052735341175.kers'
[2026-05-25 03:57:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17037340832615734726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16628269052735341175.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 226 rows 235 cols 1374 entries
Finished phase 1 with 137 SingleSign rule and 52 generalized
[2026-05-25 03:57:14] [INFO ] Computed 48 invariants in 8 ms
Computed 48 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16628269052735341175.kers
Total runtime 9 ms.
[2026-05-25 03:57:15] [INFO ] Implicit Places using invariants in 913 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 151, 156, 178, 184, 203, 228, 234]
[2026-05-25 03:57:15] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 917 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 226/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 225
Applied a total of 2 rules in 17 ms. Remains 234 /235 variables (removed 1) and now considering 225/226 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10780791855113648673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3375662858004750715.kers'
[2026-05-25 03:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10780791855113648673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3375662858004750715.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 225 rows 232 cols 1329 entries
Finished phase 1 with 143 SingleSign rule and 45 generalized
[2026-05-25 03:57:15] [INFO ] Computed 46 invariants in 6 ms
Computed 46 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3375662858004750715.kers
Total runtime 6 ms.
[2026-05-25 03:57:16] [INFO ] Implicit Places using invariants in 740 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 151, 156, 178, 184, 203]
[2026-05-25 03:57:16] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 746 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 225/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 224
Applied a total of 2 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7514042637583717673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12151091648923186042.kers'
[2026-05-25 03:57:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7514042637583717673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12151091648923186042.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 224 rows 229 cols 1290 entries
Finished phase 1 with 139 SingleSign rule and 48 generalized
[2026-05-25 03:57:16] [INFO ] Computed 44 invariants in 8 ms
Computed 44 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12151091648923186042.kers
Total runtime 9 ms.
[2026-05-25 03:57:17] [INFO ] Implicit Places using invariants in 633 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 148, 153, 175, 181, 200]
[2026-05-25 03:57:17] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 637 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 224/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 223
Applied a total of 2 rules in 14 ms. Remains 228 /229 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1744162597886561392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15859450042897665329.kers'
[2026-05-25 03:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1744162597886561392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15859450042897665329.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 223 rows 226 cols 1256 entries
Finished phase 1 with 139 SingleSign rule and 47 generalized
[2026-05-25 03:57:17] [INFO ] Computed 42 invariants in 4 ms
Computed 42 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15859450042897665329.kers
Total runtime 5 ms.
[2026-05-25 03:57:17] [INFO ] Implicit Places using invariants in 581 ms returned [66, 71, 91, 97, 118, 123, 145, 150, 172, 178, 197]
[2026-05-25 03:57:17] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 584 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 223/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 222
Applied a total of 2 rules in 14 ms. Remains 225 /226 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9060391543837200265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17323829911693604389.kers'
[2026-05-25 03:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9060391543837200265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17323829911693604389.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 223 cols 1227 entries
Finished phase 1 with 139 SingleSign rule and 46 generalized
[2026-05-25 03:57:17] [INFO ] Computed 40 invariants in 7 ms
Computed 40 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17323829911693604389.kers
Total runtime 8 ms.
[2026-05-25 03:57:18] [INFO ] Implicit Places using invariants in 546 ms returned [88, 94, 115, 120, 142, 147, 169, 175, 194]
[2026-05-25 03:57:18] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 550 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 223/240 places, 222/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 221
Applied a total of 2 rules in 14 ms. Remains 222 /223 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2264032721677208989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-105894230126807853.kers'
[2026-05-25 03:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2264032721677208989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-105894230126807853.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 220 cols 1203 entries
Finished phase 1 with 139 SingleSign rule and 45 generalized
[2026-05-25 03:57:18] [INFO ] Computed 38 invariants in 3 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-105894230126807853.kers
Total runtime 5 ms.
[2026-05-25 03:57:18] [INFO ] Implicit Places using invariants in 421 ms returned [112, 117, 139, 144, 166, 172, 191]
[2026-05-25 03:57:18] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 423 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 220/240 places, 221/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 220
Applied a total of 2 rules in 14 ms. Remains 219 /220 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2822612565343271931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14247333922715221971.kers'
[2026-05-25 03:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2822612565343271931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14247333922715221971.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 217 cols 1184 entries
Finished phase 1 with 139 SingleSign rule and 44 generalized
[2026-05-25 03:57:18] [INFO ] Computed 36 invariants in 3 ms
Computed 36 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14247333922715221971.kers
Total runtime 5 ms.
[2026-05-25 03:57:19] [INFO ] Implicit Places using invariants in 425 ms returned [136, 141, 163, 169, 188]
[2026-05-25 03:57:19] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 428 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 217/240 places, 220/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 219
Applied a total of 2 rules in 18 ms. Remains 216 /217 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12484806297407049014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11643404614555541293.kers'
[2026-05-25 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12484806297407049014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11643404614555541293.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 214 cols 1170 entries
Finished phase 1 with 139 SingleSign rule and 43 generalized
[2026-05-25 03:57:19] [INFO ] Computed 34 invariants in 7 ms
Computed 34 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11643404614555541293.kers
Total runtime 8 ms.
[2026-05-25 03:57:19] [INFO ] Implicit Places using invariants in 425 ms returned [160, 166, 185]
[2026-05-25 03:57:19] [INFO ] Actually due to overlaps returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 214/240 places, 219/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 218
Applied a total of 2 rules in 14 ms. Remains 213 /214 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4777820029628814892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9315041592372526387.kers'
[2026-05-25 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4777820029628814892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9315041592372526387.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 211 cols 1161 entries
Finished phase 1 with 139 SingleSign rule and 42 generalized
[2026-05-25 03:57:19] [INFO ] Computed 32 invariants in 3 ms
Computed 32 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9315041592372526387.kers
Total runtime 5 ms.
[2026-05-25 03:57:19] [INFO ] Implicit Places using invariants in 358 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 212/240 places, 218/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 217
Applied a total of 2 rules in 15 ms. Remains 211 /212 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8724651951333810506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17090623385349202397.kers'
[2026-05-25 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8724651951333810506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17090623385349202397.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 209 cols 1156 entries
Finished phase 1 with 138 SingleSign rule and 42 generalized
[2026-05-25 03:57:20] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17090623385349202397.kers
Total runtime 8 ms.
[2026-05-25 03:57:20] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-25 03:57:20] [INFO ] Invariant cache hit.
[2026-05-25 03:57:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 03:57:22] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 211/240 places, 217/227 transitions.
Finished structural reductions in REACHABILITY mode , in 11 iterations and 8979 ms. Remains : 211/240 places, 217/227 transitions.
RANDOM walk for 40000 steps (5739 resets) in 378 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3638 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3591 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3656 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 357325 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 4
Probabilistic random walk after 357325 steps, saw 178700 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-25 03:57:25] [INFO ] Invariant cache hit.
[2026-05-25 03:57:25] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 58/203 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/207 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 217/424 variables, 207/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 38/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/428 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/428 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 311 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 58/203 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/207 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 217/424 variables, 207/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 38/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/428 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/428 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 324 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5792ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31443 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 03:58:03] [INFO ] Invariant cache hit.
[2026-05-25 03:58:03] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 03:58:03] [INFO ] Invariant cache hit.
[2026-05-25 03:58:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 03:58:05] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
[2026-05-25 03:58:05] [INFO ] Redundant transitions in 17 ms returned []
Running 216 sub problems to find dead transitions.
[2026-05-25 03:58:05] [INFO ] Invariant cache hit.
[2026-05-25 03:58:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/428 variables, 211/242 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 280 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/428 variables, 211/242 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 216/496 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 20/516 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 516 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45456ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 45457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48187 ms. Remains : 211/211 places, 217/217 transitions.
Knowledge based reduction with 11 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 145223 ms.
Stuttering acceptance computed with spot in 180 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 528 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 17 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-14479062285471849401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10333590724448985647.kers'
[2026-05-25 03:58:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14479062285471849401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10333590724448985647.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 03:58:51] [INFO ] Computed 50 invariants in 16 ms
Computed 50 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10333590724448985647.kers
Total runtime 18 ms.
[2026-05-25 03:58:52] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-25 03:58:52] [INFO ] Invariant cache hit.
[2026-05-25 03:58:54] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 03:58:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1025 variables, 528/579 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 579 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1025 variables, 528/579 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 496/1075 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1075 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 62501 ms. Remains : 528/528 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1312 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1137 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1119 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 282707 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 4
Probabilistic random walk after 282707 steps, saw 141386 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-25 03:59:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 295/298 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/313 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 146/459 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 478/937 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 82/1019 variables, 65/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/1025 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1025 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1025 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1025 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 581 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 295/298 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/313 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 146/459 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 478/937 variables, 459/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 82/1019 variables, 65/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 4/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1019 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1019 variables, 9/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 6519ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 55221 ms.
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 526 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 526 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 409 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 408 transition count 377
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 238 place count 408 transition count 355
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 282 place count 386 transition count 355
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 464 place count 295 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 500 place count 277 transition count 264
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 536 place count 277 transition count 228
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 572 place count 241 transition count 228
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 614 place count 241 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 615 place count 240 transition count 227
Applied a total of 615 rules in 40 ms. Remains 240 /528 variables (removed 288) and now considering 227/497 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 240/528 places, 227/497 transitions.
RANDOM walk for 40000 steps (5148 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3395 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3337 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 320314 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 4
Probabilistic random walk after 320314 steps, saw 160245 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14084956218509701302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9488697490670860580.kers'
[2026-05-25 04:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14084956218509701302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9488697490670860580.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 238 cols 1427 entries
Finished phase 1 with 133 SingleSign rule and 57 generalized
[2026-05-25 04:01:02] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9488697490670860580.kers
Total runtime 2 ms.
[2026-05-25 04:01:02] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/234 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/236 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 227/463 variables, 236/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 38/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/467 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 355 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 90/234 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/236 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 227/463 variables, 236/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 38/355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/467 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/467 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/467 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 369 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 240/240 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6393ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27323 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 240/240 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:01:36] [INFO ] Invariant cache hit.
[2026-05-25 04:01:37] [INFO ] Implicit Places using invariants in 993 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 152, 157, 179, 185, 192, 206, 231, 237]
[2026-05-25 04:01:37] [INFO ] Actually due to overlaps returned [192, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 996 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 227/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 226
Applied a total of 2 rules in 22 ms. Remains 237 /238 variables (removed 1) and now considering 226/227 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9385023642826214664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5253192192418479054.kers'
[2026-05-25 04:01:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9385023642826214664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5253192192418479054.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 235 cols 1374 entries
Finished phase 1 with 137 SingleSign rule and 52 generalized
[2026-05-25 04:01:37] [INFO ] Computed 48 invariants in 4 ms
Computed 48 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5253192192418479054.kers
Total runtime 5 ms.
[2026-05-25 04:01:38] [INFO ] Implicit Places using invariants in 894 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 151, 156, 178, 184, 203, 228, 234]
[2026-05-25 04:01:38] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 897 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 226/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 225
Applied a total of 2 rules in 15 ms. Remains 234 /235 variables (removed 1) and now considering 225/226 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14896501831059447323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11130581752933695919.kers'
[2026-05-25 04:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14896501831059447323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11130581752933695919.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 232 cols 1329 entries
Finished phase 1 with 143 SingleSign rule and 45 generalized
[2026-05-25 04:01:38] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11130581752933695919.kers
Total runtime 2 ms.
[2026-05-25 04:01:38] [INFO ] Implicit Places using invariants in 723 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 151, 156, 178, 184, 203]
[2026-05-25 04:01:38] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 726 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 225/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 224
Applied a total of 2 rules in 13 ms. Remains 231 /232 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13841339526607421785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5650582612872848580.kers'
[2026-05-25 04:01:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13841339526607421785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5650582612872848580.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 224 rows 229 cols 1290 entries
Finished phase 1 with 139 SingleSign rule and 48 generalized
[2026-05-25 04:01:38] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5650582612872848580.kers
Total runtime 3 ms.
[2026-05-25 04:01:39] [INFO ] Implicit Places using invariants in 617 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 148, 153, 175, 181, 200]
[2026-05-25 04:01:39] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 620 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 224/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 223
Applied a total of 2 rules in 13 ms. Remains 228 /229 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17021718918924054018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8401742799306459534.kers'
[2026-05-25 04:01:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17021718918924054018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8401742799306459534.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 226 cols 1256 entries
Finished phase 1 with 139 SingleSign rule and 47 generalized
[2026-05-25 04:01:39] [INFO ] Computed 42 invariants in 7 ms
Computed 42 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8401742799306459534.kers
Total runtime 8 ms.
[2026-05-25 04:01:40] [INFO ] Implicit Places using invariants in 570 ms returned [66, 71, 91, 97, 118, 123, 145, 150, 172, 178, 197]
[2026-05-25 04:01:40] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 573 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 223/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 222
Applied a total of 2 rules in 13 ms. Remains 225 /226 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11866566361304959529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-342453501477862085.kers'
[2026-05-25 04:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11866566361304959529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-342453501477862085.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 223 cols 1227 entries
Finished phase 1 with 139 SingleSign rule and 46 generalized
[2026-05-25 04:01:40] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-342453501477862085.kers
Total runtime 2 ms.
[2026-05-25 04:01:40] [INFO ] Implicit Places using invariants in 523 ms returned [88, 94, 115, 120, 142, 147, 169, 175, 194]
[2026-05-25 04:01:40] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 525 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 223/240 places, 222/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 221
Applied a total of 2 rules in 15 ms. Remains 222 /223 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-916039941250340070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-74535893631001552.kers'
[2026-05-25 04:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-916039941250340070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-74535893631001552.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 220 cols 1203 entries
Finished phase 1 with 139 SingleSign rule and 45 generalized
[2026-05-25 04:01:40] [INFO ] Computed 38 invariants in 2 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-74535893631001552.kers
Total runtime 3 ms.
[2026-05-25 04:01:41] [INFO ] Implicit Places using invariants in 382 ms returned [112, 117, 139, 144, 166, 172, 191]
[2026-05-25 04:01:41] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 220/240 places, 221/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 220
Applied a total of 2 rules in 7 ms. Remains 219 /220 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5566031684381334607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3633050521014942122.kers'
[2026-05-25 04:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5566031684381334607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3633050521014942122.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 217 cols 1184 entries
Finished phase 1 with 139 SingleSign rule and 44 generalized
[2026-05-25 04:01:41] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3633050521014942122.kers
Total runtime 3 ms.
[2026-05-25 04:01:41] [INFO ] Implicit Places using invariants in 424 ms returned [136, 141, 163, 169, 188]
[2026-05-25 04:01:41] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 426 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 217/240 places, 220/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 219
Applied a total of 2 rules in 12 ms. Remains 216 /217 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10522549935397492707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3536472791834020171.kers'
[2026-05-25 04:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10522549935397492707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3536472791834020171.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 214 cols 1170 entries
Finished phase 1 with 139 SingleSign rule and 43 generalized
[2026-05-25 04:01:41] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3536472791834020171.kers
Total runtime 3 ms.
[2026-05-25 04:01:41] [INFO ] Implicit Places using invariants in 413 ms returned [160, 166, 185]
[2026-05-25 04:01:41] [INFO ] Actually due to overlaps returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 419 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 214/240 places, 219/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 218
Applied a total of 2 rules in 14 ms. Remains 213 /214 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12410613431486669201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4671310781909430139.kers'
[2026-05-25 04:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12410613431486669201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4671310781909430139.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 211 cols 1161 entries
Finished phase 1 with 139 SingleSign rule and 42 generalized
[2026-05-25 04:01:41] [INFO ] Computed 32 invariants in 5 ms
Computed 32 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4671310781909430139.kers
Total runtime 6 ms.
[2026-05-25 04:01:42] [INFO ] Implicit Places using invariants in 362 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 212/240 places, 218/227 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 217
Applied a total of 2 rules in 14 ms. Remains 211 /212 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2862234136693697741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11929855221918247131.kers'
[2026-05-25 04:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2862234136693697741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11929855221918247131.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 209 cols 1156 entries
Finished phase 1 with 138 SingleSign rule and 42 generalized
[2026-05-25 04:01:42] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11929855221918247131.kers
Total runtime 3 ms.
[2026-05-25 04:01:42] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-25 04:01:42] [INFO ] Invariant cache hit.
[2026-05-25 04:01:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:01:45] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 211/240 places, 217/227 transitions.
Finished structural reductions in REACHABILITY mode , in 11 iterations and 8768 ms. Remains : 211/240 places, 217/227 transitions.
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 110929 ms.
Stuttering acceptance computed with spot in 188 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Spot run failed in 81 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/ltsmin7814513870454823530
[2026-05-25 04:01:45] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7814513870454823530
Running compilation step : cd /tmp/ltsmin7814513870454823530;'/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 904 ms.
Running link step : cd /tmp/ltsmin7814513870454823530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7814513870454823530;'/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/stateBased8198014061925937987.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLFireability-00 finished in 323796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(X((p1||X(X(p2)))))))))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-9062484047442338066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7344852056140747870.kers'
[2026-05-25 04:01:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9062484047442338066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7344852056140747870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 04:01:47] [INFO ] Computed 50 invariants in 23 ms
Computed 50 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-7344852056140747870.kers
Total runtime 24 ms.
[2026-05-25 04:01:47] [INFO ] Implicit Places using invariants in 204 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 7 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 527/528 places, 497/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(X((p1||X(X(p2)))))))))'
Stuttering acceptance computed with spot in 795 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 14272 reset in 130 ms.
Product exploration explored 100000 steps with 14323 reset in 153 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 22 states, 29 edges and 3 AP (stutter sensitive) to 22 states, 29 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1294 resets) in 176 ms. (225 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1138 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1137 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1158 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1142 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1114 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1128 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1144 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1129 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 234481 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 8
Probabilistic random walk after 234481 steps, saw 117258 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11829546906359696327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5703166726233436423.kers'
[2026-05-25 04:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11829546906359696327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5703166726233436423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:01:52] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-5703166726233436423.kers
Total runtime 18 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 312/315 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 15/330 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 116/446 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 5/451 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 471/922 variables, 451/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf5 is UNSAT
At refinement iteration 11 (OVERLAPS) 88/1010 variables, 68/568 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 3/571 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 8/1018 variables, 4/575 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1018 variables, 0/575 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/1023 variables, 3/578 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1023 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 1/1024 variables, 1/579 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1024 variables, 1/580 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 580 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 312/315 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/330 variables, 2/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 116/446 variables, 29/48 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/451 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 471/922 variables, 451/500 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 3/503 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 88/1010 variables, 68/571 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 4/575 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 4/579 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 6/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 1/586 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1024 variables, and 589 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8381ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 242 place count 405 transition count 354
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 500 place count 276 transition count 264
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 538 place count 276 transition count 226
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 576 place count 238 transition count 226
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 618 place count 238 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 237 transition count 225
Applied a total of 619 rules in 50 ms. Remains 237 /527 variables (removed 290) and now considering 225/497 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 237/527 places, 225/497 transitions.
RANDOM walk for 40000 steps (5118 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3325 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3431 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3406 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3406 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3418 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3354 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3488 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 307133 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :2 out of 7
Probabilistic random walk after 307133 steps, saw 153655 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6768680663199450750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17727739467861212402.kers'
[2026-05-25 04:02:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6768680663199450750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17727739467861212402.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 235 cols 1422 entries
Finished phase 1 with 129 SingleSign rule and 59 generalized
[2026-05-25 04:02:03] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17727739467861212402.kers
Total runtime 2 ms.
[2026-05-25 04:02:03] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 145/214 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/232 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 225/457 variables, 232/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 37/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 5/462 variables, 5/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/462 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 360 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 37/37 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 145/214 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/232 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 225/457 variables, 232/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 37/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/457 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/457 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 5/462 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 367 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7153ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2947 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 237/237 places, 225/225 transitions.
RANDOM walk for 40000 steps (5100 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3401 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3399 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3445 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 321561 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 5
Probabilistic random walk after 321561 steps, saw 160868 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-25 04:02:17] [INFO ] Invariant cache hit.
[2026-05-25 04:02:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 145/214 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/232 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 225/457 variables, 232/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 37/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 5/462 variables, 5/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/462 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/462 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 360 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 37/37 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 145/214 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 16/230 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/232 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 225/457 variables, 232/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 37/354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/457 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/457 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/457 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 5/462 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/462 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/462 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 367 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 237/237 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7371ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2925 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 237/237 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 237 /237 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2026-05-25 04:02:27] [INFO ] Invariant cache hit.
[2026-05-25 04:02:28] [INFO ] Implicit Places using invariants in 1026 ms returned [20, 27, 47, 52, 74, 79, 99, 105, 128, 133, 134, 154, 159, 181, 187, 194, 228, 234]
[2026-05-25 04:02:28] [INFO ] Actually due to overlaps returned [194, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1030 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 13 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11662407124364910579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12782221093808498952.kers'
[2026-05-25 04:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11662407124364910579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12782221093808498952.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 224 rows 232 cols 1369 entries
Finished phase 1 with 132 SingleSign rule and 55 generalized
[2026-05-25 04:02:28] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12782221093808498952.kers
Total runtime 4 ms.
[2026-05-25 04:02:29] [INFO ] Implicit Places using invariants in 924 ms returned [20, 27, 47, 52, 74, 79, 99, 105, 128, 133, 153, 158, 180, 186, 225, 231]
[2026-05-25 04:02:29] [INFO ] Actually due to overlaps returned [231, 225]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 927 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/237 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14624600301843145454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15533009415896063580.kers'
[2026-05-25 04:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14624600301843145454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15533009415896063580.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 223 rows 229 cols 1324 entries
Finished phase 1 with 135 SingleSign rule and 51 generalized
[2026-05-25 04:02:29] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15533009415896063580.kers
Total runtime 3 ms.
[2026-05-25 04:02:30] [INFO ] Implicit Places using invariants in 710 ms returned [20, 27, 47, 52, 74, 79, 99, 105, 128, 133, 153, 158, 180, 186]
[2026-05-25 04:02:30] [INFO ] Actually due to overlaps returned [27, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 716 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/237 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 12 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12619756271675657755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6057107095131342122.kers'
[2026-05-25 04:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12619756271675657755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6057107095131342122.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 226 cols 1285 entries
Finished phase 1 with 135 SingleSign rule and 50 generalized
[2026-05-25 04:02:30] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6057107095131342122.kers
Total runtime 4 ms.
[2026-05-25 04:02:30] [INFO ] Implicit Places using invariants in 608 ms returned [44, 49, 71, 76, 96, 102, 125, 130, 150, 155, 177, 183]
[2026-05-25 04:02:30] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 610 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 226/237 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 12 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14332832710643409675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5169486488988458701.kers'
[2026-05-25 04:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14332832710643409675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5169486488988458701.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 223 cols 1251 entries
Finished phase 1 with 135 SingleSign rule and 49 generalized
[2026-05-25 04:02:30] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5169486488988458701.kers
Total runtime 3 ms.
[2026-05-25 04:02:31] [INFO ] Implicit Places using invariants in 522 ms returned [68, 73, 93, 99, 122, 127, 147, 152, 174, 180]
[2026-05-25 04:02:31] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 524 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/237 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 13 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6716075050385288328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5770317150884727807.kers'
[2026-05-25 04:02:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6716075050385288328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5770317150884727807.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 220 cols 1222 entries
Finished phase 1 with 133 SingleSign rule and 50 generalized
[2026-05-25 04:02:31] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5770317150884727807.kers
Total runtime 3 ms.
[2026-05-25 04:02:32] [INFO ] Implicit Places using invariants in 500 ms returned [90, 96, 119, 124, 144, 149, 171, 177]
[2026-05-25 04:02:32] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 503 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/237 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 12 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16223797373774342091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8883585977197665358.kers'
[2026-05-25 04:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16223797373774342091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8883585977197665358.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 217 cols 1198 entries
Finished phase 1 with 132 SingleSign rule and 50 generalized
[2026-05-25 04:02:32] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8883585977197665358.kers
Total runtime 7 ms.
[2026-05-25 04:02:32] [INFO ] Implicit Places using invariants in 389 ms returned [116, 121, 141, 146, 168, 174]
[2026-05-25 04:02:32] [INFO ] Actually due to overlaps returned [121, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/237 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 12 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11660844069085563636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-439608865526926272.kers'
[2026-05-25 04:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11660844069085563636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-439608865526926272.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 214 cols 1179 entries
Finished phase 1 with 132 SingleSign rule and 49 generalized
[2026-05-25 04:02:32] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-439608865526926272.kers
Total runtime 3 ms.
[2026-05-25 04:02:32] [INFO ] Implicit Places using invariants in 389 ms returned [138, 143, 165, 171]
[2026-05-25 04:02:32] [INFO ] Actually due to overlaps returned [143, 138]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 391 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/237 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 217
Applied a total of 2 rules in 12 ms. Remains 213 /214 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2067745252986234599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6266853453332572927.kers'
[2026-05-25 04:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2067745252986234599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6266853453332572927.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 211 cols 1165 entries
Finished phase 1 with 132 SingleSign rule and 48 generalized
[2026-05-25 04:02:32] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6266853453332572927.kers
Total runtime 3 ms.
[2026-05-25 04:02:33] [INFO ] Implicit Places using invariants in 335 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 336 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/237 places, 217/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 12 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1565748133302636095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14444610197616754013.kers'
[2026-05-25 04:02:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1565748133302636095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14444610197616754013.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 208 cols 1156 entries
Finished phase 1 with 132 SingleSign rule and 47 generalized
[2026-05-25 04:02:33] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14444610197616754013.kers
Total runtime 3 ms.
[2026-05-25 04:02:33] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-25 04:02:33] [INFO ] Invariant cache hit.
[2026-05-25 04:02:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:02:35] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/237 places, 216/225 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7375 ms. Remains : 210/237 places, 216/225 transitions.
RANDOM walk for 40000 steps (5786 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3669 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3672 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3660 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3691 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3602 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 346961 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 5
Probabilistic random walk after 346961 steps, saw 173510 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2026-05-25 04:02:38] [INFO ] Invariant cache hit.
[2026-05-25 04:02:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 92/187 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 14/201 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/205 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 216/421 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 37/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 5/426 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/426 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/426 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 305 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3135 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 27/27 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 92/187 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 14/201 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/205 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 216/421 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 37/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 5/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 5/426 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/426 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/426 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/426 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 313 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4638ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2543 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-25 04:02:45] [INFO ] Invariant cache hit.
[2026-05-25 04:02:45] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-25 04:02:45] [INFO ] Invariant cache hit.
[2026-05-25 04:02:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:02:47] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2026-05-25 04:02:47] [INFO ] Redundant transitions in 16 ms returned []
Running 215 sub problems to find dead transitions.
[2026-05-25 04:02:47] [INFO ] Invariant cache hit.
[2026-05-25 04:02:47] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/426 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 279 constraints, problems are : Problem set: 0 solved, 215 unsolved in 18863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/426 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 215/494 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 514 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48914ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 48915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50744 ms. Remains : 210/210 places, 216/216 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 22 states, 29 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 108309 ms.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 12 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-13053368694899344317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14618471947487490494.kers'
[2026-05-25 04:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13053368694899344317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14618471947487490494.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:03:37] [INFO ] Computed 49 invariants in 28 ms
Computed 49 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-14618471947487490494.kers
Total runtime 29 ms.
[2026-05-25 04:03:37] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-25 04:03:37] [INFO ] Invariant cache hit.
[2026-05-25 04:03:39] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 62225 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1342 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1138 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1141 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1137 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 332981 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :1 out of 3
Probabilistic random walk after 332981 steps, saw 166523 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :1
[2026-05-25 04:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 281/295 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/310 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 136/446 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/451 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 471/922 variables, 451/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/922 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 88/1010 variables, 68/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1018 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1018 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/1023 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1023 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1024 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 580 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 281/295 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/310 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 136/446 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/451 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 471/922 variables, 451/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/922 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/922 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 88/1010 variables, 68/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1010 variables, 3/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1010 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1010 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/1018 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1018 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/1023 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1023 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1024 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1024 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1024 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 583 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3146ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3742 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 466 place count 293 transition count 263
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 502 place count 275 transition count 263
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 540 place count 275 transition count 225
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 578 place count 237 transition count 225
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 620 place count 237 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 621 place count 236 transition count 224
Applied a total of 621 rules in 33 ms. Remains 236 /527 variables (removed 291) and now considering 224/497 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 236/527 places, 224/497 transitions.
RANDOM walk for 40000 steps (5202 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3358 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 471618 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 471618 steps, saw 235968 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1434024031085190427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3547210195099819378.kers'
[2026-05-25 04:04:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1434024031085190427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3547210195099819378.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 224 rows 234 cols 1418 entries
Finished phase 1 with 128 SingleSign rule and 59 generalized
[2026-05-25 04:04:52] [INFO ] Computed 49 invariants in 4 ms
Computed 49 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3547210195099819378.kers
Total runtime 6 ms.
[2026-05-25 04:04:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/210 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/229 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/231 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 224/455 variables, 231/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 38/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/460 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/460 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/460 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/460 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 350 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/210 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/229 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/231 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 224/455 variables, 231/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 38/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/455 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/460 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/460 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/460 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/460 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5682ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2471 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-05-25 04:05:00] [INFO ] Invariant cache hit.
[2026-05-25 04:05:01] [INFO ] Implicit Places using invariants in 1011 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 127, 132, 133, 153, 158, 180, 186, 193, 227, 233]
[2026-05-25 04:05:01] [INFO ] Actually due to overlaps returned [193, 132]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 224/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 223
Applied a total of 2 rules in 7 ms. Remains 233 /234 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7915864579443282151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9331492591764692316.kers'
[2026-05-25 04:05:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7915864579443282151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9331492591764692316.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 231 cols 1365 entries
Finished phase 1 with 131 SingleSign rule and 55 generalized
[2026-05-25 04:05:01] [INFO ] Computed 47 invariants in 5 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9331492591764692316.kers
Total runtime 7 ms.
[2026-05-25 04:05:02] [INFO ] Implicit Places using invariants in 874 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 127, 132, 152, 157, 179, 185, 224, 230]
[2026-05-25 04:05:02] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 877 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 223/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 222
Applied a total of 2 rules in 13 ms. Remains 230 /231 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17258286019328350559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15526568666246957766.kers'
[2026-05-25 04:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17258286019328350559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15526568666246957766.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 228 cols 1320 entries
Finished phase 1 with 134 SingleSign rule and 51 generalized
[2026-05-25 04:05:02] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15526568666246957766.kers
Total runtime 9 ms.
[2026-05-25 04:05:03] [INFO ] Implicit Places using invariants in 704 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 127, 132, 152, 157, 179, 185]
[2026-05-25 04:05:03] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 706 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 222/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 221
Applied a total of 2 rules in 14 ms. Remains 227 /228 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11921319511834235833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14689283593448375605.kers'
[2026-05-25 04:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11921319511834235833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14689283593448375605.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 225 cols 1281 entries
Finished phase 1 with 134 SingleSign rule and 50 generalized
[2026-05-25 04:05:03] [INFO ] Computed 43 invariants in 7 ms
Computed 43 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14689283593448375605.kers
Total runtime 8 ms.
[2026-05-25 04:05:03] [INFO ] Implicit Places using invariants in 644 ms returned [43, 48, 70, 75, 95, 101, 124, 129, 149, 154, 176, 182]
[2026-05-25 04:05:03] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 647 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 221/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 220
Applied a total of 2 rules in 12 ms. Remains 224 /225 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7702082790442099351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12147400999481165437.kers'
[2026-05-25 04:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7702082790442099351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12147400999481165437.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 222 cols 1247 entries
Finished phase 1 with 134 SingleSign rule and 49 generalized
[2026-05-25 04:05:03] [INFO ] Computed 41 invariants in 8 ms
Computed 41 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12147400999481165437.kers
Total runtime 9 ms.
[2026-05-25 04:05:04] [INFO ] Implicit Places using invariants in 537 ms returned [67, 72, 92, 98, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:05:04] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 540 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 220/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7557901123126183705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2983923358727572684.kers'
[2026-05-25 04:05:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7557901123126183705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2983923358727572684.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 219 cols 1218 entries
Finished phase 1 with 132 SingleSign rule and 50 generalized
[2026-05-25 04:05:04] [INFO ] Computed 39 invariants in 8 ms
Computed 39 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2983923358727572684.kers
Total runtime 9 ms.
[2026-05-25 04:05:04] [INFO ] Implicit Places using invariants in 493 ms returned [89, 95, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:05:04] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 496 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 219/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 10 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16338970568422629094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2283015514366915945.kers'
[2026-05-25 04:05:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16338970568422629094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2283015514366915945.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 216 cols 1194 entries
Finished phase 1 with 131 SingleSign rule and 50 generalized
[2026-05-25 04:05:04] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2283015514366915945.kers
Total runtime 7 ms.
[2026-05-25 04:05:05] [INFO ] Implicit Places using invariants in 422 ms returned [115, 120, 140, 145, 167, 173]
[2026-05-25 04:05:05] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 424 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 218/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 12 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7827277836208038766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1668584573384767362.kers'
[2026-05-25 04:05:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7827277836208038766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1668584573384767362.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 213 cols 1175 entries
Finished phase 1 with 131 SingleSign rule and 49 generalized
[2026-05-25 04:05:05] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1668584573384767362.kers
Total runtime 3 ms.
[2026-05-25 04:05:05] [INFO ] Implicit Places using invariants in 387 ms returned [137, 142, 164, 170]
[2026-05-25 04:05:05] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 217/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 12 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16326344367412946851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12534090754280531353.kers'
[2026-05-25 04:05:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16326344367412946851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12534090754280531353.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 210 cols 1161 entries
Finished phase 1 with 131 SingleSign rule and 48 generalized
[2026-05-25 04:05:05] [INFO ] Computed 33 invariants in 7 ms
Computed 33 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12534090754280531353.kers
Total runtime 8 ms.
[2026-05-25 04:05:06] [INFO ] Implicit Places using invariants in 355 ms returned [161, 167]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 358 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 216/224 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 11 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17050679875555211972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15166934567290425534.kers'
[2026-05-25 04:05:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17050679875555211972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15166934567290425534.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 207 cols 1152 entries
Finished phase 1 with 131 SingleSign rule and 47 generalized
[2026-05-25 04:05:06] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15166934567290425534.kers
Total runtime 2 ms.
[2026-05-25 04:05:06] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 04:05:06] [INFO ] Invariant cache hit.
[2026-05-25 04:05:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:05:08] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 215/224 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7944 ms. Remains : 209/236 places, 215/224 transitions.
RANDOM walk for 40000 steps (5754 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3731 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 506420 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 506420 steps, saw 253258 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-25 04:05:11] [INFO ] Invariant cache hit.
[2026-05-25 04:05:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/182 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/200 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 215/419 variables, 204/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/424 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/182 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/200 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/204 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 215/419 variables, 204/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 38/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/424 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/424 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/424 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/424 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 314 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4703ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1019 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-25 04:05:17] [INFO ] Invariant cache hit.
[2026-05-25 04:05:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-25 04:05:17] [INFO ] Invariant cache hit.
[2026-05-25 04:05:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:05:19] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
[2026-05-25 04:05:19] [INFO ] Redundant transitions in 7 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-25 04:05:19] [INFO ] Invariant cache hit.
[2026-05-25 04:05:19] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 278 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/424 variables, 209/240 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/492 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 214 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 Int declared 424/424 variables, and 513 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44543ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 44544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46925 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 197
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 179 transition count 185
Applied a total of 60 rules in 10 ms. Remains 179 /209 variables (removed 30) and now considering 185/215 (removed 30) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8643510042563317468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17399734644092883783.kers'
[2026-05-25 04:06:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8643510042563317468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17399734644092883783.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 185 rows 177 cols 1065 entries
Finished phase 1 with 106 SingleSign rule and 42 generalized
[2026-05-25 04:06:04] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17399734644092883783.kers
Total runtime 8 ms.
[2026-05-25 04:06:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 04:06:04] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2026-05-25 04:06:04] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-25 04:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:06:04] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-25 04:06:04] [INFO ] After 112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:06:04] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 04:06:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 04:06:04] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 9 ms returned sat
[2026-05-25 04:06:04] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 04:06:04] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 04:06:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
TRAPS : Iteration 1
[2026-05-25 04:06:05] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 04:06:05] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 909 ms.
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 86331 ms.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 14287 reset in 101 ms.
Product exploration explored 100000 steps with 14263 reset in 115 ms.
Spot run failed in 39 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/ltsmin14406868114834355231
[2026-05-25 04:06:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14406868114834355231
Running compilation step : cd /tmp/ltsmin14406868114834355231;'/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 772 ms.
Running link step : cd /tmp/ltsmin14406868114834355231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14406868114834355231;'/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/stateBased11144073458467177331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-2428801703498301139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13759179635322872842.kers'
[2026-05-25 04:06:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2428801703498301139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13759179635322872842.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:06:21] [INFO ] Computed 49 invariants in 23 ms
Computed 49 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-13759179635322872842.kers
Total runtime 24 ms.
[2026-05-25 04:06:21] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-25 04:06:21] [INFO ] Invariant cache hit.
[2026-05-25 04:06:23] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in LTL mode , in 1 iterations and 62152 ms. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin4794617508308902494
[2026-05-25 04:07:23] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4794617508308902494
Running compilation step : cd /tmp/ltsmin4794617508308902494;'/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 749 ms.
Running link step : cd /tmp/ltsmin4794617508308902494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4794617508308902494;'/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/stateBased11804870636543996314.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:07:38] [INFO ] Flatten gal took : 22 ms
[2026-05-25 04:07:38] [INFO ] Flatten gal took : 21 ms
[2026-05-25 04:07:38] [INFO ] Time to serialize gal into /tmp/LTL8354118909219709311.gal : 4 ms
[2026-05-25 04:07:38] [INFO ] Time to serialize properties into /tmp/LTL14385381516514155665.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/LTL8354118909219709311.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10146624509506395952.hoa' '-atoms' '/tmp/LTL14385381516514155665.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14385381516514155665.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10146624509506395952.hoa
Detected timeout of ITS tools.
[2026-05-25 04:07:53] [INFO ] Flatten gal took : 18 ms
[2026-05-25 04:07:53] [INFO ] Flatten gal took : 35 ms
[2026-05-25 04:07:53] [INFO ] Time to serialize gal into /tmp/LTL873445459726048391.gal : 3 ms
[2026-05-25 04:07:53] [INFO ] Time to serialize properties into /tmp/LTL4172851715447878159.ltl : 8 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/LTL873445459726048391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4172851715447878159.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("(p332>=1)")U(X(X(X(("(p141>=1)")||(X(X("(p224<1)"))))))))))
Formula 0 simplified : F(!"(p332>=1)" R XXX(!"(p141>=1)" & XX!"(p224<1)"))
Detected timeout of ITS tools.
[2026-05-25 04:08:08] [INFO ] Flatten gal took : 23 ms
[2026-05-25 04:08:08] [INFO ] Applying decomposition
[2026-05-25 04:08:08] [INFO ] Flatten gal took : 17 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/graph13784207736425887185.txt' '-o' '/tmp/graph13784207736425887185.bin' '-w' '/tmp/graph13784207736425887185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13784207736425887185.bin' '-l' '-1' '-v' '-w' '/tmp/graph13784207736425887185.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:08:08] [INFO ] Decomposing Gal with order
[2026-05-25 04:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:08:09] [INFO ] Removed a total of 139 redundant transitions.
[2026-05-25 04:08:09] [INFO ] Flatten gal took : 150 ms
[2026-05-25 04:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 12 ms.
[2026-05-25 04:08:09] [INFO ] Time to serialize gal into /tmp/LTL8962574686033206269.gal : 9 ms
[2026-05-25 04:08:09] [INFO ] Time to serialize properties into /tmp/LTL8797819958782396875.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8962574686033206269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8797819958782396875.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i7.u115.p332>=1)")U(X(X(X(("(i0.i0.i0.u18.p141>=1)")||(X(X("(i3.u62.p224<1)"))))))))))
Formula 0 simplified : F(!"(i7.u115.p332>=1)" R XXX(!"(i0.i0.i0.u18.p141>=1)" & XX!"(i3.u62.p224<1)"))
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLFireability-01 finished in 397263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(p1) U (X(G(p1))||(F(p2)&&X((p1&&X(p3))))))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 15 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-3421016702879761519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12688385450104737783.kers'
[2026-05-25 04:08:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3421016702879761519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12688385450104737783.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 04:08:24] [INFO ] Computed 50 invariants in 29 ms
Computed 50 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-12688385450104737783.kers
Total runtime 31 ms.
[2026-05-25 04:08:24] [INFO ] Implicit Places using invariants in 208 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 9 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 527/528 places, 497/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(p1) U (X(G(p1))||(F(p2)&&X((p1&&X(p3))))))))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1)), true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-02
Product exploration explored 100000 steps with 8164 reset in 135 ms.
Product exploration explored 100000 steps with 8088 reset in 135 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 17 factoid took 66 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1323 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1132 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1132 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1138 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1142 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 443065 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :4 out of 5
Probabilistic random walk after 443065 steps, saw 221567 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :4
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2633776918679740122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9945054587097990275.kers'
[2026-05-25 04:08:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2633776918679740122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9945054587097990275.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:08:28] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-9945054587097990275.kers
Total runtime 19 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 295/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1024 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 295/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 89/1010 variables, 69/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1024 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 472 place count 290 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 545 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 582 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 235 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 234 transition count 222
Applied a total of 623 rules in 28 ms. Remains 234 /527 variables (removed 293) and now considering 222/497 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 234/527 places, 222/497 transitions.
RANDOM walk for 40000 steps (5168 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3433 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 696675 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 696675 steps, saw 348555 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9607299355314197699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2368925750800147246.kers'
[2026-05-25 04:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9607299355314197699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2368925750800147246.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 232 cols 1414 entries
Finished phase 1 with 128 SingleSign rule and 57 generalized
[2026-05-25 04:08:33] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2368925750800147246.kers
Total runtime 8 ms.
[2026-05-25 04:08:33] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/209 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/229 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 222/451 variables, 229/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 38/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/456 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/209 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/229 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 222/451 variables, 229/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 38/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/456 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/456 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:08:37] [INFO ] Invariant cache hit.
[2026-05-25 04:08:38] [INFO ] Implicit Places using invariants in 1019 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:08:38] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 16 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2002204820036049926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5975204478042008916.kers'
[2026-05-25 04:08:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2002204820036049926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5975204478042008916.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 229 cols 1361 entries
Finished phase 1 with 131 SingleSign rule and 53 generalized
[2026-05-25 04:08:38] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5975204478042008916.kers
Total runtime 3 ms.
[2026-05-25 04:08:39] [INFO ] Implicit Places using invariants in 827 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:08:39] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 829 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 14 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-923373671913165854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2156614924102348726.kers'
[2026-05-25 04:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-923373671913165854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2156614924102348726.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 226 cols 1316 entries
Finished phase 1 with 137 SingleSign rule and 46 generalized
[2026-05-25 04:08:39] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2156614924102348726.kers
Total runtime 3 ms.
[2026-05-25 04:08:39] [INFO ] Implicit Places using invariants in 708 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 150, 155, 177, 183]
[2026-05-25 04:08:39] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 710 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 13 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18320998922332534263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1876609507246521983.kers'
[2026-05-25 04:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18320998922332534263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1876609507246521983.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1277 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-25 04:08:39] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1876609507246521983.kers
Total runtime 2 ms.
[2026-05-25 04:08:40] [INFO ] Implicit Places using invariants in 605 ms returned [43, 48, 69, 74, 94, 100, 122, 127, 147, 152, 174, 180]
[2026-05-25 04:08:40] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 607 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 13 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7572765551566458009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1487298925838461110.kers'
[2026-05-25 04:08:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7572765551566458009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1487298925838461110.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1243 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-25 04:08:40] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1487298925838461110.kers
Total runtime 3 ms.
[2026-05-25 04:08:40] [INFO ] Implicit Places using invariants in 500 ms returned [66, 71, 91, 97, 119, 124, 144, 149, 171, 177]
[2026-05-25 04:08:40] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 502 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 12 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7233966857065489045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17965762929484467731.kers'
[2026-05-25 04:08:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7233966857065489045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17965762929484467731.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1214 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-25 04:08:40] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17965762929484467731.kers
Total runtime 3 ms.
[2026-05-25 04:08:41] [INFO ] Implicit Places using invariants in 456 ms returned [88, 94, 116, 121, 141, 146, 168, 174]
[2026-05-25 04:08:41] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 458 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 217/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 216
Applied a total of 2 rules in 13 ms. Remains 216 /217 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1634898494768791400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8353539397588851329.kers'
[2026-05-25 04:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1634898494768791400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8353539397588851329.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 214 cols 1190 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-25 04:08:41] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8353539397588851329.kers
Total runtime 8 ms.
[2026-05-25 04:08:41] [INFO ] Implicit Places using invariants in 405 ms returned [113, 118, 138, 143, 165, 171]
[2026-05-25 04:08:41] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 407 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 214/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 215
Applied a total of 2 rules in 10 ms. Remains 213 /214 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6212465954143862819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13055805922047677486.kers'
[2026-05-25 04:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6212465954143862819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13055805922047677486.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1171 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-25 04:08:41] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13055805922047677486.kers
Total runtime 4 ms.
[2026-05-25 04:08:42] [INFO ] Implicit Places using invariants in 361 ms returned [135, 140, 162, 168]
[2026-05-25 04:08:42] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 363 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 211/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 214
Applied a total of 2 rules in 12 ms. Remains 210 /211 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-940621888982488283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18132189564131208955.kers'
[2026-05-25 04:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-940621888982488283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18132189564131208955.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 208 cols 1157 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-25 04:08:42] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18132189564131208955.kers
Total runtime 7 ms.
[2026-05-25 04:08:42] [INFO ] Implicit Places using invariants in 340 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 342 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 208/234 places, 214/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 10 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7417748246037643004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14382400167105224138.kers'
[2026-05-25 04:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7417748246037643004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14382400167105224138.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 205 cols 1148 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-25 04:08:42] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14382400167105224138.kers
Total runtime 4 ms.
[2026-05-25 04:08:42] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-25 04:08:42] [INFO ] Invariant cache hit.
[2026-05-25 04:08:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:08:44] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7652 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5834 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 758652 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 758652 steps, saw 379402 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2026-05-25 04:08:47] [INFO ] Invariant cache hit.
[2026-05-25 04:08:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 86/186 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/198 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/202 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 213/415 variables, 202/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 38/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/420 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 86/186 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/198 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/202 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 213/415 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/420 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2301ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 04:08:50] [INFO ] Invariant cache hit.
[2026-05-25 04:08:50] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-25 04:08:50] [INFO ] Invariant cache hit.
[2026-05-25 04:08:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:08:52] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2026-05-25 04:08:52] [INFO ] Redundant transitions in 5 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:08:52] [INFO ] Invariant cache hit.
[2026-05-25 04:08:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 213/420 variables, 207/241 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 212/491 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 511 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50100ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 50102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52434 ms. Remains : 207/207 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 9 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4532418155290867737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17192143833704982588.kers'
[2026-05-25 04:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4532418155290867737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17192143833704982588.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 175 cols 1061 entries
Finished phase 1 with 102 SingleSign rule and 44 generalized
[2026-05-25 04:09:42] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17192143833704982588.kers
Total runtime 3 ms.
[2026-05-25 04:09:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:09:42] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-25 04:09:42] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-25 04:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:09:42] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-25 04:09:42] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:09:42] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:09:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:09:42] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-25 04:09:43] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:09:43] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2026-05-25 04:09:43] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:09:43] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 444 ms.
Knowledge based reduction with 17 factoid took 96 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Knowledge-based reduction took 78361 ms.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-18406169924547517326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4826137243985499394.kers'
[2026-05-25 04:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18406169924547517326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4826137243985499394.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:09:43] [INFO ] Computed 49 invariants in 27 ms
Computed 49 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-4826137243985499394.kers
Total runtime 29 ms.
[2026-05-25 04:09:43] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-25 04:09:43] [INFO ] Invariant cache hit.
[2026-05-25 04:09:45] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in LTL mode , in 1 iterations and 62305 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 11 factoid took 52 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1321 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1145 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1157 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1138 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (1144 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 443663 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :4 out of 5
Probabilistic random walk after 443663 steps, saw 221868 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :4
[2026-05-25 04:10:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 295/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1024 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 295/296 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 89/1010 variables, 69/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1024 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 244 place count 404 transition count 353
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 472 place count 290 transition count 260
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 545 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 582 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 622 place count 235 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 234 transition count 222
Applied a total of 623 rules in 28 ms. Remains 234 /527 variables (removed 293) and now considering 222/497 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 234/527 places, 222/497 transitions.
RANDOM walk for 40000 steps (5207 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3364 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 698331 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 698331 steps, saw 349389 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2368385980503387041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3403543438695493788.kers'
[2026-05-25 04:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2368385980503387041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3403543438695493788.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 232 cols 1414 entries
Finished phase 1 with 128 SingleSign rule and 57 generalized
[2026-05-25 04:10:54] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3403543438695493788.kers
Total runtime 3 ms.
[2026-05-25 04:10:54] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/209 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/229 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 222/451 variables, 229/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 38/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/456 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/209 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/229 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 222/451 variables, 229/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 38/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/456 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/456 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:10:58] [INFO ] Invariant cache hit.
[2026-05-25 04:10:59] [INFO ] Implicit Places using invariants in 1034 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:10:59] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1037 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 14 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17800775991229865760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10172842539676473376.kers'
[2026-05-25 04:10:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17800775991229865760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10172842539676473376.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 229 cols 1361 entries
Finished phase 1 with 131 SingleSign rule and 53 generalized
[2026-05-25 04:10:59] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10172842539676473376.kers
Total runtime 4 ms.
[2026-05-25 04:11:00] [INFO ] Implicit Places using invariants in 838 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:11:00] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 840 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 13 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7848183088605892245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13475482813306164496.kers'
[2026-05-25 04:11:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7848183088605892245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13475482813306164496.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 226 cols 1316 entries
Finished phase 1 with 137 SingleSign rule and 46 generalized
[2026-05-25 04:11:00] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13475482813306164496.kers
Total runtime 7 ms.
[2026-05-25 04:11:00] [INFO ] Implicit Places using invariants in 718 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 125, 130, 150, 155, 177, 183]
[2026-05-25 04:11:00] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 720 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 13 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13100649258420947064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18398660139460652943.kers'
[2026-05-25 04:11:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13100649258420947064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18398660139460652943.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1277 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-25 04:11:00] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18398660139460652943.kers
Total runtime 4 ms.
[2026-05-25 04:11:01] [INFO ] Implicit Places using invariants in 617 ms returned [43, 48, 69, 74, 94, 100, 122, 127, 147, 152, 174, 180]
[2026-05-25 04:11:01] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 619 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 13 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11448848655281448582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16543552015961060059.kers'
[2026-05-25 04:11:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11448848655281448582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16543552015961060059.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 220 cols 1243 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-25 04:11:01] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16543552015961060059.kers
Total runtime 8 ms.
[2026-05-25 04:11:01] [INFO ] Implicit Places using invariants in 526 ms returned [66, 71, 91, 97, 119, 124, 144, 149, 171, 177]
[2026-05-25 04:11:01] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 528 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 11 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16336657431035640713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2288368084347945832.kers'
[2026-05-25 04:11:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16336657431035640713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2288368084347945832.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1214 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-25 04:11:01] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2288368084347945832.kers
Total runtime 4 ms.
[2026-05-25 04:11:02] [INFO ] Implicit Places using invariants in 467 ms returned [88, 94, 116, 121, 141, 146, 168, 174]
[2026-05-25 04:11:02] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 468 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 217/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 216
Applied a total of 2 rules in 12 ms. Remains 216 /217 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12496236837269662357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8579564688325160083.kers'
[2026-05-25 04:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12496236837269662357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8579564688325160083.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 214 cols 1190 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-25 04:11:02] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8579564688325160083.kers
Total runtime 3 ms.
[2026-05-25 04:11:02] [INFO ] Implicit Places using invariants in 396 ms returned [113, 118, 138, 143, 165, 171]
[2026-05-25 04:11:02] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 401 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 214/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 215
Applied a total of 2 rules in 10 ms. Remains 213 /214 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12890233031725058534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2165024725096069350.kers'
[2026-05-25 04:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12890233031725058534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2165024725096069350.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1171 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-25 04:11:02] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2165024725096069350.kers
Total runtime 4 ms.
[2026-05-25 04:11:03] [INFO ] Implicit Places using invariants in 367 ms returned [135, 140, 162, 168]
[2026-05-25 04:11:03] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 369 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 211/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 214
Applied a total of 2 rules in 12 ms. Remains 210 /211 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-741775851327217957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9009034414322882574.kers'
[2026-05-25 04:11:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-741775851327217957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9009034414322882574.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1157 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-25 04:11:03] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9009034414322882574.kers
Total runtime 3 ms.
[2026-05-25 04:11:03] [INFO ] Implicit Places using invariants in 336 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 337 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 208/234 places, 214/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 8 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6110440064162144154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6170248621808645014.kers'
[2026-05-25 04:11:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6110440064162144154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6170248621808645014.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 205 cols 1148 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-25 04:11:03] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6170248621808645014.kers
Total runtime 3 ms.
[2026-05-25 04:11:03] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 04:11:03] [INFO ] Invariant cache hit.
[2026-05-25 04:11:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:11:05] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2330 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7766 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5847 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3644 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 747898 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :0 out of 1
Probabilistic random walk after 747898 steps, saw 374025 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
[2026-05-25 04:11:08] [INFO ] Invariant cache hit.
[2026-05-25 04:11:08] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 86/186 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/198 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/202 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 213/415 variables, 202/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 38/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/420 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/420 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 86/186 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/198 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/202 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 213/415 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/420 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2294ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 04:11:11] [INFO ] Invariant cache hit.
[2026-05-25 04:11:11] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 04:11:11] [INFO ] Invariant cache hit.
[2026-05-25 04:11:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:11:13] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
[2026-05-25 04:11:13] [INFO ] Redundant transitions in 4 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:11:13] [INFO ] Invariant cache hit.
[2026-05-25 04:11:13] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 213/420 variables, 207/241 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 212/491 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 511 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50276ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 50277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52609 ms. Remains : 207/207 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 12 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11121801309056471156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8085484563196501032.kers'
[2026-05-25 04:12:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11121801309056471156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8085484563196501032.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 183 rows 175 cols 1061 entries
Finished phase 1 with 102 SingleSign rule and 44 generalized
[2026-05-25 04:12:03] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8085484563196501032.kers
Total runtime 7 ms.
[2026-05-25 04:12:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 04:12:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-25 04:12:04] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2026-05-25 04:12:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:12:04] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
TRAPS : Iteration 1
[2026-05-25 04:12:04] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:12:04] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:12:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:12:04] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-25 04:12:04] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:12:04] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
TRAPS : Iteration 1
[2026-05-25 04:12:04] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:12:04] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 464 ms.
Knowledge based reduction with 11 factoid took 108 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Knowledge-based reduction took 78701 ms.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 5880 reset in 98 ms.
Product exploration explored 100000 steps with 5922 reset in 100 ms.
Spot run failed in 50 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/ltsmin7361558821898002840
[2026-05-25 04:12:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7361558821898002840
Running compilation step : cd /tmp/ltsmin7361558821898002840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 747 ms.
Running link step : cd /tmp/ltsmin7361558821898002840;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7361558821898002840;'/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/stateBased2988180763917384309.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-1601360077755225387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-284946650985779719.kers'
[2026-05-25 04:12:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1601360077755225387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-284946650985779719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:12:20] [INFO ] Computed 49 invariants in 23 ms
Computed 49 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-284946650985779719.kers
Total runtime 25 ms.
[2026-05-25 04:12:20] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-25 04:12:20] [INFO ] Invariant cache hit.
[2026-05-25 04:12:22] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:12:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 62255 ms. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin15997592550706775491
[2026-05-25 04:13:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15997592550706775491
Running compilation step : cd /tmp/ltsmin15997592550706775491;'/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 768 ms.
Running link step : cd /tmp/ltsmin15997592550706775491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15997592550706775491;'/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/stateBased8239553041801880440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:13:37] [INFO ] Flatten gal took : 17 ms
[2026-05-25 04:13:37] [INFO ] Flatten gal took : 13 ms
[2026-05-25 04:13:37] [INFO ] Time to serialize gal into /tmp/LTL15952381491736598203.gal : 3 ms
[2026-05-25 04:13:37] [INFO ] Time to serialize properties into /tmp/LTL5477845146360838940.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15952381491736598203.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13112783615034238655.hoa' '-atoms' '/tmp/LTL5477845146360838940.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5477845146360838940.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13112783615034238655.hoa
Detected timeout of ITS tools.
[2026-05-25 04:13:52] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:13:52] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:13:52] [INFO ] Time to serialize gal into /tmp/LTL1814138491974181117.gal : 3 ms
[2026-05-25 04:13:52] [INFO ] Time to serialize properties into /tmp/LTL1982490801494752593.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1814138491974181117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1982490801494752593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p312<1)")))&&((X("(p156<1)"))U((X(G("(p156<1)")))||((F("((p152>=1)&&(p56>=1))"))&&(X(("(p156<1)")&&(X("(p510<1)")))))))))
Formula 0 simplified : XF!"(p312<1)" | (X!"(p156<1)" R (XF!"(p156<1)" & (G!"((p152>=1)&&(p56>=1))" | X(!"(p156<1)" | X!"(p510<1)"))))
Detected timeout of ITS tools.
[2026-05-25 04:14:07] [INFO ] Flatten gal took : 16 ms
[2026-05-25 04:14:07] [INFO ] Applying decomposition
[2026-05-25 04:14:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3815634117202645785.txt' '-o' '/tmp/graph3815634117202645785.bin' '-w' '/tmp/graph3815634117202645785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3815634117202645785.bin' '-l' '-1' '-v' '-w' '/tmp/graph3815634117202645785.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:14:07] [INFO ] Decomposing Gal with order
[2026-05-25 04:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:14:07] [INFO ] Removed a total of 136 redundant transitions.
[2026-05-25 04:14:07] [INFO ] Flatten gal took : 24 ms
[2026-05-25 04:14:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 13 ms.
[2026-05-25 04:14:07] [INFO ] Time to serialize gal into /tmp/LTL6844227368575351395.gal : 6 ms
[2026-05-25 04:14:07] [INFO ] Time to serialize properties into /tmp/LTL18017151670870151269.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6844227368575351395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18017151670870151269.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 : !(((X(G("(i3.u99.p312<1)")))&&((X("(i9.u26.p156<1)"))U((X(G("(i9.u26.p156<1)")))||((F("((i9.u23.p152>=1)&&(i9.u202.p56>=1))"))&&(X(("(...203
Formula 0 simplified : XF!"(i3.u99.p312<1)" | (X!"(i9.u26.p156<1)" R (XF!"(i9.u26.p156<1)" & (G!"((i9.u23.p152>=1)&&(i9.u202.p56>=1))" | X(!"(i9.u26.p156<1...184
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLFireability-02 finished in 358744 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 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 378
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 409 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 235 place count 409 transition count 357
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 277 place count 388 transition count 357
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 461 place count 296 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 497 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 277 transition count 264
Applied a total of 498 rules in 40 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11172281827236128896.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7497619642708267616.kers'
[2026-05-25 04:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11172281827236128896.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7497619642708267616.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 264 rows 275 cols 1017 entries
Finished phase 1 with 164 SingleSign rule and 63 generalized
[2026-05-25 04:14:23] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7497619642708267616.kers
Total runtime 2 ms.
[2026-05-25 04:14:23] [INFO ] Implicit Places using invariants in 144 ms returned [231]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 161 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 274 transition count 262
Applied a total of 4 rules in 7 ms. Remains 274 /276 variables (removed 2) and now considering 262/264 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17535421980285928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9485055945757983208.kers'
[2026-05-25 04:14:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17535421980285928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9485055945757983208.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 272 cols 1009 entries
Finished phase 1 with 158 SingleSign rule and 67 generalized
[2026-05-25 04:14:23] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9485055945757983208.kers
Total runtime 4 ms.
[2026-05-25 04:14:23] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 04:14:23] [INFO ] Invariant cache hit.
[2026-05-25 04:14:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:14:25] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2103 ms. Remains : 274/528 places, 262/497 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 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-03 finished in 2265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 3 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 15 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-7497468290421968501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4185320124495683343.kers'
[2026-05-25 04:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7497468290421968501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4185320124495683343.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 04:14:25] [INFO ] Computed 50 invariants in 28 ms
Computed 50 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-4185320124495683343.kers
Total runtime 30 ms.
[2026-05-25 04:14:25] [INFO ] Implicit Places using invariants in 219 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 7 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 527/528 places, 497/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-04
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-04 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 526 transition count 383
Reduce places removed 112 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 115 rules applied. Total rules applied 228 place count 414 transition count 380
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 231 place count 411 transition count 380
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 231 place count 411 transition count 358
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 275 place count 389 transition count 358
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 455 place count 299 transition count 268
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 489 place count 282 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 490 place count 282 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 491 place count 281 transition count 267
Applied a total of 491 rules in 36 ms. Remains 281 /528 variables (removed 247) and now considering 267/497 (removed 230) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15679150887796955184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2757437949476198380.kers'
[2026-05-25 04:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15679150887796955184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2757437949476198380.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 267 rows 279 cols 1013 entries
Finished phase 1 with 164 SingleSign rule and 67 generalized
[2026-05-25 04:14:25] [INFO ] Computed 50 invariants in 8 ms
Computed 50 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2757437949476198380.kers
Total runtime 9 ms.
[2026-05-25 04:14:25] [INFO ] Implicit Places using invariants in 140 ms returned [233]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/528 places, 267/497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 278 transition count 265
Applied a total of 4 rules in 6 ms. Remains 278 /280 variables (removed 2) and now considering 265/267 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4950013867897047979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18389379120245218918.kers'
[2026-05-25 04:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4950013867897047979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18389379120245218918.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 265 rows 276 cols 1005 entries
Finished phase 1 with 162 SingleSign rule and 67 generalized
[2026-05-25 04:14:25] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18389379120245218918.kers
Total runtime 3 ms.
[2026-05-25 04:14:26] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-25 04:14:26] [INFO ] Invariant cache hit.
[2026-05-25 04:14:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 04:14:27] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 278/528 places, 265/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1969 ms. Remains : 278/528 places, 265/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-05
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-05 finished in 2075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&p2)))))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-8866832838702211314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1833782340029052282.kers'
[2026-05-25 04:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8866832838702211314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1833782340029052282.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 04:14:27] [INFO ] Computed 50 invariants in 21 ms
Computed 50 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-1833782340029052282.kers
Total runtime 24 ms.
[2026-05-25 04:14:28] [INFO ] Implicit Places using invariants in 195 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 7 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 221 ms. Remains : 527/528 places, 497/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&p2)))))'
Stuttering acceptance computed with spot in 172 ms :[true, p0, p1, (AND p1 p0), p0, p0]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-06
Product exploration explored 100000 steps with 3324 reset in 158 ms.
Product exploration explored 100000 steps with 3314 reset in 176 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 17 factoid took 55 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (1348 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1136 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1139 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1118 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1138 resets) in 112 ms. (353 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1131 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1132 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1126 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 244746 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :3 out of 10
Probabilistic random walk after 244746 steps, saw 122390 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :3
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11047134230220636104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7105145499164525628.kers'
[2026-05-25 04:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11047134230220636104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7105145499164525628.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:14:32] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7105145499164525628.kers
Total runtime 18 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 311/317 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/332 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 113/445 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 7/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 89/1010 variables, 69/576 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 8/1018 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1018 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 5/1023 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1023 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 19 (OVERLAPS) 1/1024 variables, 1/584 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 584 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2961 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 311/317 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/332 variables, 2/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 113/445 variables, 26/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/50 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 5/505 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 7/512 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 1/513 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/921 variables, 0/513 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 89/1010 variables, 69/582 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 1/583 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1010 variables, 11/594 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1024 variables, and 594 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 19/19 constraints]
After SMT, in 7997ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 525 transition count 381
Reduce places removed 114 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 118 rules applied. Total rules applied 234 place count 411 transition count 377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 238 place count 407 transition count 377
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 238 place count 407 transition count 354
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 464 place count 294 transition count 264
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 496 place count 278 transition count 264
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 533 place count 278 transition count 227
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 570 place count 241 transition count 227
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 611 place count 241 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 612 place count 240 transition count 226
Applied a total of 612 rules in 34 ms. Remains 240 /527 variables (removed 287) and now considering 226/497 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 240/527 places, 226/497 transitions.
RANDOM walk for 40000 steps (5122 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3414 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3399 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3389 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3368 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3421 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 331175 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 5
Probabilistic random walk after 331175 steps, saw 165680 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3302540025034775599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12454599276304216502.kers'
[2026-05-25 04:14:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3302540025034775599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12454599276304216502.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 238 cols 1317 entries
Finished phase 1 with 134 SingleSign rule and 57 generalized
[2026-05-25 04:14:43] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12454599276304216502.kers
Total runtime 3 ms.
[2026-05-25 04:14:43] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 164/215 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 20/235 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 226/461 variables, 235/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 37/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 5/466 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/466 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 346 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 240/240 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 20/20 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 164/215 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 20/235 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 226/461 variables, 235/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 37/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 5/466 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/466 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 366 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2355 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 240/240 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3971ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19122 ms.
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:15:06] [INFO ] Invariant cache hit.
[2026-05-25 04:15:07] [INFO ] Implicit Places using invariants in 826 ms returned [21, 27, 47, 52, 73, 78, 98, 104, 125, 130, 131, 152, 157, 196, 231, 237]
[2026-05-25 04:15:07] [INFO ] Actually due to overlaps returned [196, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 829 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 226/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 225
Applied a total of 2 rules in 14 ms. Remains 237 /238 variables (removed 1) and now considering 225/226 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12200764024163930806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8769741571906368011.kers'
[2026-05-25 04:15:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12200764024163930806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8769741571906368011.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 235 cols 1270 entries
Finished phase 1 with 137 SingleSign rule and 53 generalized
[2026-05-25 04:15:07] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8769741571906368011.kers
Total runtime 3 ms.
[2026-05-25 04:15:08] [INFO ] Implicit Places using invariants in 771 ms returned [21, 27, 47, 52, 73, 78, 98, 104, 125, 130, 151, 156, 228, 234]
[2026-05-25 04:15:08] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 773 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 225/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 224
Applied a total of 2 rules in 14 ms. Remains 234 /235 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17398868421372524852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12596644690090341569.kers'
[2026-05-25 04:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17398868421372524852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12596644690090341569.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 224 rows 232 cols 1231 entries
Finished phase 1 with 144 SingleSign rule and 45 generalized
[2026-05-25 04:15:08] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12596644690090341569.kers
Total runtime 4 ms.
[2026-05-25 04:15:08] [INFO ] Implicit Places using invariants in 616 ms returned [21, 27, 47, 52, 73, 78, 98, 104, 125, 130, 151, 156]
[2026-05-25 04:15:08] [INFO ] Actually due to overlaps returned [27, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 618 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 224/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 223
Applied a total of 2 rules in 12 ms. Remains 231 /232 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14397662073013237777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12462508589779641466.kers'
[2026-05-25 04:15:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14397662073013237777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12462508589779641466.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 229 cols 1198 entries
Finished phase 1 with 142 SingleSign rule and 46 generalized
[2026-05-25 04:15:08] [INFO ] Computed 43 invariants in 8 ms
Computed 43 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12462508589779641466.kers
Total runtime 9 ms.
[2026-05-25 04:15:09] [INFO ] Implicit Places using invariants in 544 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 148, 153]
[2026-05-25 04:15:09] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 223/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 222
Applied a total of 2 rules in 12 ms. Remains 228 /229 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10130621722582302571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18402027226991889076.kers'
[2026-05-25 04:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10130621722582302571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18402027226991889076.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 226 cols 1170 entries
Finished phase 1 with 141 SingleSign rule and 46 generalized
[2026-05-25 04:15:09] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18402027226991889076.kers
Total runtime 3 ms.
[2026-05-25 04:15:09] [INFO ] Implicit Places using invariants in 447 ms returned [67, 72, 92, 98, 119, 124, 145, 150]
[2026-05-25 04:15:09] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 449 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 222/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 221
Applied a total of 2 rules in 12 ms. Remains 225 /226 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7824939767449168213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4038401119511675428.kers'
[2026-05-25 04:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7824939767449168213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4038401119511675428.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 223 cols 1147 entries
Finished phase 1 with 141 SingleSign rule and 45 generalized
[2026-05-25 04:15:09] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4038401119511675428.kers
Total runtime 3 ms.
[2026-05-25 04:15:10] [INFO ] Implicit Places using invariants in 385 ms returned [89, 95, 116, 121, 142, 147]
[2026-05-25 04:15:10] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 386 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 223/240 places, 221/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 220
Applied a total of 2 rules in 10 ms. Remains 222 /223 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2857455530277979157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4753231333383101147.kers'
[2026-05-25 04:15:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2857455530277979157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4753231333383101147.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 220 cols 1129 entries
Finished phase 1 with 141 SingleSign rule and 44 generalized
[2026-05-25 04:15:10] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4753231333383101147.kers
Total runtime 6 ms.
[2026-05-25 04:15:10] [INFO ] Implicit Places using invariants in 386 ms returned [113, 118, 139, 144]
[2026-05-25 04:15:10] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 388 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 220/240 places, 220/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 219
Applied a total of 2 rules in 11 ms. Remains 219 /220 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5098331492087661445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2312079951694491352.kers'
[2026-05-25 04:15:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5098331492087661445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2312079951694491352.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 217 cols 1116 entries
Finished phase 1 with 141 SingleSign rule and 43 generalized
[2026-05-25 04:15:10] [INFO ] Computed 35 invariants in 8 ms
Computed 35 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2312079951694491352.kers
Total runtime 8 ms.
[2026-05-25 04:15:10] [INFO ] Implicit Places using invariants in 343 ms returned [136, 141]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 345 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 217/240 places, 219/226 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 218
Applied a total of 2 rules in 13 ms. Remains 216 /217 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1415703174437891140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14812173499638612036.kers'
[2026-05-25 04:15:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1415703174437891140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14812173499638612036.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 214 cols 1108 entries
Finished phase 1 with 141 SingleSign rule and 42 generalized
[2026-05-25 04:15:11] [INFO ] Computed 33 invariants in 8 ms
Computed 33 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14812173499638612036.kers
Total runtime 9 ms.
[2026-05-25 04:15:11] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-25 04:15:11] [INFO ] Invariant cache hit.
[2026-05-25 04:15:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:15:12] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 216/240 places, 218/226 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 6228 ms. Remains : 216/240 places, 218/226 transitions.
RANDOM walk for 40000 steps (5780 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3598 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3634 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3612 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3690 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3622 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 348635 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 5
Probabilistic random walk after 348635 steps, saw 174354 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2026-05-25 04:15:16] [INFO ] Invariant cache hit.
[2026-05-25 04:15:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 134/185 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 24/209 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/211 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 218/429 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/429 variables, 37/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 5/434 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/434 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/434 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 287 constraints, problems are : Problem set: 0 solved, 5 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 216/216 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 134/185 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 24/209 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/211 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 218/429 variables, 211/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 37/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 5/434 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/434 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 320 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2609 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 216/216 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3105ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15040 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 216/216 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 04:15:34] [INFO ] Invariant cache hit.
[2026-05-25 04:15:34] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-25 04:15:34] [INFO ] Invariant cache hit.
[2026-05-25 04:15:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:15:35] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2026-05-25 04:15:35] [INFO ] Redundant transitions in 2 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-25 04:15:35] [INFO ] Invariant cache hit.
[2026-05-25 04:15:35] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/216 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 218/434 variables, 216/278 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 37/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/434 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 315 constraints, problems are : Problem set: 0 solved, 217 unsolved in 28743 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 216/216 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/216 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/434 variables, and 194 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/216 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 0/217 constraints, Known Traps: 161/161 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58794ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 58795ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60543 ms. Remains : 216/216 places, 218/218 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 19 factoid took 97 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, p1, (AND p1 p0), p0, p0, p0]
Knowledge-based reduction took 126421 ms.
Stuttering acceptance computed with spot in 211 ms :[true, p1, (AND p1 p0), p0, p0, p0]
Support contains 6 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 12 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-3657930738783897911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18061102835546890755.kers'
[2026-05-25 04:16:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3657930738783897911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18061102835546890755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:16:35] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-18061102835546890755.kers
Total runtime 18 ms.
[2026-05-25 04:16:35] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-25 04:16:35] [INFO ] Invariant cache hit.
[2026-05-25 04:16:37] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Finished structural reductions in LTL mode , in 1 iterations and 62181 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 11 factoid took 56 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1336 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1161 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1143 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1139 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1137 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1128 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 255319 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :3 out of 7
Probabilistic random walk after 255319 steps, saw 127680 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :3
[2026-05-25 04:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 287/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/306 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/445 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 89/1010 variables, 69/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1018 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1018 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/1023 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1023 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/1024 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1024 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1024 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 584 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 287/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/306 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/445 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 7/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/921 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 89/1010 variables, 69/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 9/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1010 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1010 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/1018 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1018 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 5/1023 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1023 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1023 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 1/1024 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7109ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 407 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 405 transition count 375
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 242 place count 405 transition count 353
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 286 place count 383 transition count 353
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 468 place count 292 transition count 262
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 502 place count 275 transition count 262
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 538 place count 275 transition count 226
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 574 place count 239 transition count 226
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 614 place count 239 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 615 place count 238 transition count 225
Applied a total of 615 rules in 37 ms. Remains 238 /527 variables (removed 289) and now considering 225/497 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 238/527 places, 225/497 transitions.
RANDOM walk for 40000 steps (5108 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3414 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3391 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 330131 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 4
Probabilistic random walk after 330131 steps, saw 165163 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8512421359277435921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-670232277884605458.kers'
[2026-05-25 04:18:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8512421359277435921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-670232277884605458.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 225 rows 236 cols 1318 entries
Finished phase 1 with 133 SingleSign rule and 56 generalized
[2026-05-25 04:18:21] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-670232277884605458.kers
Total runtime 3 ms.
[2026-05-25 04:18:21] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/231 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/233 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 225/458 variables, 233/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 37/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/463 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/463 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 351 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 238/238 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 21/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 44/231 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/233 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 225/458 variables, 233/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 37/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 8/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 5/463 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/463 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/463 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/463 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 365 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 238/238 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4296ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25998 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 238/238 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2026-05-25 04:18:51] [INFO ] Invariant cache hit.
[2026-05-25 04:18:52] [INFO ] Implicit Places using invariants in 876 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 151, 156, 195, 229, 235]
[2026-05-25 04:18:52] [INFO ] Actually due to overlaps returned [195, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 879 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 236/238 places, 225/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 235 transition count 224
Applied a total of 2 rules in 13 ms. Remains 235 /236 variables (removed 1) and now considering 224/225 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1514914205403790055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3978520429964423332.kers'
[2026-05-25 04:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1514914205403790055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3978520429964423332.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 224 rows 233 cols 1271 entries
Finished phase 1 with 137 SingleSign rule and 51 generalized
[2026-05-25 04:18:52] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3978520429964423332.kers
Total runtime 2 ms.
[2026-05-25 04:18:53] [INFO ] Implicit Places using invariants in 755 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155, 226, 232]
[2026-05-25 04:18:53] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 756 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/238 places, 224/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 223
Applied a total of 2 rules in 15 ms. Remains 232 /233 variables (removed 1) and now considering 223/224 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2722004696384516135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-830967686674070301.kers'
[2026-05-25 04:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2722004696384516135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-830967686674070301.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 230 cols 1232 entries
Finished phase 1 with 143 SingleSign rule and 44 generalized
[2026-05-25 04:18:53] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-830967686674070301.kers
Total runtime 8 ms.
[2026-05-25 04:18:53] [INFO ] Implicit Places using invariants in 640 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 150, 155]
[2026-05-25 04:18:53] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 642 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 230/238 places, 223/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 222
Applied a total of 2 rules in 12 ms. Remains 229 /230 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5989779300279881304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5558523092902306650.kers'
[2026-05-25 04:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5989779300279881304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5558523092902306650.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 227 cols 1199 entries
Finished phase 1 with 141 SingleSign rule and 45 generalized
[2026-05-25 04:18:54] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5558523092902306650.kers
Total runtime 3 ms.
[2026-05-25 04:18:54] [INFO ] Implicit Places using invariants in 522 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 147, 152]
[2026-05-25 04:18:54] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 523 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 227/238 places, 222/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 221
Applied a total of 2 rules in 13 ms. Remains 226 /227 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3564148017491955487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9301438223043307916.kers'
[2026-05-25 04:18:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3564148017491955487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9301438223043307916.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 224 cols 1171 entries
Finished phase 1 with 141 SingleSign rule and 44 generalized
[2026-05-25 04:18:54] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9301438223043307916.kers
Total runtime 3 ms.
[2026-05-25 04:18:55] [INFO ] Implicit Places using invariants in 482 ms returned [66, 71, 91, 97, 118, 123, 144, 149]
[2026-05-25 04:18:55] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 484 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 224/238 places, 221/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 220
Applied a total of 2 rules in 13 ms. Remains 223 /224 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10044967029198284203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4829046389003095104.kers'
[2026-05-25 04:18:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10044967029198284203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4829046389003095104.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 221 cols 1148 entries
Finished phase 1 with 141 SingleSign rule and 43 generalized
[2026-05-25 04:18:55] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4829046389003095104.kers
Total runtime 4 ms.
[2026-05-25 04:18:55] [INFO ] Implicit Places using invariants in 408 ms returned [88, 94, 115, 120, 141, 146]
[2026-05-25 04:18:55] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 409 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 221/238 places, 220/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 219
Applied a total of 2 rules in 12 ms. Remains 220 /221 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5202435349598257227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1750547655019164998.kers'
[2026-05-25 04:18:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5202435349598257227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1750547655019164998.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 218 cols 1130 entries
Finished phase 1 with 141 SingleSign rule and 42 generalized
[2026-05-25 04:18:55] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1750547655019164998.kers
Total runtime 7 ms.
[2026-05-25 04:18:55] [INFO ] Implicit Places using invariants in 341 ms returned [112, 117, 138, 143]
[2026-05-25 04:18:55] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 343 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 218/238 places, 219/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 218
Applied a total of 2 rules in 15 ms. Remains 217 /218 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17321916860125112127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2151406571195677765.kers'
[2026-05-25 04:18:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17321916860125112127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2151406571195677765.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 215 cols 1117 entries
Finished phase 1 with 141 SingleSign rule and 41 generalized
[2026-05-25 04:18:55] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2151406571195677765.kers
Total runtime 3 ms.
[2026-05-25 04:18:56] [INFO ] Implicit Places using invariants in 351 ms returned [135, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 352 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 215/238 places, 218/225 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 217
Applied a total of 2 rules in 9 ms. Remains 214 /215 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6970729809704151305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6034823773540699443.kers'
[2026-05-25 04:18:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6970729809704151305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6034823773540699443.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 212 cols 1109 entries
Finished phase 1 with 141 SingleSign rule and 40 generalized
[2026-05-25 04:18:56] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6034823773540699443.kers
Total runtime 3 ms.
[2026-05-25 04:18:56] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-25 04:18:56] [INFO ] Invariant cache hit.
[2026-05-25 04:18:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:18:58] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 214/238 places, 217/225 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 6462 ms. Remains : 214/238 places, 217/225 transitions.
RANDOM walk for 40000 steps (5810 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3625 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3675 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 345894 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 4
Probabilistic random walk after 345894 steps, saw 172989 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2026-05-25 04:19:01] [INFO ] Invariant cache hit.
[2026-05-25 04:19:01] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 149/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 52/205 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/209 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 217/426 variables, 209/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 37/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/431 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/431 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 311 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 214/214 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 149/153 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 52/205 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/209 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 217/426 variables, 209/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 37/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/431 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/431 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 323 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 214/214 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14030 ms.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 214/214 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 217/217 transitions.
Applied a total of 0 rules in 2 ms. Remains 214 /214 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 04:19:18] [INFO ] Invariant cache hit.
[2026-05-25 04:19:19] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-25 04:19:19] [INFO ] Invariant cache hit.
[2026-05-25 04:19:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:19:20] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2026-05-25 04:19:20] [INFO ] Redundant transitions in 1 ms returned []
Running 216 sub problems to find dead transitions.
[2026-05-25 04:19:20] [INFO ] Invariant cache hit.
[2026-05-25 04:19:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/431 variables, 214/247 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 37/284 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/431 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 284 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 214/214 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/431 variables, 214/247 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 37/284 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 216/500 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 520 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 214/214 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45743ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 45744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47753 ms. Remains : 214/214 places, 217/217 transitions.
Knowledge based reduction with 11 factoid took 101 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, p1, (AND p1 p0), p0, p0, p0]
Knowledge-based reduction took 149256 ms.
Stuttering acceptance computed with spot in 186 ms :[true, p1, (AND p1 p0), p0, p0, p0]
Stuttering acceptance computed with spot in 186 ms :[true, p1, (AND p1 p0), p0, p0, p0]
Product exploration explored 100000 steps with 3336 reset in 122 ms.
Product exploration explored 100000 steps with 3307 reset in 122 ms.
Spot run failed in 50 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/ltsmin1975770692896319077
[2026-05-25 04:20:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1975770692896319077
Running compilation step : cd /tmp/ltsmin1975770692896319077;'/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 762 ms.
Running link step : cd /tmp/ltsmin1975770692896319077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1975770692896319077;'/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/stateBased1890566939983291641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 17 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-9372044181413806547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2797851825401789477.kers'
[2026-05-25 04:20:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9372044181413806547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2797851825401789477.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:20:22] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2797851825401789477.kers
Total runtime 19 ms.
[2026-05-25 04:20:22] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-25 04:20:22] [INFO ] Invariant cache hit.
[2026-05-25 04:20:24] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:20:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 62206 ms. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin6938796944225709718
[2026-05-25 04:21:24] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6938796944225709718
Running compilation step : cd /tmp/ltsmin6938796944225709718;'/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 753 ms.
Running link step : cd /tmp/ltsmin6938796944225709718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6938796944225709718;'/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/stateBased16696857774372554131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:21:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 04:21:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:21:39] [INFO ] Time to serialize gal into /tmp/LTL8345932140415829027.gal : 2 ms
[2026-05-25 04:21:39] [INFO ] Time to serialize properties into /tmp/LTL3171046746088899520.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/LTL8345932140415829027.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10922989449358099999.hoa' '-atoms' '/tmp/LTL3171046746088899520.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3171046746088899520.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10922989449358099999.hoa
Detected timeout of ITS tools.
[2026-05-25 04:21:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:21:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:21:54] [INFO ] Time to serialize gal into /tmp/LTL15285057390040861218.gal : 3 ms
[2026-05-25 04:21:54] [INFO ] Time to serialize properties into /tmp/LTL11348946276109343946.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/LTL15285057390040861218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11348946276109343946.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...277
Read 1 LTL properties
Checking formula 0 : !((X(((!("((p454>=1)&&(p478>=1))"))U((G(!("((p454>=1)&&(p478>=1))")))||((!("((p454>=1)&&(p478>=1))"))&&(G(!("((p109>=1)&&(p128>=1))"))...362
Formula 0 simplified : X((F"((p109>=1)&&(p128>=1))" U "((p454>=1)&&(p478>=1))") R (F"((p454>=1)&&(p478>=1))" & (!"((p426>=1)&&(p458>=1))" | (F"((p109>=1)&&...197
Detected timeout of ITS tools.
[2026-05-25 04:22:09] [INFO ] Flatten gal took : 14 ms
[2026-05-25 04:22:09] [INFO ] Applying decomposition
[2026-05-25 04:22:09] [INFO ] Flatten gal took : 8 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/graph17233047024180019545.txt' '-o' '/tmp/graph17233047024180019545.bin' '-w' '/tmp/graph17233047024180019545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17233047024180019545.bin' '-l' '-1' '-v' '-w' '/tmp/graph17233047024180019545.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:22:09] [INFO ] Decomposing Gal with order
[2026-05-25 04:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:22:09] [INFO ] Removed a total of 135 redundant transitions.
[2026-05-25 04:22:09] [INFO ] Flatten gal took : 25 ms
[2026-05-25 04:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 04:22:09] [INFO ] Time to serialize gal into /tmp/LTL5443036047030272171.gal : 6 ms
[2026-05-25 04:22:09] [INFO ] Time to serialize properties into /tmp/LTL5643904168795251033.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/LTL5443036047030272171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5643904168795251033.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(((!("((i6.u166.p454>=1)&&(i5.i0.i2.u177.p478>=1))"))U((G(!("((i6.u166.p454>=1)&&(i5.i0.i2.u177.p478>=1))")))||((!("((i6.u166.p454...558
Formula 0 simplified : X((F"((i0.u5.p109>=1)&&(i0.u13.p128>=1))" U "((i6.u166.p454>=1)&&(i5.i0.i2.u177.p478>=1))") R (F"((i6.u166.p454>=1)&&(i5.i0.i2.u177....305
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLFireability-06 finished in 477147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 526 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 408 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 407 transition count 376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 239 place count 407 transition count 356
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 279 place count 387 transition count 356
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 461 place count 296 transition count 265
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 497 place count 278 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 498 place count 277 transition count 264
Applied a total of 498 rules in 31 ms. Remains 277 /528 variables (removed 251) and now considering 264/497 (removed 233) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10184153571738125933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5747939029451264603.kers'
[2026-05-25 04:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10184153571738125933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5747939029451264603.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 264 rows 276 cols 1021 entries
Finished phase 1 with 164 SingleSign rule and 63 generalized
[2026-05-25 04:22:25] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5747939029451264603.kers
Total runtime 4 ms.
[2026-05-25 04:22:25] [INFO ] Implicit Places using invariants in 141 ms returned [229]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/528 places, 264/497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 274 transition count 262
Applied a total of 4 rules in 6 ms. Remains 274 /276 variables (removed 2) and now considering 262/264 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16053163086914648228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7598632474188564779.kers'
[2026-05-25 04:22:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16053163086914648228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7598632474188564779.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 262 rows 273 cols 1013 entries
Finished phase 1 with 158 SingleSign rule and 67 generalized
[2026-05-25 04:22:25] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7598632474188564779.kers
Total runtime 3 ms.
[2026-05-25 04:22:25] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 04:22:25] [INFO ] Invariant cache hit.
[2026-05-25 04:22:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:22:26] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1887 ms. Remains : 274/528 places, 262/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-07
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-07 finished in 2007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 526 transition count 378
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 409 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 408 transition count 377
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 237 place count 408 transition count 357
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 277 place count 388 transition count 357
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 461 place count 296 transition count 265
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 495 place count 279 transition count 265
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 279 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 278 transition count 264
Applied a total of 497 rules in 36 ms. Remains 278 /528 variables (removed 250) and now considering 264/497 (removed 233) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1154830767936532093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15875622089427832840.kers'
[2026-05-25 04:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1154830767936532093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15875622089427832840.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 264 rows 276 cols 1008 entries
Finished phase 1 with 163 SingleSign rule and 65 generalized
[2026-05-25 04:22:27] [INFO ] Computed 50 invariants in 8 ms
Computed 50 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15875622089427832840.kers
Total runtime 10 ms.
[2026-05-25 04:22:27] [INFO ] Implicit Places using invariants in 159 ms returned [231]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/528 places, 264/497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 262
Applied a total of 4 rules in 6 ms. Remains 275 /277 variables (removed 2) and now considering 262/264 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4212469667576906844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3359210117456836220.kers'
[2026-05-25 04:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4212469667576906844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3359210117456836220.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 273 cols 1000 entries
Finished phase 1 with 160 SingleSign rule and 66 generalized
[2026-05-25 04:22:27] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3359210117456836220.kers
Total runtime 3 ms.
[2026-05-25 04:22:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 04:22:27] [INFO ] Invariant cache hit.
[2026-05-25 04:22:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:22:28] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 275/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1796 ms. Remains : 275/528 places, 262/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 13905 reset in 106 ms.
Product exploration explored 100000 steps with 13913 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5546 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3220 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 645094 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 645094 steps, saw 322643 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2026-05-25 04:22:32] [INFO ] Invariant cache hit.
[2026-05-25 04:22:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/218 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/239 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 252/491 variables, 239/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/531 variables, 31/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/533 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/537 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/537 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/218 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/239 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 252/491 variables, 239/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 16/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/537 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 45/47 constraints, State Equation: 270/275 constraints, ReadFeed: 16/18 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 262/262 transitions.
Graph (complete) has 809 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 261
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 274 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 260
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 273 transition count 220
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 84 place count 233 transition count 220
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 123 place count 233 transition count 220
Applied a total of 123 rules in 14 ms. Remains 233 /275 variables (removed 42) and now considering 220/262 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 233/275 places, 220/262 transitions.
RANDOM walk for 40000 steps (5125 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3366 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675379 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675379 steps, saw 337914 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1507787526718664262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5515605586338816976.kers'
[2026-05-25 04:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1507787526718664262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5515605586338816976.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 231 cols 1404 entries
Finished phase 1 with 127 SingleSign rule and 57 generalized
[2026-05-25 04:22:36] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5515605586338816976.kers
Total runtime 9 ms.
[2026-05-25 04:22:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/222 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/228 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 220/448 variables, 228/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 38/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/453 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3789 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 92/222 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 25/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/228 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 220/448 variables, 228/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 38/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/453 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5067ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 772 ms.
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 233/233 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 04:22:42] [INFO ] Invariant cache hit.
[2026-05-25 04:22:43] [INFO ] Implicit Places using invariants in 1044 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 177, 183, 190, 224, 230]
[2026-05-25 04:22:43] [INFO ] Actually due to overlaps returned [190, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/233 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 219
Applied a total of 2 rules in 15 ms. Remains 230 /231 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8489900562567474329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-253951003835852810.kers'
[2026-05-25 04:22:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8489900562567474329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-253951003835852810.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 228 cols 1351 entries
Finished phase 1 with 129 SingleSign rule and 54 generalized
[2026-05-25 04:22:43] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-253951003835852810.kers
Total runtime 8 ms.
[2026-05-25 04:22:44] [INFO ] Implicit Places using invariants in 848 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 176, 182, 221, 227]
[2026-05-25 04:22:44] [INFO ] Actually due to overlaps returned [227, 221]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 852 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/233 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 218
Applied a total of 2 rules in 13 ms. Remains 227 /228 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1076195091161888822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16633857034227421880.kers'
[2026-05-25 04:22:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1076195091161888822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16633857034227421880.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 225 cols 1306 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-25 04:22:44] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16633857034227421880.kers
Total runtime 4 ms.
[2026-05-25 04:22:45] [INFO ] Implicit Places using invariants in 744 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 176, 182]
[2026-05-25 04:22:45] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 746 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 225/233 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 217
Applied a total of 2 rules in 13 ms. Remains 224 /225 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16588127078891863253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1438507148652275337.kers'
[2026-05-25 04:22:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16588127078891863253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1438507148652275337.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 222 cols 1267 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-25 04:22:45] [INFO ] Computed 43 invariants in 8 ms
Computed 43 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1438507148652275337.kers
Total runtime 9 ms.
[2026-05-25 04:22:45] [INFO ] Implicit Places using invariants in 622 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:22:45] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 623 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 222/233 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 216
Applied a total of 2 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17184353876628508781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1572986585378483094.kers'
[2026-05-25 04:22:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17184353876628508781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1572986585378483094.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 219 cols 1233 entries
Finished phase 1 with 132 SingleSign rule and 48 generalized
[2026-05-25 04:22:45] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1572986585378483094.kers
Total runtime 4 ms.
[2026-05-25 04:22:46] [INFO ] Implicit Places using invariants in 526 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:22:46] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 527 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 219/233 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 215
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5403641242073451337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5125026785344433831.kers'
[2026-05-25 04:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5403641242073451337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5125026785344433831.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 216 cols 1204 entries
Finished phase 1 with 132 SingleSign rule and 47 generalized
[2026-05-25 04:22:46] [INFO ] Computed 39 invariants in 7 ms
Computed 39 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5125026785344433831.kers
Total runtime 8 ms.
[2026-05-25 04:22:46] [INFO ] Implicit Places using invariants in 486 ms returned [88, 94, 115, 120, 140, 145, 167, 173]
[2026-05-25 04:22:46] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 488 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 216/233 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 214
Applied a total of 2 rules in 13 ms. Remains 215 /216 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15643665900921090476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17157127842497137412.kers'
[2026-05-25 04:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15643665900921090476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17157127842497137412.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 213 cols 1180 entries
Finished phase 1 with 132 SingleSign rule and 46 generalized
[2026-05-25 04:22:46] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17157127842497137412.kers
Total runtime 7 ms.
[2026-05-25 04:22:47] [INFO ] Implicit Places using invariants in 424 ms returned [112, 117, 137, 142, 164, 170]
[2026-05-25 04:22:47] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 425 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 213/233 places, 214/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 213
Applied a total of 2 rules in 15 ms. Remains 212 /213 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15396355729434086264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5865747891072579620.kers'
[2026-05-25 04:22:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15396355729434086264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5865747891072579620.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 210 cols 1161 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-25 04:22:47] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5865747891072579620.kers
Total runtime 4 ms.
[2026-05-25 04:22:47] [INFO ] Implicit Places using invariants in 342 ms returned [134, 139, 161, 167]
[2026-05-25 04:22:47] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 210/233 places, 213/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 212
Applied a total of 2 rules in 13 ms. Remains 209 /210 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7367893034982406171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9138377291738648882.kers'
[2026-05-25 04:22:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7367893034982406171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9138377291738648882.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 207 cols 1147 entries
Finished phase 1 with 132 SingleSign rule and 44 generalized
[2026-05-25 04:22:47] [INFO ] Computed 33 invariants in 7 ms
Computed 33 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9138377291738648882.kers
Total runtime 9 ms.
[2026-05-25 04:22:48] [INFO ] Implicit Places using invariants in 345 ms returned [158, 164]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 347 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 207/233 places, 212/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 15 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18220859904963228437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-552414145177769188.kers'
[2026-05-25 04:22:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18220859904963228437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-552414145177769188.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 211 rows 204 cols 1138 entries
Finished phase 1 with 132 SingleSign rule and 43 generalized
[2026-05-25 04:22:48] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-552414145177769188.kers
Total runtime 9 ms.
[2026-05-25 04:22:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-25 04:22:48] [INFO ] Invariant cache hit.
[2026-05-25 04:22:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:22:50] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2377 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 206/233 places, 211/220 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7902 ms. Remains : 206/233 places, 211/220 transitions.
RANDOM walk for 40000 steps (5675 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3598 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 743757 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 743757 steps, saw 371961 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2026-05-25 04:22:53] [INFO ] Invariant cache hit.
[2026-05-25 04:22:53] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/195 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/412 variables, 201/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/417 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/195 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/201 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 211/412 variables, 201/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 38/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/417 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/417 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/417 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 641 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-25 04:22:58] [INFO ] Invariant cache hit.
[2026-05-25 04:22:58] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-25 04:22:58] [INFO ] Invariant cache hit.
[2026-05-25 04:22:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:23:00] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned []
Implicit Place search using SMT with State Equation took 2397 ms to find 0 implicit places.
[2026-05-25 04:23:00] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-25 04:23:00] [INFO ] Invariant cache hit.
[2026-05-25 04:23:00] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17997 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/417 variables, 206/238 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 507 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48055ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 48057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50470 ms. Remains : 206/206 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 194
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 181 transition count 186
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 181 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 180 transition count 185
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 180 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 179 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 177 transition count 182
Applied a total of 58 rules in 30 ms. Remains 177 /206 variables (removed 29) and now considering 182/211 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6770284852720670173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12211005248021890536.kers'
[2026-05-25 04:23:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6770284852720670173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12211005248021890536.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 175 cols 1054 entries
Finished phase 1 with 94 SingleSign rule and 52 generalized
[2026-05-25 04:23:48] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12211005248021890536.kers
Total runtime 2 ms.
[2026-05-25 04:23:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:23:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:23:48] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:23:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:23:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:23:48] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:23:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:23:48] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:23:49] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:23:49] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 384 ms.
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Knowledge-based reduction took 80027 ms.
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 262/262 transitions.
Applied a total of 0 rules in 16 ms. Remains 275 /275 variables (removed 0) and now considering 262/262 (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-2030463628155071225.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8947342554968214208.kers'
[2026-05-25 04:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2030463628155071225.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8947342554968214208.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 273 cols 1000 entries
Finished phase 1 with 160 SingleSign rule and 66 generalized
[2026-05-25 04:23:49] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8947342554968214208.kers
Total runtime 3 ms.
[2026-05-25 04:23:49] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 04:23:49] [INFO ] Invariant cache hit.
[2026-05-25 04:23:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:23:50] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
[2026-05-25 04:23:50] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 04:23:50] [INFO ] Invariant cache hit.
[2026-05-25 04:23:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/536 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/537 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 349 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/536 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 258/599 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 600 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 258/261 constraints, Known Traps: 0/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61692 ms. Remains : 275/275 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 849 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5561 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3293 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 657397 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 657397 steps, saw 328798 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-25 04:24:53] [INFO ] Invariant cache hit.
[2026-05-25 04:24:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/218 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/239 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 252/491 variables, 239/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/531 variables, 31/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/533 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/537 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/537 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/537 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 275/275 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/218 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/239 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 252/491 variables, 239/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 16/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/537 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 45/47 constraints, State Equation: 270/275 constraints, ReadFeed: 16/18 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 262/262 transitions.
Graph (complete) has 809 edges and 275 vertex of which 274 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 261
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 274 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 260
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 44 place count 273 transition count 220
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 84 place count 233 transition count 220
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 123 place count 233 transition count 220
Applied a total of 123 rules in 19 ms. Remains 233 /275 variables (removed 42) and now considering 220/262 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 233/275 places, 220/262 transitions.
RANDOM walk for 40000 steps (5125 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3380 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 695499 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 695499 steps, saw 347975 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3936903627960834301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6274486247501708588.kers'
[2026-05-25 04:24:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3936903627960834301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6274486247501708588.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 231 cols 1404 entries
Finished phase 1 with 127 SingleSign rule and 57 generalized
[2026-05-25 04:24:58] [INFO ] Computed 49 invariants in 8 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6274486247501708588.kers
Total runtime 9 ms.
[2026-05-25 04:24:58] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/222 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/228 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 220/448 variables, 228/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 38/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/453 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 92/222 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 25/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/228 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 220/448 variables, 228/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 38/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/448 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/453 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 756 ms.
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 233/233 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 04:25:04] [INFO ] Invariant cache hit.
[2026-05-25 04:25:05] [INFO ] Implicit Places using invariants in 1003 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 130, 150, 155, 177, 183, 190, 224, 230]
[2026-05-25 04:25:05] [INFO ] Actually due to overlaps returned [190, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1004 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/233 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 219
Applied a total of 2 rules in 16 ms. Remains 230 /231 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16965536161958958697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12640908514993990238.kers'
[2026-05-25 04:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16965536161958958697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12640908514993990238.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 228 cols 1351 entries
Finished phase 1 with 129 SingleSign rule and 54 generalized
[2026-05-25 04:25:05] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12640908514993990238.kers
Total runtime 2 ms.
[2026-05-25 04:25:05] [INFO ] Implicit Places using invariants in 808 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 176, 182, 221, 227]
[2026-05-25 04:25:05] [INFO ] Actually due to overlaps returned [227, 221]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 810 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/233 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 218
Applied a total of 2 rules in 24 ms. Remains 227 /228 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13788186556208906140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15734943619346120403.kers'
[2026-05-25 04:25:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13788186556208906140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15734943619346120403.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 225 cols 1306 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-25 04:25:06] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15734943619346120403.kers
Total runtime 4 ms.
[2026-05-25 04:25:06] [INFO ] Implicit Places using invariants in 725 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 176, 182]
[2026-05-25 04:25:06] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 728 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 225/233 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 217
Applied a total of 2 rules in 11 ms. Remains 224 /225 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15922689370105215139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15660526944953127570.kers'
[2026-05-25 04:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15922689370105215139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15660526944953127570.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 222 cols 1267 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-25 04:25:06] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15660526944953127570.kers
Total runtime 2 ms.
[2026-05-25 04:25:07] [INFO ] Implicit Places using invariants in 576 ms returned [43, 48, 69, 74, 94, 100, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:25:07] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 578 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 222/233 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 216
Applied a total of 2 rules in 19 ms. Remains 221 /222 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6517438683644939735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16064207500283902849.kers'
[2026-05-25 04:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6517438683644939735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16064207500283902849.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 219 cols 1233 entries
Finished phase 1 with 132 SingleSign rule and 48 generalized
[2026-05-25 04:25:07] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16064207500283902849.kers
Total runtime 3 ms.
[2026-05-25 04:25:07] [INFO ] Implicit Places using invariants in 511 ms returned [66, 71, 91, 97, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:25:07] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 513 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 219/233 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 215
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13835622124504928999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8951779788729377151.kers'
[2026-05-25 04:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13835622124504928999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8951779788729377151.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 216 cols 1204 entries
Finished phase 1 with 132 SingleSign rule and 47 generalized
[2026-05-25 04:25:07] [INFO ] Computed 39 invariants in 3 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8951779788729377151.kers
Total runtime 3 ms.
[2026-05-25 04:25:08] [INFO ] Implicit Places using invariants in 463 ms returned [88, 94, 115, 120, 140, 145, 167, 173]
[2026-05-25 04:25:08] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 216/233 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 214
Applied a total of 2 rules in 13 ms. Remains 215 /216 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2150781260366322384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5014456021928058997.kers'
[2026-05-25 04:25:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2150781260366322384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5014456021928058997.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 213 cols 1180 entries
Finished phase 1 with 132 SingleSign rule and 46 generalized
[2026-05-25 04:25:08] [INFO ] Computed 37 invariants in 8 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5014456021928058997.kers
Total runtime 9 ms.
[2026-05-25 04:25:08] [INFO ] Implicit Places using invariants in 404 ms returned [112, 117, 137, 142, 164, 170]
[2026-05-25 04:25:08] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 405 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 213/233 places, 214/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 213
Applied a total of 2 rules in 13 ms. Remains 212 /213 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2638118815844911190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7399432382202502766.kers'
[2026-05-25 04:25:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2638118815844911190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7399432382202502766.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 213 rows 210 cols 1161 entries
Finished phase 1 with 132 SingleSign rule and 45 generalized
[2026-05-25 04:25:08] [INFO ] Computed 35 invariants in 7 ms
Computed 35 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7399432382202502766.kers
Total runtime 8 ms.
[2026-05-25 04:25:09] [INFO ] Implicit Places using invariants in 343 ms returned [134, 139, 161, 167]
[2026-05-25 04:25:09] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 210/233 places, 213/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 212
Applied a total of 2 rules in 11 ms. Remains 209 /210 variables (removed 1) and now considering 212/213 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6968684422892904584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1200253880518506886.kers'
[2026-05-25 04:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6968684422892904584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1200253880518506886.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 207 cols 1147 entries
Finished phase 1 with 132 SingleSign rule and 44 generalized
[2026-05-25 04:25:09] [INFO ] Computed 33 invariants in 3 ms
Computed 33 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1200253880518506886.kers
Total runtime 3 ms.
[2026-05-25 04:25:09] [INFO ] Implicit Places using invariants in 309 ms returned [158, 164]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 310 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 207/233 places, 212/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 13 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2046061329683614706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10860737538182667457.kers'
[2026-05-25 04:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2046061329683614706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10860737538182667457.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 211 rows 204 cols 1138 entries
Finished phase 1 with 132 SingleSign rule and 43 generalized
[2026-05-25 04:25:09] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10860737538182667457.kers
Total runtime 9 ms.
[2026-05-25 04:25:09] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-25 04:25:09] [INFO ] Invariant cache hit.
[2026-05-25 04:25:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:25:11] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 206/233 places, 211/220 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7659 ms. Remains : 206/233 places, 211/220 transitions.
RANDOM walk for 40000 steps (5700 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3616 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 757216 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 757216 steps, saw 378690 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2026-05-25 04:25:14] [INFO ] Invariant cache hit.
[2026-05-25 04:25:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/195 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 211/412 variables, 201/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 38/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/417 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/195 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/201 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 211/412 variables, 201/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 38/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/417 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/417 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/417 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/417 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3724ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 645 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-25 04:25:19] [INFO ] Invariant cache hit.
[2026-05-25 04:25:19] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-25 04:25:19] [INFO ] Invariant cache hit.
[2026-05-25 04:25:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:25:21] [INFO ] Implicit Places using invariants and state equation in 2055 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2026-05-25 04:25:21] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-25 04:25:21] [INFO ] Invariant cache hit.
[2026-05-25 04:25:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 18135 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/417 variables, 206/238 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 38/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 509 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48185ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 48187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50567 ms. Remains : 206/206 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 194
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 181 transition count 186
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 181 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 180 transition count 185
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 180 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 179 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 177 transition count 182
Applied a total of 58 rules in 13 ms. Remains 177 /206 variables (removed 29) and now considering 182/211 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13986717990280741249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5745499060703509896.kers'
[2026-05-25 04:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13986717990280741249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5745499060703509896.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 182 rows 175 cols 1054 entries
Finished phase 1 with 94 SingleSign rule and 52 generalized
[2026-05-25 04:26:09] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5745499060703509896.kers
Total runtime 8 ms.
[2026-05-25 04:26:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:26:09] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:26:09] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:26:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:26:10] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-25 04:26:10] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:26:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:26:10] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:26:10] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:26:10] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 411 ms.
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Knowledge-based reduction took 79439 ms.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13826 reset in 99 ms.
Product exploration explored 100000 steps with 13794 reset in 101 ms.
Built C files in :
/tmp/ltsmin367078313735051598
[2026-05-25 04:26:10] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-25 04:26:10] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:10] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-25 04:26:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:10] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-25 04:26:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:10] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin367078313735051598
Running compilation step : cd /tmp/ltsmin367078313735051598;'/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 573 ms.
Running link step : cd /tmp/ltsmin367078313735051598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin367078313735051598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8842237393629846933.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 275 /275 variables (removed 0) and now considering 262/262 (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-13832464917752616824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1062054786223806032.kers'
[2026-05-25 04:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13832464917752616824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1062054786223806032.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 273 cols 1000 entries
Finished phase 1 with 160 SingleSign rule and 66 generalized
[2026-05-25 04:26:25] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1062054786223806032.kers
Total runtime 4 ms.
[2026-05-25 04:26:25] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 04:26:25] [INFO ] Invariant cache hit.
[2026-05-25 04:26:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:26:27] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2026-05-25 04:26:27] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 04:26:27] [INFO ] Invariant cache hit.
[2026-05-25 04:26:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/536 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/537 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 30066ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 30067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31755 ms. Remains : 275/275 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin12051115528342644337
[2026-05-25 04:26:57] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-25 04:26:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:57] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-25 04:26:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:57] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-25 04:26:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:26:57] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12051115528342644337
Running compilation step : cd /tmp/ltsmin12051115528342644337;'/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 533 ms.
Running link step : cd /tmp/ltsmin12051115528342644337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12051115528342644337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5398605280248414289.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:27:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:27:12] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:27:12] [INFO ] Time to serialize gal into /tmp/LTL14128724348939649353.gal : 2 ms
[2026-05-25 04:27:12] [INFO ] Time to serialize properties into /tmp/LTL14818312168655599389.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/LTL14128724348939649353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9241772226332565277.hoa' '-atoms' '/tmp/LTL14818312168655599389.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14818312168655599389.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9241772226332565277.hoa
Detected timeout of ITS tools.
[2026-05-25 04:27:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:27:27] [INFO ] Flatten gal took : 5 ms
[2026-05-25 04:27:27] [INFO ] Time to serialize gal into /tmp/LTL16309381282010615503.gal : 2 ms
[2026-05-25 04:27:27] [INFO ] Time to serialize properties into /tmp/LTL4176148324357140005.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16309381282010615503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4176148324357140005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G("((p430<1)||(p449<1))")))
Formula 0 simplified : F!"((p430<1)||(p449<1))"
Detected timeout of ITS tools.
[2026-05-25 04:27:42] [INFO ] Flatten gal took : 5 ms
[2026-05-25 04:27:42] [INFO ] Applying decomposition
[2026-05-25 04:27:42] [INFO ] Flatten gal took : 5 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/graph2437913258765094354.txt' '-o' '/tmp/graph2437913258765094354.bin' '-w' '/tmp/graph2437913258765094354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2437913258765094354.bin' '-l' '-1' '-v' '-w' '/tmp/graph2437913258765094354.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:27:42] [INFO ] Decomposing Gal with order
[2026-05-25 04:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:27:42] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-25 04:27:42] [INFO ] Flatten gal took : 14 ms
[2026-05-25 04:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2026-05-25 04:27:42] [INFO ] Time to serialize gal into /tmp/LTL4728661305353351029.gal : 4 ms
[2026-05-25 04:27:42] [INFO ] Time to serialize properties into /tmp/LTL14259798513692583027.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4728661305353351029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14259798513692583027.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G("((i4.i3.u89.p430<1)||(i4.i1.u75.p449<1))")))
Formula 0 simplified : F!"((i4.i3.u89.p430<1)||(i4.i1.u75.p449<1))"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLFireability-09 finished in 330626 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 G(p1))&&X(((p2 U X(p3)) U (!p1&&(p2 U X(p3)))))))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 19 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (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-17954205025764702259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15431199981960105497.kers'
[2026-05-25 04:27:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17954205025764702259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15431199981960105497.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 497 rows 528 cols 1395 entries
Finished phase 1 with 446 SingleSign rule and 32 generalized
[2026-05-25 04:27:57] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-15431199981960105497.kers
Total runtime 27 ms.
[2026-05-25 04:27:57] [INFO ] Implicit Places using invariants in 210 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 9 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 527/528 places, 497/497 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 G(p1))&&X(((p2 U X(p3)) U (!p1&&(p2 U X(p3)))))))'
Stuttering acceptance computed with spot in 267 ms :[true, true, (NOT p1), (NOT p1), (OR (NOT p3) p1), (NOT p3), (NOT p3)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 31 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLFireability-11 finished in 561 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 (F(p1)||X(X((X(X(X(p2)))&&F(!p0)))))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Applied a total of 0 rules in 16 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2026-05-25 04:27:58] [INFO ] Invariant cache hit.
[2026-05-25 04:27:58] [INFO ] Implicit Places using invariants in 152 ms returned [437]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Applied a total of 0 rules in 8 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 527/528 places, 497/497 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 (F(p1)||X(X((X(X(X(p2)))&&F(!p0)))))))'
Stuttering acceptance computed with spot in 1098 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 16666 reset in 165 ms.
Product exploration explored 100000 steps with 16666 reset in 172 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 9 factoid took 76 ms. Reduced automaton from 26 states, 43 edges and 3 AP (stutter sensitive) to 7 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1311 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1130 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1117 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 306184 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 3
Probabilistic random walk after 306184 steps, saw 153124 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-120227054652459717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15948643828361028289.kers'
[2026-05-25 04:28:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-120227054652459717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15948643828361028289.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:28:03] [INFO ] Computed 49 invariants in 20 ms
Computed 49 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15948643828361028289.kers
Total runtime 22 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/450 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1018 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1018 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/1023 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1023 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/1024 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1024 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 580 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 139/450 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 89/1010 variables, 69/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 11/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/1018 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1018 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 5/1023 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/1024 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 594 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5968ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 404 transition count 354
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 470 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 504 place count 274 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 541 place count 274 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 578 place count 237 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 618 place count 237 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 236 transition count 223
Applied a total of 619 rules in 28 ms. Remains 236 /527 variables (removed 291) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 236/527 places, 223/497 transitions.
RANDOM walk for 40000 steps (5049 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3378 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3416 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 425134 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 3
Probabilistic random walk after 425134 steps, saw 212686 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1748035401648001495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5275343183708028454.kers'
[2026-05-25 04:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1748035401648001495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5275343183708028454.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 223 rows 234 cols 1386 entries
Finished phase 1 with 130 SingleSign rule and 57 generalized
[2026-05-25 04:28:42] [INFO ] Computed 49 invariants in 4 ms
Computed 49 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5275343183708028454.kers
Total runtime 5 ms.
[2026-05-25 04:28:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 162/206 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/231 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 223/454 variables, 231/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 38/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/459 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/459 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 343 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1808 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 162/206 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/231 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 223/454 variables, 231/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 38/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/459 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/459 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3990ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24470 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:29:10] [INFO ] Invariant cache hit.
[2026-05-25 04:29:11] [INFO ] Implicit Places using invariants in 1081 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 132, 152, 157, 179, 185, 192, 227, 233]
[2026-05-25 04:29:11] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1083 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 14 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10908376114356121975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11229725661010613487.kers'
[2026-05-25 04:29:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10908376114356121975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11229725661010613487.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 231 cols 1335 entries
Finished phase 1 with 133 SingleSign rule and 53 generalized
[2026-05-25 04:29:11] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11229725661010613487.kers
Total runtime 8 ms.
[2026-05-25 04:29:12] [INFO ] Implicit Places using invariants in 886 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 151, 156, 178, 184, 224, 230]
[2026-05-25 04:29:12] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 888 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 15 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1306667997758478760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9144896270755718514.kers'
[2026-05-25 04:29:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1306667997758478760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9144896270755718514.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 228 cols 1292 entries
Finished phase 1 with 134 SingleSign rule and 51 generalized
[2026-05-25 04:29:12] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9144896270755718514.kers
Total runtime 9 ms.
[2026-05-25 04:29:13] [INFO ] Implicit Places using invariants in 742 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 151, 156, 178, 184]
[2026-05-25 04:29:13] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 744 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 14 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3902335495120309641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15438100910564242238.kers'
[2026-05-25 04:29:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3902335495120309641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15438100910564242238.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 225 cols 1255 entries
Finished phase 1 with 133 SingleSign rule and 51 generalized
[2026-05-25 04:29:13] [INFO ] Computed 43 invariants in 7 ms
Computed 43 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15438100910564242238.kers
Total runtime 9 ms.
[2026-05-25 04:29:14] [INFO ] Implicit Places using invariants in 638 ms returned [43, 48, 69, 74, 94, 100, 121, 128, 148, 153, 175, 181]
[2026-05-25 04:29:14] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 640 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 14 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14686858044695301130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4072584187098635081.kers'
[2026-05-25 04:29:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14686858044695301130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4072584187098635081.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 222 cols 1223 entries
Finished phase 1 with 133 SingleSign rule and 50 generalized
[2026-05-25 04:29:14] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4072584187098635081.kers
Total runtime 9 ms.
[2026-05-25 04:29:14] [INFO ] Implicit Places using invariants in 565 ms returned [66, 71, 91, 97, 118, 125, 145, 150, 172, 178]
[2026-05-25 04:29:14] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 567 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10796956928411170408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11865690405077177217.kers'
[2026-05-25 04:29:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10796956928411170408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11865690405077177217.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 219 cols 1196 entries
Finished phase 1 with 133 SingleSign rule and 49 generalized
[2026-05-25 04:29:14] [INFO ] Computed 39 invariants in 7 ms
Computed 39 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11865690405077177217.kers
Total runtime 8 ms.
[2026-05-25 04:29:15] [INFO ] Implicit Places using invariants in 462 ms returned [88, 94, 115, 122, 142, 147, 169, 175]
[2026-05-25 04:29:15] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1994412396922714073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-610017285440039337.kers'
[2026-05-25 04:29:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1994412396922714073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-610017285440039337.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 216 cols 1174 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-25 04:29:15] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-610017285440039337.kers
Total runtime 9 ms.
[2026-05-25 04:29:15] [INFO ] Implicit Places using invariants in 443 ms returned [112, 119, 139, 144, 166, 172]
[2026-05-25 04:29:15] [INFO ] Actually due to overlaps returned [119, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 444 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 13 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6900415690083862635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10395740747064500235.kers'
[2026-05-25 04:29:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6900415690083862635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10395740747064500235.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 2 ms.
// Phase 1: matrix 216 rows 213 cols 1157 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-25 04:29:15] [INFO ] Computed 35 invariants in 8 ms
Computed 35 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10395740747064500235.kers
Total runtime 9 ms.
[2026-05-25 04:29:15] [INFO ] Implicit Places using invariants in 390 ms returned [136, 141, 163, 169]
[2026-05-25 04:29:15] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 15 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15501599994390238631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18250311217213807408.kers'
[2026-05-25 04:29:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15501599994390238631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18250311217213807408.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 210 cols 1143 entries
Finished phase 1 with 132 SingleSign rule and 47 generalized
[2026-05-25 04:29:15] [INFO ] Computed 33 invariants in 3 ms
Computed 33 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18250311217213807408.kers
Total runtime 5 ms.
[2026-05-25 04:29:16] [INFO ] Implicit Places using invariants in 357 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 358 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 12 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12256445134282808238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15729779498995094731.kers'
[2026-05-25 04:29:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12256445134282808238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15729779498995094731.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 207 cols 1134 entries
Finished phase 1 with 132 SingleSign rule and 46 generalized
[2026-05-25 04:29:16] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15729779498995094731.kers
Total runtime 4 ms.
[2026-05-25 04:29:16] [INFO ] Implicit Places using invariants in 344 ms returned []
[2026-05-25 04:29:16] [INFO ] Invariant cache hit.
[2026-05-25 04:29:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:29:19] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 2902 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8607 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5692 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3635 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 440397 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 3
Probabilistic random walk after 440397 steps, saw 220246 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2026-05-25 04:29:22] [INFO ] Invariant cache hit.
[2026-05-25 04:29:22] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 129/170 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 32/202 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 214/418 variables, 204/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 5/423 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 32/32 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 129/170 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 32/202 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/204 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 214/418 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/423 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/423 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/423 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 328 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 7838ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31372 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:30:01] [INFO ] Invariant cache hit.
[2026-05-25 04:30:01] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-25 04:30:01] [INFO ] Invariant cache hit.
[2026-05-25 04:30:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:30:04] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
[2026-05-25 04:30:04] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-25 04:30:04] [INFO ] Invariant cache hit.
[2026-05-25 04:30:04] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 16059 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 514 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46116ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 46118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49011 ms. Remains : 209/209 places, 214/214 transitions.
Knowledge based reduction with 9 factoid took 81 ms. Reduced automaton from 7 states, 7 edges and 2 AP (stutter sensitive) to 7 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 171037 ms.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 2 out of 527 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Applied a total of 0 rules in 23 ms. Remains 527 /527 variables (removed 0) and now considering 497/497 (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-17949540522156592502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6899316218706417801.kers'
[2026-05-25 04:30:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17949540522156592502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6899316218706417801.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 527 cols 1392 entries
Finished phase 1 with 448 SingleSign rule and 30 generalized
[2026-05-25 04:30:51] [INFO ] Computed 49 invariants in 24 ms
Computed 49 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-6899316218706417801.kers
Total runtime 25 ms.
[2026-05-25 04:30:51] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-25 04:30:51] [INFO ] Invariant cache hit.
[2026-05-25 04:30:53] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 577 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/527 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 497/1024 variables, 527/577 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 496/1073 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1073 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 62329 ms. Remains : 527/527 places, 497/497 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 7 states, 7 edges and 2 AP (stutter sensitive) to 7 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1335 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1128 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1141 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1144 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 324316 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 3
Probabilistic random walk after 324316 steps, saw 162189 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2026-05-25 04:31:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/450 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1024 variables, and 570 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 294/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 139/450 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 89/1010 variables, 69/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 11/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1024 variables, and 590 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 519/527 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 8056ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 374
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 404 transition count 354
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 470 place count 291 transition count 261
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 504 place count 274 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 541 place count 274 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 578 place count 237 transition count 224
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 618 place count 237 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 236 transition count 223
Applied a total of 619 rules in 32 ms. Remains 236 /527 variables (removed 291) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 236/527 places, 223/497 transitions.
RANDOM walk for 40000 steps (5090 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3367 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3456 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 396815 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 3
Probabilistic random walk after 396815 steps, saw 198540 distinct states, run finished after 3008 ms. (steps per millisecond=131 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4354672200449868273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9091537605441169196.kers'
[2026-05-25 04:32:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4354672200449868273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9091537605441169196.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 223 rows 234 cols 1386 entries
Finished phase 1 with 130 SingleSign rule and 57 generalized
[2026-05-25 04:32:07] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9091537605441169196.kers
Total runtime 4 ms.
[2026-05-25 04:32:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 162/206 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/231 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 223/454 variables, 231/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 38/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/459 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/459 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 343 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 162/206 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/231 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 223/454 variables, 231/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 38/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/459 variables, 5/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/459 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 236/236 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3899ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24355 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 236/236 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:32:36] [INFO ] Invariant cache hit.
[2026-05-25 04:32:37] [INFO ] Implicit Places using invariants in 1052 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 132, 152, 157, 179, 185, 192, 227, 233]
[2026-05-25 04:32:37] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1054 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/236 places, 223/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 222
Applied a total of 2 rules in 16 ms. Remains 233 /234 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1045529431611259284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5963175321267843886.kers'
[2026-05-25 04:32:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1045529431611259284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5963175321267843886.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 231 cols 1335 entries
Finished phase 1 with 133 SingleSign rule and 53 generalized
[2026-05-25 04:32:37] [INFO ] Computed 47 invariants in 4 ms
Computed 47 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5963175321267843886.kers
Total runtime 6 ms.
[2026-05-25 04:32:38] [INFO ] Implicit Places using invariants in 881 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 151, 156, 178, 184, 224, 230]
[2026-05-25 04:32:38] [INFO ] Actually due to overlaps returned [230, 224]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 882 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/236 places, 222/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 221
Applied a total of 2 rules in 15 ms. Remains 230 /231 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439619287588147475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6159694957736220403.kers'
[2026-05-25 04:32:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439619287588147475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6159694957736220403.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 228 cols 1292 entries
Finished phase 1 with 134 SingleSign rule and 51 generalized
[2026-05-25 04:32:38] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6159694957736220403.kers
Total runtime 9 ms.
[2026-05-25 04:32:38] [INFO ] Implicit Places using invariants in 737 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 131, 151, 156, 178, 184]
[2026-05-25 04:32:38] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 739 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 228/236 places, 221/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 220
Applied a total of 2 rules in 14 ms. Remains 227 /228 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8119367849740717233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1313544826974138118.kers'
[2026-05-25 04:32:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8119367849740717233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1313544826974138118.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 225 cols 1255 entries
Finished phase 1 with 133 SingleSign rule and 51 generalized
[2026-05-25 04:32:38] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1313544826974138118.kers
Total runtime 6 ms.
[2026-05-25 04:32:39] [INFO ] Implicit Places using invariants in 632 ms returned [43, 48, 69, 74, 94, 100, 121, 128, 148, 153, 175, 181]
[2026-05-25 04:32:39] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 635 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/236 places, 220/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 219
Applied a total of 2 rules in 13 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2467962129898215212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4134747463257512746.kers'
[2026-05-25 04:32:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2467962129898215212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4134747463257512746.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 222 cols 1223 entries
Finished phase 1 with 133 SingleSign rule and 50 generalized
[2026-05-25 04:32:39] [INFO ] Computed 41 invariants in 8 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4134747463257512746.kers
Total runtime 9 ms.
[2026-05-25 04:32:40] [INFO ] Implicit Places using invariants in 581 ms returned [66, 71, 91, 97, 118, 125, 145, 150, 172, 178]
[2026-05-25 04:32:40] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 583 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 222/236 places, 219/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 13 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4209759671743438842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11818312902736876591.kers'
[2026-05-25 04:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4209759671743438842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11818312902736876591.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 219 cols 1196 entries
Finished phase 1 with 133 SingleSign rule and 49 generalized
[2026-05-25 04:32:40] [INFO ] Computed 39 invariants in 8 ms
Computed 39 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11818312902736876591.kers
Total runtime 9 ms.
[2026-05-25 04:32:40] [INFO ] Implicit Places using invariants in 456 ms returned [88, 94, 115, 122, 142, 147, 169, 175]
[2026-05-25 04:32:40] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 458 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/236 places, 218/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 12 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6905166205345020813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10762694791631533898.kers'
[2026-05-25 04:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6905166205345020813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10762694791631533898.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 216 cols 1174 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-25 04:32:40] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10762694791631533898.kers
Total runtime 6 ms.
[2026-05-25 04:32:41] [INFO ] Implicit Places using invariants in 449 ms returned [112, 119, 139, 144, 166, 172]
[2026-05-25 04:32:41] [INFO ] Actually due to overlaps returned [119, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 450 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/236 places, 217/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 12 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15546711369475269472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4018684897868434012.kers'
[2026-05-25 04:32:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15546711369475269472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4018684897868434012.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 213 cols 1157 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-25 04:32:41] [INFO ] Computed 35 invariants in 7 ms
Computed 35 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4018684897868434012.kers
Total runtime 8 ms.
[2026-05-25 04:32:41] [INFO ] Implicit Places using invariants in 371 ms returned [136, 141, 163, 169]
[2026-05-25 04:32:41] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 372 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/236 places, 216/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 11 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2839127486780406613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8849695750796597761.kers'
[2026-05-25 04:32:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2839127486780406613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8849695750796597761.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 210 cols 1143 entries
Finished phase 1 with 132 SingleSign rule and 47 generalized
[2026-05-25 04:32:41] [INFO ] Computed 33 invariants in 8 ms
Computed 33 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8849695750796597761.kers
Total runtime 9 ms.
[2026-05-25 04:32:41] [INFO ] Implicit Places using invariants in 366 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 368 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/236 places, 215/223 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 11 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16018243378494065175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17893503815477424698.kers'
[2026-05-25 04:32:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16018243378494065175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17893503815477424698.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 207 cols 1134 entries
Finished phase 1 with 132 SingleSign rule and 46 generalized
[2026-05-25 04:32:41] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17893503815477424698.kers
Total runtime 8 ms.
[2026-05-25 04:32:42] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-25 04:32:42] [INFO ] Invariant cache hit.
[2026-05-25 04:32:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:32:44] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/236 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8628 ms. Remains : 209/236 places, 214/223 transitions.
RANDOM walk for 40000 steps (5803 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3699 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3647 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 446705 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 3
Probabilistic random walk after 446705 steps, saw 223401 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2026-05-25 04:32:47] [INFO ] Invariant cache hit.
[2026-05-25 04:32:47] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 129/170 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 32/202 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/204 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 214/418 variables, 204/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 5/423 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/423 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 32/32 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 129/170 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 32/202 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/204 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 214/418 variables, 204/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/418 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 5/423 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/423 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/423 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 328 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 7941ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28951 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:33:24] [INFO ] Invariant cache hit.
[2026-05-25 04:33:25] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-25 04:33:25] [INFO ] Invariant cache hit.
[2026-05-25 04:33:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:33:27] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2026-05-25 04:33:27] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-25 04:33:27] [INFO ] Invariant cache hit.
[2026-05-25 04:33:27] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 16174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 514 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46230ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 46232ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49191 ms. Remains : 209/209 places, 214/214 transitions.
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 7 states, 7 edges and 2 AP (stutter sensitive) to 7 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 140775 ms.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 108 ms.
Product exploration explored 100000 steps with 16666 reset in 110 ms.
Spot run failed in 49 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/ltsmin4170533091314647745
[2026-05-25 04:34:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4170533091314647745
Running compilation step : cd /tmp/ltsmin4170533091314647745;'/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 802 ms.
Running link step : cd /tmp/ltsmin4170533091314647745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4170533091314647745;'/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/stateBased1407381673524977828.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA DoubleExponent-PT-010-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-010-LTLFireability-12 finished in 377961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 898 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 526 transition count 377
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 408 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 407 transition count 376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 239 place count 407 transition count 356
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 279 place count 387 transition count 356
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 463 place count 295 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 499 place count 277 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 276 transition count 263
Applied a total of 500 rules in 35 ms. Remains 276 /528 variables (removed 252) and now considering 263/497 (removed 234) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-494282146839962518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7582912026705782747.kers'
[2026-05-25 04:34:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-494282146839962518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7582912026705782747.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 263 rows 274 cols 1012 entries
Finished phase 1 with 162 SingleSign rule and 64 generalized
[2026-05-25 04:34:16] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7582912026705782747.kers
Total runtime 5 ms.
[2026-05-25 04:34:16] [INFO ] Implicit Places using invariants in 143 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/528 places, 263/497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 273 transition count 261
Applied a total of 4 rules in 6 ms. Remains 273 /275 variables (removed 2) and now considering 261/263 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16945486070456068685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2718273380026587664.kers'
[2026-05-25 04:34:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16945486070456068685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2718273380026587664.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 271 cols 1004 entries
Finished phase 1 with 157 SingleSign rule and 67 generalized
[2026-05-25 04:34:16] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2718273380026587664.kers
Total runtime 3 ms.
[2026-05-25 04:34:16] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 04:34:16] [INFO ] Invariant cache hit.
[2026-05-25 04:34:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 04:34:17] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1598 ms. Remains : 273/528 places, 261/497 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLFireability-14
Product exploration explored 100000 steps with 13829 reset in 100 ms.
Product exploration explored 100000 steps with 14005 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5600 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3252 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 643804 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 643804 steps, saw 322004 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2026-05-25 04:34:21] [INFO ] Invariant cache hit.
[2026-05-25 04:34:21] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/233 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/236 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/233 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/236 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/528 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/530 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/534 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/534 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/534 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 814 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 1 with 38 rules applied. Total rules applied 40 place count 272 transition count 222
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 234 transition count 222
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 234 transition count 222
Applied a total of 116 rules in 12 ms. Remains 234 /273 variables (removed 39) and now considering 222/261 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 234/273 places, 222/261 transitions.
RANDOM walk for 40000 steps (5130 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3376 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 697526 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 697526 steps, saw 348993 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10450352159927869586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15173684733203366173.kers'
[2026-05-25 04:34:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10450352159927869586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15173684733203366173.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 232 cols 1407 entries
Finished phase 1 with 128 SingleSign rule and 57 generalized
[2026-05-25 04:34:25] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15173684733203366173.kers
Total runtime 8 ms.
[2026-05-25 04:34:26] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 85/227 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/229 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/451 variables, 229/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 38/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/456 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 85/227 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/451 variables, 229/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 38/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/456 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/456 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/456 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/456 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7618ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:34:33] [INFO ] Invariant cache hit.
[2026-05-25 04:34:34] [INFO ] Implicit Places using invariants in 1030 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:34:34] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1031 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12780090467913825379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-157279885928226845.kers'
[2026-05-25 04:34:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12780090467913825379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-157279885928226845.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 229 cols 1354 entries
Finished phase 1 with 131 SingleSign rule and 53 generalized
[2026-05-25 04:34:34] [INFO ] Computed 47 invariants in 4 ms
Computed 47 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-157279885928226845.kers
Total runtime 5 ms.
[2026-05-25 04:34:35] [INFO ] Implicit Places using invariants in 884 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:34:35] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 886 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 14 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2768153750179778350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10926832905307037401.kers'
[2026-05-25 04:34:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2768153750179778350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10926832905307037401.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 226 cols 1309 entries
Finished phase 1 with 137 SingleSign rule and 46 generalized
[2026-05-25 04:34:35] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10926832905307037401.kers
Total runtime 8 ms.
[2026-05-25 04:34:36] [INFO ] Implicit Places using invariants in 752 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2026-05-25 04:34:36] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 754 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 13 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11864346117732455846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17939354148159546498.kers'
[2026-05-25 04:34:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11864346117732455846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17939354148159546498.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1270 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-25 04:34:36] [INFO ] Computed 43 invariants in 7 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17939354148159546498.kers
Total runtime 8 ms.
[2026-05-25 04:34:36] [INFO ] Implicit Places using invariants in 596 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2026-05-25 04:34:36] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 598 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 12 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1965520774100320373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1922509553240779703.kers'
[2026-05-25 04:34:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1965520774100320373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1922509553240779703.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 220 cols 1236 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-25 04:34:37] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1922509553240779703.kers
Total runtime 9 ms.
[2026-05-25 04:34:37] [INFO ] Implicit Places using invariants in 537 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2026-05-25 04:34:37] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 539 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 13 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18138462209029380286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10477410576421120917.kers'
[2026-05-25 04:34:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18138462209029380286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10477410576421120917.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 217 cols 1207 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-25 04:34:37] [INFO ] Computed 39 invariants in 7 ms
Computed 39 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10477410576421120917.kers
Total runtime 8 ms.
[2026-05-25 04:34:38] [INFO ] Implicit Places using invariants in 458 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2026-05-25 04:34:38] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 217/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 216
Applied a total of 2 rules in 13 ms. Remains 216 /217 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8147157775365656309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14571869357376619922.kers'
[2026-05-25 04:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8147157775365656309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14571869357376619922.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 214 cols 1183 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-25 04:34:38] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14571869357376619922.kers
Total runtime 7 ms.
[2026-05-25 04:34:38] [INFO ] Implicit Places using invariants in 391 ms returned [113, 118, 138, 143, 165, 171]
[2026-05-25 04:34:38] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 214/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 215
Applied a total of 2 rules in 12 ms. Remains 213 /214 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8308021918451290642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9791622064117846822.kers'
[2026-05-25 04:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8308021918451290642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9791622064117846822.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1164 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-25 04:34:38] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9791622064117846822.kers
Total runtime 3 ms.
[2026-05-25 04:34:38] [INFO ] Implicit Places using invariants in 390 ms returned [135, 140, 162, 168]
[2026-05-25 04:34:38] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 393 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 211/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 214
Applied a total of 2 rules in 11 ms. Remains 210 /211 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5908922529343421132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8854958891988011343.kers'
[2026-05-25 04:34:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5908922529343421132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8854958891988011343.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1150 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-25 04:34:38] [INFO ] Computed 33 invariants in 5 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8854958891988011343.kers
Total runtime 6 ms.
[2026-05-25 04:34:39] [INFO ] Implicit Places using invariants in 379 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 380 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 208/234 places, 214/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 14 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9428326800914471109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8736737110690231921.kers'
[2026-05-25 04:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9428326800914471109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8736737110690231921.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 205 cols 1141 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-25 04:34:39] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8736737110690231921.kers
Total runtime 7 ms.
[2026-05-25 04:34:39] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-25 04:34:39] [INFO ] Invariant cache hit.
[2026-05-25 04:34:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:34:41] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7866 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5696 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3641 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 754448 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 754448 steps, saw 377302 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2026-05-25 04:34:44] [INFO ] Invariant cache hit.
[2026-05-25 04:34:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/198 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/415 variables, 202/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/420 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/198 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 213/415 variables, 202/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 38/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/420 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/420 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 04:34:49] [INFO ] Invariant cache hit.
[2026-05-25 04:34:49] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-25 04:34:49] [INFO ] Invariant cache hit.
[2026-05-25 04:34:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:34:51] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2026-05-25 04:34:51] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:34:51] [INFO ] Invariant cache hit.
[2026-05-25 04:34:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 212 unsolved in 19437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 212/490 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 511 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49491ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 49492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51828 ms. Remains : 207/207 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 13 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2401686759105951533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3398534533800094968.kers'
[2026-05-25 04:35:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2401686759105951533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3398534533800094968.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 184 rows 176 cols 1056 entries
Finished phase 1 with 102 SingleSign rule and 45 generalized
[2026-05-25 04:35:41] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3398534533800094968.kers
Total runtime 3 ms.
[2026-05-25 04:35:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:35:41] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-25 04:35:41] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:35:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:35:41] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:35:41] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:35:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:35:41] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2026-05-25 04:35:41] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:35:41] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 408 ms.
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Knowledge-based reduction took 83506 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (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-8184208570348455093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13453753764358257540.kers'
[2026-05-25 04:35:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8184208570348455093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13453753764358257540.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 271 cols 1004 entries
Finished phase 1 with 157 SingleSign rule and 67 generalized
[2026-05-25 04:35:41] [INFO ] Computed 49 invariants in 5 ms
Computed 49 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13453753764358257540.kers
Total runtime 5 ms.
[2026-05-25 04:35:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 04:35:41] [INFO ] Invariant cache hit.
[2026-05-25 04:35:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 04:35:43] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2026-05-25 04:35:43] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:35:43] [INFO ] Invariant cache hit.
[2026-05-25 04:35:43] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 351 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/595 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SMT process timed out in 60042ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61456 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5580 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3223 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 660613 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 660613 steps, saw 330398 distinct states, run finished after 3002 ms. (steps per millisecond=220 ) properties seen :0
[2026-05-25 04:36:46] [INFO ] Invariant cache hit.
[2026-05-25 04:36:46] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/233 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/236 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/534 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/233 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/236 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/487 variables, 236/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 15/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/528 variables, 32/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/528 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/528 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/530 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/534 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/534 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/534 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1674ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 261/261 transitions.
Graph (complete) has 814 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 260
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 1 with 38 rules applied. Total rules applied 40 place count 272 transition count 222
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 234 transition count 222
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 234 transition count 222
Applied a total of 116 rules in 11 ms. Remains 234 /273 variables (removed 39) and now considering 222/261 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 234/273 places, 222/261 transitions.
RANDOM walk for 40000 steps (5083 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3356 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 696262 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 696262 steps, saw 348344 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5224550277319050908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10025258663744172082.kers'
[2026-05-25 04:36:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5224550277319050908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10025258663744172082.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 232 cols 1407 entries
Finished phase 1 with 128 SingleSign rule and 57 generalized
[2026-05-25 04:36:50] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10025258663744172082.kers
Total runtime 7 ms.
[2026-05-25 04:36:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 85/227 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/229 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/451 variables, 229/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 38/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/456 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 85/227 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/229 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/451 variables, 229/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 38/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/456 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/456 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/456 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/456 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7431ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 234/234 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:36:58] [INFO ] Invariant cache hit.
[2026-05-25 04:36:59] [INFO ] Implicit Places using invariants in 1016 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:36:59] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1019 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/234 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 221
Applied a total of 2 rules in 14 ms. Remains 231 /232 variables (removed 1) and now considering 221/222 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13573015475669006499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13827826774291901751.kers'
[2026-05-25 04:36:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13573015475669006499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13827826774291901751.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 229 cols 1354 entries
Finished phase 1 with 131 SingleSign rule and 53 generalized
[2026-05-25 04:36:59] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13827826774291901751.kers
Total runtime 2 ms.
[2026-05-25 04:37:00] [INFO ] Implicit Places using invariants in 845 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:37:00] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 847 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 229/234 places, 221/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 220
Applied a total of 2 rules in 15 ms. Remains 228 /229 variables (removed 1) and now considering 220/221 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15750557779514505652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18426837804264813652.kers'
[2026-05-25 04:37:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15750557779514505652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18426837804264813652.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 226 cols 1309 entries
Finished phase 1 with 137 SingleSign rule and 46 generalized
[2026-05-25 04:37:00] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18426837804264813652.kers
Total runtime 3 ms.
[2026-05-25 04:37:01] [INFO ] Implicit Places using invariants in 719 ms returned [20, 26, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 177, 183]
[2026-05-25 04:37:01] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 721 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 226/234 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 13 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8298748088740615325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9570171205268818719.kers'
[2026-05-25 04:37:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8298748088740615325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9570171205268818719.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1270 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-25 04:37:01] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9570171205268818719.kers
Total runtime 5 ms.
[2026-05-25 04:37:01] [INFO ] Implicit Places using invariants in 580 ms returned [43, 48, 70, 75, 95, 101, 122, 127, 147, 152, 174, 180]
[2026-05-25 04:37:01] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 584 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/234 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 12 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3888393033046060869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12117776268281370302.kers'
[2026-05-25 04:37:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3888393033046060869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12117776268281370302.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1236 entries
Finished phase 1 with 134 SingleSign rule and 47 generalized
[2026-05-25 04:37:01] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12117776268281370302.kers
Total runtime 2 ms.
[2026-05-25 04:37:02] [INFO ] Implicit Places using invariants in 536 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 171, 177]
[2026-05-25 04:37:02] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 538 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 220/234 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 219 transition count 217
Applied a total of 2 rules in 12 ms. Remains 219 /220 variables (removed 1) and now considering 217/218 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9865051340595226442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5731242256068322779.kers'
[2026-05-25 04:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9865051340595226442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5731242256068322779.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 217 cols 1207 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-25 04:37:02] [INFO ] Computed 39 invariants in 6 ms
Computed 39 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5731242256068322779.kers
Total runtime 6 ms.
[2026-05-25 04:37:02] [INFO ] Implicit Places using invariants in 460 ms returned [89, 95, 116, 121, 141, 146, 168, 174]
[2026-05-25 04:37:02] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 462 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 217/234 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 216 transition count 216
Applied a total of 2 rules in 12 ms. Remains 216 /217 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10099315976938537940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8881324083768522940.kers'
[2026-05-25 04:37:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10099315976938537940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8881324083768522940.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 214 cols 1183 entries
Finished phase 1 with 133 SingleSign rule and 46 generalized
[2026-05-25 04:37:02] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8881324083768522940.kers
Total runtime 2 ms.
[2026-05-25 04:37:03] [INFO ] Implicit Places using invariants in 375 ms returned [113, 118, 138, 143, 165, 171]
[2026-05-25 04:37:03] [INFO ] Actually due to overlaps returned [118, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 376 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 214/234 places, 216/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 213 transition count 215
Applied a total of 2 rules in 11 ms. Remains 213 /214 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15854812378263253405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2123890651134947862.kers'
[2026-05-25 04:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15854812378263253405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2123890651134947862.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1164 entries
Finished phase 1 with 133 SingleSign rule and 45 generalized
[2026-05-25 04:37:03] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2123890651134947862.kers
Total runtime 2 ms.
[2026-05-25 04:37:03] [INFO ] Implicit Places using invariants in 377 ms returned [135, 140, 162, 168]
[2026-05-25 04:37:03] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 379 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 211/234 places, 215/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 214
Applied a total of 2 rules in 12 ms. Remains 210 /211 variables (removed 1) and now considering 214/215 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12913987428044212869.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2844201260739403098.kers'
[2026-05-25 04:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12913987428044212869.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2844201260739403098.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1150 entries
Finished phase 1 with 133 SingleSign rule and 44 generalized
[2026-05-25 04:37:03] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2844201260739403098.kers
Total runtime 2 ms.
[2026-05-25 04:37:03] [INFO ] Implicit Places using invariants in 370 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 372 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 208/234 places, 214/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 12 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10986446819533061472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-827918058486504175.kers'
[2026-05-25 04:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10986446819533061472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-827918058486504175.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 205 cols 1141 entries
Finished phase 1 with 133 SingleSign rule and 43 generalized
[2026-05-25 04:37:03] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-827918058486504175.kers
Total runtime 2 ms.
[2026-05-25 04:37:04] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 04:37:04] [INFO ] Invariant cache hit.
[2026-05-25 04:37:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:37:06] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 207/234 places, 213/222 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7732 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5704 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3700 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 753874 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 1
Probabilistic random walk after 753874 steps, saw 377013 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
[2026-05-25 04:37:09] [INFO ] Invariant cache hit.
[2026-05-25 04:37:09] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/198 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/415 variables, 202/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/420 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/198 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 213/415 variables, 202/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 38/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/420 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/420 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4252ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 04:37:13] [INFO ] Invariant cache hit.
[2026-05-25 04:37:13] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-25 04:37:13] [INFO ] Invariant cache hit.
[2026-05-25 04:37:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-25 04:37:15] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2026-05-25 04:37:15] [INFO ] Redundant transitions in 2 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:37:15] [INFO ] Invariant cache hit.
[2026-05-25 04:37:15] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 212 unsolved in 19408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/420 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 212/490 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 212 unsolved
SMT process timed out in 49451ms, After SMT, problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 49452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51771 ms. Remains : 207/207 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 207 transition count 196
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 184
Applied a total of 58 rules in 11 ms. Remains 178 /207 variables (removed 29) and now considering 184/213 (removed 29) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15173332235913948370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8089503251205088478.kers'
[2026-05-25 04:38:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15173332235913948370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8089503251205088478.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 184 rows 176 cols 1056 entries
Finished phase 1 with 102 SingleSign rule and 45 generalized
[2026-05-25 04:38:05] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8089503251205088478.kers
Total runtime 2 ms.
[2026-05-25 04:38:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:38:05] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-25 04:38:05] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:38:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:38:05] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2026-05-25 04:38:05] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:38:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:38:05] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2026-05-25 04:38:05] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:38:05] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 388 ms.
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Knowledge-based reduction took 82725 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13858 reset in 95 ms.
Product exploration explored 100000 steps with 13909 reset in 113 ms.
Built C files in :
/tmp/ltsmin12847994271975323555
[2026-05-25 04:38:06] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:38:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:38:06] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:38:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:38:06] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:38:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:38:06] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12847994271975323555
Running compilation step : cd /tmp/ltsmin12847994271975323555;'/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 555 ms.
Running link step : cd /tmp/ltsmin12847994271975323555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12847994271975323555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased345305594567296353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 261/261 transitions.
Applied a total of 0 rules in 3 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (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-2117178804459424420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-339803057688728071.kers'
[2026-05-25 04:38:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2117178804459424420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-339803057688728071.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 271 cols 1004 entries
Finished phase 1 with 157 SingleSign rule and 67 generalized
[2026-05-25 04:38:21] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-339803057688728071.kers
Total runtime 4 ms.
[2026-05-25 04:38:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 04:38:21] [INFO ] Invariant cache hit.
[2026-05-25 04:38:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 04:38:22] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2026-05-25 04:38:22] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:38:22] [INFO ] Invariant cache hit.
[2026-05-25 04:38:22] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 351 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/533 variables, 272/321 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 17/338 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/595 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SMT process timed out in 60046ms, After SMT, problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61473 ms. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin6846368056798946479
[2026-05-25 04:39:22] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:39:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:39:22] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:39:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:39:22] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:39:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:39:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6846368056798946479
Running compilation step : cd /tmp/ltsmin6846368056798946479;'/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 568 ms.
Running link step : cd /tmp/ltsmin6846368056798946479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6846368056798946479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11258761522634436730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:39:37] [INFO ] Flatten gal took : 4 ms
[2026-05-25 04:39:37] [INFO ] Flatten gal took : 4 ms
[2026-05-25 04:39:37] [INFO ] Time to serialize gal into /tmp/LTL18027875639716109582.gal : 1 ms
[2026-05-25 04:39:37] [INFO ] Time to serialize properties into /tmp/LTL6494238911777484676.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/LTL18027875639716109582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11300812589301615256.hoa' '-atoms' '/tmp/LTL6494238911777484676.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6494238911777484676.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11300812589301615256.hoa
Detected timeout of ITS tools.
[2026-05-25 04:39:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 04:39:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 04:39:52] [INFO ] Time to serialize gal into /tmp/LTL17240961612712484536.gal : 1 ms
[2026-05-25 04:39:52] [INFO ] Time to serialize properties into /tmp/LTL14438514232415033377.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17240961612712484536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14438514232415033377.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p228<1)||(p236<1))"))))
Formula 0 simplified : GF!"((p228<1)||(p236<1))"
Detected timeout of ITS tools.
[2026-05-25 04:40:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 04:40:07] [INFO ] Applying decomposition
[2026-05-25 04:40:07] [INFO ] Flatten gal took : 6 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/graph2860320735721742947.txt' '-o' '/tmp/graph2860320735721742947.bin' '-w' '/tmp/graph2860320735721742947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2860320735721742947.bin' '-l' '-1' '-v' '-w' '/tmp/graph2860320735721742947.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:40:07] [INFO ] Decomposing Gal with order
[2026-05-25 04:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:40:07] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-25 04:40:07] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-25 04:40:07] [INFO ] Time to serialize gal into /tmp/LTL12975387983983554011.gal : 4 ms
[2026-05-25 04:40:07] [INFO ] Time to serialize properties into /tmp/LTL12335392962570395571.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12975387983983554011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12335392962570395571.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i3.i0.u29.p228<1)||(i3.i0.u30.p236<1))"))))
Formula 0 simplified : GF!"((i3.i0.u29.p228<1)||(i3.i0.u30.p236<1))"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLFireability-14 finished in 366682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(X((p1||X(X(p2)))))))))'
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(p1) U (X(G(p1))||(F(p2)&&X((p1&&X(p3))))))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&p2)))))'
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 04:40:23] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9109992842132928459
[2026-05-25 04:40:23] [INFO ] Applying decomposition
[2026-05-25 04:40:23] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2026-05-25 04:40:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:40:23] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2026-05-25 04:40:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:40:23] [INFO ] Flatten gal took : 8 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/graph3875434744121975638.txt' '-o' '/tmp/graph3875434744121975638.bin' '-w' '/tmp/graph3875434744121975638.weights'
[2026-05-25 04:40:23] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2026-05-25 04:40:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3875434744121975638.bin' '-l' '-1' '-v' '-w' '/tmp/graph3875434744121975638.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:40:23] [INFO ] Decomposing Gal with order
[2026-05-25 04:40:23] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9109992842132928459
Running compilation step : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 04:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:40:23] [INFO ] Removed a total of 129 redundant transitions.
[2026-05-25 04:40:23] [INFO ] Flatten gal took : 20 ms
[2026-05-25 04:40:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 27 ms.
[2026-05-25 04:40:23] [INFO ] Time to serialize gal into /tmp/LTLFireability11482007454373513066.gal : 6 ms
[2026-05-25 04:40:23] [INFO ] Time to serialize properties into /tmp/LTLFireability7351382022192403211.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/LTLFireability11482007454373513066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7351382022192403211.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((G(("(i5.u111.p332>=1)")U(X(X(X(("(i0.i0.i0.u5.p141>=1)")||(X(X("(i3.i0.i0.u58.p224<1)"))))))))))
Formula 0 simplified : F(!"(i5.u111.p332>=1)" R XXX(!"(i0.i0.i0.u5.p141>=1)" & XX!"(i3.i0.i0.u58.p224<1)"))
Compilation finished in 1140 ms.
Running link step : cd /tmp/ltsmin9109992842132928459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true) U X(X(X(((LTLAPp1==true)||X(X((LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true) U X(X(X(((LTLAPp1==true)||X(X((LTLAPp2==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X([]((LTLAPp3==true)))&&(X((LTLAPp4==true)) U (X([]((LTLAPp4==true)))||(<>((LTLAPp5==true))&&X(((LTLAPp4==true)&&X((LTLAPp6==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(X([]((LTLAPp3==true)))&&(X((LTLAPp4==true)) U (X([]((LTLAPp4==true)))||(<>((LTLAPp5==true))&&X(((LTLAPp4==true)&&X((LTLAPp6==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((!(LTLAPp7==true) U ([](!(LTLAPp7==true))||(!(LTLAPp7==true)&&[](!(LTLAPp8==true))))) U ([](!(LTLAPp7==true))||((!(LTLAPp7==true) U ([](!(LTLAPp7==true))||(!(LTLAPp7==true)&&[](!(LTLAPp8==true)))))&&(LTLAPp9==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((!(LTLAPp7==true) U ([](!(LTLAPp7==true))||(!(LTLAPp7==true)&&[](!(LTLAPp8==true))))) U ([](!(LTLAPp7==true))||((!(LTLAPp7==true) U ([](!(LTLAPp7==true))||(!(LTLAPp7==true)&&[](!(LTLAPp8==true)))))&&(LTLAPp9==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp10==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp10==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9109992842132928459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp11==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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