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-177955695800883.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800883
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779680932984

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 03:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 03:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:48:54] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-05-25 03:48:54] [INFO ] Transformed 534 places.
[2026-05-25 03:48:54] [INFO ] Transformed 498 transitions.
[2026-05-25 03:48:54] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DoubleExponent-PT-010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 498
Applied a total of 3 rules in 68 ms. Remains 531 /534 variables (removed 3) 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-18128520068448298752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9143512416897006699.kers'
[2026-05-25 03:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18128520068448298752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9143512416897006699.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 531 cols 1401 entries
Finished phase 1 with 449 SingleSign rule and 31 generalized
[2026-05-25 03:48:54] [INFO ] Computed 51 invariants in 18 ms
Computed 51 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-9143512416897006699.kers
Total runtime 19 ms.
[2026-05-25 03:48:55] [INFO ] Implicit Places using invariants in 508 ms returned [437, 439]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 543 ms to find 2 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 71 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-6463386804522895795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606298504064252337.kers'
[2026-05-25 03:48:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6463386804522895795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606298504064252337.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 497 rows 528 cols 1393 entries
Finished phase 1 with 449 SingleSign rule and 30 generalized
[2026-05-25 03:48:55] [INFO ] Computed 49 invariants in 22 ms
Computed 49 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-12606298504064252337.kers
Total runtime 23 ms.
[2026-05-25 03:48:55] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-25 03:48:55] [INFO ] Invariant cache hit.
[2026-05-25 03:48:57] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2011 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 2707 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 15 ms. Remains 528 /528 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2026-05-25 03:48:57] [INFO ] Invariant cache hit.
[2026-05-25 03:48:57] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 03:48:57] [INFO ] Invariant cache hit.
[2026-05-25 03:48:59] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 03:48:59] [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/1025 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/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/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, 494/1071 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1025 variables, and 1071 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/528 constraints, PredecessorRefiner: 494/496 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in LTL mode , in 1 iterations and 62149 ms. Remains : 528/528 places, 497/497 transitions.
Support contains 53 out of 528 places after structural reductions.
[2026-05-25 03:49:59] [INFO ] Flatten gal took : 56 ms
[2026-05-25 03:49:59] [INFO ] Flatten gal took : 28 ms
[2026-05-25 03:49:59] [INFO ] Input system was already deterministic with 497 transitions.
RANDOM walk for 40000 steps (1327 resets) in 1540 ms. (25 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4001 steps (113 resets) in 59 ms. (66 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (110 resets) in 49 ms. (80 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (110 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (108 resets) in 73 ms. (54 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (113 resets) in 59 ms. (66 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (114 resets) in 66 ms. (59 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (112 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (104 resets) in 45 ms. (86 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (111 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (118 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (113 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (115 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (121 resets) in 45 ms. (86 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (117 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (118 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (114 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (113 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (110 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (113 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (112 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (110 resets) in 57 ms. (68 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (112 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (110 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (111 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (141 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (115 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (109 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (109 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (117 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (118 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 174632 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :4 out of 31
Probabilistic random walk after 174632 steps, saw 87327 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :4
[2026-05-25 03:50:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 16/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 361/422 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 36/458 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 479/937 variables, 458/507 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 9 (OVERLAPS) 88/1025 variables, 70/577 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1025 variables, 1/578 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1025 variables, 1/579 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1025 variables, 7/586 constraints. Problems are: Problem set: 8 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 586 constraints, problems are : Problem set: 8 solved, 19 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 16/49 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 367/416 variables, 37/39 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/39 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 40/456 variables, 10/49 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 476/932 variables, 456/505 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/932 variables, 11/516 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/932 variables, 2/518 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 0/518 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 84/1016 variables, 66/584 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 8/592 constraints. Problems are: Problem set: 8 solved, 19 unsolved
SMT process timed out in 10038ms, After SMT, problems are : Problem set: 8 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 edges and 528 vertex of which 525 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 525 transition count 408
Reduce places removed 87 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 99 rules applied. Total rules applied 188 place count 438 transition count 396
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 200 place count 426 transition count 396
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 200 place count 426 transition count 372
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 248 place count 402 transition count 372
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 406 place count 323 transition count 293
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 438 place count 307 transition count 293
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 307 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 306 transition count 292
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 482 place count 306 transition count 250
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 524 place count 264 transition count 250
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 5 with 38 rules applied. Total rules applied 562 place count 264 transition count 250
Applied a total of 562 rules in 137 ms. Remains 264 /528 variables (removed 264) and now considering 250/497 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 264/528 places, 250/497 transitions.
RANDOM walk for 40000 steps (3946 resets) in 992 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (282 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (284 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (276 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (277 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (291 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (332 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (285 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (275 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (279 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (263 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (281 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (293 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (293 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (277 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (291 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (400 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (275 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (280 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (279 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 204125 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 19
Probabilistic random walk after 204125 steps, saw 102084 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) 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-6467509986373520533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11222041851817459967.kers'
[2026-05-25 03:50:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6467509986373520533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11222041851817459967.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 264 cols 1213 entries
Finished phase 1 with 159 SingleSign rule and 56 generalized
[2026-05-25 03:50:17] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11222041851817459967.kers
Total runtime 3 ms.
[2026-05-25 03:50:17] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 210/247 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 14/261 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/263 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 250/513 variables, 263/312 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 29/341 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/514 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/514 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 342 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 264/264 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 210/247 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 14/261 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 2/263 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/263 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/263 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/263 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/263 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/263 variables, 15/270 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/263 variables, 17/287 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/263 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/263 variables, 11/318 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/263 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 250/513 variables, 263/581 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/513 variables, 29/610 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/513 variables, 19/629 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 629 constraints, problems are : Problem set: 0 solved, 19 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 263/264 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 269/269 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47356ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 250/250 transitions.
Applied a total of 0 rules in 19 ms. Remains 264 /264 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 264/264 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2026-05-25 03:51:04] [INFO ] Invariant cache hit.
[2026-05-25 03:51:05] [INFO ] Implicit Places using invariants in 670 ms returned [22, 28, 57, 81, 86, 111, 118, 148, 149, 171, 178, 202, 208, 215, 255, 261]
[2026-05-25 03:51:05] [INFO ] Actually due to overlaps returned [86, 215, 81, 148]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 677 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 260/264 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 259 transition count 249
Applied a total of 2 rules in 27 ms. Remains 259 /260 variables (removed 1) and now considering 249/250 (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-4619216807983330701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10502487406514470788.kers'
[2026-05-25 03:51:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4619216807983330701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10502487406514470788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 259 cols 1163 entries
Finished phase 1 with 167 SingleSign rule and 47 generalized
[2026-05-25 03:51:05] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10502487406514470788.kers
Total runtime 4 ms.
[2026-05-25 03:51:06] [INFO ] Implicit Places using invariants in 568 ms returned [22, 28, 57, 109, 116, 146, 168, 175, 199, 205, 250, 256]
[2026-05-25 03:51:06] [INFO ] Actually due to overlaps returned [116, 256, 109, 250]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 576 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/264 places, 249/250 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 247
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 247
Applied a total of 4 rules in 32 ms. Remains 253 /255 variables (removed 2) and now considering 247/249 (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-10388750497587174069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1879683084125627671.kers'
[2026-05-25 03:51:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10388750497587174069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1879683084125627671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 253 cols 1127 entries
Finished phase 1 with 168 SingleSign rule and 44 generalized
[2026-05-25 03:51:06] [INFO ] Computed 41 invariants in 5 ms
Computed 41 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1879683084125627671.kers
Total runtime 6 ms.
[2026-05-25 03:51:06] [INFO ] Implicit Places using invariants in 476 ms returned [22, 28, 57, 143, 165, 172, 196, 202]
[2026-05-25 03:51:06] [INFO ] Actually due to overlaps returned [143, 22, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 478 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 250/264 places, 247/250 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 246
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 246
Applied a total of 2 rules in 22 ms. Remains 249 /250 variables (removed 1) and now considering 246/247 (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-2947084318535089906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11081371670222543790.kers'
[2026-05-25 03:51:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2947084318535089906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11081371670222543790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 249 cols 1103 entries
Finished phase 1 with 167 SingleSign rule and 44 generalized
[2026-05-25 03:51:06] [INFO ] Computed 38 invariants in 8 ms
Computed 38 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11081371670222543790.kers
Total runtime 8 ms.
[2026-05-25 03:51:07] [INFO ] Implicit Places using invariants in 422 ms returned [54, 161, 168, 192, 198]
[2026-05-25 03:51:07] [INFO ] Actually due to overlaps returned [168, 161, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 426 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 246/264 places, 246/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 245 transition count 245
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 245 transition count 245
Applied a total of 3 rules in 26 ms. Remains 245 /246 variables (removed 1) and now considering 245/246 (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-12022955270329474696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11839627762181037939.kers'
[2026-05-25 03:51:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12022955270329474696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11839627762181037939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 245 cols 1088 entries
Finished phase 1 with 167 SingleSign rule and 43 generalized
[2026-05-25 03:51:07] [INFO ] Computed 35 invariants in 7 ms
Computed 35 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11839627762181037939.kers
Total runtime 8 ms.
[2026-05-25 03:51:07] [INFO ] Implicit Places using invariants in 369 ms returned [188, 194]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 371 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 243/264 places, 245/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 244
Applied a total of 2 rules in 24 ms. Remains 242 /243 variables (removed 1) and now considering 244/245 (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-9476789459589826552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14639933939765405489.kers'
[2026-05-25 03:51:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9476789459589826552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14639933939765405489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 242 cols 1079 entries
Finished phase 1 with 168 SingleSign rule and 41 generalized
[2026-05-25 03:51:07] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14639933939765405489.kers
Total runtime 3 ms.
[2026-05-25 03:51:07] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-25 03:51:07] [INFO ] Invariant cache hit.
[2026-05-25 03:51:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 03:51:09] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 242/264 places, 244/250 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 4727 ms. Remains : 242/264 places, 244/250 transitions.
RANDOM walk for 40000 steps (4366 resets) in 365 ms. (109 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (300 resets) in 56 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (295 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (314 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (293 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (302 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (332 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (295 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (309 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (312 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (291 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (315 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (302 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (293 resets) in 28 ms. (137 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (294 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (309 resets) in 22 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (444 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (310 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (310 resets) in 22 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (317 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 214527 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 19
Probabilistic random walk after 214527 steps, saw 107280 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2026-05-25 03:51:13] [INFO ] Invariant cache hit.
[2026-05-25 03:51:13] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 186/223 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 16/239 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 244/485 variables, 241/274 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 31/305 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1/486 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/486 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/486 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 306 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 242/242 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 186/223 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 16/239 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 13/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 15/220 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 17/246 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/239 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/239 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 2/241 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/241 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 244/485 variables, 241/514 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 31/545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/485 variables, 19/564 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/485 variables, 20/584 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/486 variables, and 617 constraints, problems are : Problem set: 0 solved, 19 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 241/242 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 293/293 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76933ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 244/244 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 244/244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 244/244 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2026-05-25 03:52:29] [INFO ] Invariant cache hit.
[2026-05-25 03:52:30] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-25 03:52:30] [INFO ] Invariant cache hit.
[2026-05-25 03:52:30] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 03:52:32] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2026-05-25 03:52:32] [INFO ] Redundant transitions in 8 ms returned []
Running 243 sub problems to find dead transitions.
[2026-05-25 03:52:32] [INFO ] Invariant cache hit.
[2026-05-25 03:52:32] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 244/486 variables, 242/337 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 31/368 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 368 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 242/242 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 62/95 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/486 variables, and 247 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/242 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/243 constraints, Known Traps: 214/214 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62190 ms. Remains : 242/242 places, 244/244 transitions.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA DoubleExponent-PT-010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 896 edges and 528 vertex of which 525 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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((G(p0)||(p1&&X(X(X(G(p1))))))))'
Support contains 4 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 10 ms. Remains 527 /528 variables (removed 1) 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-13978405608177146694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18234304842999529621.kers'
[2026-05-25 03:53:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13978405608177146694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18234304842999529621.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 03:53:32] [INFO ] Computed 49 invariants in 30 ms
Computed 49 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-18234304842999529621.kers
Total runtime 32 ms.
[2026-05-25 03:53:32] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-25 03:53:32] [INFO ] Invariant cache hit.
[2026-05-25 03:53:34] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 03:53:34] [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 30023 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 60091ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62319 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((G(p0)||(p1&&X(X(X(G(p1))))))))'
Stuttering acceptance computed with spot in 524 ms :[(AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-02
Product exploration explored 100000 steps with 3336 reset in 227 ms.
Product exploration explored 100000 steps with 3335 reset in 177 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.6 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 13 factoid took 57 ms. Reduced automaton from 9 states, 20 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1326 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 465954 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 465954 steps, saw 233007 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2026-05-25 03:54:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 294/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1018 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1023 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1023 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1024 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 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) 294/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/311 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/450 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 471/921 variables, 450/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/921 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/921 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 89/1010 variables, 69/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 1/573 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 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2593 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: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 3229ms problems are : Problem set: 0 solved, 1 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.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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 525 transition count 376
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 406 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 404 transition count 374
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 244 place count 404 transition count 352
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 288 place count 382 transition count 352
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 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 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 508 place count 272 transition count 260
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 544 place count 272 transition count 224
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 580 place count 236 transition count 224
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 620 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 621 place count 235 transition count 223
Applied a total of 621 rules in 63 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 235/527 places, 223/497 transitions.
RANDOM walk for 40000 steps (5059 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3421 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 728899 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 728899 steps, saw 364677 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) 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-16378661972317475136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18071974623665465657.kers'
[2026-05-25 03:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16378661972317475136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18071974623665465657.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 233 cols 1397 entries
Finished phase 1 with 129 SingleSign rule and 57 generalized
[2026-05-25 03:54:45] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-18071974623665465657.kers
Total runtime 9 ms.
[2026-05-25 03:54:45] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 169/171 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/230 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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) 169/171 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/230 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 223/453 variables, 230/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 37/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/458 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/458 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2854ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 03:54:48] [INFO ] Invariant cache hit.
[2026-05-25 03:54:49] [INFO ] Implicit Places using invariants in 1014 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 131, 151, 157, 179, 185, 192, 226, 232]
[2026-05-25 03:54:49] [INFO ] Actually due to overlaps returned [192, 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 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 15 ms. Remains 232 /233 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-3812198443862993885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5604665222635022945.kers'
[2026-05-25 03:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3812198443862993885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5604665222635022945.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 230 cols 1347 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 03:54:49] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5604665222635022945.kers
Total runtime 8 ms.
[2026-05-25 03:54:49] [INFO ] Implicit Places using invariants in 847 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 150, 156, 178, 184, 223, 229]
[2026-05-25 03:54:49] [INFO ] Actually due to overlaps returned [229, 223]
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 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 15 ms. Remains 229 /230 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-18416207565320536746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3510134788368121515.kers'
[2026-05-25 03:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18416207565320536746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3510134788368121515.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 227 cols 1305 entries
Finished phase 1 with 130 SingleSign rule and 54 generalized
[2026-05-25 03:54:49] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3510134788368121515.kers
Total runtime 9 ms.
[2026-05-25 03:54:50] [INFO ] Implicit Places using invariants in 724 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 150, 156, 178, 184]
[2026-05-25 03:54:50] [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 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 16 ms. Remains 226 /227 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-10547392874886773438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1894873910564303504.kers'
[2026-05-25 03:54:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10547392874886773438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1894873910564303504.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 224 cols 1269 entries
Finished phase 1 with 130 SingleSign rule and 53 generalized
[2026-05-25 03:54:50] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1894873910564303504.kers
Total runtime 7 ms.
[2026-05-25 03:54:51] [INFO ] Implicit Places using invariants in 625 ms returned [49, 70, 75, 95, 101, 122, 127, 147, 153, 175, 181]
[2026-05-25 03:54:51] [INFO ] Actually due to overlaps returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 628 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/235 places, 220/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Applied a total of 1 rules in 14 ms. Remains 225 /225 variables (removed 0) and now considering 220/220 (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-8654152879695165103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2603938515274778043.kers'
[2026-05-25 03:54:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8654152879695165103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2603938515274778043.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 223 cols 1242 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-25 03:54:51] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2603938515274778043.kers
Total runtime 3 ms.
[2026-05-25 03:54:51] [INFO ] Implicit Places using invariants in 551 ms returned [69, 74, 94, 100, 121, 126, 146, 152, 174, 180]
[2026-05-25 03:54:51] [INFO ] Actually due to overlaps returned [74, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 555 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/235 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 223 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 222 transition count 219
Applied a total of 2 rules in 13 ms. Remains 222 /223 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-9064082032429795161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14258053029752506692.kers'
[2026-05-25 03:54:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9064082032429795161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14258053029752506692.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 220 cols 1213 entries
Finished phase 1 with 134 SingleSign rule and 48 generalized
[2026-05-25 03:54:51] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14258053029752506692.kers
Total runtime 4 ms.
[2026-05-25 03:54:52] [INFO ] Implicit Places using invariants in 489 ms returned [91, 97, 118, 123, 143, 149, 171, 177]
[2026-05-25 03:54:52] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 492 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/235 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 220 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 219 transition count 218
Applied a total of 2 rules in 14 ms. Remains 219 /220 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-12080895659929266025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10266199129676775120.kers'
[2026-05-25 03:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12080895659929266025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10266199129676775120.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 217 cols 1189 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-25 03:54:52] [INFO ] Computed 38 invariants in 7 ms
Computed 38 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10266199129676775120.kers
Total runtime 8 ms.
[2026-05-25 03:54:52] [INFO ] Implicit Places using invariants in 455 ms returned [115, 120, 140, 146, 168, 174]
[2026-05-25 03:54:52] [INFO ] Actually due to overlaps returned [120, 115]
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 7 : 217/235 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 217 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 216 transition count 217
Applied a total of 2 rules in 13 ms. Remains 216 /217 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-10759711336724909826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15395819758250634000.kers'
[2026-05-25 03:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10759711336724909826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15395819758250634000.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 214 cols 1170 entries
Finished phase 1 with 131 SingleSign rule and 49 generalized
[2026-05-25 03:54:52] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15395819758250634000.kers
Total runtime 4 ms.
[2026-05-25 03:54:53] [INFO ] Implicit Places using invariants in 389 ms returned [137, 143, 165, 171]
[2026-05-25 03:54:53] [INFO ] Actually due to overlaps returned [143, 137]
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 : 214/235 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 214 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 213 transition count 216
Applied a total of 2 rules in 16 ms. Remains 213 /214 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-14918415587430989880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2000494396517776276.kers'
[2026-05-25 03:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14918415587430989880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2000494396517776276.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 211 cols 1156 entries
Finished phase 1 with 131 SingleSign rule and 48 generalized
[2026-05-25 03:54:53] [INFO ] Computed 34 invariants in 6 ms
Computed 34 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2000494396517776276.kers
Total runtime 8 ms.
[2026-05-25 03:54:53] [INFO ] Implicit Places using invariants in 363 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/235 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 211 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 210 transition count 215
Applied a total of 2 rules in 16 ms. Remains 210 /211 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-10946475048620893984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11648453794210999450.kers'
[2026-05-25 03:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10946475048620893984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11648453794210999450.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 208 cols 1147 entries
Finished phase 1 with 130 SingleSign rule and 48 generalized
[2026-05-25 03:54:53] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11648453794210999450.kers
Total runtime 3 ms.
[2026-05-25 03:54:53] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 03:54:54] [INFO ] Invariant cache hit.
[2026-05-25 03:54:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:54:55] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 7700 ms. Remains : 210/235 places, 215/223 transitions.
RANDOM walk for 40000 steps (5805 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3696 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264440 states, properties seen :0
Probabilistic random walk after 528890 steps, saw 264440 distinct states, run finished after 2095 ms. (steps per millisecond=252 ) properties seen :0
Interrupted probabilistic random walk after 774786 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Exhaustive walk after 774786 steps, saw 387476 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2026-05-25 03:55:00] [INFO ] Invariant cache hit.
[2026-05-25 03:55:00] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 151/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/203 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/205 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/420 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 37/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/425 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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) 151/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/203 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/205 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/420 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 37/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/425 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/425 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-25 03:55:01] [INFO ] Invariant cache hit.
[2026-05-25 03:55:02] [INFO ] Implicit Places using invariants in 356 ms returned []
[2026-05-25 03:55:02] [INFO ] Invariant cache hit.
[2026-05-25 03:55:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:55:03] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2026-05-25 03:55:03] [INFO ] Redundant transitions in 17 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-25 03:55:03] [INFO ] Invariant cache hit.
[2026-05-25 03:55:03] [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, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/425 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 279 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14977 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/425 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 214/493 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 516 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45042ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47126 ms. Remains : 210/210 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 210 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 192 transition count 197
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 185 transition count 190
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 185 transition count 190
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 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 187
Applied a total of 56 rules in 15 ms. Remains 182 /210 variables (removed 28) and now considering 187/215 (removed 28) 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-14452351443526293963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4503932967511941369.kers'
[2026-05-25 03:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14452351443526293963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4503932967511941369.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 180 cols 1070 entries
Finished phase 1 with 108 SingleSign rule and 42 generalized
[2026-05-25 03:55:48] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4503932967511941369.kers
Total runtime 2 ms.
[2026-05-25 03:55:48] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 03:55:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 03:55:49] [INFO ] [Nat]Absence check using 4 positive and 28 generalized place invariants in 101 ms returned sat
[2026-05-25 03:55:49] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 03:55:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 03:55:49] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 03:55:49] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:55:49] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 635 ms.
Knowledge based reduction with 13 factoid took 50 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 41 ms :[true, (NOT p1)]
Knowledge-based reduction took 73985 ms.
Stuttering acceptance computed with spot in 40 ms :[true, (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 SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 525 transition count 379
Reduce places removed 116 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 409 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 237 place count 407 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 237 place count 407 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 281 place count 385 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 463 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 3 with 36 rules applied. Total rules applied 499 place count 276 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 275 transition count 263
Applied a total of 500 rules in 73 ms. Remains 275 /527 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-946474261395315924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3832302513493979599.kers'
[2026-05-25 03:55:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-946474261395315924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3832302513493979599.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 263 rows 273 cols 1009 entries
Finished phase 1 with 160 SingleSign rule and 66 generalized
[2026-05-25 03:55:49] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3832302513493979599.kers
Total runtime 2 ms.
[2026-05-25 03:55:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-25 03:55:49] [INFO ] Invariant cache hit.
[2026-05-25 03:55:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 03:55:51] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2026-05-25 03:55:51] [INFO ] Redundant transitions in 10 ms returned []
Running 262 sub problems to find dead transitions.
[2026-05-25 03:55:51] [INFO ] Invariant cache hit.
[2026-05-25 03:55:51] [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, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/538 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/538 variables, and 349 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 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: 262/262 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/537 variables, 274/323 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 18/341 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 259/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 604 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30028 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: 262/262 constraints, Known Traps: 0/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 275/527 places, 263/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61882 ms. Remains : 275/527 places, 263/497 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 854 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 45 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 (5469 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3192 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 536936 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 536936 steps, saw 268538 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2026-05-25 03:56:54] [INFO ] Invariant cache hit.
[2026-05-25 03:56:54] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
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) 167/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/234 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/237 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 251/488 variables, 237/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/527 variables, 31/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/527 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/529 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/535 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/538 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/538 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 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) 167/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/234 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/237 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 251/488 variables, 237/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/527 variables, 31/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/527 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/529 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/535 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/535 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/535 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/535 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/535 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 3/538 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/538 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2259 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: 2/2 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 2527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 263/263 transitions.
Graph (complete) has 814 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 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 274 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 273 transition count 261
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 1 with 4 rules applied. Total rules applied 8 place count 271 transition count 259
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 1 with 36 rules applied. Total rules applied 44 place count 271 transition count 223
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 80 place count 235 transition count 223
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 119 place count 235 transition count 223
Applied a total of 119 rules in 33 ms. Remains 235 /275 variables (removed 40) and now considering 223/263 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 235/275 places, 223/263 transitions.
RANDOM walk for 40000 steps (5078 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3371 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 591164 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 591164 steps, saw 295757 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) 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-3092687692724210429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17556464916763578322.kers'
[2026-05-25 03:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3092687692724210429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17556464916763578322.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 233 cols 1396 entries
Finished phase 1 with 129 SingleSign rule and 57 generalized
[2026-05-25 03:57:00] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17556464916763578322.kers
Total runtime 9 ms.
[2026-05-25 03:57:00] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 131/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/223 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/230 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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) 131/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/223 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/230 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 223/453 variables, 230/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 37/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/458 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/458 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 03:57:02] [INFO ] Invariant cache hit.
[2026-05-25 03:57:03] [INFO ] Implicit Places using invariants in 1087 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 131, 151, 157, 179, 185, 192, 226, 232]
[2026-05-25 03:57:03] [INFO ] Actually due to overlaps returned [192, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1092 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 15 ms. Remains 232 /233 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-12851096178952855753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17187911034490083211.kers'
[2026-05-25 03:57:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12851096178952855753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17187911034490083211.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 222 rows 230 cols 1346 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 03:57:03] [INFO ] Computed 47 invariants in 1 ms
Computed 47 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17187911034490083211.kers
Total runtime 2 ms.
[2026-05-25 03:57:04] [INFO ] Implicit Places using invariants in 1002 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 150, 156, 178, 184, 223, 229]
[2026-05-25 03:57:04] [INFO ] Actually due to overlaps returned [229, 223]
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 2 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 15 ms. Remains 229 /230 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-9151371630680939368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12596815647064022771.kers'
[2026-05-25 03:57:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9151371630680939368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12596815647064022771.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 14 ms.
// Phase 1: matrix 221 rows 227 cols 1304 entries
Finished phase 1 with 138 SingleSign rule and 46 generalized
[2026-05-25 03:57:05] [INFO ] Computed 45 invariants in 17 ms
Computed 45 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12596815647064022771.kers
Total runtime 17 ms.
[2026-05-25 03:57:05] [INFO ] Implicit Places using invariants in 859 ms returned [20, 26, 52, 73, 78, 98, 104, 125, 130, 150, 156, 178, 184]
[2026-05-25 03:57:05] [INFO ] Actually due to overlaps returned [26, 20]
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 3 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 13 ms. Remains 226 /227 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-803530693063899269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7197334606035953604.kers'
[2026-05-25 03:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-803530693063899269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7197334606035953604.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 224 cols 1268 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-25 03:57:05] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7197334606035953604.kers
Total runtime 2 ms.
[2026-05-25 03:57:06] [INFO ] Implicit Places using invariants in 681 ms returned [49, 70, 75, 95, 101, 122, 127, 147, 153, 175, 181]
[2026-05-25 03:57:06] [INFO ] Actually due to overlaps returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 691 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 225/235 places, 220/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 220
Applied a total of 1 rules in 6 ms. Remains 225 /225 variables (removed 0) and now considering 220/220 (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-1976428268389033074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9550326160028767810.kers'
[2026-05-25 03:57:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1976428268389033074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9550326160028767810.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 223 cols 1241 entries
Finished phase 1 with 140 SingleSign rule and 43 generalized
[2026-05-25 03:57:06] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9550326160028767810.kers
Total runtime 2 ms.
[2026-05-25 03:57:07] [INFO ] Implicit Places using invariants in 696 ms returned [69, 74, 94, 100, 121, 126, 146, 152, 174, 180]
[2026-05-25 03:57:07] [INFO ] Actually due to overlaps returned [74, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 707 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 223/235 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 223 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 222 transition count 219
Applied a total of 2 rules in 8 ms. Remains 222 /223 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-12087782890383441361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6446050765193621492.kers'
[2026-05-25 03:57:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12087782890383441361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6446050765193621492.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 220 cols 1212 entries
Finished phase 1 with 139 SingleSign rule and 43 generalized
[2026-05-25 03:57:07] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6446050765193621492.kers
Total runtime 2 ms.
[2026-05-25 03:57:07] [INFO ] Implicit Places using invariants in 554 ms returned [91, 97, 118, 123, 143, 149, 171, 177]
[2026-05-25 03:57:07] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 556 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 220/235 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 220 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 219 transition count 218
Applied a total of 2 rules in 10 ms. Remains 219 /220 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-14905120706584647330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8525788125776861751.kers'
[2026-05-25 03:57:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14905120706584647330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8525788125776861751.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 217 cols 1188 entries
Finished phase 1 with 138 SingleSign rule and 43 generalized
[2026-05-25 03:57:07] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8525788125776861751.kers
Total runtime 2 ms.
[2026-05-25 03:57:08] [INFO ] Implicit Places using invariants in 438 ms returned [115, 120, 140, 146, 168, 174]
[2026-05-25 03:57:08] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 217/235 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 217 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 216 transition count 217
Applied a total of 2 rules in 15 ms. Remains 216 /217 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-8421519111392026578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18298624446646712008.kers'
[2026-05-25 03:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8421519111392026578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18298624446646712008.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 214 cols 1169 entries
Finished phase 1 with 136 SingleSign rule and 44 generalized
[2026-05-25 03:57:08] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18298624446646712008.kers
Total runtime 2 ms.
[2026-05-25 03:57:08] [INFO ] Implicit Places using invariants in 417 ms returned [137, 143, 165, 171]
[2026-05-25 03:57:08] [INFO ] Actually due to overlaps returned [143, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 418 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 214/235 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 214 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 213 transition count 216
Applied a total of 2 rules in 10 ms. Remains 213 /214 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-4206637468648309397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17764492452472274305.kers'
[2026-05-25 03:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4206637468648309397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17764492452472274305.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 216 rows 211 cols 1155 entries
Finished phase 1 with 136 SingleSign rule and 43 generalized
[2026-05-25 03:57:08] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17764492452472274305.kers
Total runtime 1 ms.
[2026-05-25 03:57:09] [INFO ] Implicit Places using invariants in 324 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 334 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 211/235 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 211 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 210 transition count 215
Applied a total of 2 rules in 21 ms. Remains 210 /211 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-9713455480382780713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9982117184549150535.kers'
[2026-05-25 03:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9713455480382780713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9982117184549150535.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 208 cols 1146 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-25 03:57:09] [INFO ] Computed 32 invariants in 1 ms
Computed 32 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-9982117184549150535.kers
Total runtime 14 ms.
[2026-05-25 03:57:09] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-25 03:57:09] [INFO ] Invariant cache hit.
[2026-05-25 03:57:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:57:11] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2486 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 210/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8740 ms. Remains : 210/235 places, 215/223 transitions.
RANDOM walk for 40000 steps (5704 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Probably explored full state space saw : 264441 states, properties seen :0
Probabilistic random walk after 528892 steps, saw 264441 distinct states, run finished after 2498 ms. (steps per millisecond=211 ) properties seen :0
Interrupted probabilistic random walk after 658788 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Exhaustive walk after 658788 steps, saw 329469 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-25 03:57:17] [INFO ] Invariant cache hit.
[2026-05-25 03:57:17] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 149/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/201 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/205 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/420 variables, 205/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 37/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/425 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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) 149/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 50/201 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/205 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 215/420 variables, 205/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 37/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/425 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/425 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2028ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-25 03:57:19] [INFO ] Invariant cache hit.
[2026-05-25 03:57:19] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-25 03:57:19] [INFO ] Invariant cache hit.
[2026-05-25 03:57:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:57:21] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
[2026-05-25 03:57:21] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-25 03:57:21] [INFO ] Invariant cache hit.
[2026-05-25 03:57:21] [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, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/425 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/425 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 279 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 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/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/210 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/425 variables, 210/242 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 37/279 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 214/493 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 515 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 210/210 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45110ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47616 ms. Remains : 210/210 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 210 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 192 transition count 197
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 185 transition count 190
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 185 transition count 190
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 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 187
Applied a total of 56 rules in 12 ms. Remains 182 /210 variables (removed 28) and now considering 187/215 (removed 28) 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-11799494480394089767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17680132789506469502.kers'
[2026-05-25 03:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11799494480394089767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17680132789506469502.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 187 rows 180 cols 1069 entries
Finished phase 1 with 108 SingleSign rule and 42 generalized
[2026-05-25 03:58:06] [INFO ] Computed 32 invariants in 2 ms
Computed 32 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17680132789506469502.kers
Total runtime 3 ms.
[2026-05-25 03:58:06] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 03:58:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 03:58:07] [INFO ] [Nat]Absence check using 4 positive and 28 generalized place invariants in 17 ms returned sat
[2026-05-25 03:58:07] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 03:58:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 03:58:07] [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 03:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 1
[2026-05-25 03:58:07] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:58:07] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 439 ms.
Knowledge based reduction with 3 factoid took 40 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 42 ms :[true, (NOT p1)]
Knowledge-based reduction took 75810 ms.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 13859 reset in 97 ms.
Product exploration explored 100000 steps with 13772 reset in 109 ms.
Built C files in :
/tmp/ltsmin3466659688503947666
[2026-05-25 03:58:07] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2026-05-25 03:58:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:58:07] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2026-05-25 03:58:07] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:58:07] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2026-05-25 03:58:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:58:07] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3466659688503947666
Running compilation step : cd /tmp/ltsmin3466659688503947666;'/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 652 ms.
Running link step : cd /tmp/ltsmin3466659688503947666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3466659688503947666;'/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/stateBased3316316498944333682.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, 263/263 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 275 transition count 262
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 2 place count 274 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 272 transition count 260
Applied a total of 6 rules in 8 ms. Remains 272 /275 variables (removed 3) and now considering 260/263 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6467061266867611985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6961398219696475582.kers'
[2026-05-25 03:58:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6467061266867611985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6961398219696475582.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 260 rows 270 cols 1005 entries
Finished phase 1 with 157 SingleSign rule and 66 generalized
[2026-05-25 03:58:22] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6961398219696475582.kers
Total runtime 3 ms.
[2026-05-25 03:58:22] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 03:58:22] [INFO ] Invariant cache hit.
[2026-05-25 03:58:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 03:58:24] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2026-05-25 03:58:24] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2026-05-25 03:58:24] [INFO ] Invariant cache hit.
[2026-05-25 03:58:24] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/531 variables, 271/320 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 18/338 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 343 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 272/272 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/531 variables, 271/320 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 18/338 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 256/594 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/532 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 598 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 272/272 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 272/275 places, 260/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61659 ms. Remains : 272/275 places, 260/263 transitions.
Built C files in :
/tmp/ltsmin793527843136585742
[2026-05-25 03:59:24] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2026-05-25 03:59:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:59:24] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2026-05-25 03:59:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:59:24] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2026-05-25 03:59:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:59:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin793527843136585742
Running compilation step : cd /tmp/ltsmin793527843136585742;'/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 567 ms.
Running link step : cd /tmp/ltsmin793527843136585742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin793527843136585742;'/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/stateBased5891586152581246367.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 03:59:39] [INFO ] Flatten gal took : 37 ms
[2026-05-25 03:59:39] [INFO ] Flatten gal took : 40 ms
[2026-05-25 03:59:39] [INFO ] Time to serialize gal into /tmp/LTL10480150667307735063.gal : 5 ms
[2026-05-25 03:59:39] [INFO ] Time to serialize properties into /tmp/LTL17551340003299374247.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/LTL10480150667307735063.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11029135565582490916.hoa' '-atoms' '/tmp/LTL17551340003299374247.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...320
Loading property file /tmp/LTL17551340003299374247.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11029135565582490916.hoa
Detected timeout of ITS tools.
[2026-05-25 03:59:54] [INFO ] Flatten gal took : 34 ms
[2026-05-25 03:59:54] [INFO ] Flatten gal took : 28 ms
[2026-05-25 03:59:54] [INFO ] Time to serialize gal into /tmp/LTL2989735020485403976.gal : 4 ms
[2026-05-25 03:59:54] [INFO ] Time to serialize properties into /tmp/LTL17847858717699027539.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2989735020485403976.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17847858717699027539.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((G("(p398>p497)"))||(("(p190<=p410)")&&(X(X(X(G("(p190<=p410)")))))))))
Formula 0 simplified : F(F!"(p398>p497)" & (!"(p190<=p410)" | XXXF!"(p190<=p410)"))
Detected timeout of ITS tools.
[2026-05-25 04:00:09] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:00:09] [INFO ] Applying decomposition
[2026-05-25 04:00:09] [INFO ] Flatten gal took : 15 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/graph2787689990190777713.txt' '-o' '/tmp/graph2787689990190777713.bin' '-w' '/tmp/graph2787689990190777713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2787689990190777713.bin' '-l' '-1' '-v' '-w' '/tmp/graph2787689990190777713.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:00:09] [INFO ] Decomposing Gal with order
[2026-05-25 04:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:00:09] [INFO ] Removed a total of 213 redundant transitions.
[2026-05-25 04:00:09] [INFO ] Flatten gal took : 78 ms
[2026-05-25 04:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2026-05-25 04:00:10] [INFO ] Time to serialize gal into /tmp/LTL6049473253511606549.gal : 6 ms
[2026-05-25 04:00:10] [INFO ] Time to serialize properties into /tmp/LTL15669957140129581544.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/LTL6049473253511606549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15669957140129581544.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((G("(gu94.p398>gu94.p497)"))||(("(gu74.p190<=gu74.p410)")&&(X(X(X(G("(gu74.p190<=gu74.p410)")))))))))
Formula 0 simplified : F(F!"(gu94.p398>gu94.p497)" & (!"(gu74.p190<=gu74.p410)" | XXXF!"(gu74.p190<=gu74.p410)"))
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-02 finished in 412858 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 896 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
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 525 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 407 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 406 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 406 transition count 356
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 279 place count 386 transition count 356
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 3 with 186 rules applied. Total rules applied 465 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 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 501 place count 275 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 502 place count 274 transition count 262
Applied a total of 502 rules in 27 ms. Remains 274 /528 variables (removed 254) and now considering 262/497 (removed 235) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6045586934459195493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11294700086846520728.kers'
[2026-05-25 04:00:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6045586934459195493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11294700086846520728.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 262 rows 272 cols 1008 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:00:25] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11294700086846520728.kers
Total runtime 11 ms.
[2026-05-25 04:00:25] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-25 04:00:25] [INFO ] Invariant cache hit.
[2026-05-25 04:00:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:00:26] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2026-05-25 04:00:26] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 04:00:26] [INFO ] Invariant cache hit.
[2026-05-25 04:00:26] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 350 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 9/9 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60053ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 262/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61908 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 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-03
Product exploration explored 100000 steps with 13868 reset in 93 ms.
Product exploration explored 100000 steps with 13816 reset in 98 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 848 edges and 274 vertex of which 273 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 50 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 (5582 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3209 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567945 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567945 steps, saw 284058 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2026-05-25 04:01:30] [INFO ] Invariant cache hit.
[2026-05-25 04:01:30] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
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) 27/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/150 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/213 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/238 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 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) 27/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/150 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/213 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/238 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/530 variables, 31/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/536 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 2494ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1241 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 808 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 261
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 1 with 39 rules applied. Total rules applied 41 place count 273 transition count 222
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 119 place count 234 transition count 222
Applied a total of 119 rules in 13 ms. Remains 234 /274 variables (removed 40) and now considering 222/262 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 234/274 places, 222/262 transitions.
RANDOM walk for 40000 steps (5128 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3402 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 604931 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 604931 steps, saw 302646 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) 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-2933435189135403053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3559354056661754716.kers'
[2026-05-25 04:01:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2933435189135403053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3559354056661754716.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 130 SingleSign rule and 55 generalized
[2026-05-25 04:01:37] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3559354056661754716.kers
Total runtime 3 ms.
[2026-05-25 04:01:37] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 11/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/188 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/229 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/451 variables, 229/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 37/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/456 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/456 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 37/37 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) 11/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/188 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/229 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/451 variables, 229/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 37/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/456 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/456 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 373 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 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:01:39] [INFO ] Invariant cache hit.
[2026-05-25 04:01:40] [INFO ] Implicit Places using invariants in 1074 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:01:40] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1078 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 19 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-3026054936120192053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5058153290877798490.kers'
[2026-05-25 04:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3026054936120192053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5058153290877798490.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 133 SingleSign rule and 51 generalized
[2026-05-25 04:01:40] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5058153290877798490.kers
Total runtime 7 ms.
[2026-05-25 04:01:41] [INFO ] Implicit Places using invariants in 910 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:01:41] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 925 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 7 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-16617265042922103807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17542346704212033244.kers'
[2026-05-25 04:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16617265042922103807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17542346704212033244.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 129 SingleSign rule and 54 generalized
[2026-05-25 04:01:41] [INFO ] Computed 45 invariants in 2 ms
Computed 45 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17542346704212033244.kers
Total runtime 2 ms.
[2026-05-25 04:01:42] [INFO ] Implicit Places using invariants in 688 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 150, 155, 177, 183]
[2026-05-25 04:01:42] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 708 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 6 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-279772868677733058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10636414141175454171.kers'
[2026-05-25 04:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-279772868677733058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10636414141175454171.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1277 entries
Finished phase 1 with 129 SingleSign rule and 53 generalized
[2026-05-25 04:01:42] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10636414141175454171.kers
Total runtime 3 ms.
[2026-05-25 04:01:42] [INFO ] Implicit Places using invariants in 627 ms returned [43, 48, 69, 74, 94, 100, 121, 127, 147, 152, 174, 180]
[2026-05-25 04:01:42] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 649 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 6 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-7352718829180946850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5736431568250385890.kers'
[2026-05-25 04:01:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7352718829180946850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5736431568250385890.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 129 SingleSign rule and 52 generalized
[2026-05-25 04:01:42] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5736431568250385890.kers
Total runtime 2 ms.
[2026-05-25 04:01:43] [INFO ] Implicit Places using invariants in 532 ms returned [66, 71, 91, 97, 118, 124, 144, 149, 171, 177]
[2026-05-25 04:01:43] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 546 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 7 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-15295241844178313829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3447739766885223178.kers'
[2026-05-25 04:01:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15295241844178313829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3447739766885223178.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 129 SingleSign rule and 51 generalized
[2026-05-25 04:01:43] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3447739766885223178.kers
Total runtime 3 ms.
[2026-05-25 04:01:43] [INFO ] Implicit Places using invariants in 497 ms returned [88, 94, 115, 121, 141, 146, 168, 174]
[2026-05-25 04:01:43] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 506 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 7 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-6397364497917569151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9733327494385777191.kers'
[2026-05-25 04:01:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6397364497917569151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9733327494385777191.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 129 SingleSign rule and 50 generalized
[2026-05-25 04:01:43] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9733327494385777191.kers
Total runtime 2 ms.
[2026-05-25 04:01:44] [INFO ] Implicit Places using invariants in 367 ms returned [112, 118, 138, 143, 165, 171]
[2026-05-25 04:01:44] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 370 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 6 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-10924224974576903833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14346581489115942306.kers'
[2026-05-25 04:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10924224974576903833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14346581489115942306.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 129 SingleSign rule and 49 generalized
[2026-05-25 04:01:44] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14346581489115942306.kers
Total runtime 5 ms.
[2026-05-25 04:01:44] [INFO ] Implicit Places using invariants in 354 ms returned [135, 140, 162, 168]
[2026-05-25 04:01:44] [INFO ] Actually due to overlaps returned [140, 135]
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 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 6 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-13323177005607239435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17926873748744656604.kers'
[2026-05-25 04:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13323177005607239435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17926873748744656604.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 128 SingleSign rule and 49 generalized
[2026-05-25 04:01:44] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17926873748744656604.kers
Total runtime 2 ms.
[2026-05-25 04:01:44] [INFO ] Implicit Places using invariants in 309 ms returned [159, 165]
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 : 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 9 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-14537889647111040218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6495166155280289546.kers'
[2026-05-25 04:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14537889647111040218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6495166155280289546.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 128 SingleSign rule and 48 generalized
[2026-05-25 04:01:44] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6495166155280289546.kers
Total runtime 2 ms.
[2026-05-25 04:01:45] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-25 04:01:45] [INFO ] Invariant cache hit.
[2026-05-25 04:01:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:01:47] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2221 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 7795 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5741 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3613 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 651947 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 651947 steps, saw 326043 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-25 04:01:50] [INFO ] Invariant cache hit.
[2026-05-25 04:01:50] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 91/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/194 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/202 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 213/415 variables, 202/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 37/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/420 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 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) 91/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/194 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/202 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/415 variables, 202/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 37/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/420 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1918ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 236 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 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-25 04:01:52] [INFO ] Invariant cache hit.
[2026-05-25 04:01:52] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-25 04:01:52] [INFO ] Invariant cache hit.
[2026-05-25 04:01:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:01:54] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2026-05-25 04:01:54] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:01:54] [INFO ] Invariant cache hit.
[2026-05-25 04:01:54] [INFO ] State equation strengthened by 37 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, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/420 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 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, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/420 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 212/487 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 11/498 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 499 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44803ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 44804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46940 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 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 12 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-10987098899363069749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11648255395789319769.kers'
[2026-05-25 04:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10987098899363069749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11648255395789319769.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 184 rows 176 cols 1066 entries
Finished phase 1 with 101 SingleSign rule and 46 generalized
[2026-05-25 04:02:39] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11648255395789319769.kers
Total runtime 12 ms.
[2026-05-25 04:02:39] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:02:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:02:39] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2026-05-25 04:02:39] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:02:39] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:02:39] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:02:39] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 303 ms.
Knowledge based reduction with 3 factoid took 37 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 56 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 72345 ms.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 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-644367429521945821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11334932017720279415.kers'
[2026-05-25 04:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-644367429521945821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11334932017720279415.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 272 cols 1008 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:02:39] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11334932017720279415.kers
Total runtime 3 ms.
[2026-05-25 04:02:39] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 04:02:39] [INFO ] Invariant cache hit.
[2026-05-25 04:02:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:02:41] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2026-05-25 04:02:41] [INFO ] Redundant transitions in 1 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 04:02:41] [INFO ] Invariant cache hit.
[2026-05-25 04:02:41] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 348 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60042ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61805 ms. Remains : 274/274 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 848 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 42 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 (5589 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3242 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567239 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567239 steps, saw 283705 distinct states, run finished after 3003 ms. (steps per millisecond=188 ) properties seen :0
[2026-05-25 04:03:44] [INFO ] Invariant cache hit.
[2026-05-25 04:03:44] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
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) 27/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/150 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/213 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/238 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/530 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/532 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/536 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/536 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 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) 27/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/150 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/213 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/238 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 252/490 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 40/530 variables, 31/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/532 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/532 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/536 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/536 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/536 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/536 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/536 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/536 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/536 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 2445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1247 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 262/262 transitions.
Graph (complete) has 808 edges and 274 vertex of which 273 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 273 transition count 261
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 1 with 39 rules applied. Total rules applied 41 place count 273 transition count 222
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 234 transition count 222
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 119 place count 234 transition count 222
Applied a total of 119 rules in 12 ms. Remains 234 /274 variables (removed 40) and now considering 222/262 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 234/274 places, 222/262 transitions.
RANDOM walk for 40000 steps (5129 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3370 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 609594 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 1
Probabilistic random walk after 609594 steps, saw 304982 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) 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-16495296410877715294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2372043882720862334.kers'
[2026-05-25 04:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16495296410877715294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2372043882720862334.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 130 SingleSign rule and 55 generalized
[2026-05-25 04:03:51] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2372043882720862334.kers
Total runtime 9 ms.
[2026-05-25 04:03:51] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 11/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/188 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/229 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/451 variables, 229/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 37/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/456 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/456 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 320 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 37/37 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) 11/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/188 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/229 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/451 variables, 229/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 37/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/456 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/456 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 234/234 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 429 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 4 ms. Remains 234 /234 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-25 04:03:53] [INFO ] Invariant cache hit.
[2026-05-25 04:03:54] [INFO ] Implicit Places using invariants in 1058 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 131, 151, 156, 178, 184, 191, 225, 231]
[2026-05-25 04:03:54] [INFO ] Actually due to overlaps returned [191, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1063 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 13 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-9194805678899545237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12236970391903772175.kers'
[2026-05-25 04:03:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9194805678899545237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12236970391903772175.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 133 SingleSign rule and 51 generalized
[2026-05-25 04:03:54] [INFO ] Computed 47 invariants in 3 ms
Computed 47 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12236970391903772175.kers
Total runtime 5 ms.
[2026-05-25 04:03:55] [INFO ] Implicit Places using invariants in 912 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 150, 155, 177, 183, 222, 228]
[2026-05-25 04:03:55] [INFO ] Actually due to overlaps returned [228, 222]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 915 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-16445791699729517093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4071957150384318235.kers'
[2026-05-25 04:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16445791699729517093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4071957150384318235.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 129 SingleSign rule and 54 generalized
[2026-05-25 04:03:55] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4071957150384318235.kers
Total runtime 10 ms.
[2026-05-25 04:03:56] [INFO ] Implicit Places using invariants in 718 ms returned [20, 26, 46, 51, 72, 77, 97, 103, 124, 130, 150, 155, 177, 183]
[2026-05-25 04:03:56] [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 14 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-16502369159871075575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3409108866700885564.kers'
[2026-05-25 04:03:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16502369159871075575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3409108866700885564.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1277 entries
Finished phase 1 with 129 SingleSign rule and 53 generalized
[2026-05-25 04:03:56] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3409108866700885564.kers
Total runtime 7 ms.
[2026-05-25 04:03:56] [INFO ] Implicit Places using invariants in 637 ms returned [43, 48, 69, 74, 94, 100, 121, 127, 147, 152, 174, 180]
[2026-05-25 04:03:56] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 639 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-12047835240327226366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7924191546495023250.kers'
[2026-05-25 04:03:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12047835240327226366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7924191546495023250.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 129 SingleSign rule and 52 generalized
[2026-05-25 04:03:56] [INFO ] Computed 41 invariants in 6 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7924191546495023250.kers
Total runtime 8 ms.
[2026-05-25 04:03:57] [INFO ] Implicit Places using invariants in 559 ms returned [66, 71, 91, 97, 118, 124, 144, 149, 171, 177]
[2026-05-25 04:03:57] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 562 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-3643006700557257778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15099923348418967601.kers'
[2026-05-25 04:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3643006700557257778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15099923348418967601.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 217 cols 1214 entries
Finished phase 1 with 129 SingleSign rule and 51 generalized
[2026-05-25 04:03:57] [INFO ] Computed 39 invariants in 5 ms
Computed 39 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15099923348418967601.kers
Total runtime 6 ms.
[2026-05-25 04:03:57] [INFO ] Implicit Places using invariants in 464 ms returned [88, 94, 115, 121, 141, 146, 168, 174]
[2026-05-25 04:03:57] [INFO ] Actually due to overlaps returned [94, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 466 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-10161886492474642275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7584186018323976272.kers'
[2026-05-25 04:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10161886492474642275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7584186018323976272.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 129 SingleSign rule and 50 generalized
[2026-05-25 04:03:57] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7584186018323976272.kers
Total runtime 7 ms.
[2026-05-25 04:03:58] [INFO ] Implicit Places using invariants in 406 ms returned [112, 118, 138, 143, 165, 171]
[2026-05-25 04:03:58] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 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 6 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-3724879683903754236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2986259550290940257.kers'
[2026-05-25 04:03:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3724879683903754236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2986259550290940257.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 211 cols 1171 entries
Finished phase 1 with 129 SingleSign rule and 49 generalized
[2026-05-25 04:03:58] [INFO ] Computed 35 invariants in 5 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2986259550290940257.kers
Total runtime 7 ms.
[2026-05-25 04:03:58] [INFO ] Implicit Places using invariants in 366 ms returned [135, 140, 162, 168]
[2026-05-25 04:03:58] [INFO ] Actually due to overlaps returned [140, 135]
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 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 10 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-6786916469917780940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9655312478825947596.kers'
[2026-05-25 04:03:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6786916469917780940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9655312478825947596.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 128 SingleSign rule and 49 generalized
[2026-05-25 04:03:58] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9655312478825947596.kers
Total runtime 7 ms.
[2026-05-25 04:03:58] [INFO ] Implicit Places using invariants in 338 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 340 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-3924460110088483663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4179765993051378386.kers'
[2026-05-25 04:03:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3924460110088483663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4179765993051378386.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 213 rows 205 cols 1148 entries
Finished phase 1 with 128 SingleSign rule and 48 generalized
[2026-05-25 04:03:58] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4179765993051378386.kers
Total runtime 7 ms.
[2026-05-25 04:03:59] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-25 04:03:59] [INFO ] Invariant cache hit.
[2026-05-25 04:03:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:04:01] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2127 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 7719 ms. Remains : 207/234 places, 213/222 transitions.
RANDOM walk for 40000 steps (5706 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3616 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 644228 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 1
Probabilistic random walk after 644228 steps, saw 322180 distinct states, run finished after 3003 ms. (steps per millisecond=214 ) properties seen :0
[2026-05-25 04:04:04] [INFO ] Invariant cache hit.
[2026-05-25 04:04:04] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 91/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/194 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/202 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 213/415 variables, 202/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 37/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/420 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 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) 91/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/194 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/202 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/415 variables, 202/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 37/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/420 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/420 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1803ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 265 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 4 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 4 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:04:06] [INFO ] Invariant cache hit.
[2026-05-25 04:04:06] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 04:04:06] [INFO ] Invariant cache hit.
[2026-05-25 04:04:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:04:08] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
[2026-05-25 04:04:08] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2026-05-25 04:04:08] [INFO ] Invariant cache hit.
[2026-05-25 04:04:08] [INFO ] State equation strengthened by 37 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, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/420 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 212 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 212 unsolved in 14725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 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, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/420 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 212/487 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 11/498 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 499 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44796ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 44798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46989 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 181 transition count 187
Iterating global reduction 0 with 8 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 17 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-13849358267825193646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6790501349685777524.kers'
[2026-05-25 04:04:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13849358267825193646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6790501349685777524.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 184 rows 176 cols 1066 entries
Finished phase 1 with 101 SingleSign rule and 46 generalized
[2026-05-25 04:04:53] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6790501349685777524.kers
Total runtime 9 ms.
[2026-05-25 04:04:53] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:04:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:04:53] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:04:53] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:04:53] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:04:53] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:04:53] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 288 ms.
Knowledge based reduction with 3 factoid took 58 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 83 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 72118 ms.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13876 reset in 111 ms.
Product exploration explored 100000 steps with 13789 reset in 98 ms.
Built C files in :
/tmp/ltsmin5690346348899679474
[2026-05-25 04:04:54] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-25 04:04:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:04:54] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-25 04:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:04:54] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-25 04:04:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:04:54] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5690346348899679474
Running compilation step : cd /tmp/ltsmin5690346348899679474;'/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 577 ms.
Running link step : cd /tmp/ltsmin5690346348899679474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5690346348899679474;'/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/stateBased11627900329330206682.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 274 /274 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-2267102463078637224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3983928021850117238.kers'
[2026-05-25 04:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2267102463078637224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3983928021850117238.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 272 cols 1008 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:05:09] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3983928021850117238.kers
Total runtime 3 ms.
[2026-05-25 04:05:09] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-25 04:05:09] [INFO ] Invariant cache hit.
[2026-05-25 04:05:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:05:10] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2026-05-25 04:05:10] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-25 04:05:10] [INFO ] Invariant cache hit.
[2026-05-25 04:05:10] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 1/536 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 350 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/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 9/9 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/535 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 258/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 261 unsolved
SMT process timed out in 60045ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61927 ms. Remains : 274/274 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin7692135041320710080
[2026-05-25 04:06:11] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-25 04:06:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:06:11] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-25 04:06:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:06:11] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-25 04:06:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:06:11] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7692135041320710080
Running compilation step : cd /tmp/ltsmin7692135041320710080;'/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 546 ms.
Running link step : cd /tmp/ltsmin7692135041320710080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7692135041320710080;'/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/stateBased9747177894473509942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:06:26] [INFO ] Flatten gal took : 14 ms
[2026-05-25 04:06:26] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:06:26] [INFO ] Time to serialize gal into /tmp/LTL8050803368836874298.gal : 2 ms
[2026-05-25 04:06:26] [INFO ] Time to serialize properties into /tmp/LTL5000640533576507793.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/LTL8050803368836874298.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16726209769376838099.hoa' '-atoms' '/tmp/LTL5000640533576507793.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/LTL5000640533576507793.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16726209769376838099.hoa
Detected timeout of ITS tools.
[2026-05-25 04:06:41] [INFO ] Flatten gal took : 10 ms
[2026-05-25 04:06:41] [INFO ] Flatten gal took : 9 ms
[2026-05-25 04:06:41] [INFO ] Time to serialize gal into /tmp/LTL4935756777152622814.gal : 2 ms
[2026-05-25 04:06:41] [INFO ] Time to serialize properties into /tmp/LTL5241444292828353536.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/LTL4935756777152622814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5241444292828353536.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p356<=p377)"))))
Formula 0 simplified : FG!"(p356<=p377)"
Detected timeout of ITS tools.
[2026-05-25 04:06:56] [INFO ] Flatten gal took : 10 ms
[2026-05-25 04:06:56] [INFO ] Applying decomposition
[2026-05-25 04:06:56] [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/graph16105652143045839805.txt' '-o' '/tmp/graph16105652143045839805.bin' '-w' '/tmp/graph16105652143045839805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16105652143045839805.bin' '-l' '-1' '-v' '-w' '/tmp/graph16105652143045839805.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:06:56] [INFO ] Decomposing Gal with order
[2026-05-25 04:06:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:06:56] [INFO ] Removed a total of 217 redundant transitions.
[2026-05-25 04:06:56] [INFO ] Flatten gal took : 21 ms
[2026-05-25 04:06:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2026-05-25 04:06:56] [INFO ] Time to serialize gal into /tmp/LTL14946088295235273268.gal : 3 ms
[2026-05-25 04:06:56] [INFO ] Time to serialize properties into /tmp/LTL11329810684312721594.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/LTL14946088295235273268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11329810684312721594.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 : !((G(F("(gu63.p356<=gu63.p377)"))))
Formula 0 simplified : FG!"(gu63.p356<=gu63.p377)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-03 finished in 406261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1||(p1 U p2)))&&X(F(p1))))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 16 ms. Remains 527 /528 variables (removed 1) 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-17361844959541027762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4479855558054010528.kers'
[2026-05-25 04:07:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17361844959541027762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4479855558054010528.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:07:11] [INFO ] Computed 49 invariants in 16 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4479855558054010528.kers
Total runtime 18 ms.
[2026-05-25 04:07:11] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-25 04:07:11] [INFO ] Invariant cache hit.
[2026-05-25 04:07:13] [INFO ] Implicit Places using invariants and state equation in 2121 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:07:13] [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 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]
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 30032 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 60090ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62457 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 (p1||(p1 U p2)))&&X(F(p1))))'
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p1), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 189 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 17 ms. Proved property starting from automaton with 5 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-05 finished in 63124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Graph (complete) has 896 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 525 transition count 373
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
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 285 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 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 467 place count 292 transition count 262
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 503 place count 274 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 504 place count 273 transition count 261
Applied a total of 504 rules in 31 ms. Remains 273 /528 variables (removed 255) and now considering 261/497 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7371539279996198457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9215432467868051328.kers'
[2026-05-25 04:08:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7371539279996198457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9215432467868051328.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 158 SingleSign rule and 66 generalized
[2026-05-25 04:08:14] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9215432467868051328.kers
Total runtime 2 ms.
[2026-05-25 04:08:14] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-25 04:08:14] [INFO ] Invariant cache hit.
[2026-05-25 04:08:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:08:16] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2026-05-25 04:08:16] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:08:16] [INFO ] Invariant cache hit.
[2026-05-25 04:08:16] [INFO ] State equation strengthened by 18 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, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/534 variables, 1/340 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 340 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: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 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, 18/339 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 257/596 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/534 variables, and 596 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 272/273 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 257/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61868 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 46 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-06
Product exploration explored 100000 steps with 13759 reset in 110 ms.
Product exploration explored 100000 steps with 13911 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 850 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 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5570 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3275 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3436 steps, run visited all 1 properties in 18 ms. (steps per millisecond=190 )
Probabilistic random walk after 3436 steps, saw 1743 distinct states, run finished after 21 ms. (steps per millisecond=163 ) properties seen :1
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Knowledge-based reduction took 238 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 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 11 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2026-05-25 04:09:16] [INFO ] Invariant cache hit.
[2026-05-25 04:09:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 04:09:17] [INFO ] Invariant cache hit.
[2026-05-25 04:09:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:09:18] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
[2026-05-25 04:09:18] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1720 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 850 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 52 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 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3250 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3436 steps, run visited all 1 properties in 20 ms. (steps per millisecond=171 )
Probabilistic random walk after 3436 steps, saw 1743 distinct states, run finished after 20 ms. (steps per millisecond=171 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 211 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13858 reset in 113 ms.
Product exploration explored 100000 steps with 13929 reset in 120 ms.
Built C files in :
/tmp/ltsmin10551998841150502782
[2026-05-25 04:09:19] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:09:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:19] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:09:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:19] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:09:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:19] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10551998841150502782
Running compilation step : cd /tmp/ltsmin10551998841150502782;'/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 561 ms.
Running link step : cd /tmp/ltsmin10551998841150502782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10551998841150502782;'/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/stateBased9582849919685926700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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 12 ms. Remains 273 /273 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2026-05-25 04:09:34] [INFO ] Invariant cache hit.
[2026-05-25 04:09:34] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-25 04:09:34] [INFO ] Invariant cache hit.
[2026-05-25 04:09:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:09:35] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2026-05-25 04:09:35] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1694 ms. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin6139551004285882832
[2026-05-25 04:09:35] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:09:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:35] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:09:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:35] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:09:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:09:35] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6139551004285882832
Running compilation step : cd /tmp/ltsmin6139551004285882832;'/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 541 ms.
Running link step : cd /tmp/ltsmin6139551004285882832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6139551004285882832;'/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/stateBased17151386462257556614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:09:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:09:51] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:09:51] [INFO ] Time to serialize gal into /tmp/LTL5582294369629973002.gal : 1 ms
[2026-05-25 04:09:51] [INFO ] Time to serialize properties into /tmp/LTL12210275531627912298.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/LTL5582294369629973002.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12195410578128359910.hoa' '-atoms' '/tmp/LTL12210275531627912298.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/LTL12210275531627912298.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12195410578128359910.hoa
Detected timeout of ITS tools.
[2026-05-25 04:10:06] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:10:06] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:10:06] [INFO ] Time to serialize gal into /tmp/LTL4367354504516952458.gal : 2 ms
[2026-05-25 04:10:06] [INFO ] Time to serialize properties into /tmp/LTL18380272773999296092.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/LTL4367354504516952458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18380272773999296092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p119<1)"))))
Formula 0 simplified : GF!"(p119<1)"
Detected timeout of ITS tools.
[2026-05-25 04:10:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:10:21] [INFO ] Applying decomposition
[2026-05-25 04:10:21] [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/graph11715227302314037222.txt' '-o' '/tmp/graph11715227302314037222.bin' '-w' '/tmp/graph11715227302314037222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11715227302314037222.bin' '-l' '-1' '-v' '-w' '/tmp/graph11715227302314037222.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:10:21] [INFO ] Decomposing Gal with order
[2026-05-25 04:10:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:10:21] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-25 04:10:21] [INFO ] Flatten gal took : 32 ms
[2026-05-25 04:10:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2026-05-25 04:10:21] [INFO ] Time to serialize gal into /tmp/LTL15031472228780831106.gal : 24 ms
[2026-05-25 04:10:21] [INFO ] Time to serialize properties into /tmp/LTL6608857362312888043.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/LTL15031472228780831106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6608857362312888043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i5.i0.u5.p119<1)"))))
Formula 0 simplified : GF!"(i5.i0.u5.p119<1)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-06 finished in 141879 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||X(G((F(p1) U (F(!p0)&&G(p2)))))) U 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.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 11 ms. Remains 527 /528 variables (removed 1) 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-14930443204969314062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4143621447155659453.kers'
[2026-05-25 04:10:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14930443204969314062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4143621447155659453.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:10:36] [INFO ] Computed 49 invariants in 18 ms
Computed 49 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4143621447155659453.kers
Total runtime 19 ms.
[2026-05-25 04:10:36] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-25 04:10:36] [INFO ] Invariant cache hit.
[2026-05-25 04:10:38] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:10:38] [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 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 30017 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 60069ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62399 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||X(G((F(p1) U (F(!p0)&&G(p2)))))) U p3))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-07
Product exploration explored 100000 steps with 3354 reset in 188 ms.
Product exploration explored 100000 steps with 3329 reset in 181 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.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 15 factoid took 61 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (1332 resets) in 158 ms. (251 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (1107 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1134 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1124 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1106 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1145 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1139 resets) in 237 ms. (168 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1141 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
[2026-05-25 04:11:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 331/336 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 105/447 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5/452 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 472/924 variables, 452/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/924 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 86/1010 variables, 67/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 8/1018 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1018 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 5/1023 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1023 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/1024 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/1024 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 580 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2199 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: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 331/336 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 6/342 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 105/447 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5/452 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 472/924 variables, 452/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/924 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/924 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/924 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 86/1010 variables, 67/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 7/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1010 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1010 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1010 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 7264ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1555 ms.
Support contains 5 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.
Iterating post reduction 1 with 118 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 2 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 2 with 46 rules applied. Total rules applied 284 place count 384 transition count 354
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 460 place count 296 transition count 266
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 496 place count 278 transition count 266
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 533 place count 278 transition count 229
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 570 place count 241 transition count 229
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 3 with 41 rules applied. Total rules applied 611 place count 241 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 612 place count 240 transition count 228
Applied a total of 612 rules in 37 ms. Remains 240 /527 variables (removed 287) and now considering 228/497 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 240/527 places, 228/497 transitions.
RANDOM walk for 40000 steps (4125 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2915 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2922 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2845 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2849 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2887 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2903 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2915 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2923 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 167952 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :2 out of 8
Probabilistic random walk after 167952 steps, saw 84461 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) 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-6918122389387097216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17287996675403466336.kers'
[2026-05-25 04:11:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6918122389387097216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17287996675403466336.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 239 cols 1434 entries
Finished phase 1 with 134 SingleSign rule and 57 generalized
[2026-05-25 04:11:52] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17287996675403466336.kers
Total runtime 2 ms.
[2026-05-25 04:11:52] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 228/465 variables, 237/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 35/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/468 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 324 constraints, problems are : Problem set: 0 solved, 6 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 228/465 variables, 237/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 35/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/468 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 342 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3911ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 578 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 228/228 transitions.
RANDOM walk for 40000 steps (4089 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2880 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2881 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2893 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2910 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2905 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2856 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 281648 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :4 out of 6
Probabilistic random walk after 281648 steps, saw 141505 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :4
[2026-05-25 04:12:00] [INFO ] Invariant cache hit.
[2026-05-25 04:12:00] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 228/465 variables, 237/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 35/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/468 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 64/237 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 228/465 variables, 237/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 35/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/468 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1614ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 336 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 228/228 transitions.
RANDOM walk for 40000 steps (4116 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2886 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2887 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 386722 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 2
Probabilistic random walk after 386722 steps, saw 194041 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-25 04:12:05] [INFO ] Invariant cache hit.
[2026-05-25 04:12:05] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 228/465 variables, 237/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 35/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/468 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 64/237 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 228/465 variables, 237/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 35/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/468 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 330 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1646ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 440 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-25 04:12:07] [INFO ] Invariant cache hit.
[2026-05-25 04:12:08] [INFO ] Implicit Places using invariants in 1091 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 135, 155, 160, 182, 188, 195, 231, 237]
[2026-05-25 04:12:08] [INFO ] Actually due to overlaps returned [195, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 228/228 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 227
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 227
Applied a total of 2 rules in 16 ms. Remains 237 /238 variables (removed 1) and now considering 227/228 (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-933493606824470558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4150257201916524753.kers'
[2026-05-25 04:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-933493606824470558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4150257201916524753.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 227 rows 236 cols 1381 entries
Finished phase 1 with 136 SingleSign rule and 54 generalized
[2026-05-25 04:12:08] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4150257201916524753.kers
Total runtime 8 ms.
[2026-05-25 04:12:09] [INFO ] Implicit Places using invariants in 929 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 154, 159, 181, 187, 228, 234]
[2026-05-25 04:12:09] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 931 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 227/228 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 226
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 226
Applied a total of 2 rules in 17 ms. Remains 234 /235 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-1903913889910926007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-211332938471951156.kers'
[2026-05-25 04:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1903913889910926007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-211332938471951156.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 226 rows 233 cols 1336 entries
Finished phase 1 with 136 SingleSign rule and 53 generalized
[2026-05-25 04:12:09] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-211332938471951156.kers
Total runtime 8 ms.
[2026-05-25 04:12:10] [INFO ] Implicit Places using invariants in 824 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 154, 159, 181, 187]
[2026-05-25 04:12:10] [INFO ] Actually due to overlaps returned [28, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 826 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 226/228 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 225
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 225
Applied a total of 2 rules in 13 ms. Remains 231 /232 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-6998689979154451779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-543216946803397267.kers'
[2026-05-25 04:12:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6998689979154451779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-543216946803397267.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 225 rows 230 cols 1297 entries
Finished phase 1 with 136 SingleSign rule and 52 generalized
[2026-05-25 04:12:10] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-543216946803397267.kers
Total runtime 5 ms.
[2026-05-25 04:12:11] [INFO ] Implicit Places using invariants in 650 ms returned [47, 52, 73, 78, 98, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:12:11] [INFO ] Actually due to overlaps returned [52, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 652 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 225/228 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 224
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 224
Applied a total of 2 rules in 15 ms. Remains 228 /229 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-1998669953411043434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1238504713438498521.kers'
[2026-05-25 04:12:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1998669953411043434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1238504713438498521.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 224 rows 227 cols 1263 entries
Finished phase 1 with 136 SingleSign rule and 51 generalized
[2026-05-25 04:12:11] [INFO ] Computed 41 invariants in 7 ms
Computed 41 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1238504713438498521.kers
Total runtime 9 ms.
[2026-05-25 04:12:11] [INFO ] Implicit Places using invariants in 592 ms returned [70, 75, 95, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:12:11] [INFO ] Actually due to overlaps returned [75, 70]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 596 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 224/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 4175 ms. Remains : 226/240 places, 224/228 transitions.
RANDOM walk for 40000 steps (4470 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3091 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3074 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 412639 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 412639 steps, saw 206471 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) 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-15521736601889136073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10612422432485000147.kers'
[2026-05-25 04:12:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15521736601889136073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10612422432485000147.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 224 rows 225 cols 1234 entries
Finished phase 1 with 136 SingleSign rule and 51 generalized
[2026-05-25 04:12:14] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10612422432485000147.kers
Total runtime 3 ms.
[2026-05-25 04:12:14] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 80/215 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/223 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 224/447 variables, 223/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/450 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 226/226 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/135 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 80/215 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/223 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 224/447 variables, 223/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 35/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/450 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/450 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 226/226 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1056ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 224/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-05-25 04:12:15] [INFO ] Invariant cache hit.
[2026-05-25 04:12:16] [INFO ] Implicit Places using invariants in 475 ms returned [93, 100, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:12:16] [INFO ] Actually due to overlaps returned [100, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 477 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/226 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 224 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 223 transition count 223
Applied a total of 2 rules in 14 ms. Remains 223 /224 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-15136415212741850278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3245790798833308531.kers'
[2026-05-25 04:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15136415212741850278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3245790798833308531.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 223 rows 222 cols 1210 entries
Finished phase 1 with 135 SingleSign rule and 51 generalized
[2026-05-25 04:12:16] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3245790798833308531.kers
Total runtime 7 ms.
[2026-05-25 04:12:16] [INFO ] Implicit Places using invariants in 443 ms returned [118, 123, 143, 148, 170, 176]
[2026-05-25 04:12:16] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 445 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/226 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 221 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 220 transition count 222
Applied a total of 2 rules in 13 ms. Remains 220 /221 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-15948980484760007756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6733169275102861203.kers'
[2026-05-25 04:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15948980484760007756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6733169275102861203.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 222 rows 219 cols 1191 entries
Finished phase 1 with 135 SingleSign rule and 50 generalized
[2026-05-25 04:12:16] [INFO ] Computed 35 invariants in 5 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6733169275102861203.kers
Total runtime 7 ms.
[2026-05-25 04:12:17] [INFO ] Implicit Places using invariants in 439 ms returned [140, 145, 167, 173]
[2026-05-25 04:12:17] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 441 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/226 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 218 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 217 transition count 221
Applied a total of 2 rules in 14 ms. Remains 217 /218 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-2310363656344416679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8065865238471476673.kers'
[2026-05-25 04:12:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2310363656344416679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8065865238471476673.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 221 rows 216 cols 1177 entries
Finished phase 1 with 132 SingleSign rule and 52 generalized
[2026-05-25 04:12:17] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8065865238471476673.kers
Total runtime 6 ms.
[2026-05-25 04:12:17] [INFO ] Implicit Places using invariants in 362 ms returned [164, 170]
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 4 : 215/226 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 215 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 214 transition count 220
Applied a total of 2 rules in 13 ms. Remains 214 /215 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-2827635237961731886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13431235801066218471.kers'
[2026-05-25 04:12:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2827635237961731886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13431235801066218471.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 220 rows 213 cols 1168 entries
Finished phase 1 with 132 SingleSign rule and 51 generalized
[2026-05-25 04:12:17] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13431235801066218471.kers
Total runtime 3 ms.
[2026-05-25 04:12:18] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-05-25 04:12:18] [INFO ] Invariant cache hit.
[2026-05-25 04:12:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:12:19] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/226 places, 220/224 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 3826 ms. Remains : 214/226 places, 220/224 transitions.
RANDOM walk for 40000 steps (4439 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3067 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3098 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 424609 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 2
Probabilistic random walk after 424609 steps, saw 212465 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-25 04:12:22] [INFO ] Invariant cache hit.
[2026-05-25 04:12:22] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/203 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/211 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 220/431 variables, 211/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 35/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/434 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/434 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/137 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 66/203 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/211 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 220/431 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 35/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/434 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/434 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/434 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1539ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 323 ms.
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 214/214 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 04:12:24] [INFO ] Invariant cache hit.
[2026-05-25 04:12:25] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 04:12:25] [INFO ] Invariant cache hit.
[2026-05-25 04:12:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:12:26] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2026-05-25 04:12:26] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2026-05-25 04:12:26] [INFO ] Invariant cache hit.
[2026-05-25 04:12:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 214/434 variables, and 103 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/214 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 72/103 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/434 variables, and 263 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/214 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/219 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62072 ms. Remains : 214/214 places, 220/220 transitions.
Knowledge based reduction with 15 factoid took 136 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3109422564102386422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14156865102476240855.kers'
[2026-05-25 04:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3109422564102386422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14156865102476240855.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:13:27] [INFO ] Computed 49 invariants in 16 ms
Computed 49 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14156865102476240855.kers
Total runtime 17 ms.
[2026-05-25 04:13:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:13:27] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 27 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Real]Absence check using state equation in 2591 ms returned sat
[2026-05-25 04:13:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:30] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 26 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Nat]Absence check using state equation in 2085 ms returned sat
[2026-05-25 04:13:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 991 ms
[2026-05-25 04:13:33] [INFO ] Computed and/alt/rep : 496/958/496 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 04:13:39] [INFO ] Added : 204 causal constraints over 41 iterations in 5852 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 119697 ms.
Stuttering acceptance computed with spot in 189 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 497/497 transitions.
Graph (complete) has 895 edges and 527 vertex of which 526 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 525 transition count 377
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 407 transition count 377
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 237 place count 407 transition count 355
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 281 place count 385 transition count 355
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 457 place count 297 transition count 267
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 493 place count 279 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 494 place count 278 transition count 266
Applied a total of 494 rules in 27 ms. Remains 278 /527 variables (removed 249) and now considering 266/497 (removed 231) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8567620575732003904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-603809259877380970.kers'
[2026-05-25 04:13:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8567620575732003904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-603809259877380970.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 266 rows 277 cols 1017 entries
Finished phase 1 with 163 SingleSign rule and 66 generalized
[2026-05-25 04:13:39] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-603809259877380970.kers
Total runtime 2 ms.
[2026-05-25 04:13:39] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-25 04:13:39] [INFO ] Invariant cache hit.
[2026-05-25 04:13:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:13:41] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2026-05-25 04:13:41] [INFO ] Redundant transitions in 0 ms returned []
Running 265 sub problems to find dead transitions.
[2026-05-25 04:13:41] [INFO ] Invariant cache hit.
[2026-05-25 04:13:41] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 1/278 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 266/544 variables, 278/327 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 18/345 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/544 variables, and 357 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 278/278 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/278 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 266/544 variables, 278/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 18/357 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 265/622 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 624 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 278/278 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 278/527 places, 266/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61836 ms. Remains : 278/527 places, 266/497 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 853 edges and 278 vertex of which 277 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 19 factoid took 74 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (4365 resets) in 149 ms. (266 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (2792 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2792 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2832 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2784 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2799 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2806 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2825 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2833 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
[2026-05-25 04:14:41] [INFO ] Invariant cache hit.
[2026-05-25 04:14:41] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 80/237 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/244 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 256/500 variables, 244/290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 38/538 variables, 29/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/540 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 4/544 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/544 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/544 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 0/544 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 345 constraints, problems are : Problem set: 0 solved, 8 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 278/278 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 80/237 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 7/244 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 256/500 variables, 244/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/500 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 38/538 variables, 29/341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 9/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 2/540 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/540 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 4/544 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/544 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/544 variables, 8/374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 374 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 278/278 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 19/19 constraints]
After SMT, in 5759ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 266/266 transitions.
Graph (complete) has 813 edges and 278 vertex of which 277 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 277 transition count 265
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 277 transition count 228
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 240 transition count 228
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 117 place count 240 transition count 228
Applied a total of 117 rules in 14 ms. Remains 240 /278 variables (removed 38) and now considering 228/266 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 240/278 places, 228/266 transitions.
RANDOM walk for 40000 steps (4074 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2859 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2908 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2911 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2908 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2904 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2874 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2857 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2875 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 271080 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :2 out of 8
Probabilistic random walk after 271080 steps, saw 135605 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) 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-4079870353529705852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12697440802962994586.kers'
[2026-05-25 04:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4079870353529705852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12697440802962994586.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 239 cols 1434 entries
Finished phase 1 with 134 SingleSign rule and 57 generalized
[2026-05-25 04:14:50] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12697440802962994586.kers
Total runtime 2 ms.
[2026-05-25 04:14:50] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 228/465 variables, 237/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 35/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/468 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 324 constraints, problems are : Problem set: 0 solved, 6 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 228/465 variables, 237/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 35/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/468 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 345 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4687ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3317 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 228/228 transitions.
RANDOM walk for 40000 steps (4079 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2879 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2857 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2906 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2958 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2874 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2935 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 257960 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 6
Probabilistic random walk after 257960 steps, saw 129035 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2026-05-25 04:15:01] [INFO ] Invariant cache hit.
[2026-05-25 04:15:01] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 228/465 variables, 237/285 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 35/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/468 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 324 constraints, problems are : Problem set: 0 solved, 6 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 64/237 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 228/465 variables, 237/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 35/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/468 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/468 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 345 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 240/240 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4780ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3386 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 240/240 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 228/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-25 04:15:10] [INFO ] Invariant cache hit.
[2026-05-25 04:15:11] [INFO ] Implicit Places using invariants in 1077 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 135, 155, 160, 182, 188, 195, 231, 237]
[2026-05-25 04:15:11] [INFO ] Actually due to overlaps returned [195, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/240 places, 228/228 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 227
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 227
Applied a total of 2 rules in 14 ms. Remains 237 /238 variables (removed 1) and now considering 227/228 (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-3162320575714086954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9238135244306676186.kers'
[2026-05-25 04:15:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3162320575714086954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9238135244306676186.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 227 rows 236 cols 1381 entries
Finished phase 1 with 136 SingleSign rule and 54 generalized
[2026-05-25 04:15:11] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9238135244306676186.kers
Total runtime 10 ms.
[2026-05-25 04:15:12] [INFO ] Implicit Places using invariants in 958 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 154, 159, 181, 187, 228, 234]
[2026-05-25 04:15:12] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 960 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/240 places, 227/228 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 226
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 226
Applied a total of 2 rules in 15 ms. Remains 234 /235 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-7506563005513877318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12158449020307087604.kers'
[2026-05-25 04:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7506563005513877318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12158449020307087604.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 226 rows 233 cols 1336 entries
Finished phase 1 with 136 SingleSign rule and 53 generalized
[2026-05-25 04:15:12] [INFO ] Computed 45 invariants in 6 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12158449020307087604.kers
Total runtime 8 ms.
[2026-05-25 04:15:12] [INFO ] Implicit Places using invariants in 849 ms returned [22, 28, 50, 55, 76, 81, 101, 108, 129, 134, 154, 159, 181, 187]
[2026-05-25 04:15:12] [INFO ] Actually due to overlaps returned [28, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 851 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 232/240 places, 226/228 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 225
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 225
Applied a total of 2 rules in 13 ms. Remains 231 /232 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-14717005402652171940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10201047690521038705.kers'
[2026-05-25 04:15:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14717005402652171940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10201047690521038705.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 225 rows 230 cols 1297 entries
Finished phase 1 with 136 SingleSign rule and 52 generalized
[2026-05-25 04:15:12] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10201047690521038705.kers
Total runtime 4 ms.
[2026-05-25 04:15:13] [INFO ] Implicit Places using invariants in 659 ms returned [47, 52, 73, 78, 98, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:15:13] [INFO ] Actually due to overlaps returned [52, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 661 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 229/240 places, 225/228 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 224
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 224
Applied a total of 2 rules in 14 ms. Remains 228 /229 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-7234308638512485036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13002973547840690580.kers'
[2026-05-25 04:15:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7234308638512485036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13002973547840690580.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 224 rows 227 cols 1263 entries
Finished phase 1 with 136 SingleSign rule and 51 generalized
[2026-05-25 04:15:13] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13002973547840690580.kers
Total runtime 4 ms.
[2026-05-25 04:15:14] [INFO ] Implicit Places using invariants in 564 ms returned [70, 75, 95, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:15:14] [INFO ] Actually due to overlaps returned [75, 70]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 568 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 226/240 places, 224/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 4187 ms. Remains : 226/240 places, 224/228 transitions.
RANDOM walk for 40000 steps (4463 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3059 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3122 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3077 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3057 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3071 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3088 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 261069 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 6
Probabilistic random walk after 261069 steps, saw 130562 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) 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-16426480979501553923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11037444081918142209.kers'
[2026-05-25 04:15:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16426480979501553923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11037444081918142209.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 224 rows 225 cols 1234 entries
Finished phase 1 with 136 SingleSign rule and 51 generalized
[2026-05-25 04:15:17] [INFO ] Computed 39 invariants in 1 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11037444081918142209.kers
Total runtime 2 ms.
[2026-05-25 04:15:17] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 80/215 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/223 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 224/447 variables, 223/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 35/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/450 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 300 constraints, problems are : Problem set: 0 solved, 6 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 226/226 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/135 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 80/215 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 8/223 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 224/447 variables, 223/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 35/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/447 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/450 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/450 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/450 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/450 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 323 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 226/226 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4858ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 995 ms.
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-05-25 04:15:23] [INFO ] Invariant cache hit.
[2026-05-25 04:15:23] [INFO ] Implicit Places using invariants in 487 ms returned [93, 100, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:15:23] [INFO ] Actually due to overlaps returned [100, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 489 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/226 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 224 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 223 transition count 223
Applied a total of 2 rules in 13 ms. Remains 223 /224 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-3683343362098582398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17519457280380053169.kers'
[2026-05-25 04:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3683343362098582398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17519457280380053169.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 223 rows 222 cols 1210 entries
Finished phase 1 with 135 SingleSign rule and 51 generalized
[2026-05-25 04:15:23] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17519457280380053169.kers
Total runtime 7 ms.
[2026-05-25 04:15:24] [INFO ] Implicit Places using invariants in 438 ms returned [118, 123, 143, 148, 170, 176]
[2026-05-25 04:15:24] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/226 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 221 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 220 transition count 222
Applied a total of 2 rules in 12 ms. Remains 220 /221 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-17468518121239884331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7246268914187446363.kers'
[2026-05-25 04:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17468518121239884331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7246268914187446363.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 222 rows 219 cols 1191 entries
Finished phase 1 with 135 SingleSign rule and 50 generalized
[2026-05-25 04:15:24] [INFO ] Computed 35 invariants in 5 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7246268914187446363.kers
Total runtime 8 ms.
[2026-05-25 04:15:24] [INFO ] Implicit Places using invariants in 431 ms returned [140, 145, 167, 173]
[2026-05-25 04:15:24] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/226 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 218 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 217 transition count 221
Applied a total of 2 rules in 12 ms. Remains 217 /218 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-4512193928717450560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8091591963212551931.kers'
[2026-05-25 04:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4512193928717450560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8091591963212551931.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 216 cols 1177 entries
Finished phase 1 with 132 SingleSign rule and 52 generalized
[2026-05-25 04:15:24] [INFO ] Computed 33 invariants in 2 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8091591963212551931.kers
Total runtime 4 ms.
[2026-05-25 04:15:24] [INFO ] Implicit Places using invariants in 351 ms returned [164, 170]
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 4 : 215/226 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 215 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 214 transition count 220
Applied a total of 2 rules in 11 ms. Remains 214 /215 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-9279654906509411926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-222678173327527623.kers'
[2026-05-25 04:15:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9279654906509411926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-222678173327527623.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 220 rows 213 cols 1168 entries
Finished phase 1 with 132 SingleSign rule and 51 generalized
[2026-05-25 04:15:25] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-222678173327527623.kers
Total runtime 3 ms.
[2026-05-25 04:15:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-25 04:15:25] [INFO ] Invariant cache hit.
[2026-05-25 04:15:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:15:27] [INFO ] Implicit Places using invariants and state equation in 1912 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 214/226 places, 220/224 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 4010 ms. Remains : 214/226 places, 220/224 transitions.
RANDOM walk for 40000 steps (4498 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3148 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3089 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3080 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3051 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3110 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3126 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 276213 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 6
Probabilistic random walk after 276213 steps, saw 138136 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-25 04:15:30] [INFO ] Invariant cache hit.
[2026-05-25 04:15:30] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 130/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/203 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/211 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 220/431 variables, 211/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 35/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/434 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/434 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 280 constraints, problems are : Problem set: 0 solved, 6 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 130/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/137 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 66/203 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 8/211 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 220/431 variables, 211/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 35/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/431 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 3/434 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/434 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/434 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/434 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/434 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/434 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 305 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 214/214 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5417ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3197 ms.
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 214/214 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 04:15:39] [INFO ] Invariant cache hit.
[2026-05-25 04:15:39] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-25 04:15:39] [INFO ] Invariant cache hit.
[2026-05-25 04:15:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:15:41] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
[2026-05-25 04:15:41] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2026-05-25 04:15:41] [INFO ] Invariant cache hit.
[2026-05-25 04:15:41] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 214/434 variables, and 88 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/214 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/214 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 57/88 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 17/185 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/434 variables, and 228 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/214 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/219 constraints, Known Traps: 197/197 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62309 ms. Remains : 214/214 places, 220/220 transitions.
Knowledge based reduction with 19 factoid took 87 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8415255547290746082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14803473924891365639.kers'
[2026-05-25 04:16:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8415255547290746082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14803473924891365639.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 266 rows 277 cols 1017 entries
Finished phase 1 with 163 SingleSign rule and 66 generalized
[2026-05-25 04:16:41] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14803473924891365639.kers
Total runtime 2 ms.
[2026-05-25 04:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-25 04:16:41] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 18 ms returned sat
[2026-05-25 04:16:42] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2026-05-25 04:16:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:16:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:16:43] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 17 ms returned sat
[2026-05-25 04:16:43] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2026-05-25 04:16:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:16:43] [INFO ] [Nat]Added 18 Read/Feed constraints in 77 ms returned sat
[2026-05-25 04:16:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 646 ms
[2026-05-25 04:16:44] [INFO ] Computed and/alt/rep : 265/978/265 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 04:16:48] [INFO ] Added : 191 causal constraints over 39 iterations in 3905 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 127194 ms.
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), (OR (NOT p2) p0), (NOT p1), (OR (NOT p2) p0), (NOT p2), p0]
Stuttering criterion allowed to conclude after 536 steps with 58 reset in 1 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-07 finished in 372416 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(F(p0)))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 14 ms. Remains 527 /528 variables (removed 1) 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-8963442396611023490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7369547953435685152.kers'
[2026-05-25 04:16:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8963442396611023490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7369547953435685152.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:48] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7369547953435685152.kers
Total runtime 18 ms.
[2026-05-25 04:16:49] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-25 04:16:49] [INFO ] Invariant cache hit.
[2026-05-25 04:16:50] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:16:51] [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 30017 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 30024 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 60081ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62289 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(F(p0)))'
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 173 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.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 22 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-010-LTLCardinality-08 finished in 62761 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 896 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 (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 120 rules applied. Total rules applied 121 place count 526 transition count 376
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 406 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 405 transition count 375
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 243 place count 405 transition count 355
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 283 place count 385 transition count 355
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 471 place count 291 transition count 261
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 507 place count 273 transition count 261
Applied a total of 507 rules in 24 ms. Remains 273 /528 variables (removed 255) and now considering 261/497 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-976392300279596396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-660354451503892382.kers'
[2026-05-25 04:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-976392300279596396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-660354451503892382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 273 cols 1017 entries
Finished phase 1 with 158 SingleSign rule and 66 generalized
[2026-05-25 04:17:51] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-660354451503892382.kers
Total runtime 2 ms.
[2026-05-25 04:17:51] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 04:17:51] [INFO ] Invariant cache hit.
[2026-05-25 04:17:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-25 04:17:53] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2026-05-25 04:17:53] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:17:53] [INFO ] Invariant cache hit.
[2026-05-25 04:17:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 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 342 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 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, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 260/602 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 610 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61715 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' '!(G(p0))'
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-09
Product exploration explored 100000 steps with 12106 reset in 117 ms.
Product exploration explored 100000 steps with 12174 reset in 124 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 858 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 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 66 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 (4890 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3020 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 545751 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 545751 steps, saw 272967 distinct states, run finished after 3002 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-25 04:18:56] [INFO ] Invariant cache hit.
[2026-05-25 04:18:56] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/197 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/239 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 252/493 variables, 241/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 18/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 35/528 variables, 27/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, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/534 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/534 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/534 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 171/197 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/239 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/241 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 252/493 variables, 241/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 18/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 35/528 variables, 27/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, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/534 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 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 818 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 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 235 transition count 223
Applied a total of 116 rules in 14 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (4531 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3078 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 604820 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 604820 steps, saw 302591 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) 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-3814760408721549109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9487066046559589585.kers'
[2026-05-25 04:19:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3814760408721549109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9487066046559589585.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 223 rows 235 cols 1430 entries
Finished phase 1 with 130 SingleSign rule and 56 generalized
[2026-05-25 04:19:00] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9487066046559589585.kers
Total runtime 8 ms.
[2026-05-25 04:19:00] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/232 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/234 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/457 variables, 234/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 40/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/458 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/458 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 40/40 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 83/232 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 223/457 variables, 234/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 40/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/458 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/458 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 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 24 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:19:02] [INFO ] Invariant cache hit.
[2026-05-25 04:19:03] [INFO ] Implicit Places using invariants in 1088 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2026-05-25 04:19:03] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1090 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 16 ms. Remains 232 /233 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-15798790881178853355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11088944423222729958.kers'
[2026-05-25 04:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15798790881178853355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11088944423222729958.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 222 rows 232 cols 1377 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 04:19:03] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11088944423222729958.kers
Total runtime 8 ms.
[2026-05-25 04:19:04] [INFO ] Implicit Places using invariants in 934 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 151, 156, 178, 184, 223, 229]
[2026-05-25 04:19:04] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 937 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 13 ms. Remains 229 /230 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-14576208855927268810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-385695506827112718.kers'
[2026-05-25 04:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14576208855927268810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-385695506827112718.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 221 rows 229 cols 1333 entries
Finished phase 1 with 132 SingleSign rule and 52 generalized
[2026-05-25 04:19:04] [INFO ] Computed 45 invariants in 6 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-385695506827112718.kers
Total runtime 7 ms.
[2026-05-25 04:19:04] [INFO ] Implicit Places using invariants in 752 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:19:04] [INFO ] Actually due to overlaps returned [27, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 753 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 13 ms. Remains 226 /227 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-9993192321596592764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2924135565000458109.kers'
[2026-05-25 04:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9993192321596592764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2924135565000458109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 226 cols 1294 entries
Finished phase 1 with 130 SingleSign rule and 53 generalized
[2026-05-25 04:19:04] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2924135565000458109.kers
Total runtime 8 ms.
[2026-05-25 04:19:05] [INFO ] Implicit Places using invariants in 652 ms returned [45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:19:05] [INFO ] Actually due to overlaps returned [50, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 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 224 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 223 transition count 219
Applied a total of 2 rules in 14 ms. Remains 223 /224 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-15113058243396998109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5746484170259989014.kers'
[2026-05-25 04:19:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15113058243396998109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5746484170259989014.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 219 rows 223 cols 1260 entries
Finished phase 1 with 129 SingleSign rule and 53 generalized
[2026-05-25 04:19:05] [INFO ] Computed 41 invariants in 6 ms
Computed 41 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5746484170259989014.kers
Total runtime 7 ms.
[2026-05-25 04:19:06] [INFO ] Implicit Places using invariants in 583 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 172, 178]
[2026-05-25 04:19:06] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 586 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 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 221 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 220 transition count 218
Applied a total of 2 rules in 12 ms. Remains 220 /221 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-13949587213934710674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11785788022529948704.kers'
[2026-05-25 04:19:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13949587213934710674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11785788022529948704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1231 entries
Finished phase 1 with 128 SingleSign rule and 53 generalized
[2026-05-25 04:19:06] [INFO ] Computed 39 invariants in 5 ms
Computed 39 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11785788022529948704.kers
Total runtime 6 ms.
[2026-05-25 04:19:06] [INFO ] Implicit Places using invariants in 486 ms returned [90, 96, 117, 122, 142, 147, 169, 175]
[2026-05-25 04:19:06] [INFO ] Actually due to overlaps returned [96, 90]
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 : 218/235 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 218 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 217 transition count 217
Applied a total of 2 rules in 13 ms. Remains 217 /218 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-2395361969094719619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6382702036660641391.kers'
[2026-05-25 04:19:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2395361969094719619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6382702036660641391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1207 entries
Finished phase 1 with 127 SingleSign rule and 53 generalized
[2026-05-25 04:19:06] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6382702036660641391.kers
Total runtime 6 ms.
[2026-05-25 04:19:07] [INFO ] Implicit Places using invariants in 430 ms returned [114, 119, 139, 144, 166, 172]
[2026-05-25 04:19:07] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 432 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 215/235 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 215 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 214 transition count 216
Applied a total of 2 rules in 11 ms. Remains 214 /215 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-11839355739847089173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12278082732245824130.kers'
[2026-05-25 04:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11839355739847089173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12278082732245824130.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 216 rows 214 cols 1188 entries
Finished phase 1 with 126 SingleSign rule and 53 generalized
[2026-05-25 04:19:07] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12278082732245824130.kers
Total runtime 7 ms.
[2026-05-25 04:19:07] [INFO ] Implicit Places using invariants in 404 ms returned [136, 141, 163, 169]
[2026-05-25 04:19:07] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 212/235 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 212 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 211 transition count 215
Applied a total of 2 rules in 9 ms. Remains 211 /212 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-7138165193939348261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8563291829719762437.kers'
[2026-05-25 04:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7138165193939348261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8563291829719762437.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 211 cols 1174 entries
Finished phase 1 with 125 SingleSign rule and 53 generalized
[2026-05-25 04:19:07] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8563291829719762437.kers
Total runtime 2 ms.
[2026-05-25 04:19:07] [INFO ] Implicit Places using invariants in 345 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 356 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 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 209 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 208 transition count 214
Applied a total of 2 rules in 7 ms. Remains 208 /209 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-2848780579311075837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9944189673446240959.kers'
[2026-05-25 04:19:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2848780579311075837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9944189673446240959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1165 entries
Finished phase 1 with 125 SingleSign rule and 52 generalized
[2026-05-25 04:19:07] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9944189673446240959.kers
Total runtime 7 ms.
[2026-05-25 04:19:08] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 04:19:08] [INFO ] Invariant cache hit.
[2026-05-25 04:19:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 04:19:10] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8244 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5063 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3338 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 647524 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 1
Probabilistic random walk after 647524 steps, saw 323825 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
[2026-05-25 04:19:13] [INFO ] Invariant cache hit.
[2026-05-25 04:19:13] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/157 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/207 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/421 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 42/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/422 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/157 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/207 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/421 variables, 207/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 42/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/422 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:19:14] [INFO ] Invariant cache hit.
[2026-05-25 04:19:14] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 04:19:14] [INFO ] Invariant cache hit.
[2026-05-25 04:19:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 04:19:16] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2408 ms to find 0 implicit places.
[2026-05-25 04:19:17] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-25 04:19:17] [INFO ] Invariant cache hit.
[2026-05-25 04:19:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 214/422 variables, 208/302 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 344 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 63/63 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/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 213 unsolved
SMT process timed out in 60131ms, After SMT, problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62556 ms. Remains : 208/208 places, 214/214 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 208 transition count 196
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 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 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 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 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 60 place count 178 transition count 184
Applied a total of 60 rules in 12 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (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-7676418743489295297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1694052699696671086.kers'
[2026-05-25 04:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7676418743489295297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1694052699696671086.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 184 rows 178 cols 1077 entries
Finished phase 1 with 102 SingleSign rule and 45 generalized
[2026-05-25 04:20:17] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1694052699696671086.kers
Total runtime 7 ms.
[2026-05-25 04:20:17] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:20:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:20:17] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-25 04:20:17] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:20:17] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
TRAPS : Iteration 1
[2026-05-25 04:20:17] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:20:17] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
Knowledge based reduction with 3 factoid took 60 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 46 ms :[true, (NOT p0)]
Knowledge-based reduction took 83984 ms.
Stuttering acceptance computed with spot in 65 ms :[true, (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 12 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-6117376457273857609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1856621571272607096.kers'
[2026-05-25 04:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6117376457273857609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1856621571272607096.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 261 rows 273 cols 1017 entries
Finished phase 1 with 158 SingleSign rule and 66 generalized
[2026-05-25 04:20:17] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1856621571272607096.kers
Total runtime 8 ms.
[2026-05-25 04:20:17] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 04:20:17] [INFO ] Invariant cache hit.
[2026-05-25 04:20:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-25 04:20:19] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2026-05-25 04:20:19] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:20:19] [INFO ] Invariant cache hit.
[2026-05-25 04:20:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 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 342 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 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, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 260/602 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 610 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: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61668 ms. Remains : 273/273 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 858 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 51 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 (4839 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3022 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549838 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549838 steps, saw 275010 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2026-05-25 04:21:22] [INFO ] Invariant cache hit.
[2026-05-25 04:21:22] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/197 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/239 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 252/493 variables, 241/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 18/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 35/528 variables, 27/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, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/530 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/534 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/534 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/534 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 171/197 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/239 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/241 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 252/493 variables, 241/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/493 variables, 18/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 35/528 variables, 27/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, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/530 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/534 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/534 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/534 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 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 818 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 37 times.
Iterating global reduction 1 with 37 rules applied. Total rules applied 39 place count 272 transition count 223
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 235 transition count 223
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 2 with 40 rules applied. Total rules applied 116 place count 235 transition count 223
Applied a total of 116 rules in 13 ms. Remains 235 /273 variables (removed 38) and now considering 223/261 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 235/273 places, 223/261 transitions.
RANDOM walk for 40000 steps (4566 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3142 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 596613 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 596613 steps, saw 298501 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) 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-10751669979419710714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6393193179063883721.kers'
[2026-05-25 04:21:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10751669979419710714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6393193179063883721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 235 cols 1430 entries
Finished phase 1 with 130 SingleSign rule and 56 generalized
[2026-05-25 04:21:26] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6393193179063883721.kers
Total runtime 2 ms.
[2026-05-25 04:21:26] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 83/232 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/234 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/457 variables, 234/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 40/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/458 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/458 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 40/40 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/149 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 83/232 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 223/457 variables, 234/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 40/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/458 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/458 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:21:28] [INFO ] Invariant cache hit.
[2026-05-25 04:21:29] [INFO ] Implicit Places using invariants in 1164 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2026-05-25 04:21:29] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1166 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 14 ms. Remains 232 /233 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-16669045153460097840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3148102760304610203.kers'
[2026-05-25 04:21:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16669045153460097840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3148102760304610203.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 222 rows 232 cols 1377 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 04:21:29] [INFO ] Computed 47 invariants in 6 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3148102760304610203.kers
Total runtime 9 ms.
[2026-05-25 04:21:30] [INFO ] Implicit Places using invariants in 928 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 151, 156, 178, 184, 223, 229]
[2026-05-25 04:21:30] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 929 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 15 ms. Remains 229 /230 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-8163528646357189402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2804602545340474922.kers'
[2026-05-25 04:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8163528646357189402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2804602545340474922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 229 cols 1333 entries
Finished phase 1 with 132 SingleSign rule and 52 generalized
[2026-05-25 04:21:30] [INFO ] Computed 45 invariants in 3 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2804602545340474922.kers
Total runtime 4 ms.
[2026-05-25 04:21:30] [INFO ] Implicit Places using invariants in 732 ms returned [21, 27, 48, 53, 74, 79, 99, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:21:30] [INFO ] Actually due to overlaps returned [27, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 736 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 14 ms. Remains 226 /227 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-13842953202159401325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17331329540757121620.kers'
[2026-05-25 04:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13842953202159401325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17331329540757121620.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 220 rows 226 cols 1294 entries
Finished phase 1 with 130 SingleSign rule and 53 generalized
[2026-05-25 04:21:30] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17331329540757121620.kers
Total runtime 7 ms.
[2026-05-25 04:21:31] [INFO ] Implicit Places using invariants in 614 ms returned [45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:21:31] [INFO ] Actually due to overlaps returned [50, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 616 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 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 224 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 223 transition count 219
Applied a total of 2 rules in 13 ms. Remains 223 /224 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-6798334099866832187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17391125018552578402.kers'
[2026-05-25 04:21:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6798334099866832187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17391125018552578402.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 223 cols 1260 entries
Finished phase 1 with 129 SingleSign rule and 53 generalized
[2026-05-25 04:21:31] [INFO ] Computed 41 invariants in 5 ms
Computed 41 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17391125018552578402.kers
Total runtime 6 ms.
[2026-05-25 04:21:32] [INFO ] Implicit Places using invariants in 562 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 172, 178]
[2026-05-25 04:21:32] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 564 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 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 221 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 220 transition count 218
Applied a total of 2 rules in 19 ms. Remains 220 /221 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-539299926533480250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10858811249984701742.kers'
[2026-05-25 04:21:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-539299926533480250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10858811249984701742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 220 cols 1231 entries
Finished phase 1 with 128 SingleSign rule and 53 generalized
[2026-05-25 04:21:32] [INFO ] Computed 39 invariants in 3 ms
Computed 39 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10858811249984701742.kers
Total runtime 4 ms.
[2026-05-25 04:21:32] [INFO ] Implicit Places using invariants in 479 ms returned [90, 96, 117, 122, 142, 147, 169, 175]
[2026-05-25 04:21:32] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 483 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 218/235 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 218 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 217 transition count 217
Applied a total of 2 rules in 13 ms. Remains 217 /218 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-981772036524421114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16296796251328059206.kers'
[2026-05-25 04:21:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-981772036524421114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16296796251328059206.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 217 cols 1207 entries
Finished phase 1 with 127 SingleSign rule and 53 generalized
[2026-05-25 04:21:32] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16296796251328059206.kers
Total runtime 3 ms.
[2026-05-25 04:21:33] [INFO ] Implicit Places using invariants in 442 ms returned [114, 119, 139, 144, 166, 172]
[2026-05-25 04:21:33] [INFO ] Actually due to overlaps returned [119, 114]
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 : 215/235 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 215 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 214 transition count 216
Applied a total of 2 rules in 12 ms. Remains 214 /215 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-15042134789529217386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1535038834134191118.kers'
[2026-05-25 04:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15042134789529217386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1535038834134191118.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 214 cols 1188 entries
Finished phase 1 with 126 SingleSign rule and 53 generalized
[2026-05-25 04:21:33] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1535038834134191118.kers
Total runtime 7 ms.
[2026-05-25 04:21:33] [INFO ] Implicit Places using invariants in 405 ms returned [136, 141, 163, 169]
[2026-05-25 04:21:33] [INFO ] Actually due to overlaps returned [141, 136]
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 8 : 212/235 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 212 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 211 transition count 215
Applied a total of 2 rules in 11 ms. Remains 211 /212 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-5197967026178990652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7756936338088008663.kers'
[2026-05-25 04:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5197967026178990652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7756936338088008663.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 215 rows 211 cols 1174 entries
Finished phase 1 with 125 SingleSign rule and 53 generalized
[2026-05-25 04:21:33] [INFO ] Computed 33 invariants in 5 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7756936338088008663.kers
Total runtime 6 ms.
[2026-05-25 04:21:33] [INFO ] Implicit Places using invariants in 372 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 374 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 209/235 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 209 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 208 transition count 214
Applied a total of 2 rules in 13 ms. Remains 208 /209 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-17620187002816978470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3341135195176330369.kers'
[2026-05-25 04:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17620187002816978470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3341135195176330369.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 208 cols 1165 entries
Finished phase 1 with 125 SingleSign rule and 52 generalized
[2026-05-25 04:21:33] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3341135195176330369.kers
Total runtime 3 ms.
[2026-05-25 04:21:34] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 04:21:34] [INFO ] Invariant cache hit.
[2026-05-25 04:21:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 04:21:36] [INFO ] Implicit Places using invariants and state equation in 2052 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 : 208/235 places, 214/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8225 ms. Remains : 208/235 places, 214/223 transitions.
RANDOM walk for 40000 steps (5025 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3360 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 651958 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 651958 steps, saw 326044 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-25 04:21:39] [INFO ] Invariant cache hit.
[2026-05-25 04:21:39] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/157 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/207 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/421 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 42/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/422 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 151/157 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/207 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/421 variables, 207/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 42/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/422 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:21:40] [INFO ] Invariant cache hit.
[2026-05-25 04:21:40] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-25 04:21:40] [INFO ] Invariant cache hit.
[2026-05-25 04:21:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 04:21:42] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2026-05-25 04:21:42] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-25 04:21:42] [INFO ] Invariant cache hit.
[2026-05-25 04:21:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (OVERLAPS) 214/422 variables, 208/302 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 42/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 344 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 208/208 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 63/63 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/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 213 unsolved
SMT process timed out in 60102ms, After SMT, problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62501 ms. Remains : 208/208 places, 214/214 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 208 transition count 196
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 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 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 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 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 60 place count 178 transition count 184
Applied a total of 60 rules in 12 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (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-3905938266553630279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7319121438996564664.kers'
[2026-05-25 04:22:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3905938266553630279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7319121438996564664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 178 cols 1077 entries
Finished phase 1 with 102 SingleSign rule and 45 generalized
[2026-05-25 04:22:43] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7319121438996564664.kers
Total runtime 5 ms.
[2026-05-25 04:22:43] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:22:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:22:43] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:22:43] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:22:43] [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:22:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 1
[2026-05-25 04:22:43] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:22:43] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 344 ms.
Knowledge based reduction with 3 factoid took 70 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 55 ms :[true, (NOT p0)]
Knowledge-based reduction took 84157 ms.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 12129 reset in 110 ms.
Product exploration explored 100000 steps with 12232 reset in 109 ms.
Built C files in :
/tmp/ltsmin10921882820611215119
[2026-05-25 04:22:43] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:22:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:22:43] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:22:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:22:43] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:22:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:22:43] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10921882820611215119
Running compilation step : cd /tmp/ltsmin10921882820611215119;'/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 585 ms.
Running link step : cd /tmp/ltsmin10921882820611215119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10921882820611215119;'/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/stateBased10786262656386856118.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 11 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-4868239245372077662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6338579740250109971.kers'
[2026-05-25 04:22:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4868239245372077662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6338579740250109971.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 273 cols 1017 entries
Finished phase 1 with 158 SingleSign rule and 66 generalized
[2026-05-25 04:22:58] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6338579740250109971.kers
Total runtime 4 ms.
[2026-05-25 04:22:59] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 04:22:59] [INFO ] Invariant cache hit.
[2026-05-25 04:22:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-25 04:23:00] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2026-05-25 04:23:00] [INFO ] Redundant transitions in 1 ms returned []
Running 260 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 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 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 342 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 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, 44/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 260/602 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 610 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/273 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61720 ms. Remains : 273/273 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin13278995369832217133
[2026-05-25 04:24:00] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:24:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:24:00] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:24:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:24:00] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:24:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:24:00] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13278995369832217133
Running compilation step : cd /tmp/ltsmin13278995369832217133;'/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 587 ms.
Running link step : cd /tmp/ltsmin13278995369832217133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13278995369832217133;'/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/stateBased3952094226582418754.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:24:15] [INFO ] Flatten gal took : 20 ms
[2026-05-25 04:24:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:24:15] [INFO ] Time to serialize gal into /tmp/LTL17604357104528890040.gal : 1 ms
[2026-05-25 04:24:15] [INFO ] Time to serialize properties into /tmp/LTL17955707323823272032.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/LTL17604357104528890040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14344712228554513040.hoa' '-atoms' '/tmp/LTL17955707323823272032.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...320
Loading property file /tmp/LTL17955707323823272032.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14344712228554513040.hoa
Detected timeout of ITS tools.
[2026-05-25 04:24:30] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:24:30] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:24:30] [INFO ] Time to serialize gal into /tmp/LTL15616202923397972414.gal : 2 ms
[2026-05-25 04:24:30] [INFO ] Time to serialize properties into /tmp/LTL1216382094799949801.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/LTL15616202923397972414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1216382094799949801.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("(p167<=p1)")))
Formula 0 simplified : F!"(p167<=p1)"
Detected timeout of ITS tools.
[2026-05-25 04:24:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 04:24:45] [INFO ] Applying decomposition
[2026-05-25 04:24:45] [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/graph1893448667944117810.txt' '-o' '/tmp/graph1893448667944117810.bin' '-w' '/tmp/graph1893448667944117810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1893448667944117810.bin' '-l' '-1' '-v' '-w' '/tmp/graph1893448667944117810.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:24:45] [INFO ] Decomposing Gal with order
[2026-05-25 04:24:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:24:45] [INFO ] Removed a total of 213 redundant transitions.
[2026-05-25 04:24:45] [INFO ] Flatten gal took : 18 ms
[2026-05-25 04:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-25 04:24:45] [INFO ] Time to serialize gal into /tmp/LTL15165311405801979094.gal : 3 ms
[2026-05-25 04:24:45] [INFO ] Time to serialize properties into /tmp/LTL16478760357882024055.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/LTL15165311405801979094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16478760357882024055.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 : !((G("(gu0.p167<=gu0.p1)")))
Formula 0 simplified : F!"(gu0.p167<=gu0.p1)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-09 finished in 429353 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(F((p0&&X(F(p1))&&(F(p2) U (!p0 U p3))))))'
Support contains 7 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 22 ms. Remains 527 /528 variables (removed 1) 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-6116956708675345434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17023383893507639504.kers'
[2026-05-25 04:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6116956708675345434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17023383893507639504.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:25:00] [INFO ] Computed 49 invariants in 28 ms
Computed 49 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-17023383893507639504.kers
Total runtime 30 ms.
[2026-05-25 04:25:01] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-25 04:25:01] [INFO ] Invariant cache hit.
[2026-05-25 04:25:03] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:25:03] [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 30031 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 60090ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62408 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(F((p0&&X(F(p1))&&(F(p2) U (!p0 U p3))))))'
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-11
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-010-LTLCardinality-11 finished in 62717 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 896 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
Reduce places removed 1 places and 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 120 rules applied. Total rules applied 121 place count 525 transition count 375
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 243 place count 405 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 403 transition count 373
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 245 place count 403 transition count 353
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 285 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 467 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 501 place count 275 transition count 262
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 503 place count 275 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 504 place count 274 transition count 261
Applied a total of 504 rules in 32 ms. Remains 274 /528 variables (removed 254) and now considering 261/497 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12005646856473114920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2008831616557658990.kers'
[2026-05-25 04:26:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12005646856473114920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2008831616557658990.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 272 cols 999 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:26:03] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2008831616557658990.kers
Total runtime 3 ms.
[2026-05-25 04:26:03] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 04:26:03] [INFO ] Invariant cache hit.
[2026-05-25 04:26:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:26:05] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
[2026-05-25 04:26:05] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:26:05] [INFO ] Invariant cache hit.
[2026-05-25 04:26:05] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 347 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 257/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 597 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 257/260 constraints, Known Traps: 0/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/528 places, 261/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61981 ms. Remains : 274/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' '!(G(p0))'
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-14
Product exploration explored 100000 steps with 11529 reset in 107 ms.
Product exploration explored 100000 steps with 11414 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 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 50 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 (4561 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3806 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571244 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571244 steps, saw 285713 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
[2026-05-25 04:27:08] [INFO ] Invariant cache hit.
[2026-05-25 04:27:08] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
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) 172/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/236 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 251/489 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/529 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/531 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/535 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/535 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 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) 172/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/236 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/238 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/489 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 16/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/529 variables, 31/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/531 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/535 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/535 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/535 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/535 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1911ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 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 273 transition count 260
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 1 with 40 rules applied. Total rules applied 42 place count 273 transition count 220
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 233 transition count 220
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 120 place count 233 transition count 220
Applied a total of 120 rules in 16 ms. Remains 233 /274 variables (removed 41) and now considering 220/261 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 233/274 places, 220/261 transitions.
RANDOM walk for 40000 steps (4953 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 593978 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 593978 steps, saw 297175 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) 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-8719244071185161423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9097387207734274001.kers'
[2026-05-25 04:27:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8719244071185161423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9097387207734274001.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 231 cols 1403 entries
Finished phase 1 with 126 SingleSign rule and 58 generalized
[2026-05-25 04:27:14] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9097387207734274001.kers
Total runtime 9 ms.
[2026-05-25 04:27:14] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 169/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/228 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/448 variables, 228/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 39/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/453 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/453 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 233/233 constraints, ReadFeed: 39/39 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) 169/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/228 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 220/448 variables, 228/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/453 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 233/233 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3087ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 397 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 3 ms. Remains 233 /233 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 04:27:17] [INFO ] Invariant cache hit.
[2026-05-25 04:27:18] [INFO ] Implicit Places using invariants in 1008 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 130, 150, 155, 177, 183, 190, 224, 230]
[2026-05-25 04:27:18] [INFO ] Actually due to overlaps returned [190, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1010 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-773037739941759722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8468932309213719540.kers'
[2026-05-25 04:27:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-773037739941759722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8468932309213719540.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 228 cols 1350 entries
Finished phase 1 with 132 SingleSign rule and 51 generalized
[2026-05-25 04:27:18] [INFO ] Computed 47 invariants in 2 ms
Computed 47 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8468932309213719540.kers
Total runtime 4 ms.
[2026-05-25 04:27:19] [INFO ] Implicit Places using invariants in 861 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 149, 154, 176, 182, 221, 227]
[2026-05-25 04:27:19] [INFO ] Actually due to overlaps returned [227, 221]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 863 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 15 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-12205036508127363035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12432588398423790481.kers'
[2026-05-25 04:27:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12205036508127363035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12432588398423790481.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 225 cols 1305 entries
Finished phase 1 with 128 SingleSign rule and 54 generalized
[2026-05-25 04:27:19] [INFO ] Computed 45 invariants in 4 ms
Computed 45 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12432588398423790481.kers
Total runtime 6 ms.
[2026-05-25 04:27:20] [INFO ] Implicit Places using invariants in 709 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 149, 154, 176, 182]
[2026-05-25 04:27:20] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 711 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 12 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-13827125633744922797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6350856867201925479.kers'
[2026-05-25 04:27:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13827125633744922797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6350856867201925479.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 222 cols 1266 entries
Finished phase 1 with 128 SingleSign rule and 53 generalized
[2026-05-25 04:27:20] [INFO ] Computed 43 invariants in 4 ms
Computed 43 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6350856867201925479.kers
Total runtime 5 ms.
[2026-05-25 04:27:21] [INFO ] Implicit Places using invariants in 663 ms returned [43, 48, 69, 74, 95, 101, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:27:21] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 664 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 14 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-160086064026369277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5140845137815393468.kers'
[2026-05-25 04:27:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-160086064026369277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5140845137815393468.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 219 cols 1232 entries
Finished phase 1 with 128 SingleSign rule and 52 generalized
[2026-05-25 04:27:21] [INFO ] Computed 41 invariants in 5 ms
Computed 41 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5140845137815393468.kers
Total runtime 6 ms.
[2026-05-25 04:27:21] [INFO ] Implicit Places using invariants in 544 ms returned [66, 71, 92, 98, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:27:21] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 545 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 14 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-10207276126405110638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6455883147523904487.kers'
[2026-05-25 04:27:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10207276126405110638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6455883147523904487.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 216 cols 1203 entries
Finished phase 1 with 128 SingleSign rule and 51 generalized
[2026-05-25 04:27:21] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6455883147523904487.kers
Total runtime 3 ms.
[2026-05-25 04:27:22] [INFO ] Implicit Places using invariants in 478 ms returned [89, 95, 115, 120, 140, 145, 167, 173]
[2026-05-25 04:27:22] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 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-12581029784755051019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15961903561854289476.kers'
[2026-05-25 04:27:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12581029784755051019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15961903561854289476.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 213 cols 1179 entries
Finished phase 1 with 128 SingleSign rule and 50 generalized
[2026-05-25 04:27:22] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15961903561854289476.kers
Total runtime 6 ms.
[2026-05-25 04:27:22] [INFO ] Implicit Places using invariants in 423 ms returned [112, 117, 137, 142, 164, 170]
[2026-05-25 04:27:22] [INFO ] Actually due to overlaps returned [117, 112]
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 : 213/233 places, 214/220 transitions.
Applied a total of 0 rules in 7 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 4791 ms. Remains : 213/233 places, 214/220 transitions.
RANDOM walk for 40000 steps (5493 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 650189 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 650189 steps, saw 325162 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) 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-58441428834891588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12326499534084900670.kers'
[2026-05-25 04:27:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-58441428834891588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12326499534084900670.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 214 rows 211 cols 1160 entries
Finished phase 1 with 129 SingleSign rule and 49 generalized
[2026-05-25 04:27:25] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12326499534084900670.kers
Total runtime 2 ms.
[2026-05-25 04:27:25] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 159/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/206 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/208 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/422 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 39/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/427 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/427 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 39/39 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) 159/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 45/206 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/208 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 214/422 variables, 208/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 39/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/427 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/427 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2701 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2873ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 213/213 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:27:28] [INFO ] Invariant cache hit.
[2026-05-25 04:27:29] [INFO ] Implicit Places using invariants in 378 ms returned [135, 140, 162, 168]
[2026-05-25 04:27:29] [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 1 : 211/213 places, 214/214 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 213
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 213
Applied a total of 2 rules in 13 ms. Remains 210 /211 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-12078899373003030996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7503783931575941497.kers'
[2026-05-25 04:27:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12078899373003030996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7503783931575941497.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 213 rows 208 cols 1146 entries
Finished phase 1 with 129 SingleSign rule and 48 generalized
[2026-05-25 04:27:29] [INFO ] Computed 33 invariants in 1 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7503783931575941497.kers
Total runtime 2 ms.
[2026-05-25 04:27:29] [INFO ] Implicit Places using invariants in 338 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/213 places, 213/214 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 212
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 212
Applied a total of 2 rules in 14 ms. Remains 207 /208 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-14967017089995862850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9776317903334278349.kers'
[2026-05-25 04:27:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14967017089995862850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9776317903334278349.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 212 rows 205 cols 1137 entries
Finished phase 1 with 129 SingleSign rule and 47 generalized
[2026-05-25 04:27:29] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9776317903334278349.kers
Total runtime 10 ms.
[2026-05-25 04:27:29] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-25 04:27:29] [INFO ] Invariant cache hit.
[2026-05-25 04:27:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:27:31] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 207/213 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3040 ms. Remains : 207/213 places, 212/214 transitions.
RANDOM walk for 40000 steps (5425 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 648377 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 1
Probabilistic random walk after 648377 steps, saw 324254 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2026-05-25 04:27:34] [INFO ] Invariant cache hit.
[2026-05-25 04:27:34] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 150/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/200 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 212/414 variables, 202/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 39/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/419 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 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) 150/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 48/200 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/414 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 39/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/419 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/419 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 344 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-25 04:27:38] [INFO ] Invariant cache hit.
[2026-05-25 04:27:38] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-25 04:27:38] [INFO ] Invariant cache hit.
[2026-05-25 04:27:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:27:40] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2026-05-25 04:27:40] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-25 04:27:40] [INFO ] Invariant cache hit.
[2026-05-25 04:27:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/419 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 39/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 277 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/419 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 39/279 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 211/490 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 211 unsolved
SMT process timed out in 44701ms, After SMT, problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44702ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47031 ms. Remains : 207/207 places, 212/212 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 195
Deduced a syphon composed of 17 places in 2 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 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 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 54 place count 180 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 183
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 183
Applied a total of 58 rules in 17 ms. Remains 178 /207 variables (removed 29) and now considering 183/212 (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-15426809837855731711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5385787594956179028.kers'
[2026-05-25 04:28:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15426809837855731711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5385787594956179028.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 176 cols 1054 entries
Finished phase 1 with 111 SingleSign rule and 36 generalized
[2026-05-25 04:28:25] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5385787594956179028.kers
Total runtime 2 ms.
[2026-05-25 04:28:25] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:28:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 04:28:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 11 ms returned sat
[2026-05-25 04:28:25] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:28:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:28:25] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:28:25] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:28:25] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 436 ms.
Knowledge based reduction with 3 factoid took 45 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 51 ms :[true, (NOT p0)]
Knowledge-based reduction took 79969 ms.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 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-17957488282565797001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9689777334775472921.kers'
[2026-05-25 04:28:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17957488282565797001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9689777334775472921.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 261 rows 272 cols 999 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:28:25] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9689777334775472921.kers
Total runtime 8 ms.
[2026-05-25 04:28:26] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 04:28:26] [INFO ] Invariant cache hit.
[2026-05-25 04:28:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:28:27] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2026-05-25 04:28:27] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:28:27] [INFO ] Invariant cache hit.
[2026-05-25 04:28:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 347 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: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 257/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 597 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/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 257/260 constraints, Known Traps: 0/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61962 ms. Remains : 274/274 places, 261/261 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 852 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
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).
RANDOM walk for 40000 steps (4558 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3806 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 568238 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 568238 steps, saw 284210 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2026-05-25 04:29:30] [INFO ] Invariant cache hit.
[2026-05-25 04:29:30] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
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) 172/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/236 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/238 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 251/489 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 16/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/529 variables, 31/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/531 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/535 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/535 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 341 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 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) 172/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/236 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/238 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 251/489 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 16/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 40/529 variables, 31/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/531 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/535 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/535 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/535 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/535 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1794ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 337 ms.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 261/261 transitions.
Graph (complete) has 812 edges and 274 vertex of which 273 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 273 transition count 260
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 1 with 40 rules applied. Total rules applied 42 place count 273 transition count 220
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 233 transition count 220
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 120 place count 233 transition count 220
Applied a total of 120 rules in 25 ms. Remains 233 /274 variables (removed 41) and now considering 220/261 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 233/274 places, 220/261 transitions.
RANDOM walk for 40000 steps (4899 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 591870 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 591870 steps, saw 296119 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) 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-743565496262485249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6213921137739944976.kers'
[2026-05-25 04:29:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-743565496262485249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6213921137739944976.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 220 rows 231 cols 1403 entries
Finished phase 1 with 126 SingleSign rule and 58 generalized
[2026-05-25 04:29:36] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6213921137739944976.kers
Total runtime 8 ms.
[2026-05-25 04:29:36] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 169/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/228 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/448 variables, 228/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 39/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/453 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/453 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 233/233 constraints, ReadFeed: 39/39 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) 169/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/228 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 220/448 variables, 228/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/453 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/453 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 233/233 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 412 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 12 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 12 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:29:39] [INFO ] Invariant cache hit.
[2026-05-25 04:29:40] [INFO ] Implicit Places using invariants in 998 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 130, 150, 155, 177, 183, 190, 224, 230]
[2026-05-25 04:29:40] [INFO ] Actually due to overlaps returned [190, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1001 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 14 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-12900650850242223533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5926647267392335886.kers'
[2026-05-25 04:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12900650850242223533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5926647267392335886.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 228 cols 1350 entries
Finished phase 1 with 132 SingleSign rule and 51 generalized
[2026-05-25 04:29:40] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5926647267392335886.kers
Total runtime 8 ms.
[2026-05-25 04:29:41] [INFO ] Implicit Places using invariants in 875 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 149, 154, 176, 182, 221, 227]
[2026-05-25 04:29:41] [INFO ] Actually due to overlaps returned [227, 221]
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 : 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 18 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-16838243283159116448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1703796724408763028.kers'
[2026-05-25 04:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16838243283159116448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1703796724408763028.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 225 cols 1305 entries
Finished phase 1 with 128 SingleSign rule and 54 generalized
[2026-05-25 04:29:41] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1703796724408763028.kers
Total runtime 5 ms.
[2026-05-25 04:29:42] [INFO ] Implicit Places using invariants in 733 ms returned [20, 26, 46, 51, 72, 77, 98, 104, 124, 129, 149, 154, 176, 182]
[2026-05-25 04:29:42] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 735 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-7614144027664931200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6862331736631394805.kers'
[2026-05-25 04:29:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7614144027664931200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6862331736631394805.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 222 cols 1266 entries
Finished phase 1 with 128 SingleSign rule and 53 generalized
[2026-05-25 04:29:42] [INFO ] Computed 43 invariants in 6 ms
Computed 43 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6862331736631394805.kers
Total runtime 7 ms.
[2026-05-25 04:29:42] [INFO ] Implicit Places using invariants in 641 ms returned [43, 48, 69, 74, 95, 101, 121, 126, 146, 151, 173, 179]
[2026-05-25 04:29:42] [INFO ] Actually due to overlaps returned [48, 43]
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 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 12 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-10371887314312227768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11356091054818174860.kers'
[2026-05-25 04:29:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10371887314312227768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11356091054818174860.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 219 cols 1232 entries
Finished phase 1 with 128 SingleSign rule and 52 generalized
[2026-05-25 04:29:42] [INFO ] Computed 41 invariants in 6 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11356091054818174860.kers
Total runtime 7 ms.
[2026-05-25 04:29:43] [INFO ] Implicit Places using invariants in 544 ms returned [66, 71, 92, 98, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:29:43] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 545 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 15 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-6387282081586829596.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9970185200182079071.kers'
[2026-05-25 04:29:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6387282081586829596.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9970185200182079071.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 216 cols 1203 entries
Finished phase 1 with 128 SingleSign rule and 51 generalized
[2026-05-25 04:29:43] [INFO ] Computed 39 invariants in 6 ms
Computed 39 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9970185200182079071.kers
Total runtime 7 ms.
[2026-05-25 04:29:44] [INFO ] Implicit Places using invariants in 495 ms returned [89, 95, 115, 120, 140, 145, 167, 173]
[2026-05-25 04:29:44] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 497 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 12 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-3813376553071460987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14308991627291830573.kers'
[2026-05-25 04:29:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3813376553071460987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14308991627291830573.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 213 cols 1179 entries
Finished phase 1 with 128 SingleSign rule and 50 generalized
[2026-05-25 04:29:44] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14308991627291830573.kers
Total runtime 7 ms.
[2026-05-25 04:29:44] [INFO ] Implicit Places using invariants in 424 ms returned [112, 117, 137, 142, 164, 170]
[2026-05-25 04:29:44] [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.
Applied a total of 0 rules in 8 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 4821 ms. Remains : 213/233 places, 214/220 transitions.
RANDOM walk for 40000 steps (5461 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 637807 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 1
Probabilistic random walk after 637807 steps, saw 318968 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) 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-9168514911812032028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18097693744313043701.kers'
[2026-05-25 04:29:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9168514911812032028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18097693744313043701.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 214 rows 211 cols 1160 entries
Finished phase 1 with 129 SingleSign rule and 49 generalized
[2026-05-25 04:29:47] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-18097693744313043701.kers
Total runtime 8 ms.
[2026-05-25 04:29:47] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 159/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/206 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/208 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/422 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 39/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/427 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/427 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 39/39 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) 159/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 45/206 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/208 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 214/422 variables, 208/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 39/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/427 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/427 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 213/213 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 213/213 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2026-05-25 04:29:50] [INFO ] Invariant cache hit.
[2026-05-25 04:29:51] [INFO ] Implicit Places using invariants in 388 ms returned [135, 140, 162, 168]
[2026-05-25 04:29:51] [INFO ] Actually due to overlaps returned [140, 135]
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 1 : 211/213 places, 214/214 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 213
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 213
Applied a total of 2 rules in 13 ms. Remains 210 /211 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-12982560698917817139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6833329725563367036.kers'
[2026-05-25 04:29:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12982560698917817139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6833329725563367036.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 213 rows 208 cols 1146 entries
Finished phase 1 with 129 SingleSign rule and 48 generalized
[2026-05-25 04:29:51] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6833329725563367036.kers
Total runtime 8 ms.
[2026-05-25 04:29:51] [INFO ] Implicit Places using invariants in 358 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 359 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/213 places, 213/214 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 212
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 212
Applied a total of 2 rules in 19 ms. Remains 207 /208 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-3262578167024738747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17193233853806957084.kers'
[2026-05-25 04:29:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3262578167024738747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17193233853806957084.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 205 cols 1137 entries
Finished phase 1 with 129 SingleSign rule and 47 generalized
[2026-05-25 04:29:51] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17193233853806957084.kers
Total runtime 4 ms.
[2026-05-25 04:29:51] [INFO ] Implicit Places using invariants in 381 ms returned []
[2026-05-25 04:29:51] [INFO ] Invariant cache hit.
[2026-05-25 04:29:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:29:53] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 207/213 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3065 ms. Remains : 207/213 places, 212/214 transitions.
RANDOM walk for 40000 steps (5484 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (5712 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 654345 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 654345 steps, saw 327239 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2026-05-25 04:29:56] [INFO ] Invariant cache hit.
[2026-05-25 04:29:56] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
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) 150/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/200 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/202 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 212/414 variables, 202/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 39/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/419 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 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) 150/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 48/200 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/202 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 212/414 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 39/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/419 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/419 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3172ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2026-05-25 04:30:00] [INFO ] Invariant cache hit.
[2026-05-25 04:30:00] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-05-25 04:30:00] [INFO ] Invariant cache hit.
[2026-05-25 04:30:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:30:02] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2026-05-25 04:30:02] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-05-25 04:30:02] [INFO ] Invariant cache hit.
[2026-05-25 04:30:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/419 variables, 207/238 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 39/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 277 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 207/207 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 1/207 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/419 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 39/279 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 211/490 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 211 unsolved
SMT process timed out in 44344ms, After SMT, problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46629 ms. Remains : 207/207 places, 212/212 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 195
Deduced a syphon composed of 17 places in 1 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 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 181 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 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 54 place count 180 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 183
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 183
Applied a total of 58 rules in 11 ms. Remains 178 /207 variables (removed 29) and now considering 183/212 (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-15659343899744399152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8693711359068102509.kers'
[2026-05-25 04:30:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15659343899744399152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8693711359068102509.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 183 rows 176 cols 1054 entries
Finished phase 1 with 111 SingleSign rule and 36 generalized
[2026-05-25 04:30:46] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8693711359068102509.kers
Total runtime 2 ms.
[2026-05-25 04:30:46] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:30:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 04:30:47] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 10 ms returned sat
[2026-05-25 04:30:47] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:30:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:30:47] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:30:47] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:30:47] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 437 ms.
Knowledge based reduction with 3 factoid took 38 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 38 ms :[true, (NOT p0)]
Knowledge-based reduction took 79531 ms.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11331 reset in 103 ms.
Product exploration explored 100000 steps with 11471 reset in 125 ms.
Built C files in :
/tmp/ltsmin12292465222462108664
[2026-05-25 04:30:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:30:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:30:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:30:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:30:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:30:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:30:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12292465222462108664
Running compilation step : cd /tmp/ltsmin12292465222462108664;'/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 552 ms.
Running link step : cd /tmp/ltsmin12292465222462108664;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12292465222462108664;'/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/stateBased12437967543852576690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 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-866603135895856363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11217098419312882079.kers'
[2026-05-25 04:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-866603135895856363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11217098419312882079.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 272 cols 999 entries
Finished phase 1 with 159 SingleSign rule and 66 generalized
[2026-05-25 04:31:02] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-11217098419312882079.kers
Total runtime 14 ms.
[2026-05-25 04:31:03] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-25 04:31:03] [INFO ] Invariant cache hit.
[2026-05-25 04:31:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-25 04:31:04] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2026-05-25 04:31:04] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:31:04] [INFO ] Invariant cache hit.
[2026-05-25 04:31:04] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 347 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 274/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 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/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/534 variables, 273/322 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 257/597 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 597 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 273/274 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 257/260 constraints, Known Traps: 0/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61966 ms. Remains : 274/274 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin10837206407976031958
[2026-05-25 04:32:04] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2026-05-25 04:32:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:32:04] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2026-05-25 04:32:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:32:04] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2026-05-25 04:32:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:32:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10837206407976031958
Running compilation step : cd /tmp/ltsmin10837206407976031958;'/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 586 ms.
Running link step : cd /tmp/ltsmin10837206407976031958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10837206407976031958;'/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/stateBased10921498425984966018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:32:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:32:19] [INFO ] Flatten gal took : 5 ms
[2026-05-25 04:32:19] [INFO ] Time to serialize gal into /tmp/LTL1424336055814844992.gal : 2 ms
[2026-05-25 04:32:19] [INFO ] Time to serialize properties into /tmp/LTL12007046713000716856.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/LTL1424336055814844992.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6102302266915500187.hoa' '-atoms' '/tmp/LTL12007046713000716856.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/LTL12007046713000716856.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6102302266915500187.hoa
Detected timeout of ITS tools.
[2026-05-25 04:32:34] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:32:34] [INFO ] Flatten gal took : 6 ms
[2026-05-25 04:32:34] [INFO ] Time to serialize gal into /tmp/LTL5777086282984843653.gal : 1 ms
[2026-05-25 04:32:34] [INFO ] Time to serialize properties into /tmp/LTL13696602415708262712.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/LTL5777086282984843653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13696602415708262712.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("(p362<=p28)")))
Formula 0 simplified : F!"(p362<=p28)"
Detected timeout of ITS tools.
[2026-05-25 04:32:49] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:32:49] [INFO ] Applying decomposition
[2026-05-25 04:32:49] [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/graph9455235807131424774.txt' '-o' '/tmp/graph9455235807131424774.bin' '-w' '/tmp/graph9455235807131424774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9455235807131424774.bin' '-l' '-1' '-v' '-w' '/tmp/graph9455235807131424774.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:32:49] [INFO ] Decomposing Gal with order
[2026-05-25 04:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:32:50] [INFO ] Removed a total of 180 redundant transitions.
[2026-05-25 04:32:50] [INFO ] Flatten gal took : 30 ms
[2026-05-25 04:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2026-05-25 04:32:50] [INFO ] Time to serialize gal into /tmp/LTL12984019631669547364.gal : 3 ms
[2026-05-25 04:32:50] [INFO ] Time to serialize properties into /tmp/LTL2053698360239686900.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/LTL12984019631669547364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2053698360239686900.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("(gu31.p362<=gu31.p28)")))
Formula 0 simplified : F!"(gu31.p362<=gu31.p28)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-14 finished in 421482 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)||(((F(p1) U p2) U p3)&&X(!p2)))))'
Support contains 7 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 497/497 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 497
Applied a total of 1 rules in 18 ms. Remains 527 /528 variables (removed 1) 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-5551595770957752693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13103340640482446203.kers'
[2026-05-25 04:33:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5551595770957752693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13103340640482446203.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:33:05] [INFO ] Computed 49 invariants in 28 ms
Computed 49 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-13103340640482446203.kers
Total runtime 30 ms.
[2026-05-25 04:33:05] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-25 04:33:05] [INFO ] Invariant cache hit.
[2026-05-25 04:33:07] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:33:07] [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 30035 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 30026 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 60097ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 527/528 places, 497/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62500 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)||(((F(p1) U p2) U p3)&&X(!p2)))))'
Stuttering acceptance computed with spot in 484 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), p2, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-010-LTLCardinality-15
Product exploration explored 100000 steps with 3352 reset in 97 ms.
Product exploration explored 100000 steps with 3347 reset in 111 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.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 32 factoid took 92 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1305 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1144 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 397207 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 397207 steps, saw 198639 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2026-05-25 04:34:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 301/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/318 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1018 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1023 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1023 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1024 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 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) 301/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/318 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 7/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1018 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1018 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1023 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1024 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1024 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 4880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 344 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 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 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 2 with 184 rules applied. Total rules applied 470 place count 291 transition count 261
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 506 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 543 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 580 place count 236 transition count 224
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 619 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 235 transition count 223
Applied a total of 620 rules in 32 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 235/527 places, 223/497 transitions.
RANDOM walk for 40000 steps (5069 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3415 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 595680 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 595680 steps, saw 298024 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) 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-513474154124160276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4264913838105585593.kers'
[2026-05-25 04:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-513474154124160276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4264913838105585593.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 233 cols 1414 entries
Finished phase 1 with 129 SingleSign rule and 57 generalized
[2026-05-25 04:34:19] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4264913838105585593.kers
Total runtime 8 ms.
[2026-05-25 04:34:19] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 133/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/224 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/230 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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) 133/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/224 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/230 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:34:21] [INFO ] Invariant cache hit.
[2026-05-25 04:34:22] [INFO ] Implicit Places using invariants in 1043 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2026-05-25 04:34:22] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 15 ms. Remains 232 /233 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-4878913675586763405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-827310490583673657.kers'
[2026-05-25 04:34:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4878913675586763405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-827310490583673657.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 230 cols 1361 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 04:34:22] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-827310490583673657.kers
Total runtime 10 ms.
[2026-05-25 04:34:23] [INFO ] Implicit Places using invariants in 868 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 151, 156, 178, 184, 223, 229]
[2026-05-25 04:34:23] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 871 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 14 ms. Remains 229 /230 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-7987460496685308576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2876223854400659281.kers'
[2026-05-25 04:34:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7987460496685308576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2876223854400659281.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 221 rows 227 cols 1316 entries
Finished phase 1 with 138 SingleSign rule and 46 generalized
[2026-05-25 04:34:23] [INFO ] Computed 45 invariants in 3 ms
Computed 45 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2876223854400659281.kers
Total runtime 4 ms.
[2026-05-25 04:34:23] [INFO ] Implicit Places using invariants in 718 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:34:23] [INFO ] Actually due to overlaps returned [26, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 719 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 14 ms. Remains 226 /227 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-5571270007093746235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16544921454634255782.kers'
[2026-05-25 04:34:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5571270007093746235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16544921454634255782.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 224 cols 1277 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-25 04:34:23] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16544921454634255782.kers
Total runtime 4 ms.
[2026-05-25 04:34:24] [INFO ] Implicit Places using invariants in 656 ms returned [43, 48, 70, 75, 96, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:34:24] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 658 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 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 224 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 223 transition count 219
Applied a total of 2 rules in 13 ms. Remains 223 /224 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-15857497779461433777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11108029327768454483.kers'
[2026-05-25 04:34:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15857497779461433777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11108029327768454483.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 221 cols 1243 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-25 04:34:24] [INFO ] Computed 41 invariants in 6 ms
Computed 41 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11108029327768454483.kers
Total runtime 8 ms.
[2026-05-25 04:34:25] [INFO ] Implicit Places using invariants in 567 ms returned [67, 72, 93, 99, 120, 125, 145, 150, 172, 178]
[2026-05-25 04:34:25] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Applied a total of 1 rules in 9 ms. Remains 221 /221 variables (removed 0) and now considering 219/219 (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-11633636874231577728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11073847717354052164.kers'
[2026-05-25 04:34:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11633636874231577728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11073847717354052164.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 219 cols 1216 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-25 04:34:25] [INFO ] Computed 39 invariants in 2 ms
Computed 39 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11073847717354052164.kers
Total runtime 4 ms.
[2026-05-25 04:34:25] [INFO ] Implicit Places using invariants in 484 ms returned [91, 97, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:34:25] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 493 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/235 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 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 9 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-1905321365756415788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7563877587791782846.kers'
[2026-05-25 04:34:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1905321365756415788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7563877587791782846.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 218 rows 216 cols 1192 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-25 04:34:25] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7563877587791782846.kers
Total runtime 3 ms.
[2026-05-25 04:34:26] [INFO ] Implicit Places using invariants in 398 ms returned [115, 120, 140, 145, 167, 173]
[2026-05-25 04:34:26] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 412 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/235 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 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 7 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-16745205305473906277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4988810811143809332.kers'
[2026-05-25 04:34:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16745205305473906277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4988810811143809332.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 213 cols 1173 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-25 04:34:26] [INFO ] Computed 35 invariants in 7 ms
Computed 35 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4988810811143809332.kers
Total runtime 9 ms.
[2026-05-25 04:34:26] [INFO ] Implicit Places using invariants in 374 ms returned [137, 142, 164, 170]
[2026-05-25 04:34:26] [INFO ] Actually due to overlaps returned [142, 137]
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 8 : 213/235 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 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-15816145761376746784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10356997642576817219.kers'
[2026-05-25 04:34:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15816145761376746784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10356997642576817219.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 210 cols 1159 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-25 04:34:26] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10356997642576817219.kers
Total runtime 8 ms.
[2026-05-25 04:34:26] [INFO ] Implicit Places using invariants in 365 ms returned [161, 167]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 367 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 210/235 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 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 10 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-2389329549352643195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14230510464452396889.kers'
[2026-05-25 04:34:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2389329549352643195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14230510464452396889.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 215 rows 207 cols 1150 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-25 04:34:26] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14230510464452396889.kers
Total runtime 7 ms.
[2026-05-25 04:34:27] [INFO ] Implicit Places using invariants in 344 ms returned []
[2026-05-25 04:34:27] [INFO ] Invariant cache hit.
[2026-05-25 04:34:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:34:29] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8660 ms. Remains : 209/235 places, 215/223 transitions.
RANDOM walk for 40000 steps (5730 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3642 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 631961 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 1
Probabilistic random walk after 631961 steps, saw 316050 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2026-05-25 04:34:32] [INFO ] Invariant cache hit.
[2026-05-25 04:34:32] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 138/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/198 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/204 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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) 138/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/198 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/204 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/419 variables, 204/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/424 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 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 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-25 04:34:34] [INFO ] Invariant cache hit.
[2026-05-25 04:34:34] [INFO ] Implicit Places using invariants in 349 ms returned []
[2026-05-25 04:34:34] [INFO ] Invariant cache hit.
[2026-05-25 04:34:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:34:37] [INFO ] Implicit Places using invariants and state equation in 2727 ms returned []
Implicit Place search using SMT with State Equation took 3087 ms to find 0 implicit places.
[2026-05-25 04:34:37] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-25 04:34:37] [INFO ] Invariant cache hit.
[2026-05-25 04:34:37] [INFO ] State equation strengthened by 37 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, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 511 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45093ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48194 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 0 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
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 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (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-17937847758235771759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11014119273111745553.kers'
[2026-05-25 04:35:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17937847758235771759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11014119273111745553.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 186 rows 178 cols 1068 entries
Finished phase 1 with 104 SingleSign rule and 45 generalized
[2026-05-25 04:35:22] [INFO ] Computed 31 invariants in 7 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11014119273111745553.kers
Total runtime 8 ms.
[2026-05-25 04:35:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:35:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:35:22] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-25 04:35:22] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:35:22] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:35:22] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:35:22] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
Knowledge based reduction with 32 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 74494 ms.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 21 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-6704133184907934425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16738674355825655935.kers'
[2026-05-25 04:35:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6704133184907934425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16738674355825655935.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:35:23] [INFO ] Computed 49 invariants in 28 ms
Computed 49 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-16738674355825655935.kers
Total runtime 29 ms.
[2026-05-25 04:35:23] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 04:35:23] [INFO ] Invariant cache hit.
[2026-05-25 04:35:25] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:35:25] [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 30026 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 60091ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 62466 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 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1336 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1112 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386786 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386786 steps, saw 193424 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-25 04:36:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 301/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/318 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1018 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1023 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1023 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1024 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1024 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 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) 301/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/318 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/445 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/450 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 471/921 variables, 450/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 89/1010 variables, 69/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 7/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1010 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1018 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1018 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1023 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1024 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1024 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1024 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 4685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 323 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 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 2 with 184 rules applied. Total rules applied 470 place count 291 transition count 261
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 506 place count 273 transition count 261
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 2 with 37 rules applied. Total rules applied 543 place count 273 transition count 224
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 580 place count 236 transition count 224
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 619 place count 236 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 235 transition count 223
Applied a total of 620 rules in 31 ms. Remains 235 /527 variables (removed 292) and now considering 223/497 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 235/527 places, 223/497 transitions.
RANDOM walk for 40000 steps (5174 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3431 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 589813 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 589813 steps, saw 295087 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) 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-10948095386738873801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7442408312699876968.kers'
[2026-05-25 04:36:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10948095386738873801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7442408312699876968.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 223 rows 233 cols 1414 entries
Finished phase 1 with 129 SingleSign rule and 57 generalized
[2026-05-25 04:36:36] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7442408312699876968.kers
Total runtime 9 ms.
[2026-05-25 04:36:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 133/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/224 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/230 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 223/453 variables, 230/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 37/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 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) 133/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/224 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/230 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 223/453 variables, 230/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 37/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/458 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 235/235 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1249ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 235/235 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-25 04:36:38] [INFO ] Invariant cache hit.
[2026-05-25 04:36:39] [INFO ] Implicit Places using invariants in 1040 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 132, 152, 157, 179, 185, 192, 226, 232]
[2026-05-25 04:36:39] [INFO ] Actually due to overlaps returned [192, 131]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1043 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/235 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 233 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 232 transition count 222
Applied a total of 2 rules in 16 ms. Remains 232 /233 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-19765251764386961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17749071469981046814.kers'
[2026-05-25 04:36:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-19765251764386961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17749071469981046814.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 222 rows 230 cols 1361 entries
Finished phase 1 with 132 SingleSign rule and 53 generalized
[2026-05-25 04:36:39] [INFO ] Computed 47 invariants in 7 ms
Computed 47 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17749071469981046814.kers
Total runtime 8 ms.
[2026-05-25 04:36:39] [INFO ] Implicit Places using invariants in 850 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 151, 156, 178, 184, 223, 229]
[2026-05-25 04:36:40] [INFO ] Actually due to overlaps returned [229, 223]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 853 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/235 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 230 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 229 transition count 221
Applied a total of 2 rules in 14 ms. Remains 229 /230 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-3407497767990429552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14448585506598108601.kers'
[2026-05-25 04:36:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3407497767990429552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14448585506598108601.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 221 rows 227 cols 1316 entries
Finished phase 1 with 138 SingleSign rule and 46 generalized
[2026-05-25 04:36:40] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14448585506598108601.kers
Total runtime 8 ms.
[2026-05-25 04:36:40] [INFO ] Implicit Places using invariants in 718 ms returned [20, 26, 46, 51, 73, 78, 99, 105, 126, 131, 151, 156, 178, 184]
[2026-05-25 04:36:40] [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 : 227/235 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 227 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 226 transition count 220
Applied a total of 2 rules in 13 ms. Remains 226 /227 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-12397492322638754331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14800262072636592751.kers'
[2026-05-25 04:36:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12397492322638754331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14800262072636592751.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 220 rows 224 cols 1277 entries
Finished phase 1 with 135 SingleSign rule and 48 generalized
[2026-05-25 04:36:40] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14800262072636592751.kers
Total runtime 3 ms.
[2026-05-25 04:36:41] [INFO ] Implicit Places using invariants in 652 ms returned [43, 48, 70, 75, 96, 102, 123, 128, 148, 153, 175, 181]
[2026-05-25 04:36:41] [INFO ] Actually due to overlaps returned [48, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 224/235 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 224 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 223 transition count 219
Applied a total of 2 rules in 14 ms. Remains 223 /224 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-11164549644575106606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5996695241186014696.kers'
[2026-05-25 04:36:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11164549644575106606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5996695241186014696.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 219 rows 221 cols 1243 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-25 04:36:41] [INFO ] Computed 41 invariants in 2 ms
Computed 41 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5996695241186014696.kers
Total runtime 3 ms.
[2026-05-25 04:36:41] [INFO ] Implicit Places using invariants in 570 ms returned [67, 72, 93, 99, 120, 125, 145, 150, 172, 178]
[2026-05-25 04:36:41] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 572 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 221/235 places, 219/223 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Applied a total of 1 rules in 11 ms. Remains 221 /221 variables (removed 0) and now considering 219/219 (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-9255857401545582706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10448317034926694487.kers'
[2026-05-25 04:36:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9255857401545582706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10448317034926694487.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 219 rows 219 cols 1216 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-25 04:36:42] [INFO ] Computed 39 invariants in 6 ms
Computed 39 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10448317034926694487.kers
Total runtime 7 ms.
[2026-05-25 04:36:42] [INFO ] Implicit Places using invariants in 503 ms returned [91, 97, 118, 123, 143, 148, 170, 176]
[2026-05-25 04:36:42] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 505 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 219/235 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 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 13 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-1756717683455559458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12970831186691273569.kers'
[2026-05-25 04:36:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1756717683455559458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12970831186691273569.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 218 rows 216 cols 1192 entries
Finished phase 1 with 135 SingleSign rule and 46 generalized
[2026-05-25 04:36:42] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12970831186691273569.kers
Total runtime 7 ms.
[2026-05-25 04:36:42] [INFO ] Implicit Places using invariants in 404 ms returned [115, 120, 140, 145, 167, 173]
[2026-05-25 04:36:42] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 216/235 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 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 11 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-998276413791328928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14397780886122895385.kers'
[2026-05-25 04:36:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-998276413791328928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14397780886122895385.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 217 rows 213 cols 1173 entries
Finished phase 1 with 135 SingleSign rule and 45 generalized
[2026-05-25 04:36:42] [INFO ] Computed 35 invariants in 6 ms
Computed 35 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14397780886122895385.kers
Total runtime 7 ms.
[2026-05-25 04:36:43] [INFO ] Implicit Places using invariants in 375 ms returned [137, 142, 164, 170]
[2026-05-25 04:36:43] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 377 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 213/235 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 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-8331351535053890749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18049934692791839373.kers'
[2026-05-25 04:36:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8331351535053890749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18049934692791839373.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 216 rows 210 cols 1159 entries
Finished phase 1 with 135 SingleSign rule and 44 generalized
[2026-05-25 04:36:43] [INFO ] Computed 33 invariants in 6 ms
Computed 33 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18049934692791839373.kers
Total runtime 7 ms.
[2026-05-25 04:36:43] [INFO ] Implicit Places using invariants in 362 ms returned [161, 167]
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 9 : 210/235 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 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-2566688242846952514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9303213785718217787.kers'
[2026-05-25 04:36:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2566688242846952514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9303213785718217787.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 215 rows 207 cols 1150 entries
Finished phase 1 with 135 SingleSign rule and 43 generalized
[2026-05-25 04:36:43] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9303213785718217787.kers
Total runtime 3 ms.
[2026-05-25 04:36:44] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-25 04:36:44] [INFO ] Invariant cache hit.
[2026-05-25 04:36:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:36:46] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 209/235 places, 215/223 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 8597 ms. Remains : 209/235 places, 215/223 transitions.
RANDOM walk for 40000 steps (5794 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 635326 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 635326 steps, saw 317731 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2026-05-25 04:36:49] [INFO ] Invariant cache hit.
[2026-05-25 04:36:49] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
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) 138/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/198 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/204 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/424 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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) 138/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/198 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/204 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/419 variables, 204/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 37/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/424 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 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 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2026-05-25 04:36:50] [INFO ] Invariant cache hit.
[2026-05-25 04:36:51] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-25 04:36:51] [INFO ] Invariant cache hit.
[2026-05-25 04:36:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 04:36:53] [INFO ] Implicit Places using invariants and state equation in 2714 ms returned []
Implicit Place search using SMT with State Equation took 3053 ms to find 0 implicit places.
[2026-05-25 04:36:54] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2026-05-25 04:36:54] [INFO ] Invariant cache hit.
[2026-05-25 04:36:54] [INFO ] State equation strengthened by 37 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, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 209/209 constraints, ReadFeed: 37/37 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, 37/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 214/491 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 511 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: 37/37 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45144ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48215 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
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 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 10 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (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-1311041364618496981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2854710710537292227.kers'
[2026-05-25 04:37:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1311041364618496981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2854710710537292227.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 186 rows 178 cols 1068 entries
Finished phase 1 with 104 SingleSign rule and 45 generalized
[2026-05-25 04:37:39] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2854710710537292227.kers
Total runtime 3 ms.
[2026-05-25 04:37:39] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 04:37:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 04:37:39] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2026-05-25 04:37:39] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 04:37:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:37:39] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 04:37:39] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 04:37:39] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 271 ms.
Knowledge based reduction with 1 factoid took 44 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 74081 ms.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3325 reset in 99 ms.
Product exploration explored 100000 steps with 3315 reset in 128 ms.
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16265974562496242671
[2026-05-25 04:37:40] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16265974562496242671
Running compilation step : cd /tmp/ltsmin16265974562496242671;'/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/ltsmin16265974562496242671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16265974562496242671;'/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/stateBased5016660549249526757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 13 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-6946184132339941784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15581516056002635504.kers'
[2026-05-25 04:37:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6946184132339941784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15581516056002635504.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:37:55] [INFO ] Computed 49 invariants in 17 ms
Computed 49 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15581516056002635504.kers
Total runtime 18 ms.
[2026-05-25 04:37:55] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-25 04:37:55] [INFO ] Invariant cache hit.
[2026-05-25 04:37:57] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2327 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2026-05-25 04:37:57] [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 30014 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 30023 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 60068ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in LTL mode , in 1 iterations and 62411 ms. Remains : 527/527 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin15743226025110046470
[2026-05-25 04:38:57] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15743226025110046470
Running compilation step : cd /tmp/ltsmin15743226025110046470;'/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 782 ms.
Running link step : cd /tmp/ltsmin15743226025110046470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15743226025110046470;'/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/stateBased5304677444673092356.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:39:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:39:12] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:39:12] [INFO ] Time to serialize gal into /tmp/LTL12615579756078721422.gal : 2 ms
[2026-05-25 04:39:12] [INFO ] Time to serialize properties into /tmp/LTL11173552065524325517.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/LTL12615579756078721422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18046691695359530126.hoa' '-atoms' '/tmp/LTL11173552065524325517.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...320
Loading property file /tmp/LTL11173552065524325517.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18046691695359530126.hoa
Detected timeout of ITS tools.
[2026-05-25 04:39:27] [INFO ] Flatten gal took : 9 ms
[2026-05-25 04:39:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:39:27] [INFO ] Time to serialize gal into /tmp/LTL17688504930951234882.gal : 2 ms
[2026-05-25 04:39:27] [INFO ] Time to serialize properties into /tmp/LTL1020895425133225339.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/LTL17688504930951234882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1020895425133225339.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(p274<=p241)"))||((((F("(p373>=2)"))U("(p65<=p350)"))U("(p503<=p1)"))&&(X("(p65>p350)"))))))
Formula 0 simplified : X(F!"(p274<=p241)" & (((G!"(p373>=2)" R !"(p65<=p350)") R !"(p503<=p1)") | X!"(p65>p350)"))
Detected timeout of ITS tools.
[2026-05-25 04:39:42] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:39:42] [INFO ] Applying decomposition
[2026-05-25 04:39:42] [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/graph6132284569903349634.txt' '-o' '/tmp/graph6132284569903349634.bin' '-w' '/tmp/graph6132284569903349634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6132284569903349634.bin' '-l' '-1' '-v' '-w' '/tmp/graph6132284569903349634.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:39:42] [INFO ] Decomposing Gal with order
[2026-05-25 04:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:39:42] [INFO ] Removed a total of 137 redundant transitions.
[2026-05-25 04:39:43] [INFO ] Flatten gal took : 42 ms
[2026-05-25 04:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 14 ms.
[2026-05-25 04:39:43] [INFO ] Time to serialize gal into /tmp/LTL1840674437923286470.gal : 5 ms
[2026-05-25 04:39:43] [INFO ] Time to serialize properties into /tmp/LTL16434600302540150059.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/LTL1840674437923286470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16434600302540150059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu70.p274<=gu70.p241)"))||((((F("(gi2.gi1.gi2.gi2.gi1.gu128.p373>=2)"))U("(gu207.p65<=gu207.p350)"))U("(gu0.p503<=gu0.p1)"))...190
Formula 0 simplified : X(F!"(gu70.p274<=gu70.p241)" & (((G!"(gi2.gi1.gi2.gi2.gi1.gu128.p373>=2)" R !"(gu207.p65<=gu207.p350)") R !"(gu0.p503<=gu0.p1)") | X...182
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-010-LTLCardinality-15 finished in 413047 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((G(p0)||(p1&&X(X(X(G(p1))))))))'
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/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(F(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.
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 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/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 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.
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 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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)||(((F(p1) U p2) U p3)&&X(!p2)))))'
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:39:58] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2052304627431198665
[2026-05-25 04:39:58] [INFO ] Applying decomposition
[2026-05-25 04:39:58] [INFO ] Computing symmetric may disable matrix : 497 transitions.
[2026-05-25 04:39:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:39:58] [INFO ] Computing symmetric may enable matrix : 497 transitions.
[2026-05-25 04:39:58] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:39:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11280824086267353525.txt' '-o' '/tmp/graph11280824086267353525.bin' '-w' '/tmp/graph11280824086267353525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11280824086267353525.bin' '-l' '-1' '-v' '-w' '/tmp/graph11280824086267353525.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:39:58] [INFO ] Decomposing Gal with order
[2026-05-25 04:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:39:58] [INFO ] Computing Do-Not-Accords matrix : 497 transitions.
[2026-05-25 04:39:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:39:58] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2052304627431198665
Running compilation step : cd /tmp/ltsmin2052304627431198665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '120' '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:39:58] [INFO ] Removed a total of 142 redundant transitions.
[2026-05-25 04:39:58] [INFO ] Flatten gal took : 37 ms
[2026-05-25 04:39:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 26 ms.
[2026-05-25 04:39:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality2193916436700143553.gal : 22 ms
[2026-05-25 04:39:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality8976477639876383692.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/LTLCardinality2193916436700143553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8976477639876383692.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 6 LTL properties
Checking formula 0 : !((G((G("(gi4.gu143.p398>gi4.gu143.p497)"))||(("(gu151.p190<=gu151.p410)")&&(X(X(X(G("(gu151.p190<=gu151.p410)")))))))))
Formula 0 simplified : F(F!"(gi4.gu143.p398>gi4.gu143.p497)" & (!"(gu151.p190<=gu151.p410)" | XXXF!"(gu151.p190<=gu151.p410)"))
Compilation finished in 1107 ms.
Running link step : cd /tmp/ltsmin2052304627431198665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/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))||((LTLAPp1==true)&&X(X(X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin2052304627431198665;'/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))||((LTLAPp1==true)&&X(X(X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin2052304627431198665;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin2052304627431198665;'/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' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin2052304627431198665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/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' '[]((LTLAPp5==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin2052304627431198665;'/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' '[]((LTLAPp5==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2052304627431198665;'/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(([]((LTLAPp6==true))||(((<>((LTLAPp7==true)) U (LTLAPp8==true)) U (LTLAPp9==true))&&X(!(LTLAPp8==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600