Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 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 795K 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 ASLink-PT-05b-LTLFireability-00
FORMULA_NAME ASLink-PT-05b-LTLFireability-01
FORMULA_NAME ASLink-PT-05b-LTLFireability-02
FORMULA_NAME ASLink-PT-05b-LTLFireability-03
FORMULA_NAME ASLink-PT-05b-LTLFireability-04
FORMULA_NAME ASLink-PT-05b-LTLFireability-05
FORMULA_NAME ASLink-PT-05b-LTLFireability-06
FORMULA_NAME ASLink-PT-05b-LTLFireability-07
FORMULA_NAME ASLink-PT-05b-LTLFireability-08
FORMULA_NAME ASLink-PT-05b-LTLFireability-09
FORMULA_NAME ASLink-PT-05b-LTLFireability-10
FORMULA_NAME ASLink-PT-05b-LTLFireability-11
FORMULA_NAME ASLink-PT-05b-LTLFireability-12
FORMULA_NAME ASLink-PT-05b-LTLFireability-13
FORMULA_NAME ASLink-PT-05b-LTLFireability-14
FORMULA_NAME ASLink-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779477109176

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:11:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:11:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:11:50] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-22 19:11:51] [INFO ] Transformed 2430 places.
[2026-05-22 19:11:51] [INFO ] Transformed 3040 transitions.
[2026-05-22 19:11:51] [INFO ] Found NUPN structural information;
[2026-05-22 19:11:51] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 147 place count 2283 transition count 2893
Iterating global reduction 0 with 147 rules applied. Total rules applied 294 place count 2283 transition count 2893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 295 place count 2283 transition count 2892
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 349 place count 2229 transition count 2805
Iterating global reduction 1 with 54 rules applied. Total rules applied 403 place count 2229 transition count 2805
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 419 place count 2229 transition count 2789
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 427 place count 2221 transition count 2781
Iterating global reduction 2 with 8 rules applied. Total rules applied 435 place count 2221 transition count 2781
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 439 place count 2217 transition count 2770
Iterating global reduction 2 with 4 rules applied. Total rules applied 443 place count 2217 transition count 2770
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 446 place count 2214 transition count 2767
Iterating global reduction 2 with 3 rules applied. Total rules applied 449 place count 2214 transition count 2767
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 451 place count 2212 transition count 2765
Iterating global reduction 2 with 2 rules applied. Total rules applied 453 place count 2212 transition count 2765
Applied a total of 453 rules in 1593 ms. Remains 2212 /2430 variables (removed 218) and now considering 2765/3040 (removed 275) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16762209336860699064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4408041803828813118.kers'
[2026-05-22 19:11:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16762209336860699064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4408041803828813118.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2765 rows 2212 cols 8646 entries
Finished phase 1 with 1409 SingleSign rule and 565 generalized
[2026-05-22 19:11:53] [INFO ] Computed 238 invariants in 20 ms
Computed 238 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-4408041803828813118.kers
Total runtime 25 ms.
[2026-05-22 19:11:55] [INFO ] Implicit Places using invariants in 2258 ms returned [2046, 2057, 2068, 2076, 2084, 2092, 2100, 2111, 2119, 2127, 2138]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2295 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2201/2430 places, 2765/3040 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2189 transition count 2753
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2189 transition count 2753
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 2178 transition count 2742
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 2178 transition count 2742
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 2169 transition count 2733
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 2169 transition count 2733
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 2165 transition count 2729
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 2165 transition count 2729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 2163 transition count 2727
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 2163 transition count 2727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 2161 transition count 2725
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 2161 transition count 2725
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 2159 transition count 2723
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 2159 transition count 2723
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 2157 transition count 2721
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 2157 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 2156 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 2156 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2155 transition count 2719
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2155 transition count 2719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2154 transition count 2718
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2154 transition count 2718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2153 transition count 2717
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2153 transition count 2717
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 2152 transition count 2716
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 2152 transition count 2716
Applied a total of 98 rules in 1444 ms. Remains 2152 /2201 variables (removed 49) and now considering 2716/2765 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4665957042230597643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15351801392807526149.kers'
[2026-05-22 19:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4665957042230597643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15351801392807526149.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2716 rows 2152 cols 8488 entries
Finished phase 1 with 1396 SingleSign rule and 529 generalized
[2026-05-22 19:11:56] [INFO ] Computed 227 invariants in 54 ms
Computed 227 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-15351801392807526149.kers
Total runtime 60 ms.
[2026-05-22 19:11:58] [INFO ] Implicit Places using invariants in 1876 ms returned []
[2026-05-22 19:11:58] [INFO ] Invariant cache hit.
[2026-05-22 19:12:07] [INFO ] Implicit Places using invariants and state equation in 9041 ms returned []
Implicit Place search using SMT with State Equation took 10943 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2152/2430 places, 2716/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16291 ms. Remains : 2152/2430 places, 2716/3040 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Applied a total of 0 rules in 100 ms. Remains 2152 /2152 variables (removed 0) and now considering 2716/2716 (removed 0) transitions.
[2026-05-22 19:12:07] [INFO ] Invariant cache hit.
[2026-05-22 19:12:09] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2026-05-22 19:12:09] [INFO ] Invariant cache hit.
[2026-05-22 19:12:17] [INFO ] Implicit Places using invariants and state equation in 8785 ms returned []
Implicit Place search using SMT with State Equation took 10164 ms to find 0 implicit places.
Running 2715 sub problems to find dead transitions.
[2026-05-22 19:12:18] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2151 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2151/4868 variables, and 134 constraints, problems are : Problem set: 0 solved, 2715 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 134/177 constraints, State Equation: 0/2152 constraints, PredecessorRefiner: 2715/2715 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2151 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2151/4868 variables, and 134 constraints, problems are : Problem set: 0 solved, 2715 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, Generalized P Invariants (flows): 134/177 constraints, State Equation: 0/2152 constraints, PredecessorRefiner: 0/2715 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61344ms problems are : Problem set: 0 solved, 2715 unsolved
Search for dead transitions found 0 dead transitions in 61402ms
Finished structural reductions in LTL mode , in 1 iterations and 71728 ms. Remains : 2152/2152 places, 2716/2716 transitions.
Support contains 54 out of 2152 places after structural reductions.
[2026-05-22 19:13:19] [INFO ] Flatten gal took : 181 ms
[2026-05-22 19:13:19] [INFO ] Flatten gal took : 116 ms
[2026-05-22 19:13:20] [INFO ] Input system was already deterministic with 2716 transitions.
RANDOM walk for 40000 steps (59 resets) in 1887 ms. (21 steps per ms) remains 14/29 properties
BEST_FIRST walk for 40003 steps (9 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 158 ms. (251 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (11 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (9 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (10 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
[2026-05-22 19:13:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 442/469 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 416/885 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1182/2067 variables, 150/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2067 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 85/2152 variables, 27/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2152 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 2716/4868 variables, 2152/2379 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4868 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4868/4868 variables, and 2379 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 177/177 constraints, State Equation: 2152/2152 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 442/469 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 416/885 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1182/2067 variables, 150/201 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2067 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2067/4868 variables, and 202 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 150/177 constraints, State Equation: 0/2152 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10058ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 2152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2152 transition count 2327
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 396 rules applied. Total rules applied 785 place count 1763 transition count 2320
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 791 place count 1759 transition count 2318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 793 place count 1757 transition count 2318
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 793 place count 1757 transition count 1745
Deduced a syphon composed of 573 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1200 rules applied. Total rules applied 1993 place count 1130 transition count 1745
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 36 rules applied. Total rules applied 2029 place count 1125 transition count 1714
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 34 rules applied. Total rules applied 2063 place count 1094 transition count 1711
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2066 place count 1091 transition count 1711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2066 place count 1091 transition count 1690
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 2128 place count 1050 transition count 1690
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2128 place count 1050 transition count 1671
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2166 place count 1031 transition count 1671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2167 place count 1030 transition count 1670
Iterating global reduction 7 with 1 rules applied. Total rules applied 2168 place count 1030 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2169 place count 1029 transition count 1669
Iterating global reduction 7 with 1 rules applied. Total rules applied 2170 place count 1029 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2171 place count 1028 transition count 1668
Iterating global reduction 7 with 1 rules applied. Total rules applied 2172 place count 1028 transition count 1668
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 7 with 342 rules applied. Total rules applied 2514 place count 856 transition count 1498
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2516 place count 854 transition count 1496
Iterating global reduction 7 with 2 rules applied. Total rules applied 2518 place count 854 transition count 1496
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 2519 place count 854 transition count 1495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2520 place count 853 transition count 1495
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2520 place count 853 transition count 1494
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2522 place count 852 transition count 1494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2524 place count 851 transition count 1499
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 2530 place count 851 transition count 1493
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 2536 place count 845 transition count 1493
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2540 place count 845 transition count 1489
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2544 place count 841 transition count 1489
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2549 place count 841 transition count 1489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2550 place count 840 transition count 1488
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 13 rules applied. Total rules applied 2563 place count 831 transition count 1484
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2567 place count 827 transition count 1484
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 13 Pre rules applied. Total rules applied 2567 place count 827 transition count 1471
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 26 rules applied. Total rules applied 2593 place count 814 transition count 1471
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2598 place count 809 transition count 1471
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 2618 place count 799 transition count 1461
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 2623 place count 794 transition count 1456
Iterating global reduction 14 with 5 rules applied. Total rules applied 2628 place count 794 transition count 1456
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 2633 place count 794 transition count 1451
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2638 place count 789 transition count 1451
Applied a total of 2638 rules in 805 ms. Remains 789 /2152 variables (removed 1363) and now considering 1451/2716 (removed 1265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 805 ms. Remains : 789/2152 places, 1451/2716 transitions.
RANDOM walk for 40000 steps (452 resets) in 467 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (70 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (72 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (71 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (74 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (77 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (70 resets) in 78 ms. (506 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (74 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (71 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (72 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 266850 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 12
Probabilistic random walk after 266850 steps, saw 50403 distinct states, run finished after 3008 ms. (steps per millisecond=88 ) 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-482574500299530017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18144909350355606611.kers'
[2026-05-22 19:13:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-482574500299530017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18144909350355606611.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 1451 rows 776 cols 5685 entries
Finished phase 1 with 191 SingleSign rule and 466 generalized
[2026-05-22 19:13:35] [INFO ] Computed 132 invariants in 10 ms
Computed 132 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18144909350355606611.kers
Total runtime 12 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 210/233 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/273 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/276 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/278 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 288/566 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 100/666 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 5/671 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/672 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 100/772 variables, 31/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/772 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 12/784 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/784 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 1/785 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 4/789 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 1451/2240 variables, 789/921 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2240 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 0/2240 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2240/2240 variables, and 921 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3408 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 210/233 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/273 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/276 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/278 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 288/566 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 100/666 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 5/671 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/671 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/672 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 100/772 variables, 31/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/772 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 12/784 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/784 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 1/785 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/785 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 4/789 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 25 (OVERLAPS) 1451/2240 variables, 789/921 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2240 variables, 9/930 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2240 variables, 2/932 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2240 variables, 1/933 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2240 variables, 0/933 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/2240 variables, 0/933 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2240/2240 variables, and 933 constraints, problems are : Problem set: 3 solved, 9 unsolved in 30855 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34293ms problems are : Problem set: 3 solved, 9 unsolved
Parikh walk visited 0 properties in 30006 ms.
Support contains 17 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1451/1451 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 789 transition count 1448
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 786 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 785 transition count 1440
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 785 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 784 transition count 1432
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 784 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 783 transition count 1424
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 783 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 782 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 782 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 781 transition count 1408
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 781 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 780 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 780 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 779 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 779 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 778 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 778 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 777 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 777 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 776 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 776 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 775 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 775 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 774 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 774 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 773 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 773 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 772 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 772 transition count 1336
Applied a total of 34 rules in 291 ms. Remains 772 /789 variables (removed 17) and now considering 1336/1451 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 772/789 places, 1336/1451 transitions.
RANDOM walk for 40000 steps (464 resets) in 351 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (76 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (77 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (74 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (71 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (72 resets) in 82 ms. (481 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (76 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8842690469108082052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4956656614234879496.kers'
[2026-05-22 19:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8842690469108082052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4956656614234879496.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1336 rows 759 cols 5231 entries
Finished phase 1 with 193 SingleSign rule and 447 generalized
[2026-05-22 19:14:40] [INFO ] Computed 132 invariants in 14 ms
Computed 132 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4956656614234879496.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 120/134 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/157 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/159 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 141/301 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/325 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 102/429 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 67/496 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 3/499 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 58/557 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/557 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 12/569 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/569 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 52/621 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/621 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 34/655 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/655 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 12/667 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/667 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 77/744 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/744 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 20/764 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/764 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 1/765 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/765 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 7/772 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/772 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/772 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 1336/2108 variables, 772/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2108 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (OVERLAPS) 0/2108 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2108/2108 variables, and 905 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4000 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 120/134 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/157 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/159 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 141/301 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 24/325 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/327 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 102/429 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 67/496 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 3/499 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/499 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 58/557 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/557 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 12/569 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/569 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 52/621 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/621 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 34/655 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/655 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 12/667 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/667 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 77/744 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/744 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 20/764 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/764 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 1/765 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/765 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 7/772 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/772 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/772 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 1336/2108 variables, 772/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2108 variables, 8/913 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2108 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 0/2108 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2108/2108 variables, and 913 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11173ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 25922 ms.
Support contains 9 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1336/1336 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 772 transition count 1335
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 770 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 770 transition count 1327
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 767 transition count 1324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 766 transition count 1323
Applied a total of 11 rules in 93 ms. Remains 766 /772 variables (removed 6) and now considering 1323/1336 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 766/772 places, 1323/1336 transitions.
FORMULA ASLink-PT-05b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-05b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 86 stabilizing places and 86 stable transitions
FORMULA ASLink-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4 out of 2152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 2151 transition count 2321
Reduce places removed 394 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 401 rules applied. Total rules applied 795 place count 1757 transition count 2314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 799 place count 1753 transition count 2314
Performed 578 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 578 Pre rules applied. Total rules applied 799 place count 1753 transition count 1736
Deduced a syphon composed of 578 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 631 places and 0 transitions.
Iterating global reduction 3 with 1209 rules applied. Total rules applied 2008 place count 1122 transition count 1736
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 39 rules applied. Total rules applied 2047 place count 1116 transition count 1703
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 34 rules applied. Total rules applied 2081 place count 1083 transition count 1702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2082 place count 1082 transition count 1702
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2082 place count 1082 transition count 1681
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 63 rules applied. Total rules applied 2145 place count 1040 transition count 1681
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2145 place count 1040 transition count 1661
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2185 place count 1020 transition count 1661
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2188 place count 1017 transition count 1651
Iterating global reduction 6 with 3 rules applied. Total rules applied 2191 place count 1017 transition count 1651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2191 place count 1017 transition count 1650
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2193 place count 1016 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2195 place count 1014 transition count 1641
Iterating global reduction 6 with 2 rules applied. Total rules applied 2197 place count 1014 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2199 place count 1012 transition count 1632
Iterating global reduction 6 with 2 rules applied. Total rules applied 2201 place count 1012 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2202 place count 1011 transition count 1624
Iterating global reduction 6 with 1 rules applied. Total rules applied 2203 place count 1011 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2204 place count 1010 transition count 1616
Iterating global reduction 6 with 1 rules applied. Total rules applied 2205 place count 1010 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2206 place count 1009 transition count 1608
Iterating global reduction 6 with 1 rules applied. Total rules applied 2207 place count 1009 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2208 place count 1008 transition count 1600
Iterating global reduction 6 with 1 rules applied. Total rules applied 2209 place count 1008 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2210 place count 1007 transition count 1592
Iterating global reduction 6 with 1 rules applied. Total rules applied 2211 place count 1007 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2212 place count 1006 transition count 1584
Iterating global reduction 6 with 1 rules applied. Total rules applied 2213 place count 1006 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2214 place count 1005 transition count 1576
Iterating global reduction 6 with 1 rules applied. Total rules applied 2215 place count 1005 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2216 place count 1004 transition count 1568
Iterating global reduction 6 with 1 rules applied. Total rules applied 2217 place count 1004 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2218 place count 1003 transition count 1560
Iterating global reduction 6 with 1 rules applied. Total rules applied 2219 place count 1003 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2220 place count 1002 transition count 1552
Iterating global reduction 6 with 1 rules applied. Total rules applied 2221 place count 1002 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2222 place count 1001 transition count 1544
Iterating global reduction 6 with 1 rules applied. Total rules applied 2223 place count 1001 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2224 place count 1000 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 2225 place count 1000 transition count 1536
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 6 with 340 rules applied. Total rules applied 2565 place count 829 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2567 place count 827 transition count 1365
Iterating global reduction 6 with 2 rules applied. Total rules applied 2569 place count 827 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2570 place count 827 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2571 place count 826 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2571 place count 826 transition count 1363
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2573 place count 825 transition count 1363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2575 place count 824 transition count 1368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2577 place count 822 transition count 1366
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 13 rules applied. Total rules applied 2590 place count 813 transition count 1362
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2594 place count 809 transition count 1362
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 13 Pre rules applied. Total rules applied 2594 place count 809 transition count 1349
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 27 rules applied. Total rules applied 2621 place count 795 transition count 1349
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 10 with 10 rules applied. Total rules applied 2631 place count 785 transition count 1349
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 2631 place count 785 transition count 1348
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2633 place count 784 transition count 1348
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 30 rules applied. Total rules applied 2663 place count 769 transition count 1333
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 2672 place count 760 transition count 1324
Iterating global reduction 11 with 9 rules applied. Total rules applied 2681 place count 760 transition count 1324
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2685 place count 756 transition count 1320
Iterating global reduction 11 with 4 rules applied. Total rules applied 2689 place count 756 transition count 1320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2693 place count 756 transition count 1316
Applied a total of 2693 rules in 798 ms. Remains 756 /2152 variables (removed 1396) and now considering 1316/2716 (removed 1400) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7766525896502962343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14303667091647113456.kers'
[2026-05-22 19:15:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7766525896502962343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14303667091647113456.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 5 ms.
// Phase 1: matrix 1316 rows 741 cols 5122 entries
Finished phase 1 with 184 SingleSign rule and 447 generalized
[2026-05-22 19:15:19] [INFO ] Computed 125 invariants in 48 ms
Computed 125 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-14303667091647113456.kers
Total runtime 52 ms.
[2026-05-22 19:15:20] [INFO ] Implicit Places using invariants in 850 ms returned [1, 18, 19, 20, 36, 53, 71, 90, 142, 152, 153, 155, 172, 190, 210, 261, 262, 274, 275, 277, 295, 313, 333, 384, 385, 397, 398, 400, 417, 435, 513, 529, 530, 532, 549, 567, 587, 638, 639, 642, 653, 654, 655, 673, 694, 695, 696, 697]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 853 ms to find 48 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/2152 places, 1316/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 708 transition count 1228
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 620 transition count 1228
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 620 transition count 1201
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 592 transition count 1201
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 588 transition count 1193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 580 transition count 1193
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 577 transition count 1190
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 577 transition count 1190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 577 transition count 1187
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 346 place count 534 transition count 1144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 532 transition count 1145
Applied a total of 350 rules in 69 ms. Remains 532 /708 variables (removed 176) and now considering 1145/1316 (removed 171) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17382823479774296406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3605258696433975810.kers'
[2026-05-22 19:15:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17382823479774296406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3605258696433975810.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1145 rows 531 cols 4603 entries
Finished phase 1 with 148 SingleSign rule and 312 generalized
[2026-05-22 19:15:20] [INFO ] Computed 72 invariants in 8 ms
Computed 72 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3605258696433975810.kers
Total runtime 9 ms.
[2026-05-22 19:15:20] [INFO ] Implicit Places using invariants in 540 ms returned [90, 96, 101, 176, 182, 187, 265, 271, 276, 357, 363, 368, 453, 459, 464, 529]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 542 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 516/2152 places, 1145/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 516 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 515 transition count 1144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 505 transition count 1134
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 505 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 495 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 495 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 490 transition count 1119
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 490 transition count 1119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 485 transition count 1114
Applied a total of 62 rules in 55 ms. Remains 485 /516 variables (removed 31) and now considering 1114/1145 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1583481534364843595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-276631959847854423.kers'
[2026-05-22 19:15:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1583481534364843595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-276631959847854423.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1114 rows 484 cols 4488 entries
Finished phase 1 with 138 SingleSign rule and 291 generalized
[2026-05-22 19:15:20] [INFO ] Computed 56 invariants in 8 ms
Computed 56 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-276631959847854423.kers
Total runtime 10 ms.
[2026-05-22 19:15:21] [INFO ] Implicit Places using invariants in 568 ms returned []
[2026-05-22 19:15:21] [INFO ] Invariant cache hit.
[2026-05-22 19:15:22] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 485/2152 places, 1114/2716 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3977 ms. Remains : 485/2152 places, 1114/2716 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-00 finished in 4302 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 3 out of 2152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 2151 transition count 2321
Reduce places removed 394 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 401 rules applied. Total rules applied 795 place count 1757 transition count 2314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 799 place count 1753 transition count 2314
Performed 578 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 578 Pre rules applied. Total rules applied 799 place count 1753 transition count 1736
Deduced a syphon composed of 578 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 3 with 1210 rules applied. Total rules applied 2009 place count 1121 transition count 1736
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 3 with 41 rules applied. Total rules applied 2050 place count 1115 transition count 1701
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 2085 place count 1080 transition count 1701
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2085 place count 1080 transition count 1680
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 2147 place count 1039 transition count 1680
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 2147 place count 1039 transition count 1661
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2185 place count 1020 transition count 1661
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2188 place count 1017 transition count 1651
Iterating global reduction 5 with 3 rules applied. Total rules applied 2191 place count 1017 transition count 1651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2191 place count 1017 transition count 1650
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2193 place count 1016 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2195 place count 1014 transition count 1641
Iterating global reduction 5 with 2 rules applied. Total rules applied 2197 place count 1014 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2199 place count 1012 transition count 1632
Iterating global reduction 5 with 2 rules applied. Total rules applied 2201 place count 1012 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2202 place count 1011 transition count 1624
Iterating global reduction 5 with 1 rules applied. Total rules applied 2203 place count 1011 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2204 place count 1010 transition count 1616
Iterating global reduction 5 with 1 rules applied. Total rules applied 2205 place count 1010 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2206 place count 1009 transition count 1608
Iterating global reduction 5 with 1 rules applied. Total rules applied 2207 place count 1009 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2208 place count 1008 transition count 1600
Iterating global reduction 5 with 1 rules applied. Total rules applied 2209 place count 1008 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2210 place count 1007 transition count 1592
Iterating global reduction 5 with 1 rules applied. Total rules applied 2211 place count 1007 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2212 place count 1006 transition count 1584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2213 place count 1006 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2214 place count 1005 transition count 1576
Iterating global reduction 5 with 1 rules applied. Total rules applied 2215 place count 1005 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2216 place count 1004 transition count 1568
Iterating global reduction 5 with 1 rules applied. Total rules applied 2217 place count 1004 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2218 place count 1003 transition count 1560
Iterating global reduction 5 with 1 rules applied. Total rules applied 2219 place count 1003 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2220 place count 1002 transition count 1552
Iterating global reduction 5 with 1 rules applied. Total rules applied 2221 place count 1002 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2222 place count 1001 transition count 1544
Iterating global reduction 5 with 1 rules applied. Total rules applied 2223 place count 1001 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2224 place count 1000 transition count 1536
Iterating global reduction 5 with 1 rules applied. Total rules applied 2225 place count 1000 transition count 1536
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2567 place count 828 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2570 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 2574 place count 824 transition count 1363
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2575 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2576 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2576 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2578 place count 822 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2579 place count 821 transition count 1360
Iterating global reduction 7 with 1 rules applied. Total rules applied 2580 place count 821 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2582 place count 821 transition count 1358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2583 place count 820 transition count 1358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2585 place count 819 transition count 1363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2587 place count 817 transition count 1361
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2602 place count 807 transition count 1356
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2607 place count 802 transition count 1356
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2607 place count 802 transition count 1341
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2638 place count 786 transition count 1341
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2649 place count 775 transition count 1341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2649 place count 775 transition count 1340
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2651 place count 774 transition count 1340
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2683 place count 758 transition count 1324
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2693 place count 748 transition count 1314
Iterating global reduction 12 with 10 rules applied. Total rules applied 2703 place count 748 transition count 1314
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2708 place count 743 transition count 1309
Iterating global reduction 12 with 5 rules applied. Total rules applied 2713 place count 743 transition count 1309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2718 place count 743 transition count 1304
Applied a total of 2718 rules in 866 ms. Remains 743 /2152 variables (removed 1409) and now considering 1304/2716 (removed 1412) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17434835245283619811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-208546025072670154.kers'
[2026-05-22 19:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17434835245283619811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-208546025072670154.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 1304 rows 727 cols 5081 entries
Finished phase 1 with 169 SingleSign rule and 452 generalized
[2026-05-22 19:15:23] [INFO ] Computed 122 invariants in 9 ms
Computed 122 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-208546025072670154.kers
Total runtime 11 ms.
[2026-05-22 19:15:24] [INFO ] Implicit Places using invariants in 657 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 501, 502, 514, 518, 535, 553, 573, 625, 626, 629, 640, 641, 642, 660, 681, 682, 683, 684]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 659 ms to find 48 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 695/2152 places, 1304/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 695 transition count 1220
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 611 transition count 1220
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 168 place count 611 transition count 1197
Deduced a syphon composed of 23 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 215 place count 587 transition count 1197
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 227 place count 583 transition count 1189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 235 place count 575 transition count 1189
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 238 place count 572 transition count 1186
Iterating global reduction 4 with 3 rules applied. Total rules applied 241 place count 572 transition count 1186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 244 place count 572 transition count 1183
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 334 place count 527 transition count 1138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 338 place count 525 transition count 1139
Applied a total of 338 rules in 89 ms. Remains 525 /695 variables (removed 170) and now considering 1139/1304 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16519929395435540184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7288389806567965096.kers'
[2026-05-22 19:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16519929395435540184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7288389806567965096.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1139 rows 525 cols 4582 entries
Finished phase 1 with 159 SingleSign rule and 297 generalized
[2026-05-22 19:15:24] [INFO ] Computed 69 invariants in 8 ms
Computed 69 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7288389806567965096.kers
Total runtime 10 ms.
[2026-05-22 19:15:24] [INFO ] Implicit Places using invariants in 467 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 445, 451, 457, 522]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 469 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/2152 places, 1139/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 512 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 511 transition count 1138
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 503 transition count 1130
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 503 transition count 1130
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 495 transition count 1122
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 495 transition count 1122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 491 transition count 1118
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 491 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 487 transition count 1114
Applied a total of 50 rules in 61 ms. Remains 487 /512 variables (removed 25) and now considering 1114/1139 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3955899799231431248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5320544339963876411.kers'
[2026-05-22 19:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3955899799231431248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5320544339963876411.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1114 rows 487 cols 4489 entries
Finished phase 1 with 151 SingleSign rule and 280 generalized
[2026-05-22 19:15:24] [INFO ] Computed 56 invariants in 7 ms
Computed 56 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5320544339963876411.kers
Total runtime 10 ms.
[2026-05-22 19:15:25] [INFO ] Implicit Places using invariants in 596 ms returned []
[2026-05-22 19:15:25] [INFO ] Invariant cache hit.
[2026-05-22 19:15:26] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1568 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 487/2152 places, 1114/2716 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3730 ms. Remains : 487/2152 places, 1114/2716 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-01
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-01 finished in 3843 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 4 out of 2152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2151 transition count 2320
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 402 rules applied. Total rules applied 797 place count 1756 transition count 2313
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 801 place count 1752 transition count 2313
Performed 578 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 578 Pre rules applied. Total rules applied 801 place count 1752 transition count 1735
Deduced a syphon composed of 578 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 3 with 1210 rules applied. Total rules applied 2011 place count 1120 transition count 1735
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2050 place count 1115 transition count 1701
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2084 place count 1081 transition count 1701
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2084 place count 1081 transition count 1680
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2147 place count 1039 transition count 1680
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2147 place count 1039 transition count 1660
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2187 place count 1019 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2189 place count 1017 transition count 1658
Iterating global reduction 5 with 2 rules applied. Total rules applied 2191 place count 1017 transition count 1658
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2191 place count 1017 transition count 1657
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2193 place count 1016 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2194 place count 1015 transition count 1656
Iterating global reduction 5 with 1 rules applied. Total rules applied 2195 place count 1015 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2196 place count 1014 transition count 1655
Iterating global reduction 5 with 1 rules applied. Total rules applied 2197 place count 1014 transition count 1655
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2539 place count 842 transition count 1485
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2542 place count 839 transition count 1482
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 2546 place count 838 transition count 1482
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2547 place count 838 transition count 1481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2548 place count 837 transition count 1481
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2548 place count 837 transition count 1480
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2550 place count 836 transition count 1480
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2551 place count 835 transition count 1479
Iterating global reduction 7 with 1 rules applied. Total rules applied 2552 place count 835 transition count 1479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2554 place count 835 transition count 1477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2555 place count 834 transition count 1477
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2557 place count 833 transition count 1482
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2559 place count 831 transition count 1480
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2574 place count 821 transition count 1475
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2579 place count 816 transition count 1475
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2579 place count 816 transition count 1460
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2610 place count 800 transition count 1460
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2621 place count 789 transition count 1460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2621 place count 789 transition count 1459
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2623 place count 788 transition count 1459
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2655 place count 772 transition count 1443
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2665 place count 762 transition count 1433
Iterating global reduction 12 with 10 rules applied. Total rules applied 2675 place count 762 transition count 1433
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2680 place count 757 transition count 1428
Iterating global reduction 12 with 5 rules applied. Total rules applied 2685 place count 757 transition count 1428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2690 place count 757 transition count 1423
Applied a total of 2690 rules in 484 ms. Remains 757 /2152 variables (removed 1395) and now considering 1423/2716 (removed 1293) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14198919219439922743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7420714808992605296.kers'
[2026-05-22 19:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14198919219439922743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7420714808992605296.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 1423 rows 740 cols 5551 entries
Finished phase 1 with 173 SingleSign rule and 462 generalized
[2026-05-22 19:15:27] [INFO ] Computed 122 invariants in 11 ms
Computed 122 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-7420714808992605296.kers
Total runtime 24 ms.
[2026-05-22 19:15:27] [INFO ] Implicit Places using invariants in 711 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 186, 206, 258, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 628, 639, 640, 641, 674, 695, 696, 697, 698]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 717 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/2152 places, 1423/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 708 transition count 1339
Reduce places removed 84 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 88 rules applied. Total rules applied 172 place count 624 transition count 1335
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 176 place count 620 transition count 1335
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 176 place count 620 transition count 1308
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 231 place count 592 transition count 1308
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 588 transition count 1300
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 251 place count 580 transition count 1300
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 577 transition count 1297
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 577 transition count 1297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 260 place count 577 transition count 1294
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 342 place count 536 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 534 transition count 1254
Applied a total of 346 rules in 94 ms. Remains 534 /708 variables (removed 174) and now considering 1254/1423 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10969935159305445343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11639553259372766104.kers'
[2026-05-22 19:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10969935159305445343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11639553259372766104.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1254 rows 534 cols 5044 entries
Finished phase 1 with 145 SingleSign rule and 321 generalized
[2026-05-22 19:15:27] [INFO ] Computed 68 invariants in 23 ms
Computed 68 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-11639553259372766104.kers
Total runtime 26 ms.
[2026-05-22 19:15:28] [INFO ] Implicit Places using invariants in 568 ms returned [88, 94, 99, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 531]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 590 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 518/2152 places, 1254/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 518 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 517 transition count 1253
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 507 transition count 1243
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 507 transition count 1243
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 497 transition count 1233
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 497 transition count 1233
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 492 transition count 1228
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 492 transition count 1228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 487 transition count 1223
Applied a total of 62 rules in 59 ms. Remains 487 /518 variables (removed 31) and now considering 1223/1254 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10141281270587887937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2293898081380415071.kers'
[2026-05-22 19:15:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10141281270587887937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2293898081380415071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1223 rows 487 cols 4929 entries
Finished phase 1 with 135 SingleSign rule and 300 generalized
[2026-05-22 19:15:28] [INFO ] Computed 52 invariants in 7 ms
Computed 52 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2293898081380415071.kers
Total runtime 9 ms.
[2026-05-22 19:15:29] [INFO ] Implicit Places using invariants in 509 ms returned []
[2026-05-22 19:15:29] [INFO ] Invariant cache hit.
[2026-05-22 19:15:30] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 487/2152 places, 1223/2716 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3518 ms. Remains : 487/2152 places, 1223/2716 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 72 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-02
Product exploration explored 100000 steps with 1449 reset in 395 ms.
Product exploration explored 100000 steps with 1428 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 30671 steps (429 resets) in 220 ms. (138 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 43 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 36 ms :[(NOT p0)]
Knowledge-based reduction took 229 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 1223/1223 transitions.
Applied a total of 0 rules in 13 ms. Remains 487 /487 variables (removed 0) and now considering 1223/1223 (removed 0) transitions.
[2026-05-22 19:15:31] [INFO ] Invariant cache hit.
[2026-05-22 19:15:31] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-22 19:15:31] [INFO ] Invariant cache hit.
[2026-05-22 19:15:32] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2026-05-22 19:15:32] [INFO ] Redundant transitions in 78 ms returned []
Running 1184 sub problems to find dead transitions.
[2026-05-22 19:15:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1710 variables, and 40 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 1184/1184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
At refinement iteration 3 (OVERLAPS) 3/484 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/1710 variables, and 46 constraints, problems are : Problem set: 0 solved, 1184 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 0/1184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1184 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61943 ms. Remains : 487/487 places, 1223/1223 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (575 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (135 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15981 steps, run visited all 1 properties in 133 ms. (steps per millisecond=120 )
Probabilistic random walk after 15981 steps, saw 9313 distinct states, run finished after 137 ms. (steps per millisecond=116 ) properties seen :1
Knowledge based reduction with 3 factoid took 70 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 59 ms :[(NOT p0)]
Knowledge-based reduction took 557 ms.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 253 ms.
Stack based approach found an accepted trace after 81717 steps with 1140 reset with depth 356 and stack size 356 in 253 ms.
FORMULA ASLink-PT-05b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-05b-LTLFireability-02 finished in 67714 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((X(X((X(p1)||p0)))||G(p2)))))'
Support contains 5 out of 2152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2145 transition count 2702
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2145 transition count 2702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2700
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 2140 transition count 2688
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 2204 ms. Remains 2121 /2152 variables (removed 31) and now considering 2578/2716 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12387523799994051348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3858263597005759682.kers'
[2026-05-22 19:16:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12387523799994051348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3858263597005759682.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:16:36] [INFO ] Computed 227 invariants in 18 ms
Computed 227 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-3858263597005759682.kers
Total runtime 24 ms.
[2026-05-22 19:16:38] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2026-05-22 19:16:38] [INFO ] Invariant cache hit.
[2026-05-22 19:16:42] [INFO ] Implicit Places using invariants and state equation in 4909 ms returned []
Implicit Place search using SMT with State Equation took 6424 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:16:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60984ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61003ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2152 places, 2578/2716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69642 ms. Remains : 2121/2152 places, 2578/2716 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((X(X((X(p1)||p0)))||G(p2)))))'
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-04
Product exploration explored 100000 steps with 20009 reset in 422 ms.
Product exploration explored 100000 steps with 19952 reset in 388 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (72 resets) in 297 ms. (134 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (10 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
[2026-05-22 19:17:45] [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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 698/771 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1245/2016 variables, 148/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2016 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 105/2121 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2578/4699 variables, 2121/2348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 698/771 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 1245/2016 variables, 148/194 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2016 variables, 2/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2016 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 105/2121 variables, 33/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2121 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2578/4699 variables, 2121/2351 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4699 variables, 4/2355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4699/4699 variables, and 2355 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7868ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 785 place count 1729 transition count 1613
Deduced a syphon composed of 572 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1198 rules applied. Total rules applied 1983 place count 1103 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2021 place count 1098 transition count 1580
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 2054 place count 1065 transition count 1580
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2054 place count 1065 transition count 1559
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 63 rules applied. Total rules applied 2117 place count 1023 transition count 1559
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2117 place count 1023 transition count 1539
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2157 place count 1003 transition count 1539
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 6 with 346 rules applied. Total rules applied 2503 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2507 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2512 place count 824 transition count 1363
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2513 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2514 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2514 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2516 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2518 place count 820 transition count 1359
Iterating global reduction 8 with 2 rules applied. Total rules applied 2520 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2522 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2523 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2525 place count 818 transition count 1362
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2531 place count 818 transition count 1356
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2537 place count 812 transition count 1356
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2542 place count 812 transition count 1351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2547 place count 807 transition count 1351
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2552 place count 807 transition count 1351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2553 place count 806 transition count 1350
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2568 place count 796 transition count 1345
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2573 place count 791 transition count 1345
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 14 Pre rules applied. Total rules applied 2573 place count 791 transition count 1331
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 29 rules applied. Total rules applied 2602 place count 776 transition count 1331
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2608 place count 770 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2608 place count 770 transition count 1330
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2610 place count 769 transition count 1330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2632 place count 758 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2637 place count 753 transition count 1314
Iterating global reduction 15 with 5 rules applied. Total rules applied 2642 place count 753 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2647 place count 753 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2652 place count 748 transition count 1309
Applied a total of 2652 rules in 505 ms. Remains 748 /2121 variables (removed 1373) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 748/2121 places, 1309/2578 transitions.
RANDOM walk for 40000 steps (434 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (86 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 245715 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 245715 steps, saw 51249 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13116803475403358826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15394156629521641552.kers'
[2026-05-22 19:17:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13116803475403358826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15394156629521641552.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1309 rows 736 cols 5145 entries
Finished phase 1 with 199 SingleSign rule and 422 generalized
[2026-05-22 19:17:57] [INFO ] Computed 127 invariants in 10 ms
Computed 127 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15394156629521641552.kers
Total runtime 13 ms.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/139 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/147 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 165/312 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 95/407 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 54/461 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 129/590 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 41/631 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 33/664 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 76/740 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/740 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/742 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 1/743 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/743 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 5/748 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/748 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1309/2057 variables, 748/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2057 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2057 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2057/2057 variables, and 875 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 49/139 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/147 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 165/312 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 95/407 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 54/461 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 129/590 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 41/631 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 33/664 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 76/740 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/740 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/740 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/742 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/742 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 1/743 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/743 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 5/748 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1309/2057 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2057 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2057 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/2057 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2057/2057 variables, and 880 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5805ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1592 ms.
Support contains 5 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 21 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 748/748 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 19 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2026-05-22 19:18:04] [INFO ] Invariant cache hit.
[2026-05-22 19:18:05] [INFO ] Implicit Places using invariants in 617 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 272, 273, 275, 292, 310, 379, 383, 384, 395, 396, 398, 415, 433, 502, 506, 507, 518, 519, 521, 538, 556, 625, 629, 635, 646, 647, 648, 666, 687, 688, 689, 690]
[2026-05-22 19:18:05] [INFO ] Actually due to overlaps returned [666, 648, 48, 169, 292, 415, 538, 31, 152, 275, 398, 521, 149, 272, 395, 518, 646, 687, 150, 273, 396, 519, 647, 688, 1, 18, 260, 261, 383, 384, 506, 507, 629, 66, 187, 310, 433, 556, 689, 19, 635, 690]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 619 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 706/748 places, 1309/1309 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 701 transition count 1217
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 609 transition count 1211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 608 transition count 1211
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 196 place count 608 transition count 1184
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 251 place count 580 transition count 1184
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 263 place count 576 transition count 1176
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 271 place count 568 transition count 1176
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 274 place count 565 transition count 1173
Iterating global reduction 5 with 3 rules applied. Total rules applied 277 place count 565 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 280 place count 565 transition count 1170
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 350 place count 530 transition count 1135
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 355 place count 525 transition count 1130
Iterating global reduction 6 with 5 rules applied. Total rules applied 360 place count 525 transition count 1130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 365 place count 525 transition count 1125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 369 place count 523 transition count 1126
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 379 place count 523 transition count 1116
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 390 place count 512 transition count 1116
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 405 place count 512 transition count 1116
Applied a total of 405 rules in 113 ms. Remains 512 /706 variables (removed 194) and now considering 1116/1309 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10979565955569322311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15628105599627518905.kers'
[2026-05-22 19:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10979565955569322311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15628105599627518905.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1116 rows 511 cols 4561 entries
Finished phase 1 with 146 SingleSign rule and 292 generalized
[2026-05-22 19:18:05] [INFO ] Computed 74 invariants in 25 ms
Computed 74 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-15628105599627518905.kers
Total runtime 27 ms.
[2026-05-22 19:18:06] [INFO ] Implicit Places using invariants in 609 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444]
[2026-05-22 19:18:06] [INFO ] Actually due to overlaps returned [105, 191, 277, 363, 106, 192, 278, 364, 90, 96, 101, 175, 181, 186, 261, 267, 272, 347, 353, 358, 433, 439, 444, 73, 102, 159, 245, 331, 417]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 622 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 483/748 places, 1116/1309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 1096
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 1096
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 458 transition count 1091
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 458 transition count 1091
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 448 transition count 1081
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 448 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 433 transition count 1066
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 433 transition count 1061
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 428 transition count 1061
Applied a total of 110 rules in 114 ms. Remains 428 /483 variables (removed 55) and now considering 1061/1116 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12461746517329882725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6356550926073656513.kers'
[2026-05-22 19:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12461746517329882725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6356550926073656513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1061 rows 428 cols 4338 entries
Finished phase 1 with 94 SingleSign rule and 289 generalized
[2026-05-22 19:18:06] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-6356550926073656513.kers
Total runtime 23 ms.
[2026-05-22 19:18:06] [INFO ] Implicit Places using invariants in 444 ms returned []
[2026-05-22 19:18:06] [INFO ] Invariant cache hit.
[2026-05-22 19:18:07] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 428/748 places, 1061/1309 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2933 ms. Remains : 428/748 places, 1061/1309 transitions.
RANDOM walk for 40000 steps (638 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (153 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (153 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (164 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 253474 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 253474 steps, saw 73147 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2026-05-22 19:18:10] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 30/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/144 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 230/374 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/397 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/401 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 27/428 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1489/1489 variables, and 473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 30/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/144 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 230/374 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 23/397 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/401 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 27/428 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1489 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1489 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1489 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1489/1489 variables, and 477 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3826ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1251 ms.
Support contains 5 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1061/1061 transitions.
Applied a total of 0 rules in 13 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 428/428 places, 1061/1061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1061/1061 transitions.
Applied a total of 0 rules in 12 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
[2026-05-22 19:18:16] [INFO ] Invariant cache hit.
[2026-05-22 19:18:16] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-22 19:18:16] [INFO ] Invariant cache hit.
[2026-05-22 19:18:17] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2026-05-22 19:18:17] [INFO ] Redundant transitions in 34 ms returned []
Running 1032 sub problems to find dead transitions.
[2026-05-22 19:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/1489 variables, and 43 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1489 variables, and 45 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61734 ms. Remains : 428/428 places, 1061/1061 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Running SMT prover for 4 properties.
[2026-05-22 19:19:17] [INFO ] Invariant cache hit.
[2026-05-22 19:19:17] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-22 19:19:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-22 19:19:18] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 24 ms returned sat
[2026-05-22 19:19:18] [INFO ] After 479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-22 19:19:18] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-22 19:19:19] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1404 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 94175 ms.
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 91 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (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-10737077300864675749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14288401381467523653.kers'
[2026-05-22 19:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10737077300864675749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14288401381467523653.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:19:20] [INFO ] Computed 227 invariants in 40 ms
Computed 227 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-14288401381467523653.kers
Total runtime 42 ms.
[2026-05-22 19:19:21] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2026-05-22 19:19:21] [INFO ] Invariant cache hit.
[2026-05-22 19:19:26] [INFO ] Implicit Places using invariants and state equation in 4572 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:19:26] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 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 Int declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60904ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60913ms
Finished structural reductions in LTL mode , in 1 iterations and 67032 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (80 resets) in 238 ms. (167 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
[2026-05-22 19:20:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 698/771 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1245/2016 variables, 148/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2016 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 105/2121 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2578/4699 variables, 2121/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/4699 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 181/181 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 698/771 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1245/2016 variables, 148/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7315ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 785 place count 1729 transition count 1613
Deduced a syphon composed of 572 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1198 rules applied. Total rules applied 1983 place count 1103 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2021 place count 1098 transition count 1580
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 2054 place count 1065 transition count 1580
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2054 place count 1065 transition count 1559
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 63 rules applied. Total rules applied 2117 place count 1023 transition count 1559
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2117 place count 1023 transition count 1539
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2157 place count 1003 transition count 1539
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 6 with 346 rules applied. Total rules applied 2503 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2507 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2512 place count 824 transition count 1363
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2513 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2514 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2514 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2516 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2518 place count 820 transition count 1359
Iterating global reduction 8 with 2 rules applied. Total rules applied 2520 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2522 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2523 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2525 place count 818 transition count 1362
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2531 place count 818 transition count 1356
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2537 place count 812 transition count 1356
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2542 place count 812 transition count 1351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2547 place count 807 transition count 1351
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2552 place count 807 transition count 1351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2553 place count 806 transition count 1350
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2568 place count 796 transition count 1345
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2573 place count 791 transition count 1345
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 14 Pre rules applied. Total rules applied 2573 place count 791 transition count 1331
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 29 rules applied. Total rules applied 2602 place count 776 transition count 1331
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2608 place count 770 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2608 place count 770 transition count 1330
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2610 place count 769 transition count 1330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2632 place count 758 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2637 place count 753 transition count 1314
Iterating global reduction 15 with 5 rules applied. Total rules applied 2642 place count 753 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2647 place count 753 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2652 place count 748 transition count 1309
Applied a total of 2652 rules in 438 ms. Remains 748 /2121 variables (removed 1373) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 748/2121 places, 1309/2578 transitions.
RANDOM walk for 40000 steps (433 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (87 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (84 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 140892 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 3
Probabilistic random walk after 140892 steps, saw 31607 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) 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-7688857227946561904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3217702065652420070.kers'
[2026-05-22 19:20:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7688857227946561904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3217702065652420070.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 1 ms.
// Phase 1: matrix 1309 rows 736 cols 5145 entries
Finished phase 1 with 199 SingleSign rule and 422 generalized
[2026-05-22 19:20:38] [INFO ] Computed 127 invariants in 23 ms
Computed 127 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-3217702065652420070.kers
Total runtime 26 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/139 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/147 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 165/312 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 95/407 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/461 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 129/590 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 41/631 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 33/664 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 76/740 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/740 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/742 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 1/743 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/743 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 5/748 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/748 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1309/2057 variables, 748/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2057 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2057 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2057/2057 variables, and 875 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/139 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/147 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 165/312 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 95/407 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 54/461 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 129/590 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 41/631 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/631 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 33/664 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/664 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 76/740 variables, 15/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/740 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/742 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/742 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/742 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/743 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/743 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 5/748 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1309/2057 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2057 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2057 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2057 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2057/2057 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3111 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4385ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 991 ms.
Support contains 5 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 21 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 748/748 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1309/1309 transitions.
Applied a total of 0 rules in 20 ms. Remains 748 /748 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2026-05-22 19:20:43] [INFO ] Invariant cache hit.
[2026-05-22 19:20:44] [INFO ] Implicit Places using invariants in 700 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 272, 273, 275, 292, 310, 379, 383, 384, 395, 396, 398, 415, 433, 502, 506, 507, 518, 519, 521, 538, 556, 625, 629, 635, 646, 647, 648, 666, 687, 688, 689, 690]
[2026-05-22 19:20:44] [INFO ] Actually due to overlaps returned [666, 648, 48, 169, 292, 415, 538, 31, 152, 275, 398, 521, 149, 272, 395, 518, 646, 687, 150, 273, 396, 519, 647, 688, 1, 18, 260, 261, 383, 384, 506, 507, 629, 66, 187, 310, 433, 556, 689, 19, 635, 690]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 715 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 706/748 places, 1309/1309 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 701 transition count 1217
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 609 transition count 1211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 608 transition count 1211
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 196 place count 608 transition count 1184
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 251 place count 580 transition count 1184
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 263 place count 576 transition count 1176
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 271 place count 568 transition count 1176
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 274 place count 565 transition count 1173
Iterating global reduction 5 with 3 rules applied. Total rules applied 277 place count 565 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 280 place count 565 transition count 1170
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 350 place count 530 transition count 1135
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 355 place count 525 transition count 1130
Iterating global reduction 6 with 5 rules applied. Total rules applied 360 place count 525 transition count 1130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 365 place count 525 transition count 1125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 369 place count 523 transition count 1126
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 379 place count 523 transition count 1116
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 390 place count 512 transition count 1116
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 405 place count 512 transition count 1116
Applied a total of 405 rules in 102 ms. Remains 512 /706 variables (removed 194) and now considering 1116/1309 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11554410102177604370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13664862774667676398.kers'
[2026-05-22 19:20:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11554410102177604370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13664862774667676398.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1116 rows 511 cols 4561 entries
Finished phase 1 with 146 SingleSign rule and 292 generalized
[2026-05-22 19:20:44] [INFO ] Computed 74 invariants in 34 ms
Computed 74 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-13664862774667676398.kers
Total runtime 38 ms.
[2026-05-22 19:20:44] [INFO ] Implicit Places using invariants in 460 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444]
[2026-05-22 19:20:44] [INFO ] Actually due to overlaps returned [105, 191, 277, 363, 106, 192, 278, 364, 90, 96, 101, 175, 181, 186, 261, 267, 272, 347, 353, 358, 433, 439, 444, 73, 102, 159, 245, 331, 417]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 462 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 483/748 places, 1116/1309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 463 transition count 1096
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 463 transition count 1096
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 458 transition count 1091
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 458 transition count 1091
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 448 transition count 1081
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 448 transition count 1066
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 433 transition count 1066
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 433 transition count 1061
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 428 transition count 1061
Applied a total of 110 rules in 63 ms. Remains 428 /483 variables (removed 55) and now considering 1061/1116 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1696273029169322145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16611581720207953379.kers'
[2026-05-22 19:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1696273029169322145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16611581720207953379.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1061 rows 428 cols 4338 entries
Finished phase 1 with 94 SingleSign rule and 289 generalized
[2026-05-22 19:20:45] [INFO ] Computed 45 invariants in 24 ms
Computed 45 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-16611581720207953379.kers
Total runtime 27 ms.
[2026-05-22 19:20:45] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-22 19:20:45] [INFO ] Invariant cache hit.
[2026-05-22 19:20:46] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 428/748 places, 1061/1309 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2672 ms. Remains : 428/748 places, 1061/1309 transitions.
RANDOM walk for 40000 steps (611 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (160 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 335667 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 3
Probabilistic random walk after 335667 steps, saw 95773 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2026-05-22 19:20:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 30/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/144 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 230/374 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 23/397 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/401 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 27/428 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1489/1489 variables, and 473 constraints, problems are : Problem set: 0 solved, 3 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 30/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/144 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 230/374 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 23/397 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/401 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 27/428 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1489 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1489 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1489 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1489/1489 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1905ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 766 ms.
Support contains 3 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1061/1061 transitions.
Applied a total of 0 rules in 12 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 428/428 places, 1061/1061 transitions.
RANDOM walk for 40000 steps (667 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (154 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (157 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 359262 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 2
Probabilistic random walk after 359262 steps, saw 101825 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-22 19:20:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/192 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 52/244 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/260 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 154/414 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/416 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1489 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1489/1489 variables, and 473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/192 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 52/244 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/260 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 154/414 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/416 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/428 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1061/1489 variables, 428/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1489 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1489 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1489 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1489/1489 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1588ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 444 ms.
Support contains 3 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1061/1061 transitions.
Applied a total of 0 rules in 15 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 428/428 places, 1061/1061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1061/1061 transitions.
Applied a total of 0 rules in 13 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
[2026-05-22 19:20:57] [INFO ] Invariant cache hit.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants in 397 ms returned []
[2026-05-22 19:20:57] [INFO ] Invariant cache hit.
[2026-05-22 19:20:59] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2026-05-22 19:20:59] [INFO ] Redundant transitions in 26 ms returned []
Running 1032 sub problems to find dead transitions.
[2026-05-22 19:20:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/1489 variables, and 43 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1489 variables, and 45 constraints, problems are : Problem set: 0 solved, 1032 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1032 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62174 ms. Remains : 428/428 places, 1061/1061 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 428 /428 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Running SMT prover for 2 properties.
[2026-05-22 19:21:59] [INFO ] Invariant cache hit.
[2026-05-22 19:21:59] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 19:21:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2026-05-22 19:21:59] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 24 ms returned sat
[2026-05-22 19:22:00] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 19:22:00] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 19:22:00] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 767 ms.
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Knowledge-based reduction took 93713 ms.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 516 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 20058 reset in 445 ms.
Product exploration explored 100000 steps with 19930 reset in 416 ms.
Spot run failed in 161 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/ltsmin3908152236499306863
[2026-05-22 19:22:02] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3908152236499306863
Running compilation step : cd /tmp/ltsmin3908152236499306863;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3908152236499306863;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3908152236499306863;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 89 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (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-6968292200133379951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11653608129042553549.kers'
[2026-05-22 19:22:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6968292200133379951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11653608129042553549.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:22:06] [INFO ] Computed 227 invariants in 18 ms
Computed 227 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-11653608129042553549.kers
Total runtime 23 ms.
[2026-05-22 19:22:07] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2026-05-22 19:22:07] [INFO ] Invariant cache hit.
[2026-05-22 19:22:13] [INFO ] Implicit Places using invariants and state equation in 5799 ms returned []
Implicit Place search using SMT with State Equation took 7164 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:22:13] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60849ms
Finished structural reductions in LTL mode , in 1 iterations and 68107 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin5596791752346975694
[2026-05-22 19:23:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5596791752346975694
Running compilation step : cd /tmp/ltsmin5596791752346975694;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5596791752346975694;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5596791752346975694;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 19:23:17] [INFO ] Flatten gal took : 74 ms
[2026-05-22 19:23:17] [INFO ] Flatten gal took : 75 ms
[2026-05-22 19:23:17] [INFO ] Time to serialize gal into /tmp/LTL14870642208016637971.gal : 24 ms
[2026-05-22 19:23:17] [INFO ] Time to serialize properties into /tmp/LTL16537978544587798679.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/LTL14870642208016637971.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14348908088399650385.hoa' '-atoms' '/tmp/LTL16537978544587798679.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/LTL16537978544587798679.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14348908088399650385.hoa
Detected timeout of ITS tools.
[2026-05-22 19:23:32] [INFO ] Flatten gal took : 48 ms
[2026-05-22 19:23:32] [INFO ] Flatten gal took : 49 ms
[2026-05-22 19:23:32] [INFO ] Time to serialize gal into /tmp/LTL8311321131375238279.gal : 14 ms
[2026-05-22 19:23:32] [INFO ] Time to serialize properties into /tmp/LTL1741461740612591359.ltl : 4 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/LTL8311321131375238279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1741461740612591359.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(("((p108==0)||(p565==0))")||(X("((p2000==1)&&(p2004==1))")))))||(G("(p244==0)"))))))
Formula 0 simplified : XF(XX(!"((p108==0)||(p565==0))" & X!"((p2000==1)&&(p2004==1))") & F!"(p244==0)")
Detected timeout of ITS tools.
[2026-05-22 19:23:47] [INFO ] Flatten gal took : 46 ms
[2026-05-22 19:23:47] [INFO ] Applying decomposition
[2026-05-22 19:23:47] [INFO ] Flatten gal took : 46 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/graph14546074989919984833.txt' '-o' '/tmp/graph14546074989919984833.bin' '-w' '/tmp/graph14546074989919984833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14546074989919984833.bin' '-l' '-1' '-v' '-w' '/tmp/graph14546074989919984833.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:23:48] [INFO ] Decomposing Gal with order
[2026-05-22 19:23:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:23:48] [INFO ] Removed a total of 1921 redundant transitions.
[2026-05-22 19:23:48] [INFO ] Flatten gal took : 299 ms
[2026-05-22 19:23:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 61 ms.
[2026-05-22 19:23:48] [INFO ] Time to serialize gal into /tmp/LTL15620882197338194479.gal : 54 ms
[2026-05-22 19:23:48] [INFO ] Time to serialize properties into /tmp/LTL15414078691616042295.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/LTL15620882197338194479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15414078691616042295.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(("((i2.u36.p108==0)||(i2.u193.p565==0))")||(X("((i15.i1.i1.u699.p2000==1)&&(i15.i1.i1.u699.p2004==1))")))))||(G("(i2.u77.p...169
Formula 0 simplified : XF(XX(!"((i2.u36.p108==0)||(i2.u193.p565==0))" & X!"((i15.i1.i1.u699.p2000==1)&&(i15.i1.i1.u699.p2004==1))") & F!"(i2.u77.p244==0)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-04 finished in 449699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2151 transition count 2320
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 402 rules applied. Total rules applied 797 place count 1756 transition count 2313
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 801 place count 1752 transition count 2313
Performed 579 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 579 Pre rules applied. Total rules applied 801 place count 1752 transition count 1734
Deduced a syphon composed of 579 places in 2 ms
Ensure Unique test removed 54 places
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1212 rules applied. Total rules applied 2013 place count 1119 transition count 1734
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2052 place count 1114 transition count 1700
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2086 place count 1080 transition count 1700
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2086 place count 1080 transition count 1679
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2149 place count 1038 transition count 1679
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2149 place count 1038 transition count 1659
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2189 place count 1018 transition count 1659
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2192 place count 1015 transition count 1649
Iterating global reduction 5 with 3 rules applied. Total rules applied 2195 place count 1015 transition count 1649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2195 place count 1015 transition count 1648
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2197 place count 1014 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2199 place count 1012 transition count 1639
Iterating global reduction 5 with 2 rules applied. Total rules applied 2201 place count 1012 transition count 1639
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2203 place count 1010 transition count 1630
Iterating global reduction 5 with 2 rules applied. Total rules applied 2205 place count 1010 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2206 place count 1009 transition count 1622
Iterating global reduction 5 with 1 rules applied. Total rules applied 2207 place count 1009 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2208 place count 1008 transition count 1614
Iterating global reduction 5 with 1 rules applied. Total rules applied 2209 place count 1008 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2210 place count 1007 transition count 1606
Iterating global reduction 5 with 1 rules applied. Total rules applied 2211 place count 1007 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2212 place count 1006 transition count 1598
Iterating global reduction 5 with 1 rules applied. Total rules applied 2213 place count 1006 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2214 place count 1005 transition count 1590
Iterating global reduction 5 with 1 rules applied. Total rules applied 2215 place count 1005 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2216 place count 1004 transition count 1582
Iterating global reduction 5 with 1 rules applied. Total rules applied 2217 place count 1004 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2218 place count 1003 transition count 1574
Iterating global reduction 5 with 1 rules applied. Total rules applied 2219 place count 1003 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2220 place count 1002 transition count 1566
Iterating global reduction 5 with 1 rules applied. Total rules applied 2221 place count 1002 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2222 place count 1001 transition count 1558
Iterating global reduction 5 with 1 rules applied. Total rules applied 2223 place count 1001 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2224 place count 1000 transition count 1550
Iterating global reduction 5 with 1 rules applied. Total rules applied 2225 place count 1000 transition count 1550
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2226 place count 999 transition count 1542
Iterating global reduction 5 with 1 rules applied. Total rules applied 2227 place count 999 transition count 1542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2228 place count 998 transition count 1534
Iterating global reduction 5 with 1 rules applied. Total rules applied 2229 place count 998 transition count 1534
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 2571 place count 826 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2574 place count 823 transition count 1361
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 2578 place count 822 transition count 1361
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2579 place count 822 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2580 place count 821 transition count 1360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2580 place count 821 transition count 1359
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2582 place count 820 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2583 place count 819 transition count 1358
Iterating global reduction 7 with 1 rules applied. Total rules applied 2584 place count 819 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2586 place count 819 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2587 place count 818 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2589 place count 817 transition count 1361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2591 place count 815 transition count 1359
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2606 place count 805 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2611 place count 800 transition count 1354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2611 place count 800 transition count 1339
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2642 place count 784 transition count 1339
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2653 place count 773 transition count 1339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2653 place count 773 transition count 1338
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2655 place count 772 transition count 1338
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2687 place count 756 transition count 1322
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2697 place count 746 transition count 1312
Iterating global reduction 12 with 10 rules applied. Total rules applied 2707 place count 746 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2712 place count 741 transition count 1307
Iterating global reduction 12 with 5 rules applied. Total rules applied 2717 place count 741 transition count 1307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2722 place count 741 transition count 1302
Applied a total of 2722 rules in 782 ms. Remains 741 /2152 variables (removed 1411) and now considering 1302/2716 (removed 1414) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7838832385169512353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2729624683846191039.kers'
[2026-05-22 19:24:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7838832385169512353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2729624683846191039.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 2 ms.
// Phase 1: matrix 1302 rows 724 cols 5069 entries
Finished phase 1 with 176 SingleSign rule and 443 generalized
[2026-05-22 19:24:04] [INFO ] Computed 122 invariants in 25 ms
Computed 122 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-2729624683846191039.kers
Total runtime 28 ms.
[2026-05-22 19:24:05] [INFO ] Implicit Places using invariants in 993 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 627, 638, 639, 640, 658, 679, 680, 681, 682]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 692/2152 places, 1302/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 692 transition count 1214
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 604 transition count 1214
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 604 transition count 1187
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 576 transition count 1187
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 572 transition count 1179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 564 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 561 transition count 1176
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 561 transition count 1176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 561 transition count 1173
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 342 place count 520 transition count 1132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 346 place count 518 transition count 1133
Applied a total of 346 rules in 61 ms. Remains 518 /692 variables (removed 174) and now considering 1133/1302 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9556427530987412482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3132979904556965580.kers'
[2026-05-22 19:24:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9556427530987412482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3132979904556965580.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1133 rows 518 cols 4562 entries
Finished phase 1 with 153 SingleSign rule and 297 generalized
[2026-05-22 19:24:05] [INFO ] Computed 68 invariants in 25 ms
Computed 68 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-3132979904556965580.kers
Total runtime 27 ms.
[2026-05-22 19:24:06] [INFO ] Implicit Places using invariants in 541 ms returned [88, 94, 99, 174, 180, 185, 263, 269, 274, 351, 357, 362, 439, 445, 450, 515]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 553 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/2152 places, 1133/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 1132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 491 transition count 1122
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 491 transition count 1122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 481 transition count 1112
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 481 transition count 1112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 476 transition count 1107
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 476 transition count 1107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 471 transition count 1102
Applied a total of 62 rules in 60 ms. Remains 471 /502 variables (removed 31) and now considering 1102/1133 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12747679124569310538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15684508455076907217.kers'
[2026-05-22 19:24:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12747679124569310538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15684508455076907217.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1102 rows 471 cols 4447 entries
Finished phase 1 with 143 SingleSign rule and 276 generalized
[2026-05-22 19:24:06] [INFO ] Computed 52 invariants in 21 ms
Computed 52 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15684508455076907217.kers
Total runtime 22 ms.
[2026-05-22 19:24:06] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-22 19:24:06] [INFO ] Invariant cache hit.
[2026-05-22 19:24:07] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 471/2152 places, 1102/2716 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3925 ms. Remains : 471/2152 places, 1102/2716 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-06
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-06 finished in 4042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((X(p0)||(p1&&X(p2)))))))))'
Support contains 4 out of 2152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2147 transition count 2704
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2147 transition count 2704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 2147 transition count 2702
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 2145 transition count 2693
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 2143 transition count 2691
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 2143 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 2142 transition count 2683
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 2142 transition count 2683
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 2141 transition count 2675
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 2141 transition count 2675
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 2140 transition count 2674
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 2140 transition count 2674
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 2139 transition count 2666
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 2138 transition count 2658
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 2137 transition count 2657
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2657
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 2136 transition count 2649
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2649
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 2135 transition count 2641
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2641
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 2134 transition count 2640
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 2133 transition count 2632
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 2132 transition count 2624
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2131 transition count 2623
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 2130 transition count 2615
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 2129 transition count 2607
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 2128 transition count 2606
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 2127 transition count 2598
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 2126 transition count 2590
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 2125 transition count 2589
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 2124 transition count 2581
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2581
Applied a total of 58 rules in 2153 ms. Remains 2124 /2152 variables (removed 28) and now considering 2581/2716 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4643883247583655768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17582050887171317332.kers'
[2026-05-22 19:24:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4643883247583655768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17582050887171317332.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2581 rows 2124 cols 7978 entries
Finished phase 1 with 1379 SingleSign rule and 518 generalized
[2026-05-22 19:24:10] [INFO ] Computed 227 invariants in 55 ms
Computed 227 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-17582050887171317332.kers
Total runtime 62 ms.
[2026-05-22 19:24:12] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2026-05-22 19:24:12] [INFO ] Invariant cache hit.
[2026-05-22 19:24:18] [INFO ] Implicit Places using invariants and state equation in 6121 ms returned []
Implicit Place search using SMT with State Equation took 7956 ms to find 0 implicit places.
Running 2580 sub problems to find dead transitions.
[2026-05-22 19:24:18] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2123 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2123/4705 variables, and 134 constraints, problems are : Problem set: 0 solved, 2580 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 2580/2580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2123 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2580 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2123/4705 variables, and 134 constraints, problems are : Problem set: 0 solved, 2580 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2124 constraints, PredecessorRefiner: 0/2580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 2580 unsolved
Search for dead transitions found 0 dead transitions in 60901ms
Starting structural reductions in LTL mode, iteration 1 : 2124/2152 places, 2581/2716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71015 ms. Remains : 2124/2152 places, 2581/2716 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((X(p0)||(p1&&X(p2)))))))))'
Stuttering acceptance computed with spot in 401 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-08
Stuttering criterion allowed to conclude after 286 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-08 finished in 71483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 4 out of 2152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2145 transition count 2702
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2145 transition count 2702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 2145 transition count 2700
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 2140 transition count 2688
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2140 transition count 2688
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 2139 transition count 2680
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 2139 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 2121 transition count 2578
Applied a total of 64 rules in 2070 ms. Remains 2121 /2152 variables (removed 31) and now considering 2578/2716 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3407362378514471710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5760649034379605556.kers'
[2026-05-22 19:25:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3407362378514471710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5760649034379605556.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2578 rows 2121 cols 7972 entries
Finished phase 1 with 1376 SingleSign rule and 518 generalized
[2026-05-22 19:25:21] [INFO ] Computed 227 invariants in 55 ms
Computed 227 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-5760649034379605556.kers
Total runtime 58 ms.
[2026-05-22 19:25:23] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2026-05-22 19:25:23] [INFO ] Invariant cache hit.
[2026-05-22 19:25:28] [INFO ] Implicit Places using invariants and state equation in 4959 ms returned []
Implicit Place search using SMT with State Equation took 6871 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2026-05-22 19:25:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 134 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 134/181 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 60829ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2152 places, 2578/2716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69792 ms. Remains : 2121/2152 places, 2578/2716 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-11 finished in 70035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(p1&&X(X(!p0)))||(X(X(!p0))&&G(!p2))))))'
Support contains 5 out of 2152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2146 transition count 2703
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2146 transition count 2703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 2146 transition count 2702
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 2143 transition count 2692
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 2143 transition count 2692
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2141 transition count 2690
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2141 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2140 transition count 2682
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2140 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2139 transition count 2674
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2139 transition count 2674
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2138 transition count 2673
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2138 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2137 transition count 2665
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2137 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2136 transition count 2657
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2136 transition count 2657
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2135 transition count 2656
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2135 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2134 transition count 2648
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2134 transition count 2648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2133 transition count 2640
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2133 transition count 2640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2132 transition count 2639
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2132 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2131 transition count 2631
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2131 transition count 2631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2130 transition count 2623
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2130 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2129 transition count 2622
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2129 transition count 2622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2128 transition count 2614
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2128 transition count 2614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2127 transition count 2606
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2127 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2126 transition count 2605
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2126 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2125 transition count 2597
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2125 transition count 2597
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2124 transition count 2589
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2124 transition count 2589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2123 transition count 2588
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2123 transition count 2588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2122 transition count 2580
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2122 transition count 2580
Applied a total of 61 rules in 2142 ms. Remains 2122 /2152 variables (removed 30) and now considering 2580/2716 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7503786563972919617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7816644891769590649.kers'
[2026-05-22 19:26:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7503786563972919617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7816644891769590649.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2580 rows 2122 cols 7976 entries
Finished phase 1 with 1378 SingleSign rule and 517 generalized
[2026-05-22 19:26:31] [INFO ] Computed 227 invariants in 55 ms
Computed 227 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-7816644891769590649.kers
Total runtime 58 ms.
[2026-05-22 19:26:33] [INFO ] Implicit Places using invariants in 1854 ms returned []
[2026-05-22 19:26:33] [INFO ] Invariant cache hit.
[2026-05-22 19:26:41] [INFO ] Implicit Places using invariants and state equation in 8105 ms returned []
Implicit Place search using SMT with State Equation took 9980 ms to find 0 implicit places.
Running 2579 sub problems to find dead transitions.
[2026-05-22 19:26:41] [INFO ] Invariant cache hit.
(s264 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 6.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 6.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 69.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 9.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 22.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 2.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0timeout
)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 15.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 15.0)
(s288 1.0)
(s289 16.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 9.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 9.0)
(s324 1.0)
(s325 10.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 2.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 12.0)
(s409 2.0)
(s410 1.0)
(s411 3.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 28.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 68.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 9.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 21.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2579/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60927ms problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2152 places, 2580/2716 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73068 ms. Remains : 2122/2152 places, 2580/2716 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(X(p0)))||(X(X(p0))&&G(p2))))))'
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-13
Product exploration explored 100000 steps with 25024 reset in 466 ms.
Product exploration explored 100000 steps with 25164 reset in 463 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 23 factoid took 172 ms. Reduced automaton from 9 states, 45 edges and 3 AP (stutter sensitive) to 9 states, 45 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (78 resets) in 426 ms. (93 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
[2026-05-22 19:27:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 699/807 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2027 variables, 149/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/2027 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2027/4702 variables, and 204 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 149/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 699/807 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2027 variables, 149/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2027 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 10064ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2122 transition count 2191
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 392 rules applied. Total rules applied 781 place count 1733 transition count 2188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 783 place count 1731 transition count 2188
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 572 Pre rules applied. Total rules applied 783 place count 1731 transition count 1616
Deduced a syphon composed of 572 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 3 with 1197 rules applied. Total rules applied 1980 place count 1106 transition count 1616
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 38 rules applied. Total rules applied 2018 place count 1101 transition count 1583
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2051 place count 1068 transition count 1583
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2051 place count 1068 transition count 1562
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2114 place count 1026 transition count 1562
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2114 place count 1026 transition count 1542
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2154 place count 1006 transition count 1542
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 5 with 346 rules applied. Total rules applied 2500 place count 832 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2504 place count 828 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2509 place count 827 transition count 1366
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2510 place count 827 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2511 place count 826 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2511 place count 826 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2513 place count 825 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2515 place count 823 transition count 1362
Iterating global reduction 7 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2519 place count 823 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2520 place count 822 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2522 place count 821 transition count 1365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2523 place count 821 transition count 1364
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2525 place count 820 transition count 1363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2526 place count 819 transition count 1363
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2532 place count 819 transition count 1357
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2538 place count 813 transition count 1357
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 2543 place count 813 transition count 1352
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2548 place count 808 transition count 1352
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2553 place count 808 transition count 1352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2554 place count 807 transition count 1351
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 13 rules applied. Total rules applied 2567 place count 798 transition count 1347
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2571 place count 794 transition count 1347
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 14 Pre rules applied. Total rules applied 2571 place count 794 transition count 1333
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 29 rules applied. Total rules applied 2600 place count 779 transition count 1333
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 15 with 5 rules applied. Total rules applied 2605 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2605 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2607 place count 773 transition count 1332
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 2627 place count 763 transition count 1322
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2631 place count 759 transition count 1318
Iterating global reduction 16 with 4 rules applied. Total rules applied 2635 place count 759 transition count 1318
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2639 place count 759 transition count 1314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2643 place count 755 transition count 1314
Applied a total of 2643 rules in 420 ms. Remains 755 /2122 variables (removed 1367) and now considering 1314/2580 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 755/2122 places, 1314/2580 transitions.
RANDOM walk for 40000 steps (478 resets) in 331 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (89 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (84 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (86 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (87 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (86 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 280418 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 7
Probabilistic random walk after 280418 steps, saw 58010 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) 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-7373276186973366995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14259879029666206787.kers'
[2026-05-22 19:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7373276186973366995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14259879029666206787.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 1314 rows 741 cols 5155 entries
Finished phase 1 with 222 SingleSign rule and 404 generalized
[2026-05-22 19:27:58] [INFO ] Computed 129 invariants in 14 ms
Computed 129 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14259879029666206787.kers
Total runtime 16 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/749 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/749 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 1/750 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/750 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 5/755 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/755 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 1314/2069 variables, 755/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 39 (OVERLAPS) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2069/2069 variables, and 884 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5428 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/749 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/749 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/749 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 1/750 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/750 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 5/755 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/755 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 1314/2069 variables, 755/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2069 variables, 7/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2069 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 0/2069 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2069/2069 variables, and 892 constraints, problems are : Problem set: 0 solved, 7 unsolved in 9756 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15223ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 16464 ms.
Support contains 5 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1314/1314 transitions.
Applied a total of 0 rules in 25 ms. Remains 755 /755 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 755/755 places, 1314/1314 transitions.
RANDOM walk for 40000 steps (488 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (88 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (87 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 284099 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 6
Probabilistic random walk after 284099 steps, saw 58756 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-22 19:28:33] [INFO ] Invariant cache hit.
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) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 2/749 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/749 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 1/750 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/750 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 5/755 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/755 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 1314/2069 variables, 755/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2069/2069 variables, and 884 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3939 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 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) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/747 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 2/749 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/749 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 1/750 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/750 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 5/755 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/755 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 1314/2069 variables, 755/885 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2069 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2069 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/2069 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2069/2069 variables, and 891 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9108 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13073ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6947 ms.
Support contains 5 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1314/1314 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 755/755 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1314/1314 transitions.
Applied a total of 0 rules in 19 ms. Remains 755 /755 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2026-05-22 19:28:53] [INFO ] Invariant cache hit.
[2026-05-22 19:28:54] [INFO ] Implicit Places using invariants in 835 ms returned [1, 18, 19, 31, 48, 67, 136, 140, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 510, 514, 515, 526, 527, 528, 530, 547, 565, 634, 638, 639, 642, 653, 654, 655, 673, 694, 695, 696, 697]
[2026-05-22 19:28:54] [INFO ] Actually due to overlaps returned [673, 655, 48, 170, 293, 399, 416, 547, 31, 153, 276, 530, 150, 273, 396, 527, 653, 694, 151, 274, 397, 528, 654, 695, 1, 18, 261, 262, 384, 385, 514, 515, 638, 639, 67, 188, 311, 434, 526, 565, 696, 19, 642, 697]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 849 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 711/755 places, 1314/1314 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 706 transition count 1223
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 98 rules applied. Total rules applied 194 place count 615 transition count 1216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 197 place count 612 transition count 1216
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 197 place count 612 transition count 1189
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 252 place count 584 transition count 1189
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 264 place count 580 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 272 place count 572 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 275 place count 569 transition count 1178
Iterating global reduction 5 with 3 rules applied. Total rules applied 278 place count 569 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 281 place count 569 transition count 1175
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 353 place count 533 transition count 1139
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 358 place count 528 transition count 1134
Iterating global reduction 6 with 5 rules applied. Total rules applied 363 place count 528 transition count 1134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 368 place count 528 transition count 1129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 372 place count 526 transition count 1130
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 382 place count 526 transition count 1120
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 393 place count 515 transition count 1120
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 408 place count 515 transition count 1120
Applied a total of 408 rules in 97 ms. Remains 515 /711 variables (removed 196) and now considering 1120/1314 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16895207713661061178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4882702009101515787.kers'
[2026-05-22 19:28:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16895207713661061178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4882702009101515787.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1120 rows 514 cols 4560 entries
Finished phase 1 with 169 SingleSign rule and 272 generalized
[2026-05-22 19:28:54] [INFO ] Computed 74 invariants in 22 ms
Computed 74 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-4882702009101515787.kers
Total runtime 26 ms.
[2026-05-22 19:28:55] [INFO ] Implicit Places using invariants in 633 ms returned [75, 91, 97, 100, 102, 103, 108, 161, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 370, 371, 424, 440, 446, 449, 451]
[2026-05-22 19:28:55] [INFO ] Actually due to overlaps returned [193, 279, 370, 108, 194, 280, 371, 91, 97, 102, 177, 183, 188, 263, 269, 274, 349, 355, 360, 440, 446, 451, 75, 103, 161, 247, 333, 424]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 636 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/755 places, 1120/1314 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 467 transition count 1100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 467 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 462 transition count 1095
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 462 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 452 transition count 1085
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 452 transition count 1070
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 437 transition count 1070
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 437 transition count 1065
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 432 transition count 1065
Applied a total of 110 rules in 93 ms. Remains 432 /487 variables (removed 55) and now considering 1065/1120 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11335401365815954450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6887043940749676923.kers'
[2026-05-22 19:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11335401365815954450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6887043940749676923.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1065 rows 432 cols 4353 entries
Finished phase 1 with 109 SingleSign rule and 277 generalized
[2026-05-22 19:28:55] [INFO ] Computed 46 invariants in 23 ms
Computed 46 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-6887043940749676923.kers
Total runtime 26 ms.
[2026-05-22 19:28:55] [INFO ] Implicit Places using invariants in 484 ms returned []
[2026-05-22 19:28:55] [INFO ] Invariant cache hit.
[2026-05-22 19:28:56] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 432/755 places, 1065/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3483 ms. Remains : 432/755 places, 1065/1314 transitions.
RANDOM walk for 40000 steps (709 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (175 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (170 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (146 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (148 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (159 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 231228 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 6
Probabilistic random walk after 231228 steps, saw 57172 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
[2026-05-22 19:29:00] [INFO ] Invariant cache hit.
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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1065/1497 variables, 432/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1497 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1497/1497 variables, and 479 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1065/1497 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 6/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 485 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5824ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 8464 ms.
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 14 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 432/432 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2026-05-22 19:29:14] [INFO ] Invariant cache hit.
[2026-05-22 19:29:15] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-22 19:29:15] [INFO ] Invariant cache hit.
[2026-05-22 19:29:16] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2026-05-22 19:29:16] [INFO ] Redundant transitions in 10 ms returned []
Running 1035 sub problems to find dead transitions.
[2026-05-22 19:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/1497 variables, and 44 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1497 variables, and 44 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61905 ms. Remains : 432/432 places, 1065/1065 transitions.
Knowledge based reduction with 23 factoid took 284 ms. Reduced automaton from 9 states, 45 edges and 3 AP (stutter sensitive) to 9 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 153427 ms.
Stuttering acceptance computed with spot in 530 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Applied a total of 0 rules in 98 ms. Remains 2122 /2122 variables (removed 0) and now considering 2580/2580 (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-8752926826979674876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5541596188178015583.kers'
[2026-05-22 19:30:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8752926826979674876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5541596188178015583.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2580 rows 2122 cols 7976 entries
Finished phase 1 with 1378 SingleSign rule and 517 generalized
[2026-05-22 19:30:18] [INFO ] Computed 227 invariants in 57 ms
Computed 227 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-5541596188178015583.kers
Total runtime 62 ms.
[2026-05-22 19:30:19] [INFO ] Implicit Places using invariants in 1575 ms returned []
[2026-05-22 19:30:19] [INFO ] Invariant cache hit.
[2026-05-22 19:30:27] [INFO ] Implicit Places using invariants and state equation in 8146 ms returned []
Implicit Place search using SMT with State Equation took 9734 ms to find 0 implicit places.
Running 2579 sub problems to find dead transitions.
[2026-05-22 19:30:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2579/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60913ms problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Finished structural reductions in LTL mode , in 1 iterations and 70763 ms. Remains : 2122/2122 places, 2580/2580 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge based reduction with 23 factoid took 169 ms. Reduced automaton from 9 states, 45 edges and 3 AP (stutter sensitive) to 9 states, 45 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (74 resets) in 397 ms. (100 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
[2026-05-22 19:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 699/807 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2027 variables, 149/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/2027 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2027/4702 variables, and 204 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 149/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 103/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 699/807 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1220/2027 variables, 149/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2027 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2027 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2027/4702 variables, and 214 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 149/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10027ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2122 transition count 2191
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 392 rules applied. Total rules applied 781 place count 1733 transition count 2188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 783 place count 1731 transition count 2188
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 572 Pre rules applied. Total rules applied 783 place count 1731 transition count 1616
Deduced a syphon composed of 572 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 3 with 1197 rules applied. Total rules applied 1980 place count 1106 transition count 1616
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 38 rules applied. Total rules applied 2018 place count 1101 transition count 1583
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2051 place count 1068 transition count 1583
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2051 place count 1068 transition count 1562
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2114 place count 1026 transition count 1562
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2114 place count 1026 transition count 1542
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2154 place count 1006 transition count 1542
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 5 with 346 rules applied. Total rules applied 2500 place count 832 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2504 place count 828 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2509 place count 827 transition count 1366
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2510 place count 827 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2511 place count 826 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2511 place count 826 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2513 place count 825 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2515 place count 823 transition count 1362
Iterating global reduction 7 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2519 place count 823 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2520 place count 822 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2522 place count 821 transition count 1365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2523 place count 821 transition count 1364
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2525 place count 820 transition count 1363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2526 place count 819 transition count 1363
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2532 place count 819 transition count 1357
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2538 place count 813 transition count 1357
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 2543 place count 813 transition count 1352
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2548 place count 808 transition count 1352
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2553 place count 808 transition count 1352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2554 place count 807 transition count 1351
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 13 rules applied. Total rules applied 2567 place count 798 transition count 1347
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2571 place count 794 transition count 1347
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 14 Pre rules applied. Total rules applied 2571 place count 794 transition count 1333
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 29 rules applied. Total rules applied 2600 place count 779 transition count 1333
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 15 with 5 rules applied. Total rules applied 2605 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2605 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2607 place count 773 transition count 1332
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 2627 place count 763 transition count 1322
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2631 place count 759 transition count 1318
Iterating global reduction 16 with 4 rules applied. Total rules applied 2635 place count 759 transition count 1318
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2639 place count 759 transition count 1314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2643 place count 755 transition count 1314
Applied a total of 2643 rules in 512 ms. Remains 755 /2122 variables (removed 1367) and now considering 1314/2580 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 755/2122 places, 1314/2580 transitions.
RANDOM walk for 40000 steps (468 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (81 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (86 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (85 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 187319 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 7
Probabilistic random walk after 187319 steps, saw 41222 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) 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-7117522186480660715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13986302505184446925.kers'
[2026-05-22 19:31:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7117522186480660715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13986302505184446925.kers]
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 1 ms.
// Phase 1: matrix 1314 rows 741 cols 5155 entries
Finished phase 1 with 222 SingleSign rule and 404 generalized
[2026-05-22 19:31:43] [INFO ] Computed 129 invariants in 18 ms
Computed 129 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-13986302505184446925.kers
Total runtime 32 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/749 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/749 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 1/750 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/750 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 5/755 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/755 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 1314/2069 variables, 755/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 39 (OVERLAPS) 0/2069 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2069/2069 variables, and 884 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3454 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 53/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 161/226 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 63/289 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/318 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 134/452 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 42/494 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 27/521 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 50/571 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 36/607 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/607 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 1/608 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 61/669 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/669 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 22/691 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 7/698 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 49/747 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/747 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 2/749 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/749 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/749 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 1/750 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/750 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 5/755 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/755 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 1314/2069 variables, 755/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2069 variables, 7/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2069 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 0/2069 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2069/2069 variables, and 892 constraints, problems are : Problem set: 0 solved, 7 unsolved in 16385 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19887ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 24761 ms.
Support contains 5 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1314/1314 transitions.
Applied a total of 0 rules in 27 ms. Remains 755 /755 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 755/755 places, 1314/1314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1314/1314 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 1314/1314 (removed 0) transitions.
[2026-05-22 19:32:27] [INFO ] Invariant cache hit.
[2026-05-22 19:32:28] [INFO ] Implicit Places using invariants in 802 ms returned [1, 18, 19, 31, 48, 67, 136, 140, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 510, 514, 515, 526, 527, 528, 530, 547, 565, 634, 638, 639, 642, 653, 654, 655, 673, 694, 695, 696, 697]
[2026-05-22 19:32:28] [INFO ] Actually due to overlaps returned [673, 655, 48, 170, 293, 399, 416, 547, 31, 153, 276, 530, 150, 273, 396, 527, 653, 694, 151, 274, 397, 528, 654, 695, 1, 18, 261, 262, 384, 385, 514, 515, 638, 639, 67, 188, 311, 434, 526, 565, 696, 19, 642, 697]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 805 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 711/755 places, 1314/1314 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 706 transition count 1223
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 98 rules applied. Total rules applied 194 place count 615 transition count 1216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 197 place count 612 transition count 1216
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 197 place count 612 transition count 1189
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 252 place count 584 transition count 1189
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 264 place count 580 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 272 place count 572 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 275 place count 569 transition count 1178
Iterating global reduction 5 with 3 rules applied. Total rules applied 278 place count 569 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 281 place count 569 transition count 1175
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 353 place count 533 transition count 1139
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 358 place count 528 transition count 1134
Iterating global reduction 6 with 5 rules applied. Total rules applied 363 place count 528 transition count 1134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 368 place count 528 transition count 1129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 372 place count 526 transition count 1130
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 382 place count 526 transition count 1120
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 393 place count 515 transition count 1120
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 408 place count 515 transition count 1120
Applied a total of 408 rules in 110 ms. Remains 515 /711 variables (removed 196) and now considering 1120/1314 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6955220538596453844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9870363589502695784.kers'
[2026-05-22 19:32:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6955220538596453844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9870363589502695784.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1120 rows 514 cols 4560 entries
Finished phase 1 with 169 SingleSign rule and 272 generalized
[2026-05-22 19:32:28] [INFO ] Computed 74 invariants in 9 ms
Computed 74 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9870363589502695784.kers
Total runtime 12 ms.
[2026-05-22 19:32:29] [INFO ] Implicit Places using invariants in 790 ms returned [75, 91, 97, 100, 102, 103, 108, 161, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 370, 371, 424, 440, 446, 449, 451]
[2026-05-22 19:32:29] [INFO ] Actually due to overlaps returned [193, 279, 370, 108, 194, 280, 371, 91, 97, 102, 177, 183, 188, 263, 269, 274, 349, 355, 360, 440, 446, 451, 75, 103, 161, 247, 333, 424]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 791 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/755 places, 1120/1314 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 467 transition count 1100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 467 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 462 transition count 1095
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 462 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 452 transition count 1085
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 452 transition count 1070
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 437 transition count 1070
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 437 transition count 1065
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 432 transition count 1065
Applied a total of 110 rules in 70 ms. Remains 432 /487 variables (removed 55) and now considering 1065/1120 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5244095029488809512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6281792800797563108.kers'
[2026-05-22 19:32:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5244095029488809512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6281792800797563108.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1065 rows 432 cols 4353 entries
Finished phase 1 with 109 SingleSign rule and 277 generalized
[2026-05-22 19:32:29] [INFO ] Computed 46 invariants in 7 ms
Computed 46 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6281792800797563108.kers
Total runtime 8 ms.
[2026-05-22 19:32:30] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-22 19:32:30] [INFO ] Invariant cache hit.
[2026-05-22 19:32:31] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 432/755 places, 1065/1314 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3168 ms. Remains : 432/755 places, 1065/1314 transitions.
RANDOM walk for 40000 steps (707 resets) in 220 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (173 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (163 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (159 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (158 resets) in 58 ms. (678 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (161 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (157 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
[2026-05-22 19:32:31] [INFO ] Invariant cache hit.
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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1065/1497 variables, 432/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1497 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1497/1497 variables, and 479 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1065/1497 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 6/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 485 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3543 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5688ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 4545 ms.
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 14 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 432/432 places, 1065/1065 transitions.
RANDOM walk for 40000 steps (729 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (173 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (152 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (157 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (156 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (152 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (143 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 295206 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 6
Probabilistic random walk after 295206 steps, saw 71910 distinct states, run finished after 3003 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-22 19:32:44] [INFO ] Invariant cache hit.
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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1065/1497 variables, 432/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1497 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1497 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1497/1497 variables, and 479 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 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) 87/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 51/143 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 24/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 185/352 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 29/381 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 51/432 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1065/1497 variables, 432/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1497 variables, 6/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1497 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 485 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3818 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5390ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 8222 ms.
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 432/432 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1065/1065 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2026-05-22 19:32:58] [INFO ] Invariant cache hit.
[2026-05-22 19:32:58] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-22 19:32:58] [INFO ] Invariant cache hit.
[2026-05-22 19:32:59] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2026-05-22 19:32:59] [INFO ] Redundant transitions in 13 ms returned []
Running 1035 sub problems to find dead transitions.
[2026-05-22 19:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/1497 variables, and 44 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (OVERLAPS) 1/432 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/1497 variables, and 46 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60331ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61639 ms. Remains : 432/432 places, 1065/1065 transitions.
Knowledge based reduction with 23 factoid took 223 ms. Reduced automaton from 9 states, 45 edges and 3 AP (stutter sensitive) to 9 states, 45 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 151950 ms.
Stuttering acceptance computed with spot in 560 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24968 reset in 413 ms.
Product exploration explored 100000 steps with 25042 reset in 455 ms.
Spot run failed in 40 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/ltsmin17163905688383604893
[2026-05-22 19:34:02] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17163905688383604893
Running compilation step : cd /tmp/ltsmin17163905688383604893;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17163905688383604893;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17163905688383604893;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2580/2580 transitions.
Applied a total of 0 rules in 96 ms. Remains 2122 /2122 variables (removed 0) and now considering 2580/2580 (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-5727392287389108871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8749743886978955638.kers'
[2026-05-22 19:34:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5727392287389108871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8749743886978955638.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2580 rows 2122 cols 7976 entries
Finished phase 1 with 1378 SingleSign rule and 517 generalized
[2026-05-22 19:34:05] [INFO ] Computed 227 invariants in 31 ms
Computed 227 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-8749743886978955638.kers
Total runtime 37 ms.
[2026-05-22 19:34:07] [INFO ] Implicit Places using invariants in 1311 ms returned []
[2026-05-22 19:34:07] [INFO ] Invariant cache hit.
[2026-05-22 19:34:14] [INFO ] Implicit Places using invariants and state equation in 7739 ms returned []
Implicit Place search using SMT with State Equation took 9081 ms to find 0 implicit places.
Running 2579 sub problems to find dead transitions.
[2026-05-22 19:34:14] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2579/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4702 variables, and 133 constraints, problems are : Problem set: 0 solved, 2579 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/48 constraints, Generalized P Invariants (flows): 133/179 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60924ms problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Finished structural reductions in LTL mode , in 1 iterations and 70125 ms. Remains : 2122/2122 places, 2580/2580 transitions.
Built C files in :
/tmp/ltsmin489151208336044023
[2026-05-22 19:35:15] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin489151208336044023
Running compilation step : cd /tmp/ltsmin489151208336044023;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin489151208336044023;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin489151208336044023;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 19:35:18] [INFO ] Flatten gal took : 55 ms
[2026-05-22 19:35:19] [INFO ] Flatten gal took : 68 ms
[2026-05-22 19:35:19] [INFO ] Time to serialize gal into /tmp/LTL7496758233850839086.gal : 12 ms
[2026-05-22 19:35:19] [INFO ] Time to serialize properties into /tmp/LTL10486463385206219042.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/LTL7496758233850839086.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4946677596835705306.hoa' '-atoms' '/tmp/LTL10486463385206219042.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/LTL10486463385206219042.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4946677596835705306.hoa
Detected timeout of ITS tools.
[2026-05-22 19:35:34] [INFO ] Flatten gal took : 36 ms
[2026-05-22 19:35:34] [INFO ] Flatten gal took : 38 ms
[2026-05-22 19:35:34] [INFO ] Time to serialize gal into /tmp/LTL12726147431884537120.gal : 9 ms
[2026-05-22 19:35:34] [INFO ] Time to serialize properties into /tmp/LTL4179204874509677463.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/LTL12726147431884537120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4179204874509677463.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(F(((G("((p146!=1)||(p435!=1))"))||(("(p1581!=1)")&&(X(X("((p146!=1)||(p435!=1))")))))||((X(X("((p146!=1)||(p435!=1))")))&&(G("((p...180
Formula 0 simplified : G(F!"((p146!=1)||(p435!=1))" & FG((!"(p1581!=1)" | XX!"((p146!=1)||(p435!=1))") & (XX!"((p146!=1)||(p435!=1))" | F!"((p12!=1)||(p74!...163
Detected timeout of ITS tools.
[2026-05-22 19:35:49] [INFO ] Flatten gal took : 42 ms
[2026-05-22 19:35:49] [INFO ] Applying decomposition
[2026-05-22 19:35:49] [INFO ] Flatten gal took : 70 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/graph6132756838750948695.txt' '-o' '/tmp/graph6132756838750948695.bin' '-w' '/tmp/graph6132756838750948695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6132756838750948695.bin' '-l' '-1' '-v' '-w' '/tmp/graph6132756838750948695.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:35:49] [INFO ] Decomposing Gal with order
[2026-05-22 19:35:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:35:49] [INFO ] Removed a total of 1906 redundant transitions.
[2026-05-22 19:35:49] [INFO ] Flatten gal took : 79 ms
[2026-05-22 19:35:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 14 ms.
[2026-05-22 19:35:49] [INFO ] Time to serialize gal into /tmp/LTL1709084433159494473.gal : 19 ms
[2026-05-22 19:35:49] [INFO ] Time to serialize properties into /tmp/LTL7765982404588959755.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/LTL1709084433159494473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7765982404588959755.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("((i2.i1.i0.u47.p146!=1)||(i2.i1.i0.u151.p435!=1))"))||(("(i18.i1.i0.u549.p1581!=1)")&&(X(X("((i2.i1.i0.u47.p146!=1)||(i2.i...294
Formula 0 simplified : G(F!"((i2.i1.i0.u47.p146!=1)||(i2.i1.i0.u151.p435!=1))" & FG((!"(i18.i1.i0.u549.p1581!=1)" | XX!"((i2.i1.i0.u47.p146!=1)||(i2.i1.i0....277
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-13 finished in 575376 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(((p1 U p2)&&p0))))'
Support contains 5 out of 2152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2152/2152 places, 2716/2716 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 393 place count 2151 transition count 2322
Reduce places removed 393 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 400 rules applied. Total rules applied 793 place count 1758 transition count 2315
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 798 place count 1754 transition count 2314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 1753 transition count 2314
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 580 Pre rules applied. Total rules applied 799 place count 1753 transition count 1734
Deduced a syphon composed of 580 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 4 with 1213 rules applied. Total rules applied 2012 place count 1120 transition count 1734
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2051 place count 1115 transition count 1700
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2085 place count 1081 transition count 1700
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2085 place count 1081 transition count 1680
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2145 place count 1041 transition count 1680
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2145 place count 1041 transition count 1661
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2183 place count 1022 transition count 1661
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2186 place count 1019 transition count 1651
Iterating global reduction 6 with 3 rules applied. Total rules applied 2189 place count 1019 transition count 1651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2189 place count 1019 transition count 1650
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2191 place count 1018 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2193 place count 1016 transition count 1641
Iterating global reduction 6 with 2 rules applied. Total rules applied 2195 place count 1016 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2197 place count 1014 transition count 1632
Iterating global reduction 6 with 2 rules applied. Total rules applied 2199 place count 1014 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2200 place count 1013 transition count 1624
Iterating global reduction 6 with 1 rules applied. Total rules applied 2201 place count 1013 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2202 place count 1012 transition count 1616
Iterating global reduction 6 with 1 rules applied. Total rules applied 2203 place count 1012 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2204 place count 1011 transition count 1608
Iterating global reduction 6 with 1 rules applied. Total rules applied 2205 place count 1011 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2206 place count 1010 transition count 1600
Iterating global reduction 6 with 1 rules applied. Total rules applied 2207 place count 1010 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2208 place count 1009 transition count 1592
Iterating global reduction 6 with 1 rules applied. Total rules applied 2209 place count 1009 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2210 place count 1008 transition count 1584
Iterating global reduction 6 with 1 rules applied. Total rules applied 2211 place count 1008 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2212 place count 1007 transition count 1576
Iterating global reduction 6 with 1 rules applied. Total rules applied 2213 place count 1007 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2214 place count 1006 transition count 1568
Iterating global reduction 6 with 1 rules applied. Total rules applied 2215 place count 1006 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2216 place count 1005 transition count 1560
Iterating global reduction 6 with 1 rules applied. Total rules applied 2217 place count 1005 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2218 place count 1004 transition count 1552
Iterating global reduction 6 with 1 rules applied. Total rules applied 2219 place count 1004 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2220 place count 1003 transition count 1544
Iterating global reduction 6 with 1 rules applied. Total rules applied 2221 place count 1003 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2222 place count 1002 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 2223 place count 1002 transition count 1536
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 6 with 338 rules applied. Total rules applied 2561 place count 832 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2564 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 2568 place count 828 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2569 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2570 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2570 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2572 place count 826 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2573 place count 825 transition count 1362
Iterating global reduction 8 with 1 rules applied. Total rules applied 2574 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2576 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2577 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2579 place count 823 transition count 1365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2581 place count 821 transition count 1363
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 15 rules applied. Total rules applied 2596 place count 811 transition count 1358
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2601 place count 806 transition count 1358
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2601 place count 806 transition count 1343
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2632 place count 790 transition count 1343
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 2643 place count 779 transition count 1343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2643 place count 779 transition count 1342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2645 place count 778 transition count 1342
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 2677 place count 762 transition count 1326
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 2687 place count 752 transition count 1316
Iterating global reduction 13 with 10 rules applied. Total rules applied 2697 place count 752 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2702 place count 747 transition count 1311
Iterating global reduction 13 with 5 rules applied. Total rules applied 2707 place count 747 transition count 1311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2712 place count 747 transition count 1306
Applied a total of 2712 rules in 740 ms. Remains 747 /2152 variables (removed 1405) and now considering 1306/2716 (removed 1410) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3308805569240959464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-38709902182732367.kers'
[2026-05-22 19:36:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3308805569240959464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-38709902182732367.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 2 ms.
// Phase 1: matrix 1306 rows 730 cols 5082 entries
Finished phase 1 with 178 SingleSign rule and 445 generalized
[2026-05-22 19:36:05] [INFO ] Computed 124 invariants in 30 ms
Computed 124 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-38709902182732367.kers
Total runtime 44 ms.
[2026-05-22 19:36:06] [INFO ] Implicit Places using invariants in 685 ms returned [1, 18, 19, 31, 48, 66, 85, 119, 120, 141, 151, 152, 154, 171, 189, 209, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 398, 415, 433, 453, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 630, 641, 642, 684, 685, 686, 687]
[2026-05-22 19:36:06] [INFO ] Actually due to overlaps returned [48, 171, 293, 415, 537, 31, 151, 154, 273, 276, 395, 398, 517, 520, 641, 684, 152, 274, 396, 518, 642, 685, 1, 18, 260, 261, 382, 383, 504, 505, 626, 627, 686, 19, 66, 85, 141, 189, 209, 311, 331, 433, 453, 555, 575, 630, 687]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 703 ms to find 47 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 700/2152 places, 1306/2716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 700 transition count 1224
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 618 transition count 1224
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 164 place count 618 transition count 1197
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 219 place count 590 transition count 1197
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 223 place count 586 transition count 1197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 226 place count 583 transition count 1194
Iterating global reduction 3 with 3 rules applied. Total rules applied 229 place count 583 transition count 1194
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 580 transition count 1191
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 580 transition count 1191
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 238 place count 577 transition count 1188
Iterating global reduction 3 with 3 rules applied. Total rules applied 241 place count 577 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 244 place count 577 transition count 1185
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 320 place count 539 transition count 1147
Applied a total of 320 rules in 71 ms. Remains 539 /700 variables (removed 161) and now considering 1147/1306 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15430035434890452211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9166302442827437749.kers'
[2026-05-22 19:36:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15430035434890452211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9166302442827437749.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1147 rows 539 cols 4607 entries
Finished phase 1 with 152 SingleSign rule and 315 generalized
[2026-05-22 19:36:06] [INFO ] Computed 72 invariants in 8 ms
Computed 72 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9166302442827437749.kers
Total runtime 9 ms.
[2026-05-22 19:36:07] [INFO ] Implicit Places using invariants in 503 ms returned [91, 92, 98, 103, 178, 184, 189, 266, 272, 277, 354, 360, 365, 442, 448, 453, 535]
[2026-05-22 19:36:07] [INFO ] Actually due to overlaps returned [91, 98, 103, 178, 184, 189, 266, 272, 277, 354, 360, 365, 442, 448, 453, 535]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 520 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 523/2152 places, 1147/2716 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 514 transition count 1138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 514 transition count 1138
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 505 transition count 1129
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 505 transition count 1129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 501 transition count 1125
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 501 transition count 1125
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 495 transition count 1119
Applied a total of 56 rules in 54 ms. Remains 495 /523 variables (removed 28) and now considering 1119/1147 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3496282578147824208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11486046234442531434.kers'
[2026-05-22 19:36:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3496282578147824208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11486046234442531434.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1119 rows 495 cols 4501 entries
Finished phase 1 with 149 SingleSign rule and 290 generalized
[2026-05-22 19:36:07] [INFO ] Computed 56 invariants in 10 ms
Computed 56 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-11486046234442531434.kers
Total runtime 12 ms.
[2026-05-22 19:36:07] [INFO ] Implicit Places using invariants in 447 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 494/2152 places, 1119/2716 transitions.
Applied a total of 0 rules in 14 ms. Remains 494 /494 variables (removed 0) and now considering 1119/1119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 2550 ms. Remains : 494/2152 places, 1119/2716 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(((p1 U p2)&&p0))))'
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-14
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-14 finished in 2682 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((X(X((X(p1)||p0)))||G(p2)))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(p1&&X(X(!p0)))||(X(X(!p0))&&G(!p2))))))'
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.
[2026-05-22 19:36:07] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3321844453116472725
[2026-05-22 19:36:07] [INFO ] Too many transitions (2716) to apply POR reductions. Disabling POR matrices.
[2026-05-22 19:36:07] [INFO ] Applying decomposition
[2026-05-22 19:36:07] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3321844453116472725
Running compilation step : cd /tmp/ltsmin3321844453116472725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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-22 19:36:07] [INFO ] Flatten gal took : 42 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/graph1175914877101592706.txt' '-o' '/tmp/graph1175914877101592706.bin' '-w' '/tmp/graph1175914877101592706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1175914877101592706.bin' '-l' '-1' '-v' '-w' '/tmp/graph1175914877101592706.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:36:08] [INFO ] Decomposing Gal with order
[2026-05-22 19:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:36:08] [INFO ] Removed a total of 2156 redundant transitions.
[2026-05-22 19:36:08] [INFO ] Flatten gal took : 155 ms
[2026-05-22 19:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 34 ms.
[2026-05-22 19:36:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12756040520507836212.gal : 24 ms
[2026-05-22 19:36:08] [INFO ] Time to serialize properties into /tmp/LTLFireability1750707486053528713.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/LTLFireability12756040520507836212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1750707486053528713.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(G((X(X(("((i1.u36.p108==0)||(i1.u196.p565==0))")||(X("((i18.i1.i1.u702.p2000==1)&&(i18.i1.i1.u702.p2004==1))")))))||(G("(i1.u78.p...169
Formula 0 simplified : XF(XX(!"((i1.u36.p108==0)||(i1.u196.p565==0))" & X!"((i18.i1.i1.u702.p2000==1)&&(i18.i1.i1.u702.p2004==1))") & F!"(i1.u78.p244==0)")
Compilation finished in 6289 ms.
Running link step : cd /tmp/ltsmin3321844453116472725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin3321844453116472725;'/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([]((X(X((X((LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3321844453116472725;'/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([]((X(X((X((LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3321844453116472725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(([](!(LTLAPp3==true))||((LTLAPp4==true)&&X(X(!(LTLAPp3==true))))||(X(X(!(LTLAPp3==true)))&&[](!(LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 20:04:13] [INFO ] Applying decomposition
[2026-05-22 20:04:13] [INFO ] Flatten gal took : 80 ms
[2026-05-22 20:04:14] [INFO ] Decomposing Gal with order
[2026-05-22 20:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:04:14] [INFO ] Removed a total of 1983 redundant transitions.
[2026-05-22 20:04:14] [INFO ] Flatten gal took : 104 ms
[2026-05-22 20:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2947 labels/synchronizations in 91 ms.
[2026-05-22 20:04:14] [INFO ] Time to serialize gal into /tmp/LTLFireability8480842085232767822.gal : 15 ms
[2026-05-22 20:04:14] [INFO ] Time to serialize properties into /tmp/LTLFireability8141281129334802927.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/LTLFireability8480842085232767822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8141281129334802927.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...276
Read 2 LTL properties
Checking formula 0 : !((X(G((X(X(("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u19.p108==0)||(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u68.p565==0))")||(X("((i0.i1.i0...293
Formula 0 simplified : XF(XX(!"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u19.p108==0)||(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u68.p565==0))" & X!"((i0.i1.i0.i0.i...279
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3321844453116472725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(([](!(LTLAPp3==true))||((LTLAPp4==true)&&X(X(!(LTLAPp3==true))))||(X(X(!(LTLAPp3==true)))&&[](!(LTLAPp5==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin3321844453116472725;'/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([]((X(X((X((LTLAPp1==true))||(LTLAPp0==true))))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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