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-177944366200403.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:03 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.6K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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 1.2M 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-08b-LTLCardinality-00
FORMULA_NAME ASLink-PT-08b-LTLCardinality-01
FORMULA_NAME ASLink-PT-08b-LTLCardinality-02
FORMULA_NAME ASLink-PT-08b-LTLCardinality-03
FORMULA_NAME ASLink-PT-08b-LTLCardinality-04
FORMULA_NAME ASLink-PT-08b-LTLCardinality-05
FORMULA_NAME ASLink-PT-08b-LTLCardinality-06
FORMULA_NAME ASLink-PT-08b-LTLCardinality-07
FORMULA_NAME ASLink-PT-08b-LTLCardinality-08
FORMULA_NAME ASLink-PT-08b-LTLCardinality-09
FORMULA_NAME ASLink-PT-08b-LTLCardinality-10
FORMULA_NAME ASLink-PT-08b-LTLCardinality-11
FORMULA_NAME ASLink-PT-08b-LTLCardinality-12
FORMULA_NAME ASLink-PT-08b-LTLCardinality-13
FORMULA_NAME ASLink-PT-08b-LTLCardinality-14
FORMULA_NAME ASLink-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779484142784

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 21:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:09:04] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2026-05-22 21:09:04] [INFO ] Transformed 3618 places.
[2026-05-22 21:09:04] [INFO ] Transformed 4459 transitions.
[2026-05-22 21:09:04] [INFO ] Found NUPN structural information;
[2026-05-22 21:09:04] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 221 place count 3397 transition count 4238
Iterating global reduction 0 with 221 rules applied. Total rules applied 442 place count 3397 transition count 4238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 443 place count 3397 transition count 4237
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 529 place count 3311 transition count 4103
Iterating global reduction 1 with 86 rules applied. Total rules applied 615 place count 3311 transition count 4103
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 642 place count 3311 transition count 4076
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 654 place count 3299 transition count 4064
Iterating global reduction 2 with 12 rules applied. Total rules applied 666 place count 3299 transition count 4064
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 670 place count 3295 transition count 4053
Iterating global reduction 2 with 4 rules applied. Total rules applied 674 place count 3295 transition count 4053
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 677 place count 3292 transition count 4050
Iterating global reduction 2 with 3 rules applied. Total rules applied 680 place count 3292 transition count 4050
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 683 place count 3289 transition count 4040
Iterating global reduction 2 with 3 rules applied. Total rules applied 686 place count 3289 transition count 4040
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 687 place count 3288 transition count 4032
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 3288 transition count 4032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 689 place count 3287 transition count 4031
Iterating global reduction 2 with 1 rules applied. Total rules applied 690 place count 3287 transition count 4031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 691 place count 3286 transition count 4023
Iterating global reduction 2 with 1 rules applied. Total rules applied 692 place count 3286 transition count 4023
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 693 place count 3285 transition count 4015
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 3285 transition count 4015
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 695 place count 3284 transition count 4014
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 3284 transition count 4014
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 697 place count 3283 transition count 4006
Iterating global reduction 2 with 1 rules applied. Total rules applied 698 place count 3283 transition count 4006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 699 place count 3282 transition count 3998
Iterating global reduction 2 with 1 rules applied. Total rules applied 700 place count 3282 transition count 3998
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 701 place count 3281 transition count 3997
Iterating global reduction 2 with 1 rules applied. Total rules applied 702 place count 3281 transition count 3997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 703 place count 3280 transition count 3989
Iterating global reduction 2 with 1 rules applied. Total rules applied 704 place count 3280 transition count 3989
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 705 place count 3279 transition count 3981
Iterating global reduction 2 with 1 rules applied. Total rules applied 706 place count 3279 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 707 place count 3278 transition count 3980
Iterating global reduction 2 with 1 rules applied. Total rules applied 708 place count 3278 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 709 place count 3277 transition count 3972
Iterating global reduction 2 with 1 rules applied. Total rules applied 710 place count 3277 transition count 3972
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 711 place count 3276 transition count 3964
Iterating global reduction 2 with 1 rules applied. Total rules applied 712 place count 3276 transition count 3964
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 713 place count 3275 transition count 3963
Iterating global reduction 2 with 1 rules applied. Total rules applied 714 place count 3275 transition count 3963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 715 place count 3274 transition count 3955
Iterating global reduction 2 with 1 rules applied. Total rules applied 716 place count 3274 transition count 3955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 717 place count 3273 transition count 3947
Iterating global reduction 2 with 1 rules applied. Total rules applied 718 place count 3273 transition count 3947
Applied a total of 718 rules in 6770 ms. Remains 3273 /3618 variables (removed 345) and now considering 3947/4459 (removed 512) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12269056016132985132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13369784245764420079.kers'
[2026-05-22 21:09:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12269056016132985132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13369784245764420079.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3947 rows 3273 cols 12195 entries
Finished phase 1 with 2097 SingleSign rule and 821 generalized
[2026-05-22 21:09:11] [INFO ] Computed 355 invariants in 33 ms
Computed 355 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-13369784245764420079.kers
Total runtime 38 ms.
[2026-05-22 21:09:15] [INFO ] Implicit Places using invariants in 3261 ms returned [3107, 3118, 3129, 3137, 3145, 3153, 3161, 3172, 3180, 3188, 3199]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 3355 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3262/3618 places, 3947/4459 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3250 transition count 3935
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3250 transition count 3935
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 3240 transition count 3925
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 3240 transition count 3925
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 3232 transition count 3917
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 3232 transition count 3917
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 3229 transition count 3914
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 3229 transition count 3914
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 3227 transition count 3912
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 3227 transition count 3912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 3225 transition count 3910
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 3225 transition count 3910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3224 transition count 3909
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 3223 transition count 3908
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3908
Applied a total of 78 rules in 2174 ms. Remains 3223 /3262 variables (removed 39) and now considering 3908/3947 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4667855083026224064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12069101585396468189.kers'
[2026-05-22 21:09:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4667855083026224064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12069101585396468189.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3908 rows 3223 cols 12067 entries
Finished phase 1 with 2090 SingleSign rule and 789 generalized
[2026-05-22 21:09:17] [INFO ] Computed 344 invariants in 80 ms
Computed 344 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-12069101585396468189.kers
Total runtime 88 ms.
[2026-05-22 21:09:20] [INFO ] Implicit Places using invariants in 2786 ms returned []
[2026-05-22 21:09:20] [INFO ] Invariant cache hit.
[2026-05-22 21:09:31] [INFO ] Implicit Places using invariants and state equation in 10989 ms returned []
Implicit Place search using SMT with State Equation took 13784 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3223/3618 places, 3908/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26103 ms. Remains : 3223/3618 places, 3908/4459 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Applied a total of 0 rules in 331 ms. Remains 3223 /3223 variables (removed 0) and now considering 3908/3908 (removed 0) transitions.
[2026-05-22 21:09:31] [INFO ] Invariant cache hit.
[2026-05-22 21:09:33] [INFO ] Implicit Places using invariants in 2419 ms returned []
[2026-05-22 21:09:33] [INFO ] Invariant cache hit.
[2026-05-22 21:09:44] [INFO ] Implicit Places using invariants and state equation in 10738 ms returned []
Implicit Place search using SMT with State Equation took 13178 ms to find 0 implicit places.
Running 3907 sub problems to find dead transitions.
[2026-05-22 21:09:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3222 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3222/7131 variables, and 207 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30149 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3223 constraints, PredecessorRefiner: 3907/3907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3907 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3222 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3222/7131 variables, and 207 constraints, problems are : Problem set: 0 solved, 3907 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3223 constraints, PredecessorRefiner: 0/3907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62291ms problems are : Problem set: 0 solved, 3907 unsolved
Search for dead transitions found 0 dead transitions in 62341ms
Finished structural reductions in LTL mode , in 1 iterations and 75929 ms. Remains : 3223/3223 places, 3908/3908 transitions.
Support contains 22 out of 3223 places after structural reductions.
[2026-05-22 21:10:47] [INFO ] Flatten gal took : 243 ms
[2026-05-22 21:10:47] [INFO ] Flatten gal took : 160 ms
[2026-05-22 21:10:47] [INFO ] Input system was already deterministic with 3908 transitions.
Support contains 20 out of 3223 places (down from 22) after GAL structural reductions.
RANDOM walk for 40000 steps (55 resets) in 1806 ms. (22 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
[2026-05-22 21:10:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1103/1193 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1873/3066 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3066 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 157/3223 variables, 48/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3223 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3908/7131 variables, 3223/3567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7131 variables, 0/3567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/7131 variables, 0/3567 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7131/7131 variables, and 3567 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4644 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 274/274 constraints, State Equation: 3223/3223 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 80/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1103/1193 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1873/3066 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3066 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3066 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 157/3223 variables, 48/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3223/7131 variables, and 345 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 274/274 constraints, State Equation: 0/3223 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9686ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 3223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 3223 transition count 3311
Reduce places removed 597 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 600 rules applied. Total rules applied 1197 place count 2626 transition count 3308
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1200 place count 2624 transition count 3307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1201 place count 2623 transition count 3307
Performed 869 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 869 Pre rules applied. Total rules applied 1201 place count 2623 transition count 2438
Deduced a syphon composed of 869 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 953 places and 0 transitions.
Iterating global reduction 4 with 1822 rules applied. Total rules applied 3023 place count 1670 transition count 2438
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 59 rules applied. Total rules applied 3082 place count 1662 transition count 2387
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 3133 place count 1611 transition count 2387
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3133 place count 1611 transition count 2354
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 99 rules applied. Total rules applied 3232 place count 1545 transition count 2354
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3232 place count 1545 transition count 2322
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3296 place count 1513 transition count 2322
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 258
Deduced a syphon composed of 258 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 6 with 518 rules applied. Total rules applied 3814 place count 1253 transition count 2064
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3818 place count 1249 transition count 2060
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3823 place count 1248 transition count 2060
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 3824 place count 1248 transition count 2059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3825 place count 1247 transition count 2059
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3825 place count 1247 transition count 2058
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3827 place count 1246 transition count 2058
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3829 place count 1244 transition count 2056
Iterating global reduction 8 with 2 rules applied. Total rules applied 3831 place count 1244 transition count 2056
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 3833 place count 1244 transition count 2054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3834 place count 1243 transition count 2054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3836 place count 1242 transition count 2061
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 3846 place count 1242 transition count 2051
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 3856 place count 1232 transition count 2051
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 3863 place count 1232 transition count 2044
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3870 place count 1225 transition count 2044
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3878 place count 1225 transition count 2044
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3879 place count 1224 transition count 2043
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 22 rules applied. Total rules applied 3901 place count 1208 transition count 2037
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 8 rules applied. Total rules applied 3909 place count 1202 transition count 2035
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 3911 place count 1200 transition count 2035
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 25 Pre rules applied. Total rules applied 3911 place count 1200 transition count 2010
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 15 with 51 rules applied. Total rules applied 3962 place count 1174 transition count 2010
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 15 with 9 rules applied. Total rules applied 3971 place count 1165 transition count 2010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3971 place count 1165 transition count 2009
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3973 place count 1164 transition count 2009
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 4003 place count 1149 transition count 1994
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 4011 place count 1141 transition count 1986
Iterating global reduction 16 with 8 rules applied. Total rules applied 4019 place count 1141 transition count 1986
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4027 place count 1141 transition count 1978
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 4035 place count 1133 transition count 1978
Applied a total of 4035 rules in 1167 ms. Remains 1133 /3223 variables (removed 2090) and now considering 1978/3908 (removed 1930) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 1133/3223 places, 1978/3908 transitions.
RANDOM walk for 40000 steps (404 resets) in 482 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (51 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 105 ms. (377 steps per ms) remains 5/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6443511007756055114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5308411316780638242.kers'
[2026-05-22 21:11:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6443511007756055114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5308411316780638242.kers]
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 1 ms.
// Phase 1: matrix 1978 rows 1115 cols 7752 entries
Finished phase 1 with 250 SingleSign rule and 693 generalized
[2026-05-22 21:11:00] [INFO ] Computed 190 invariants in 18 ms
Computed 190 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5308411316780638242.kers
Total runtime 20 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 86/159 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/162 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 250/413 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 129/542 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/548 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/549 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/549 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 200/749 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 77/826 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/826 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 4/830 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/830 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 134/964 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/964 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 85/1049 variables, 12/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1049 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 3/1052 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1052 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/1053 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1053 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 67/1120 variables, 13/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1120 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 11/1131 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1131 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 2/1133 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1133 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 1978/3111 variables, 1133/1323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3111 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 0/3111 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3111/3111 variables, and 1323 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3396 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1133/1133 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 86/159 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/162 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 250/413 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 129/542 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/548 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/549 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 200/749 variables, 34/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/749 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 77/826 variables, 16/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/826 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 4/830 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 134/964 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/964 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 85/1049 variables, 12/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1049 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 3/1052 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1052 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 1/1053 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1053 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 67/1120 variables, 13/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1120 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 11/1131 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1131 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 2/1133 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1133 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 1978/3111 variables, 1133/1324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3111 variables, 5/1329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3111 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 0/3111 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3111/3111 variables, and 1329 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34400 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1133/1133 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37834ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 36468 ms.
Support contains 6 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 1978/1978 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 1133 transition count 1977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1132 transition count 1977
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1132 transition count 1976
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1131 transition count 1976
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1128 transition count 1973
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 1126 transition count 1964
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1126 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 1124 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 1124 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 1122 transition count 1945
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 1122 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1121 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1121 transition count 1943
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1121 transition count 1943
Applied a total of 25 rules in 281 ms. Remains 1121 /1133 variables (removed 12) and now considering 1943/1978 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 1121/1133 places, 1943/1978 transitions.
RANDOM walk for 40000 steps (416 resets) in 382 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (48 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 178014 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 178014 steps, saw 46276 distinct states, run finished after 3010 ms. (steps per millisecond=59 ) 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-9657388637329958836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16349843976654151754.kers'
[2026-05-22 21:12:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9657388637329958836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16349843976654151754.kers]
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 1 ms.
// Phase 1: matrix 1943 rows 1103 cols 7623 entries
Finished phase 1 with 242 SingleSign rule and 689 generalized
[2026-05-22 21:12:18] [INFO ] Computed 190 invariants in 19 ms
Computed 190 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-16349843976654151754.kers
Total runtime 21 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 78/128 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/131 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 175/307 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/369 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 29/398 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 133/531 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 75/606 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/610 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 114/724 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 54/778 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/778 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/780 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/780 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 59/839 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/839 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 26/865 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/865 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 26/891 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/891 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 63/954 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/954 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 26/980 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/980 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 26/1006 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1006 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 42/1048 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1048 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 12/1060 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1060 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 7/1067 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1067 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 46/1113 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1113 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1113 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/1115 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1115 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 1/1116 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1116 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 5/1121 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1121 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 1943/3064 variables, 1121/1312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3064 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 0/3064 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3064/3064 variables, and 1312 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7034 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1121/1121 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 78/128 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/131 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 175/307 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/369 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 29/398 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 133/531 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 75/606 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/610 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 114/724 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 54/778 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/778 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/780 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/780 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 59/839 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/839 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 26/865 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/865 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 26/891 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/891 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 63/954 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/954 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 26/980 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/980 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 26/1006 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1006 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 42/1048 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1048 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 12/1060 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1060 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 7/1067 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1067 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 46/1113 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1113 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1113 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 2/1115 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1115 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 1/1116 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1116 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 5/1121 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1121 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 1943/3064 variables, 1121/1312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3064 variables, 4/1316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/3064 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 0/3064 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3064/3064 variables, and 1316 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37555 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1121/1121 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44640ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33332 ms.
Support contains 6 out of 1121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1121/1121 places, 1943/1943 transitions.
Applied a total of 0 rules in 43 ms. Remains 1121 /1121 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1121/1121 places, 1943/1943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1121/1121 places, 1943/1943 transitions.
Applied a total of 0 rules in 42 ms. Remains 1121 /1121 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
[2026-05-22 21:13:36] [INFO ] Invariant cache hit.
[2026-05-22 21:13:37] [INFO ] Implicit Places using invariants in 982 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 151, 152, 154, 171, 189, 259, 263, 264, 275, 276, 278, 295, 313, 383, 387, 388, 399, 400, 402, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 631, 635, 636, 647, 648, 650, 667, 685, 754, 758, 759, 770, 771, 773, 790, 808, 877, 881, 882, 893, 894, 896, 913, 931, 1000, 1004, 1005, 1008, 1019, 1020, 1021, 1039, 1060, 1061, 1062, 1063]
[2026-05-22 21:13:37] [INFO ] Actually due to overlaps returned [1039, 1021, 48, 171, 295, 419, 525, 542, 667, 790, 913, 31, 154, 278, 402, 650, 773, 896, 151, 275, 399, 522, 647, 770, 893, 1019, 1060, 152, 276, 400, 523, 648, 771, 894, 1020, 1061, 1, 18, 263, 264, 387, 388, 510, 511, 635, 636, 758, 759, 881, 882, 1004, 1005, 66, 189, 313, 437, 560, 685, 808, 931, 1062, 19, 141, 1008, 1063]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 985 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1056/1121 places, 1943/1943 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 1048 transition count 1805
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 146 rules applied. Total rules applied 292 place count 910 transition count 1797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 294 place count 908 transition count 1797
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 294 place count 908 transition count 1758
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 373 place count 868 transition count 1758
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 385 place count 864 transition count 1750
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 393 place count 856 transition count 1750
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 396 place count 853 transition count 1747
Iterating global reduction 5 with 3 rules applied. Total rules applied 399 place count 853 transition count 1747
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 402 place count 853 transition count 1744
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 512 place count 798 transition count 1689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 513 place count 798 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 521 place count 790 transition count 1680
Iterating global reduction 7 with 8 rules applied. Total rules applied 529 place count 790 transition count 1680
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 537 place count 790 transition count 1672
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 541 place count 788 transition count 1673
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 559 place count 788 transition count 1655
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 578 place count 769 transition count 1655
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 579 place count 769 transition count 1654
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 602 place count 769 transition count 1654
Applied a total of 602 rules in 273 ms. Remains 769 /1056 variables (removed 287) and now considering 1654/1943 (removed 289) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14223555211325341045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9287666771435918899.kers'
[2026-05-22 21:13:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14223555211325341045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9287666771435918899.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1654 rows 769 cols 6765 entries
Finished phase 1 with 188 SingleSign rule and 470 generalized
[2026-05-22 21:13:37] [INFO ] Computed 111 invariants in 46 ms
Computed 111 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-9287666771435918899.kers
Total runtime 48 ms.
[2026-05-22 21:13:38] [INFO ] Implicit Places using invariants in 673 ms returned [73, 90, 96, 99, 101, 105, 106, 160, 176, 182, 185, 187, 192, 193, 246, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 365, 366, 418, 435, 441, 447, 452, 453, 506, 522, 528, 531, 533, 538, 539, 592, 608, 614, 617, 619, 624, 625, 678, 694, 700, 703, 705]
[2026-05-22 21:13:38] [INFO ] Actually due to overlaps returned [105, 192, 279, 365, 452, 538, 624, 106, 193, 280, 366, 453, 539, 625, 90, 96, 101, 176, 182, 187, 263, 269, 274, 349, 355, 360, 435, 441, 522, 528, 533, 608, 614, 619, 694, 700, 705, 73, 160, 246, 333, 418, 447, 506, 592, 678]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 677 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 723/1121 places, 1654/1943 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 692 transition count 1623
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 692 transition count 1623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 684 transition count 1615
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 684 transition count 1615
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 0 with 32 rules applied. Total rules applied 110 place count 668 transition count 1599
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 134 place count 668 transition count 1575
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 158 place count 644 transition count 1575
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 644 transition count 1568
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 172 place count 637 transition count 1568
Applied a total of 172 rules in 167 ms. Remains 637 /723 variables (removed 86) and now considering 1568/1654 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12054817388350036681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10619099988955819560.kers'
[2026-05-22 21:13:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12054817388350036681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10619099988955819560.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1568 rows 637 cols 6391 entries
Finished phase 1 with 139 SingleSign rule and 433 generalized
[2026-05-22 21:13:38] [INFO ] Computed 65 invariants in 14 ms
Computed 65 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-10619099988955819560.kers
Total runtime 29 ms.
[2026-05-22 21:13:38] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-05-22 21:13:38] [INFO ] Invariant cache hit.
[2026-05-22 21:13:40] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 637/1121 places, 1568/1943 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4056 ms. Remains : 637/1121 places, 1568/1943 transitions.
Computed a total of 131 stabilizing places and 131 stable 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)||X(X(X(F(p1)))))))'
Support contains 4 out of 3223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 3222 transition count 3308
Reduce places removed 599 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 602 rules applied. Total rules applied 1201 place count 2623 transition count 3305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1203 place count 2621 transition count 3305
Performed 870 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 870 Pre rules applied. Total rules applied 1203 place count 2621 transition count 2435
Deduced a syphon composed of 870 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 954 places and 0 transitions.
Iterating global reduction 3 with 1824 rules applied. Total rules applied 3027 place count 1667 transition count 2435
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3087 place count 1659 transition count 2383
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3139 place count 1607 transition count 2383
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3139 place count 1607 transition count 2350
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3238 place count 1541 transition count 2350
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3238 place count 1541 transition count 2318
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3302 place count 1509 transition count 2318
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3304 place count 1507 transition count 2316
Iterating global reduction 5 with 2 rules applied. Total rules applied 3306 place count 1507 transition count 2316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3306 place count 1507 transition count 2315
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3308 place count 1506 transition count 2315
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3310 place count 1504 transition count 2306
Iterating global reduction 5 with 2 rules applied. Total rules applied 3312 place count 1504 transition count 2306
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3314 place count 1502 transition count 2297
Iterating global reduction 5 with 2 rules applied. Total rules applied 3316 place count 1502 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3317 place count 1501 transition count 2289
Iterating global reduction 5 with 1 rules applied. Total rules applied 3318 place count 1501 transition count 2289
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 5 with 514 rules applied. Total rules applied 3832 place count 1243 transition count 2033
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3836 place count 1239 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3841 place count 1238 transition count 2029
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 3842 place count 1238 transition count 2028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3843 place count 1237 transition count 2028
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3843 place count 1237 transition count 2027
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3845 place count 1236 transition count 2027
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3847 place count 1234 transition count 2025
Iterating global reduction 7 with 2 rules applied. Total rules applied 3849 place count 1234 transition count 2025
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 3851 place count 1234 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3852 place count 1233 transition count 2023
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3853 place count 1232 transition count 2022
Iterating global reduction 9 with 1 rules applied. Total rules applied 3854 place count 1232 transition count 2022
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3855 place count 1231 transition count 2021
Iterating global reduction 9 with 1 rules applied. Total rules applied 3856 place count 1231 transition count 2021
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3858 place count 1230 transition count 2026
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3860 place count 1228 transition count 2024
Reduce places removed 16 places and 0 transitions.
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 9 with 24 rules applied. Total rules applied 3884 place count 1212 transition count 2016
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3892 place count 1204 transition count 2016
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3892 place count 1204 transition count 1992
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3941 place count 1179 transition count 1992
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3958 place count 1162 transition count 1992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3958 place count 1162 transition count 1991
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3960 place count 1161 transition count 1991
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 4010 place count 1136 transition count 1966
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4026 place count 1120 transition count 1950
Iterating global reduction 12 with 16 rules applied. Total rules applied 4042 place count 1120 transition count 1950
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4050 place count 1112 transition count 1942
Iterating global reduction 12 with 8 rules applied. Total rules applied 4058 place count 1112 transition count 1942
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4066 place count 1112 transition count 1934
Applied a total of 4066 rules in 1312 ms. Remains 1112 /3223 variables (removed 2111) and now considering 1934/3908 (removed 1974) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-381068928813929860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11717914247844752895.kers'
[2026-05-22 21:13:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-381068928813929860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11717914247844752895.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 1 ms.
// Phase 1: matrix 1934 rows 1086 cols 7515 entries
Finished phase 1 with 252 SingleSign rule and 678 generalized
[2026-05-22 21:13:41] [INFO ] Computed 182 invariants in 32 ms
Computed 182 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-11717914247844752895.kers
Total runtime 34 ms.
[2026-05-22 21:13:42] [INFO ] Implicit Places using invariants in 967 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 535, 553, 572, 628, 629, 641, 642, 644, 661, 679, 699, 750, 751, 763, 764, 766, 783, 801, 821, 872, 873, 885, 886, 888, 905, 923, 943, 994, 995, 998, 1009, 1010, 1011, 1029, 1050, 1051, 1052, 1053]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 970 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1039/3223 places, 1934/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1039 transition count 1802
Reduce places removed 132 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 265 place count 907 transition count 1801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 906 transition count 1801
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 266 place count 906 transition count 1762
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 345 place count 866 transition count 1762
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 357 place count 862 transition count 1754
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 365 place count 854 transition count 1754
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 368 place count 851 transition count 1751
Iterating global reduction 5 with 3 rules applied. Total rules applied 371 place count 851 transition count 1751
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 374 place count 851 transition count 1748
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 498 place count 789 transition count 1686
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 502 place count 787 transition count 1687
Applied a total of 502 rules in 170 ms. Remains 787 /1039 variables (removed 252) and now considering 1687/1934 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16903837360097894459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14055799618328200582.kers'
[2026-05-22 21:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16903837360097894459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14055799618328200582.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1687 rows 787 cols 6783 entries
Finished phase 1 with 223 SingleSign rule and 460 generalized
[2026-05-22 21:13:42] [INFO ] Computed 104 invariants in 29 ms
Computed 104 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-14055799618328200582.kers
Total runtime 31 ms.
[2026-05-22 21:13:43] [INFO ] Implicit Places using invariants in 664 ms returned [88, 94, 99, 174, 180, 185, 263, 269, 274, 351, 357, 362, 442, 448, 455, 532, 538, 543, 620, 626, 631, 708, 714, 719, 784]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 666 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/3223 places, 1687/3908 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 762 transition count 1686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 1686
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 745 transition count 1670
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 745 transition count 1670
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 49 place count 730 transition count 1655
Iterating global reduction 2 with 15 rules applied. Total rules applied 64 place count 730 transition count 1655
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 722 transition count 1647
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 722 transition count 1647
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 96 place count 714 transition count 1639
Applied a total of 96 rules in 155 ms. Remains 714 /762 variables (removed 48) and now considering 1639/1687 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12362136252862250111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5131422040025064130.kers'
[2026-05-22 21:13:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12362136252862250111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5131422040025064130.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1639 rows 714 cols 6605 entries
Finished phase 1 with 208 SingleSign rule and 427 generalized
[2026-05-22 21:13:43] [INFO ] Computed 79 invariants in 34 ms
Computed 79 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-5131422040025064130.kers
Total runtime 39 ms.
[2026-05-22 21:13:44] [INFO ] Implicit Places using invariants in 613 ms returned []
[2026-05-22 21:13:44] [INFO ] Invariant cache hit.
[2026-05-22 21:13:46] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 714/3223 places, 1639/3908 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5537 ms. Remains : 714/3223 places, 1639/3908 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)||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 7430 reset in 471 ms.
Product exploration explored 100000 steps with 7502 reset in 451 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 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (437 resets) in 258 ms. (154 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (70 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2026-05-22 21:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/185 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/235 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/260 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 341/637 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/659 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/663 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/714 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/714 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1639/2353 variables, 714/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2353 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2353 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2353/2353 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/185 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/235 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/260 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 341/637 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/659 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/663 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/714 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/714 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1639/2353 variables, 714/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2353 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2353 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2353 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2353/2353 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 240 ms.
Support contains 2 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1639/1639 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 714 transition count 1637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 712 transition count 1637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 712 transition count 1636
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 711 transition count 1636
Free-agglomeration rule applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 46 place count 711 transition count 1596
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 94 place count 671 transition count 1588
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 118 place count 671 transition count 1564
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 142 place count 647 transition count 1564
Applied a total of 142 rules in 97 ms. Remains 647 /714 variables (removed 67) and now considering 1564/1639 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 647/714 places, 1564/1639 transitions.
RANDOM walk for 40000 steps (642 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (106 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 312760 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 312760 steps, saw 86982 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) 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-17366276065488867730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6364844345829034365.kers'
[2026-05-22 21:13:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17366276065488867730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6364844345829034365.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1564 rows 647 cols 6578 entries
Finished phase 1 with 191 SingleSign rule and 377 generalized
[2026-05-22 21:13:53] [INFO ] Computed 79 invariants in 42 ms
Computed 79 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-6364844345829034365.kers
Total runtime 45 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/580 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/602 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/606 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/647 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1564/2211 variables, 647/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2211 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2211 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2211/2211 variables, and 726 constraints, problems are : Problem set: 0 solved, 1 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/580 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/602 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/606 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/647 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2211 variables, 647/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2211 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2211 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2211 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2211/2211 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1973ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 2 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 647 /647 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 647/647 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 22 ms. Remains 647 /647 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2026-05-22 21:13:55] [INFO ] Invariant cache hit.
[2026-05-22 21:13:56] [INFO ] Implicit Places using invariants in 729 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 375, 376, 446, 447, 517, 518]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 733 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 633/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 51 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 806 ms. Remains : 633/647 places, 1564/1564 transitions.
RANDOM walk for 40000 steps (654 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (102 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333772 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 333772 steps, saw 92972 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) 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-11701733838235021203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1553571785511200161.kers'
[2026-05-22 21:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11701733838235021203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1553571785511200161.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1564 rows 633 cols 6389 entries
Finished phase 1 with 161 SingleSign rule and 407 generalized
[2026-05-22 21:13:59] [INFO ] Computed 65 invariants in 42 ms
Computed 65 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-1553571785511200161.kers
Total runtime 45 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 300/576 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/598 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/602 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 31/633 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2197/2197 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 300/576 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/598 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/602 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 31/633 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2197/2197 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2634ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 633/633 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 24 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2026-05-22 21:14:02] [INFO ] Invariant cache hit.
[2026-05-22 21:14:02] [INFO ] Implicit Places using invariants in 631 ms returned []
[2026-05-22 21:14:02] [INFO ] Invariant cache hit.
[2026-05-22 21:14:04] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2026-05-22 21:14:04] [INFO ] Redundant transitions in 166 ms returned []
Running 1523 sub problems to find dead transitions.
[2026-05-22 21:14:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2197 variables, and 63 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1523/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
(s471 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2197 variables, and 63 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 1523 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63131 ms. Remains : 633/633 places, 1564/1564 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 29 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:15:05] [INFO ] Invariant cache hit.
[2026-05-22 21:15:05] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2026-05-22 21:15:05] [INFO ] [Real]Absence check using 19 positive and 46 generalized place invariants in 25 ms returned sat
[2026-05-22 21:15:06] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:15:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-22 21:15:06] [INFO ] [Nat]Absence check using 19 positive and 46 generalized place invariants in 21 ms returned sat
[2026-05-22 21:15:06] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:15:06] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:15:07] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1755 ms.
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5359394821408112433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14152327936348399833.kers'
[2026-05-22 21:15:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5359394821408112433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14152327936348399833.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1639 rows 714 cols 6605 entries
Finished phase 1 with 208 SingleSign rule and 427 generalized
[2026-05-22 21:15:07] [INFO ] Computed 79 invariants in 30 ms
Computed 79 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-14152327936348399833.kers
Total runtime 32 ms.
[2026-05-22 21:15:08] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2026-05-22 21:15:09] [INFO ] [Real]Absence check using 19 positive and 60 generalized place invariants in 1022 ms returned sat
[2026-05-22 21:15:22] [INFO ] [Real]Absence check using state equation in 13117 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 95006 ms.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 714 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 714/714 places, 1639/1639 transitions.
Applied a total of 0 rules in 68 ms. Remains 714 /714 variables (removed 0) and now considering 1639/1639 (removed 0) transitions.
[2026-05-22 21:15:22] [INFO ] Invariant cache hit.
[2026-05-22 21:15:23] [INFO ] Implicit Places using invariants in 693 ms returned []
[2026-05-22 21:15:23] [INFO ] Invariant cache hit.
[2026-05-22 21:15:25] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
[2026-05-22 21:15:25] [INFO ] Redundant transitions in 31 ms returned []
Running 1581 sub problems to find dead transitions.
[2026-05-22 21:15:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2353 variables, and 60 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 1581/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2353 variables, and 60 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 0/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1581 unsolved
Search for dead transitions found 0 dead transitions in 60626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63156 ms. Remains : 714/714 places, 1639/1639 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 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (435 resets) in 230 ms. (173 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (73 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2026-05-22 21:16:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/185 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/235 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/260 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 341/637 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/659 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/663 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/714 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/714 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1639/2353 variables, 714/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2353 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2353 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2353/2353 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/185 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/235 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/260 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/296 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 341/637 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/637 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/659 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/663 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/663 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/714 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/714 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1639/2353 variables, 714/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2353 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2353 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2353 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2353/2353 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 2 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1639/1639 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 714 transition count 1637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 712 transition count 1637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 712 transition count 1636
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 711 transition count 1636
Free-agglomeration rule applied 40 times.
Iterating global reduction 2 with 40 rules applied. Total rules applied 46 place count 711 transition count 1596
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 94 place count 671 transition count 1588
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 118 place count 671 transition count 1564
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 142 place count 647 transition count 1564
Applied a total of 142 rules in 89 ms. Remains 647 /714 variables (removed 67) and now considering 1564/1639 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 647/714 places, 1564/1639 transitions.
RANDOM walk for 40000 steps (684 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268599 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268599 steps, saw 73856 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) 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-17585195288519268975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6007921022345724730.kers'
[2026-05-22 21:16:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17585195288519268975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6007921022345724730.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1564 rows 647 cols 6578 entries
Finished phase 1 with 191 SingleSign rule and 377 generalized
[2026-05-22 21:16:31] [INFO ] Computed 79 invariants in 42 ms
Computed 79 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-6007921022345724730.kers
Total runtime 46 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/580 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/602 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/606 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/647 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 1564/2211 variables, 647/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2211 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2211 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2211/2211 variables, and 726 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 304/580 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/580 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/602 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/606 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/647 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/647 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2211 variables, 647/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2211 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2211 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2211 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2211/2211 variables, and 727 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2151ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 2 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 25 ms. Remains 647 /647 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 647/647 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 24 ms. Remains 647 /647 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2026-05-22 21:16:33] [INFO ] Invariant cache hit.
[2026-05-22 21:16:34] [INFO ] Implicit Places using invariants in 669 ms returned [88, 89, 159, 160, 231, 232, 302, 303, 375, 376, 446, 447, 517, 518]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 674 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 633/647 places, 1564/1564 transitions.
Applied a total of 0 rules in 27 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 725 ms. Remains : 633/647 places, 1564/1564 transitions.
RANDOM walk for 40000 steps (697 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (106 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 282993 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282993 steps, saw 77952 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) 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-4422012489715775100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9591666091262989063.kers'
[2026-05-22 21:16:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4422012489715775100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9591666091262989063.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1564 rows 633 cols 6389 entries
Finished phase 1 with 161 SingleSign rule and 407 generalized
[2026-05-22 21:16:37] [INFO ] Computed 65 invariants in 42 ms
Computed 65 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-9591666091262989063.kers
Total runtime 46 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 300/576 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/598 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/602 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 31/633 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2197/2197 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/216 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/240 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/270 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/276 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 300/576 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/598 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/602 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 31/633 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2197 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2197 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2197/2197 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2615ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 633/633 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2026-05-22 21:16:40] [INFO ] Invariant cache hit.
[2026-05-22 21:16:41] [INFO ] Implicit Places using invariants in 615 ms returned []
[2026-05-22 21:16:41] [INFO ] Invariant cache hit.
[2026-05-22 21:16:42] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2174 ms to find 0 implicit places.
[2026-05-22 21:16:42] [INFO ] Redundant transitions in 85 ms returned []
Running 1523 sub problems to find dead transitions.
[2026-05-22 21:16:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2197 variables, and 63 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1523/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2197 variables, and 63 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60591ms problems are : Problem set: 0 solved, 1523 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62884 ms. Remains : 633/633 places, 1564/1564 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 27 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:17:43] [INFO ] Invariant cache hit.
[2026-05-22 21:17:43] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2026-05-22 21:17:43] [INFO ] [Real]Absence check using 19 positive and 46 generalized place invariants in 14 ms returned sat
[2026-05-22 21:17:44] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:17:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2026-05-22 21:17:44] [INFO ] [Nat]Absence check using 19 positive and 46 generalized place invariants in 14 ms returned sat
[2026-05-22 21:17:44] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:17:44] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:17:44] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1477 ms.
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11574655882602233040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5571941176979095053.kers'
[2026-05-22 21:17:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11574655882602233040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5571941176979095053.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1639 rows 714 cols 6605 entries
Finished phase 1 with 208 SingleSign rule and 427 generalized
[2026-05-22 21:17:45] [INFO ] Computed 79 invariants in 43 ms
Computed 79 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-5571941176979095053.kers
Total runtime 47 ms.
[2026-05-22 21:17:46] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2026-05-22 21:17:47] [INFO ] [Real]Absence check using 19 positive and 60 generalized place invariants in 974 ms returned sat
[2026-05-22 21:18:00] [INFO ] [Real]Absence check using state equation in 12982 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 94674 ms.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6597 reset in 394 ms.
Product exploration explored 100000 steps with 6775 reset in 362 ms.
Built C files in :
/tmp/ltsmin6821900275542463806
[2026-05-22 21:18:01] [INFO ] Too many transitions (1639) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:18:01] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6821900275542463806
Running compilation step : cd /tmp/ltsmin6821900275542463806;'/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/ltsmin6821900275542463806;'/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/ltsmin6821900275542463806;'/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 4 out of 714 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 714/714 places, 1639/1639 transitions.
Applied a total of 0 rules in 24 ms. Remains 714 /714 variables (removed 0) and now considering 1639/1639 (removed 0) transitions.
[2026-05-22 21:18:04] [INFO ] Invariant cache hit.
[2026-05-22 21:18:05] [INFO ] Implicit Places using invariants in 681 ms returned []
[2026-05-22 21:18:05] [INFO ] Invariant cache hit.
[2026-05-22 21:18:06] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2026-05-22 21:18:06] [INFO ] Redundant transitions in 58 ms returned []
Running 1581 sub problems to find dead transitions.
[2026-05-22 21:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2353 variables, and 60 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 1581/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2353 variables, and 60 constraints, problems are : Problem set: 0 solved, 1581 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 44/60 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 0/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1581 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62920 ms. Remains : 714/714 places, 1639/1639 transitions.
Built C files in :
/tmp/ltsmin1301582441930010743
[2026-05-22 21:19:07] [INFO ] Too many transitions (1639) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:19:07] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1301582441930010743
Running compilation step : cd /tmp/ltsmin1301582441930010743;'/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/ltsmin1301582441930010743;'/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/ltsmin1301582441930010743;'/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 21:19:10] [INFO ] Flatten gal took : 48 ms
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:19:10] [INFO ] Time to serialize gal into /tmp/LTL14012520083962925036.gal : 16 ms
[2026-05-22 21:19:10] [INFO ] Time to serialize properties into /tmp/LTL2432726069710274134.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/LTL14012520083962925036.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3710209494791420062.hoa' '-atoms' '/tmp/LTL2432726069710274134.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/LTL2432726069710274134.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3710209494791420062.hoa
Detected timeout of ITS tools.
[2026-05-22 21:19:25] [INFO ] Flatten gal took : 43 ms
[2026-05-22 21:19:25] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:19:25] [INFO ] Time to serialize gal into /tmp/LTL16196475544234664891.gal : 9 ms
[2026-05-22 21:19:25] [INFO ] Time to serialize properties into /tmp/LTL18047962341945006645.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/LTL16196475544234664891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18047962341945006645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((p1939==0)&&(p980==1))"))||(X(X(X(F("((p1834==0)&&(p1711==1))"))))))))
Formula 0 simplified : F(G!"((p1939==0)&&(p980==1))" & XXXG!"((p1834==0)&&(p1711==1))")
Detected timeout of ITS tools.
[2026-05-22 21:19:41] [INFO ] Flatten gal took : 54 ms
[2026-05-22 21:19:41] [INFO ] Applying decomposition
[2026-05-22 21:19:41] [INFO ] Flatten gal took : 36 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/graph16533320705588623657.txt' '-o' '/tmp/graph16533320705588623657.bin' '-w' '/tmp/graph16533320705588623657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16533320705588623657.bin' '-l' '-1' '-v' '-w' '/tmp/graph16533320705588623657.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:19:41] [INFO ] Decomposing Gal with order
[2026-05-22 21:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:19:41] [INFO ] Removed a total of 3231 redundant transitions.
[2026-05-22 21:19:41] [INFO ] Flatten gal took : 150 ms
[2026-05-22 21:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 49 ms.
[2026-05-22 21:19:41] [INFO ] Time to serialize gal into /tmp/LTL6590838247456908217.gal : 16 ms
[2026-05-22 21:19:41] [INFO ] Time to serialize properties into /tmp/LTL8626729818459751072.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/LTL6590838247456908217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8626729818459751072.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("((i8.u98.p1939==0)&&(i5.u53.p980==1))"))||(X(X(X(F("((i10.u97.p1834==0)&&(i10.u89.p1711==1))"))))))))
Formula 0 simplified : F(G!"((i8.u98.p1939==0)&&(i5.u53.p980==1))" & XXXG!"((i10.u97.p1834==0)&&(i10.u89.p1711==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLCardinality-05 finished in 376446 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(F(p0))))'
Support contains 2 out of 3223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3218 transition count 3903
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3218 transition count 3903
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3214 transition count 3892
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3214 transition count 3892
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 3212 transition count 3883
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 3212 transition count 3883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 3210 transition count 3881
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 3210 transition count 3881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 3208 transition count 3872
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 3208 transition count 3872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3207 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3207 transition count 3871
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3206 transition count 3870
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3206 transition count 3870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3205 transition count 3869
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3205 transition count 3869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3204 transition count 3868
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3203 transition count 3867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 3202 transition count 3866
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 3202 transition count 3866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 3201 transition count 3865
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 3201 transition count 3865
Applied a total of 44 rules in 3286 ms. Remains 3201 /3223 variables (removed 22) and now considering 3865/3908 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8627128842866273495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6603661840178983157.kers'
[2026-05-22 21:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8627128842866273495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6603661840178983157.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 3865 rows 3201 cols 11923 entries
Finished phase 1 with 2081 SingleSign rule and 776 generalized
[2026-05-22 21:20:00] [INFO ] Computed 344 invariants in 79 ms
Computed 344 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-6603661840178983157.kers
Total runtime 89 ms.
[2026-05-22 21:20:02] [INFO ] Implicit Places using invariants in 2523 ms returned []
[2026-05-22 21:20:02] [INFO ] Invariant cache hit.
[2026-05-22 21:20:11] [INFO ] Implicit Places using invariants and state equation in 9008 ms returned []
Implicit Place search using SMT with State Equation took 11534 ms to find 0 implicit places.
Running 3864 sub problems to find dead transitions.
[2026-05-22 21:20:11] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 3864/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3200 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3864 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/7066 variables, and 207 constraints, problems are : Problem set: 0 solved, 3864 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3201 constraints, PredecessorRefiner: 0/3864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61971ms problems are : Problem set: 0 solved, 3864 unsolved
Search for dead transitions found 0 dead transitions in 61985ms
Starting structural reductions in LTL mode, iteration 1 : 3201/3223 places, 3865/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76826 ms. Remains : 3201/3223 places, 3865/3908 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 643 ms.
Product exploration explored 100000 steps with 33333 reset in 637 ms.
Computed a total of 131 stabilizing places and 131 stable transitions
Computed a total of 131 stabilizing places and 131 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 23 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 48 ms.
FORMULA ASLink-PT-08b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08b-LTLCardinality-07 finished in 78440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 604 transitions
Trivial Post-agglo rules discarded 604 transitions
Performed 604 trivial Post agglomeration. Transition count delta: 604
Iterating post reduction 0 with 604 rules applied. Total rules applied 604 place count 3222 transition count 3303
Reduce places removed 604 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 607 rules applied. Total rules applied 1211 place count 2618 transition count 3300
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1213 place count 2616 transition count 3300
Performed 869 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 869 Pre rules applied. Total rules applied 1213 place count 2616 transition count 2431
Deduced a syphon composed of 869 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 953 places and 0 transitions.
Iterating global reduction 3 with 1822 rules applied. Total rules applied 3035 place count 1663 transition count 2431
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3095 place count 1655 transition count 2379
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3147 place count 1603 transition count 2379
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3147 place count 1603 transition count 2346
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3246 place count 1537 transition count 2346
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3246 place count 1537 transition count 2314
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3310 place count 1505 transition count 2314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3311 place count 1504 transition count 2313
Iterating global reduction 5 with 1 rules applied. Total rules applied 3312 place count 1504 transition count 2313
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3313 place count 1503 transition count 2312
Iterating global reduction 5 with 1 rules applied. Total rules applied 3314 place count 1503 transition count 2312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3315 place count 1502 transition count 2311
Iterating global reduction 5 with 1 rules applied. Total rules applied 3316 place count 1502 transition count 2311
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Deduced a syphon composed of 257 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 5 with 516 rules applied. Total rules applied 3832 place count 1243 transition count 2054
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3836 place count 1239 transition count 2050
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3841 place count 1238 transition count 2050
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 3842 place count 1238 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3843 place count 1237 transition count 2049
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3843 place count 1237 transition count 2048
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3845 place count 1236 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3847 place count 1234 transition count 2046
Iterating global reduction 7 with 2 rules applied. Total rules applied 3849 place count 1234 transition count 2046
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 3851 place count 1234 transition count 2044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3852 place count 1233 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3853 place count 1232 transition count 2043
Iterating global reduction 9 with 1 rules applied. Total rules applied 3854 place count 1232 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3855 place count 1231 transition count 2042
Iterating global reduction 9 with 1 rules applied. Total rules applied 3856 place count 1231 transition count 2042
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3858 place count 1230 transition count 2047
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3859 place count 1230 transition count 2047
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3861 place count 1228 transition count 2045
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 9 with 23 rules applied. Total rules applied 3884 place count 1212 transition count 2038
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 8 rules applied. Total rules applied 3892 place count 1205 transition count 2037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3893 place count 1204 transition count 2037
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 24 Pre rules applied. Total rules applied 3893 place count 1204 transition count 2013
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 49 rules applied. Total rules applied 3942 place count 1179 transition count 2013
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 3959 place count 1162 transition count 2013
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3959 place count 1162 transition count 2012
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3961 place count 1161 transition count 2012
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 13 with 50 rules applied. Total rules applied 4011 place count 1136 transition count 1987
Discarding 16 places :
Symmetric choice reduction at 13 with 16 rule applications. Total rules 4027 place count 1120 transition count 1971
Iterating global reduction 13 with 16 rules applied. Total rules applied 4043 place count 1120 transition count 1971
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 4051 place count 1112 transition count 1963
Iterating global reduction 13 with 8 rules applied. Total rules applied 4059 place count 1112 transition count 1963
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4066 place count 1112 transition count 1956
Applied a total of 4066 rules in 931 ms. Remains 1112 /3223 variables (removed 2111) and now considering 1956/3908 (removed 1952) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7665709301212452683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11262353508136863063.kers'
[2026-05-22 21:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7665709301212452683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11262353508136863063.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 1956 rows 1086 cols 7607 entries
Finished phase 1 with 269 SingleSign rule and 661 generalized
[2026-05-22 21:21:16] [INFO ] Computed 182 invariants in 48 ms
Computed 182 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-11262353508136863063.kers
Total runtime 51 ms.
[2026-05-22 21:21:17] [INFO ] Implicit Places using invariants in 1183 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 326, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 994, 1005, 1006, 1007, 1029, 1050, 1051, 1052, 1053]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1188 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1039/3223 places, 1956/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1039 transition count 1824
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 907 transition count 1824
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 264 place count 907 transition count 1784
Deduced a syphon composed of 40 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 345 place count 866 transition count 1784
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 357 place count 862 transition count 1776
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 365 place count 854 transition count 1776
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 368 place count 851 transition count 1773
Iterating global reduction 4 with 3 rules applied. Total rules applied 371 place count 851 transition count 1773
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 374 place count 851 transition count 1770
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 498 place count 789 transition count 1708
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 787 transition count 1709
Applied a total of 502 rules in 139 ms. Remains 787 /1039 variables (removed 252) and now considering 1709/1956 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17933975983150506982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15192646541099422190.kers'
[2026-05-22 21:21:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17933975983150506982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15192646541099422190.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1709 rows 787 cols 6875 entries
Finished phase 1 with 238 SingleSign rule and 445 generalized
[2026-05-22 21:21:17] [INFO ] Computed 104 invariants in 42 ms
Computed 104 P flows in 43 ms.
Exported basis to /tmp/petrispot-output-15192646541099422190.kers
Total runtime 47 ms.
[2026-05-22 21:21:18] [INFO ] Implicit Places using invariants in 766 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 784]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 770 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/3223 places, 1709/3908 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 762 transition count 1708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 1708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 745 transition count 1692
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 745 transition count 1692
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 729 transition count 1676
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 729 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 721 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 721 transition count 1668
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 713 transition count 1660
Applied a total of 98 rules in 135 ms. Remains 713 /762 variables (removed 49) and now considering 1660/1709 (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-9165562732435715681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14891321885873637977.kers'
[2026-05-22 21:21:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9165562732435715681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14891321885873637977.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1660 rows 713 cols 6694 entries
Finished phase 1 with 222 SingleSign rule and 412 generalized
[2026-05-22 21:21:18] [INFO ] Computed 79 invariants in 40 ms
Computed 79 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-14891321885873637977.kers
Total runtime 44 ms.
[2026-05-22 21:21:19] [INFO ] Implicit Places using invariants in 726 ms returned []
[2026-05-22 21:21:19] [INFO ] Invariant cache hit.
[2026-05-22 21:21:20] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 713/3223 places, 1660/3908 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5659 ms. Remains : 713/3223 places, 1660/3908 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 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-09
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-09 finished in 5833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3219 transition count 3904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3219 transition count 3904
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3216 transition count 3894
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3216 transition count 3894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 3215 transition count 3886
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 3215 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 3214 transition count 3885
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 3214 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 3213 transition count 3877
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 3213 transition count 3877
Applied a total of 20 rules in 1606 ms. Remains 3213 /3223 variables (removed 10) and now considering 3877/3908 (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-5218275945613709810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10227985860494164442.kers'
[2026-05-22 21:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5218275945613709810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10227985860494164442.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3877 rows 3213 cols 11957 entries
Finished phase 1 with 2089 SingleSign rule and 780 generalized
[2026-05-22 21:21:22] [INFO ] Computed 344 invariants in 79 ms
Computed 344 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-10227985860494164442.kers
Total runtime 88 ms.
[2026-05-22 21:21:25] [INFO ] Implicit Places using invariants in 2410 ms returned []
[2026-05-22 21:21:25] [INFO ] Invariant cache hit.
[2026-05-22 21:21:35] [INFO ] Implicit Places using invariants and state equation in 10690 ms returned []
Implicit Place search using SMT with State Equation took 13105 ms to find 0 implicit places.
Running 3876 sub problems to find dead transitions.
[2026-05-22 21:21:35] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3212 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3212/7090 variables, and 207 constraints, problems are : Problem set: 0 solved, 3876 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3213 constraints, PredecessorRefiner: 3876/3876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3876 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3212 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3876 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3212/7090 variables, and 207 constraints, problems are : Problem set: 0 solved, 3876 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3213 constraints, PredecessorRefiner: 0/3876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62106ms problems are : Problem set: 0 solved, 3876 unsolved
Search for dead transitions found 0 dead transitions in 62120ms
Starting structural reductions in LTL mode, iteration 1 : 3213/3223 places, 3877/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76850 ms. Remains : 3213/3223 places, 3877/3908 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-11
Stuttering criterion allowed to conclude after 796 steps with 0 reset in 6 ms.
FORMULA ASLink-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08b-LTLCardinality-11 finished in 77025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(G(p0))||(!p0 U X(!p1)))))'
Support contains 4 out of 3223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3219 transition count 3904
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3219 transition count 3904
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3216 transition count 3894
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3216 transition count 3894
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 3214 transition count 3885
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 3214 transition count 3885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 3212 transition count 3883
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 3212 transition count 3883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 3210 transition count 3874
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 3210 transition count 3874
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 3209 transition count 3873
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 3209 transition count 3873
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 3208 transition count 3872
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 3208 transition count 3872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 3207 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 3207 transition count 3871
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 3206 transition count 3870
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 3206 transition count 3870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 3205 transition count 3869
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 3205 transition count 3869
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 3204 transition count 3868
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 3204 transition count 3868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 3203 transition count 3867
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 3203 transition count 3867
Applied a total of 40 rules in 2792 ms. Remains 3203 /3223 variables (removed 20) and now considering 3867/3908 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-923191969161611686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1658707507985724974.kers'
[2026-05-22 21:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-923191969161611686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1658707507985724974.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3867 rows 3203 cols 11927 entries
Finished phase 1 with 2083 SingleSign rule and 776 generalized
[2026-05-22 21:22:40] [INFO ] Computed 344 invariants in 31 ms
Computed 344 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-1658707507985724974.kers
Total runtime 39 ms.
[2026-05-22 21:22:43] [INFO ] Implicit Places using invariants in 2339 ms returned []
[2026-05-22 21:22:43] [INFO ] Invariant cache hit.
[2026-05-22 21:23:07] [INFO ] Implicit Places using invariants and state equation in 24282 ms returned []
Implicit Place search using SMT with State Equation took 26638 ms to find 0 implicit places.
Running 3866 sub problems to find dead transitions.
[2026-05-22 21:23:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3202 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3866 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3202/7070 variables, and 207 constraints, problems are : Problem set: 0 solved, 3866 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3203 constraints, PredecessorRefiner: 3866/3866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3202 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 3866 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3202/7070 variables, and 207 constraints, problems are : Problem set: 0 solved, 3866 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 0/70 constraints, Generalized P Invariants (flows): 207/274 constraints, State Equation: 0/3203 constraints, PredecessorRefiner: 0/3866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61671ms problems are : Problem set: 0 solved, 3866 unsolved
Search for dead transitions found 0 dead transitions in 61690ms
Starting structural reductions in LTL mode, iteration 1 : 3203/3223 places, 3867/3908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91133 ms. Remains : 3203/3223 places, 3867/3908 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 (X(G(p0))||(!p0 U X(!p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-13
Product exploration explored 100000 steps with 146 reset in 441 ms.
Product exploration explored 100000 steps with 147 reset in 485 ms.
Computed a total of 131 stabilizing places and 131 stable transitions
Computed a total of 131 stabilizing places and 131 stable transitions
Knowledge based reduction with 9 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (57 resets) in 441 ms. (90 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
[2026-05-22 21:24:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1162/1182 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1864/3046 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3046 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 157/3203 variables, 48/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3203 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3867/7070 variables, 3203/3547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/7070 variables, 0/3547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/7070 variables, 0/3547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7070/7070 variables, and 3547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 274/274 constraints, State Equation: 3203/3203 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1162/1182 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1864/3046 variables, 226/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3046 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3046 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 157/3203 variables, 48/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3203 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7070/7070 variables, and 3550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3480 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 274/274 constraints, State Equation: 3203/3203 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5795ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 4 out of 3203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3203/3203 places, 3867/3867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3203 transition count 3272
Reduce places removed 595 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 598 rules applied. Total rules applied 1193 place count 2608 transition count 3269
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1196 place count 2606 transition count 3268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1197 place count 2605 transition count 3268
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 865 Pre rules applied. Total rules applied 1197 place count 2605 transition count 2403
Deduced a syphon composed of 865 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1814 rules applied. Total rules applied 3011 place count 1656 transition count 2403
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 59 rules applied. Total rules applied 3070 place count 1648 transition count 2352
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 3121 place count 1597 transition count 2352
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3121 place count 1597 transition count 2319
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 32 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 3219 place count 1532 transition count 2319
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3219 place count 1532 transition count 2288
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3281 place count 1501 transition count 2288
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 258
Deduced a syphon composed of 258 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 6 with 518 rules applied. Total rules applied 3799 place count 1241 transition count 2030
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3803 place count 1237 transition count 2026
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3808 place count 1236 transition count 2026
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 3809 place count 1236 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3810 place count 1235 transition count 2025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3810 place count 1235 transition count 2024
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3812 place count 1234 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3814 place count 1232 transition count 2022
Iterating global reduction 8 with 2 rules applied. Total rules applied 3816 place count 1232 transition count 2022
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 3818 place count 1232 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3819 place count 1231 transition count 2020
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3821 place count 1230 transition count 2025
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 3830 place count 1230 transition count 2016
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3839 place count 1221 transition count 2016
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3847 place count 1221 transition count 2008
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3855 place count 1213 transition count 2008
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 3863 place count 1213 transition count 2008
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3864 place count 1212 transition count 2007
Reduce places removed 16 places and 0 transitions.
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 12 with 24 rules applied. Total rules applied 3888 place count 1196 transition count 1999
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 3896 place count 1188 transition count 1999
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 24 Pre rules applied. Total rules applied 3896 place count 1188 transition count 1975
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 49 rules applied. Total rules applied 3945 place count 1163 transition count 1975
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 3954 place count 1154 transition count 1975
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3954 place count 1154 transition count 1974
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3956 place count 1153 transition count 1974
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 15 with 34 rules applied. Total rules applied 3990 place count 1136 transition count 1957
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 3998 place count 1128 transition count 1949
Iterating global reduction 15 with 8 rules applied. Total rules applied 4006 place count 1128 transition count 1949
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4014 place count 1128 transition count 1941
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4022 place count 1120 transition count 1941
Applied a total of 4022 rules in 712 ms. Remains 1120 /3203 variables (removed 2083) and now considering 1941/3867 (removed 1926) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 1120/3203 places, 1941/3867 transitions.
RANDOM walk for 40000 steps (402 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (47 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245649 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245649 steps, saw 47959 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-1026980819335505425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9320759422072085024.kers'
[2026-05-22 21:24:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1026980819335505425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9320759422072085024.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 4 ms.
// Phase 1: matrix 1941 rows 1101 cols 7625 entries
Finished phase 1 with 289 SingleSign rule and 640 generalized
[2026-05-22 21:24:20] [INFO ] Computed 191 invariants in 53 ms
Computed 191 P flows in 54 ms.
Exported basis to /tmp/petrispot-output-9320759422072085024.kers
Total runtime 59 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/66 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/84 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/149 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/213 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/242 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 201/443 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/555 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/566 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/567 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 189/756 variables, 29/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/756 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 64/820 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 17/837 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/837 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 147/984 variables, 25/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/984 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 58/1042 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1042 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 27/1069 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1069 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 49/1118 variables, 14/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1118 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1120 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1120 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1941/3061 variables, 1120/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3061 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/3061 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3061/3061 variables, and 1311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1120/1120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/66 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/84 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/149 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/213 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 29/242 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 201/443 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 112/555 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/566 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/567 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/567 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 189/756 variables, 29/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/756 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 64/820 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/820 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 17/837 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/837 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 147/984 variables, 25/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/984 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 58/1042 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1042 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 27/1069 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1069 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 49/1118 variables, 14/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1118 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1120 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1120 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1941/3061 variables, 1120/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3061 variables, 1/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3061 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/3061 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3061/3061 variables, and 1313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1120/1120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3243ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 4 out of 1120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 1941/1941 transitions.
Applied a total of 0 rules in 36 ms. Remains 1120 /1120 variables (removed 0) and now considering 1941/1941 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1120/1120 places, 1941/1941 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 1941/1941 transitions.
Applied a total of 0 rules in 37 ms. Remains 1120 /1120 variables (removed 0) and now considering 1941/1941 (removed 0) transitions.
[2026-05-22 21:24:24] [INFO ] Invariant cache hit.
[2026-05-22 21:24:25] [INFO ] Implicit Places using invariants in 1091 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 481, 504, 508, 509, 520, 521, 523, 540, 558, 628, 632, 633, 645, 646, 648, 665, 683, 752, 756, 757, 768, 769, 771, 788, 806, 875, 879, 880, 891, 892, 894, 911, 929, 999, 1003, 1004, 1007, 1018, 1019, 1020, 1038, 1059, 1060, 1061, 1062]
[2026-05-22 21:24:25] [INFO ] Actually due to overlaps returned [1038, 1020, 48, 168, 291, 414, 540, 665, 788, 911, 31, 151, 274, 397, 523, 648, 771, 894, 148, 271, 394, 520, 645, 768, 891, 1018, 1059, 149, 272, 395, 521, 646, 769, 892, 1019, 1060, 1, 18, 259, 260, 382, 383, 508, 509, 632, 633, 756, 757, 879, 880, 1003, 1004, 66, 186, 309, 432, 558, 683, 806, 929, 1061, 19, 1007, 1062]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1056/1120 places, 1941/1941 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1047 transition count 1802
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 295 place count 908 transition count 1794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 907 transition count 1794
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 296 place count 907 transition count 1755
Deduced a syphon composed of 39 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 375 place count 867 transition count 1755
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 387 place count 863 transition count 1747
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 395 place count 855 transition count 1747
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 398 place count 852 transition count 1744
Iterating global reduction 5 with 3 rules applied. Total rules applied 401 place count 852 transition count 1744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 404 place count 852 transition count 1741
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 512 place count 798 transition count 1687
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 520 place count 790 transition count 1679
Iterating global reduction 6 with 8 rules applied. Total rules applied 528 place count 790 transition count 1679
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 536 place count 790 transition count 1671
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 540 place count 788 transition count 1672
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 557 place count 788 transition count 1655
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 575 place count 770 transition count 1655
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 576 place count 770 transition count 1654
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 600 place count 770 transition count 1654
Applied a total of 600 rules in 231 ms. Remains 770 /1056 variables (removed 286) and now considering 1654/1941 (removed 287) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12570646740463946084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9146818139057940106.kers'
[2026-05-22 21:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12570646740463946084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9146818139057940106.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1654 rows 769 cols 6767 entries
Finished phase 1 with 222 SingleSign rule and 436 generalized
[2026-05-22 21:24:25] [INFO ] Computed 112 invariants in 13 ms
Computed 112 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-9146818139057940106.kers
Total runtime 17 ms.
[2026-05-22 21:24:26] [INFO ] Implicit Places using invariants in 874 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 244, 260, 266, 269, 271, 276, 277, 330, 354, 357, 359, 364, 365, 418, 435, 441, 444, 446, 452, 453, 506, 522, 528, 531, 533, 538, 539, 592, 608, 614, 617, 619, 624, 625, 678, 694, 700, 703, 705]
[2026-05-22 21:24:26] [INFO ] Actually due to overlaps returned [104, 190, 276, 364, 452, 538, 624, 105, 191, 277, 365, 453, 539, 625, 89, 95, 100, 174, 180, 185, 260, 266, 271, 354, 359, 435, 441, 446, 522, 528, 533, 608, 614, 619, 694, 700, 705, 73, 101, 158, 244, 330, 418, 506, 592, 678]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 878 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 724/1120 places, 1654/1941 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 696 transition count 1626
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 696 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 689 transition count 1619
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 689 transition count 1619
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 0 with 32 rules applied. Total rules applied 102 place count 673 transition count 1603
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 125 place count 673 transition count 1580
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 148 place count 650 transition count 1580
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 156 place count 650 transition count 1572
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 164 place count 642 transition count 1572
Applied a total of 164 rules in 154 ms. Remains 642 /724 variables (removed 82) and now considering 1572/1654 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4688875720259363503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12582148766373405308.kers'
[2026-05-22 21:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4688875720259363503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12582148766373405308.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1572 rows 642 cols 6413 entries
Finished phase 1 with 161 SingleSign rule and 415 generalized
[2026-05-22 21:24:26] [INFO ] Computed 66 invariants in 42 ms
Computed 66 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-12582148766373405308.kers
Total runtime 46 ms.
[2026-05-22 21:24:27] [INFO ] Implicit Places using invariants in 620 ms returned []
[2026-05-22 21:24:27] [INFO ] Invariant cache hit.
[2026-05-22 21:24:28] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 642/1120 places, 1572/1941 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4451 ms. Remains : 642/1120 places, 1572/1941 transitions.
RANDOM walk for 40000 steps (644 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (103 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 330487 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 330487 steps, saw 72518 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2026-05-22 21:24:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/148 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/259 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/267 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/439 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 57/496 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 111/607 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/626 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/630 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/642 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/642 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1572/2214 variables, 642/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2214 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2214 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2214/2214 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/148 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 111/259 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/267 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/439 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 57/496 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 111/607 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/626 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/630 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/642 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/642 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1572/2214 variables, 642/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2214 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2214 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2214 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2214/2214 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1291 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2029ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 642 /642 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 642/642 places, 1572/1572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 642 /642 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
[2026-05-22 21:24:33] [INFO ] Invariant cache hit.
[2026-05-22 21:24:34] [INFO ] Implicit Places using invariants in 626 ms returned []
[2026-05-22 21:24:34] [INFO ] Invariant cache hit.
[2026-05-22 21:24:36] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
[2026-05-22 21:24:36] [INFO ] Redundant transitions in 24 ms returned []
Running 1531 sub problems to find dead transitions.
[2026-05-22 21:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/2214 variables, and 64 constraints, problems are : Problem set: 0 solved, 1531 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/642 constraints, PredecessorRefiner: 1531/1531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/2214 variables, and 64 constraints, problems are : Problem set: 0 solved, 1531 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/642 constraints, PredecessorRefiner: 0/1531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1531 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62736 ms. Remains : 642/642 places, 1572/1572 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 29 ms. Remains 642 /642 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:25:36] [INFO ] Invariant cache hit.
[2026-05-22 21:25:36] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:25:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2026-05-22 21:25:36] [INFO ] [Nat]Absence check using 23 positive and 43 generalized place invariants in 19 ms returned sat
[2026-05-22 21:25:37] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:25:37] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:25:37] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1094 ms.
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Knowledge-based reduction took 87846 ms.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Support contains 4 out of 3203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3203/3203 places, 3867/3867 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 3202 transition count 3271
Reduce places removed 595 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 598 rules applied. Total rules applied 1193 place count 2607 transition count 3268
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1196 place count 2605 transition count 3267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1197 place count 2604 transition count 3267
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 865 Pre rules applied. Total rules applied 1197 place count 2604 transition count 2402
Deduced a syphon composed of 865 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1814 rules applied. Total rules applied 3011 place count 1655 transition count 2402
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 59 rules applied. Total rules applied 3070 place count 1647 transition count 2351
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 3121 place count 1596 transition count 2351
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 33 Pre rules applied. Total rules applied 3121 place count 1596 transition count 2318
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 32 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 3219 place count 1531 transition count 2318
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3219 place count 1531 transition count 2287
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3281 place count 1500 transition count 2287
Performed 256 Post agglomeration using F-continuation condition.Transition count delta: 256
Deduced a syphon composed of 256 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 6 with 514 rules applied. Total rules applied 3795 place count 1242 transition count 2031
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3799 place count 1238 transition count 2027
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3804 place count 1237 transition count 2027
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 3805 place count 1237 transition count 2026
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3806 place count 1236 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3806 place count 1236 transition count 2025
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3808 place count 1235 transition count 2025
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3810 place count 1233 transition count 2023
Iterating global reduction 8 with 2 rules applied. Total rules applied 3812 place count 1233 transition count 2023
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 3814 place count 1233 transition count 2021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3815 place count 1232 transition count 2021
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3817 place count 1231 transition count 2026
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3819 place count 1229 transition count 2024
Reduce places removed 16 places and 0 transitions.
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 10 with 24 rules applied. Total rules applied 3843 place count 1213 transition count 2016
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3851 place count 1205 transition count 2016
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 24 Pre rules applied. Total rules applied 3851 place count 1205 transition count 1992
Deduced a syphon composed of 24 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 49 rules applied. Total rules applied 3900 place count 1180 transition count 1992
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 3916 place count 1164 transition count 1992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3916 place count 1164 transition count 1991
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3918 place count 1163 transition count 1991
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 13 with 48 rules applied. Total rules applied 3966 place count 1139 transition count 1967
Discarding 15 places :
Symmetric choice reduction at 13 with 15 rule applications. Total rules 3981 place count 1124 transition count 1952
Iterating global reduction 13 with 15 rules applied. Total rules applied 3996 place count 1124 transition count 1952
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 4004 place count 1116 transition count 1944
Iterating global reduction 13 with 8 rules applied. Total rules applied 4012 place count 1116 transition count 1944
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 4020 place count 1116 transition count 1936
Applied a total of 4020 rules in 773 ms. Remains 1116 /3203 variables (removed 2087) and now considering 1936/3867 (removed 1931) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11578557139501938490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-221518067235328561.kers'
[2026-05-22 21:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11578557139501938490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-221518067235328561.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 4 ms.
// Phase 1: matrix 1936 rows 1091 cols 7535 entries
Finished phase 1 with 262 SingleSign rule and 670 generalized
[2026-05-22 21:25:39] [INFO ] Computed 184 invariants in 55 ms
Computed 184 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-221518067235328561.kers
Total runtime 60 ms.
[2026-05-22 21:25:40] [INFO ] Implicit Places using invariants in 1137 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 479, 503, 504, 516, 517, 519, 536, 554, 574, 626, 627, 640, 641, 643, 660, 678, 698, 749, 750, 762, 763, 765, 782, 800, 820, 871, 872, 884, 885, 887, 904, 922, 942, 991, 997, 998, 1001, 1012, 1014, 1015, 1033, 1054, 1055, 1056, 1057]
[2026-05-22 21:25:40] [INFO ] Actually due to overlaps returned [1033, 1015, 48, 167, 289, 411, 536, 660, 782, 904, 887, 31, 147, 150, 269, 272, 391, 394, 516, 519, 640, 643, 762, 765, 884, 1012, 1054, 148, 270, 392, 517, 641, 763, 885, 1014, 1055, 1, 18, 256, 257, 378, 379, 503, 504, 626, 627, 749, 750, 871, 872, 997, 998, 1056, 19, 66, 86, 137, 185, 205, 307, 327, 429, 449, 554, 574, 678, 698, 800, 820, 922, 942, 991, 1001, 1057]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 74 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1042/3203 places, 1936/3867 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1041 transition count 1805
Reduce places removed 131 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 133 rules applied. Total rules applied 265 place count 910 transition count 1803
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 267 place count 908 transition count 1803
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 267 place count 908 transition count 1764
Deduced a syphon composed of 39 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 346 place count 868 transition count 1764
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 358 place count 864 transition count 1756
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 366 place count 856 transition count 1756
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 369 place count 853 transition count 1753
Iterating global reduction 5 with 3 rules applied. Total rules applied 372 place count 853 transition count 1753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 375 place count 853 transition count 1750
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 501 place count 790 transition count 1687
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 505 place count 788 transition count 1688
Applied a total of 505 rules in 168 ms. Remains 788 /1042 variables (removed 254) and now considering 1688/1936 (removed 248) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13408406284939157331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-952546396508764464.kers'
[2026-05-22 21:25:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13408406284939157331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-952546396508764464.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1688 rows 788 cols 6785 entries
Finished phase 1 with 245 SingleSign rule and 439 generalized
[2026-05-22 21:25:40] [INFO ] Computed 104 invariants in 43 ms
Computed 104 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-952546396508764464.kers
Total runtime 46 ms.
[2026-05-22 21:25:41] [INFO ] Implicit Places using invariants in 832 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 358, 363, 441, 447, 452, 531, 537, 542, 619, 625, 630, 707, 713, 718, 785]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 835 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 764/3203 places, 1688/3867 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 764 transition count 1687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 763 transition count 1687
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 749 transition count 1673
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 749 transition count 1673
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 735 transition count 1659
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 735 transition count 1659
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 728 transition count 1652
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 728 transition count 1652
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 720 transition count 1644
Applied a total of 88 rules in 121 ms. Remains 720 /764 variables (removed 44) and now considering 1644/1688 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15807006199420167189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13947340199888047650.kers'
[2026-05-22 21:25:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15807006199420167189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13947340199888047650.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1644 rows 720 cols 6620 entries
Finished phase 1 with 232 SingleSign rule and 408 generalized
[2026-05-22 21:25:41] [INFO ] Computed 80 invariants in 43 ms
Computed 80 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-13947340199888047650.kers
Total runtime 47 ms.
[2026-05-22 21:25:42] [INFO ] Implicit Places using invariants in 738 ms returned []
[2026-05-22 21:25:42] [INFO ] Invariant cache hit.
[2026-05-22 21:25:43] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 720/3203 places, 1644/3867 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5370 ms. Remains : 720/3203 places, 1644/3867 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 13 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (434 resets) in 234 ms. (170 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (63 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2026-05-22 21:25:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/83 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 167/423 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/433 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 240/673 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/692 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/696 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/696 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/720 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/720 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1644/2364 variables, 720/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2364 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2364 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2364/2364 variables, and 800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 720/720 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/83 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/256 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 167/423 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/433 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 240/673 variables, 34/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/692 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/692 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/696 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/696 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 24/720 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/720 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1644/2364 variables, 720/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2364 variables, 1/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2364 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2364 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2364/2364 variables, and 802 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 720/720 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 1644/1644 transitions.
Free-agglomeration rule applied 39 times.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 720 transition count 1605
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 85 place count 681 transition count 1598
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 110 place count 681 transition count 1573
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 135 place count 656 transition count 1573
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 656 transition count 1572
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 656 transition count 1572
Applied a total of 138 rules in 130 ms. Remains 656 /720 variables (removed 64) and now considering 1572/1644 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 656/720 places, 1572/1644 transitions.
RANDOM walk for 40000 steps (634 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33777 steps (88 resets) in 71 ms. (469 steps per ms) remains 0/1 properties
Knowledge based reduction with 13 factoid took 166 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Knowledge-based reduction took 3214 ms.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), false, false]
Product exploration explored 100000 steps with 1102 reset in 338 ms.
Product exploration explored 100000 steps with 1218 reset in 376 ms.
Built C files in :
/tmp/ltsmin18215847668344955907
[2026-05-22 21:25:48] [INFO ] Too many transitions (1644) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:25:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18215847668344955907
Running compilation step : cd /tmp/ltsmin18215847668344955907;'/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/ltsmin18215847668344955907;'/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/ltsmin18215847668344955907;'/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 4 out of 720 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 720/720 places, 1644/1644 transitions.
Applied a total of 0 rules in 61 ms. Remains 720 /720 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2026-05-22 21:25:51] [INFO ] Invariant cache hit.
[2026-05-22 21:25:52] [INFO ] Implicit Places using invariants in 655 ms returned []
[2026-05-22 21:25:52] [INFO ] Invariant cache hit.
[2026-05-22 21:25:53] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
[2026-05-22 21:25:53] [INFO ] Redundant transitions in 53 ms returned []
Running 1587 sub problems to find dead transitions.
[2026-05-22 21:25:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 711/2364 variables, and 61 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 44/55 constraints, State Equation: 0/720 constraints, PredecessorRefiner: 1587/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/711 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/711 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 1587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 711/2364 variables, and 61 constraints, problems are : Problem set: 0 solved, 1587 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 44/55 constraints, State Equation: 0/720 constraints, PredecessorRefiner: 0/1587 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1587 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62954 ms. Remains : 720/720 places, 1644/1644 transitions.
Built C files in :
/tmp/ltsmin1713832509109888543
[2026-05-22 21:26:54] [INFO ] Too many transitions (1644) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:26:54] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1713832509109888543
Running compilation step : cd /tmp/ltsmin1713832509109888543;'/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/ltsmin1713832509109888543;'/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/ltsmin1713832509109888543;'/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 21:26:57] [INFO ] Flatten gal took : 38 ms
[2026-05-22 21:26:57] [INFO ] Flatten gal took : 33 ms
[2026-05-22 21:26:57] [INFO ] Time to serialize gal into /tmp/LTL18212927126597726614.gal : 7 ms
[2026-05-22 21:26:57] [INFO ] Time to serialize properties into /tmp/LTL7536958159052257721.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/LTL18212927126597726614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13368318397649255864.hoa' '-atoms' '/tmp/LTL7536958159052257721.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7536958159052257721.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13368318397649255864.hoa
Detected timeout of ITS tools.
[2026-05-22 21:27:12] [INFO ] Flatten gal took : 31 ms
[2026-05-22 21:27:12] [INFO ] Flatten gal took : 31 ms
[2026-05-22 21:27:12] [INFO ] Time to serialize gal into /tmp/LTL4650122694157463116.gal : 6 ms
[2026-05-22 21:27:12] [INFO ] Time to serialize properties into /tmp/LTL10363129276598631556.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/LTL4650122694157463116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10363129276598631556.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((p1779==0)||(p2015==1))"))U((X(G("((p1779==0)||(p2015==1))")))||((!("((p1779==0)||(p2015==1))"))U(X(!("((p3169==0)||(p1501==1)...164
Formula 0 simplified : G!"((p1779==0)||(p2015==1))" R (XF!"((p1779==0)||(p2015==1))" & ("((p1779==0)||(p2015==1))" R X"((p3169==0)||(p1501==1))"))
Detected timeout of ITS tools.
[2026-05-22 21:27:27] [INFO ] Flatten gal took : 30 ms
[2026-05-22 21:27:27] [INFO ] Applying decomposition
[2026-05-22 21:27:27] [INFO ] Flatten gal took : 29 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/graph15518303903254132677.txt' '-o' '/tmp/graph15518303903254132677.bin' '-w' '/tmp/graph15518303903254132677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15518303903254132677.bin' '-l' '-1' '-v' '-w' '/tmp/graph15518303903254132677.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:27:27] [INFO ] Decomposing Gal with order
[2026-05-22 21:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:27:28] [INFO ] Removed a total of 3217 redundant transitions.
[2026-05-22 21:27:28] [INFO ] Flatten gal took : 77 ms
[2026-05-22 21:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 35 ms.
[2026-05-22 21:27:28] [INFO ] Time to serialize gal into /tmp/LTL3168660845989469356.gal : 13 ms
[2026-05-22 21:27:28] [INFO ] Time to serialize properties into /tmp/LTL5721152565143293022.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/LTL3168660845989469356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5721152565143293022.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 : !(((F("((i9.u99.p1779==0)||(i9.u101.p2015==1))"))U((X(G("((i9.u99.p1779==0)||(i9.u101.p2015==1))")))||((!("((i9.u99.p1779==0)||(i9.u10...228
Formula 0 simplified : G!"((i9.u99.p1779==0)||(i9.u101.p2015==1))" R (XF!"((i9.u99.p1779==0)||(i9.u101.p2015==1))" & ("((i9.u99.p1779==0)||(i9.u101.p2015==...210
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLCardinality-13 finished in 305040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 0 with 605 rules applied. Total rules applied 605 place count 3222 transition count 3302
Reduce places removed 605 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 608 rules applied. Total rules applied 1213 place count 2617 transition count 3299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1215 place count 2615 transition count 3299
Performed 868 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 868 Pre rules applied. Total rules applied 1215 place count 2615 transition count 2431
Deduced a syphon composed of 868 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 952 places and 0 transitions.
Iterating global reduction 3 with 1820 rules applied. Total rules applied 3035 place count 1663 transition count 2431
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3095 place count 1655 transition count 2379
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3147 place count 1603 transition count 2379
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3147 place count 1603 transition count 2346
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3246 place count 1537 transition count 2346
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3246 place count 1537 transition count 2314
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3310 place count 1505 transition count 2314
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3312 place count 1503 transition count 2312
Iterating global reduction 5 with 2 rules applied. Total rules applied 3314 place count 1503 transition count 2312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3314 place count 1503 transition count 2311
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3316 place count 1502 transition count 2311
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3318 place count 1500 transition count 2302
Iterating global reduction 5 with 2 rules applied. Total rules applied 3320 place count 1500 transition count 2302
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3322 place count 1498 transition count 2293
Iterating global reduction 5 with 2 rules applied. Total rules applied 3324 place count 1498 transition count 2293
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3325 place count 1497 transition count 2285
Iterating global reduction 5 with 1 rules applied. Total rules applied 3326 place count 1497 transition count 2285
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Deduced a syphon composed of 257 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 5 with 516 rules applied. Total rules applied 3842 place count 1238 transition count 2028
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3846 place count 1234 transition count 2024
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3851 place count 1233 transition count 2024
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 3852 place count 1233 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3853 place count 1232 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3853 place count 1232 transition count 2022
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3855 place count 1231 transition count 2022
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3857 place count 1229 transition count 2020
Iterating global reduction 7 with 2 rules applied. Total rules applied 3859 place count 1229 transition count 2020
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 3861 place count 1229 transition count 2018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3862 place count 1228 transition count 2018
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3863 place count 1227 transition count 2017
Iterating global reduction 9 with 1 rules applied. Total rules applied 3864 place count 1227 transition count 2017
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3865 place count 1226 transition count 2016
Iterating global reduction 9 with 1 rules applied. Total rules applied 3866 place count 1226 transition count 2016
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3868 place count 1225 transition count 2021
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3870 place count 1223 transition count 2019
Reduce places removed 16 places and 0 transitions.
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 9 with 24 rules applied. Total rules applied 3894 place count 1207 transition count 2011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3902 place count 1199 transition count 2011
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 24 Pre rules applied. Total rules applied 3902 place count 1199 transition count 1987
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 11 with 49 rules applied. Total rules applied 3951 place count 1174 transition count 1987
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 3968 place count 1157 transition count 1987
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3968 place count 1157 transition count 1986
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3970 place count 1156 transition count 1986
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 12 with 50 rules applied. Total rules applied 4020 place count 1131 transition count 1961
Discarding 16 places :
Symmetric choice reduction at 12 with 16 rule applications. Total rules 4036 place count 1115 transition count 1945
Iterating global reduction 12 with 16 rules applied. Total rules applied 4052 place count 1115 transition count 1945
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4060 place count 1107 transition count 1937
Iterating global reduction 12 with 8 rules applied. Total rules applied 4068 place count 1107 transition count 1937
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4076 place count 1107 transition count 1929
Applied a total of 4076 rules in 860 ms. Remains 1107 /3223 variables (removed 2116) and now considering 1929/3908 (removed 1979) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18089204986901726426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3010101421240565056.kers'
[2026-05-22 21:27:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18089204986901726426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3010101421240565056.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 1929 rows 1081 cols 7505 entries
Finished phase 1 with 268 SingleSign rule and 657 generalized
[2026-05-22 21:27:44] [INFO ] Computed 182 invariants in 52 ms
Computed 182 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-3010101421240565056.kers
Total runtime 54 ms.
[2026-05-22 21:27:45] [INFO ] Implicit Places using invariants in 1297 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 206, 257, 258, 270, 271, 273, 290, 308, 327, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 571, 623, 624, 636, 637, 639, 656, 674, 694, 745, 746, 758, 759, 761, 778, 796, 816, 867, 868, 880, 881, 883, 900, 918, 938, 989, 990, 993, 1004, 1005, 1006, 1024, 1045, 1046, 1047, 1048]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1303 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1034/3223 places, 1929/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1034 transition count 1796
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 901 transition count 1796
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 266 place count 901 transition count 1757
Deduced a syphon composed of 39 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 345 place count 861 transition count 1757
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 357 place count 857 transition count 1749
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 365 place count 849 transition count 1749
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 368 place count 846 transition count 1746
Iterating global reduction 4 with 3 rules applied. Total rules applied 371 place count 846 transition count 1746
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 374 place count 846 transition count 1743
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 498 place count 784 transition count 1681
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 502 place count 782 transition count 1682
Applied a total of 502 rules in 184 ms. Remains 782 /1034 variables (removed 252) and now considering 1682/1929 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17803063549176209572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17500204248432152845.kers'
[2026-05-22 21:27:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17803063549176209572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17500204248432152845.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1682 rows 782 cols 6773 entries
Finished phase 1 with 239 SingleSign rule and 439 generalized
[2026-05-22 21:27:45] [INFO ] Computed 104 invariants in 44 ms
Computed 104 P flows in 45 ms.
Exported basis to /tmp/petrispot-output-17500204248432152845.kers
Total runtime 49 ms.
[2026-05-22 21:27:46] [INFO ] Implicit Places using invariants in 779 ms returned [88, 94, 99, 175, 181, 186, 263, 269, 274, 351, 357, 362, 439, 445, 450, 527, 533, 538, 615, 621, 626, 703, 709, 714, 779]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 782 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/3223 places, 1682/3908 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 757 transition count 1681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 756 transition count 1681
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 740 transition count 1665
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 740 transition count 1665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 724 transition count 1649
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 724 transition count 1649
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 716 transition count 1641
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 716 transition count 1641
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 708 transition count 1633
Applied a total of 98 rules in 142 ms. Remains 708 /757 variables (removed 49) and now considering 1633/1682 (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-11306176323869625096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12440684333102170773.kers'
[2026-05-22 21:27:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11306176323869625096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12440684333102170773.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1633 rows 708 cols 6592 entries
Finished phase 1 with 223 SingleSign rule and 406 generalized
[2026-05-22 21:27:46] [INFO ] Computed 79 invariants in 22 ms
Computed 79 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-12440684333102170773.kers
Total runtime 26 ms.
[2026-05-22 21:27:47] [INFO ] Implicit Places using invariants in 631 ms returned []
[2026-05-22 21:27:47] [INFO ] Invariant cache hit.
[2026-05-22 21:27:48] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 708/3223 places, 1633/3908 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5492 ms. Remains : 708/3223 places, 1633/3908 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 60 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-14
Product exploration explored 100000 steps with 1152 reset in 259 ms.
Product exploration explored 100000 steps with 1140 reset in 247 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 90 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 (426 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (76 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 314714 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 1
Probabilistic random walk after 314714 steps, saw 71581 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2026-05-22 21:27:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/185 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/191 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/285 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/365 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/367 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/451 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/530 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/532 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 105/637 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/637 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/664 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/664 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/708 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/708 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1633/2341 variables, 708/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2341 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2341 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2341/2341 variables, and 787 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 708/708 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/185 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/191 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/285 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/365 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/367 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/451 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/530 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/532 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 105/637 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/637 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/664 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/664 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/708 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/708 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1633/2341 variables, 708/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2341/2341 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 708/708 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2939ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1633/1633 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 708 transition count 1593
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 88 place count 668 transition count 1585
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 111 place count 668 transition count 1562
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 134 place count 645 transition count 1562
Applied a total of 134 rules in 126 ms. Remains 645 /708 variables (removed 63) and now considering 1562/1633 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 645/708 places, 1562/1633 transitions.
RANDOM walk for 40000 steps (664 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (112 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279770 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279770 steps, saw 77193 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-8871177957265359611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2354217380756161272.kers'
[2026-05-22 21:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8871177957265359611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2354217380756161272.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1562 rows 645 cols 6573 entries
Finished phase 1 with 209 SingleSign rule and 357 generalized
[2026-05-22 21:27:58] [INFO ] Computed 79 invariants in 39 ms
Computed 79 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-2354217380756161272.kers
Total runtime 43 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 81/261 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/336 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/338 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/410 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/484 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 93/579 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/579 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/606 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/645 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2207 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2207 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2207 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2207/2207 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 81/261 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/336 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/338 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/410 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/484 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 93/579 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/579 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/606 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/645 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2207 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2207 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2207/2207 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9061 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9943ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 339 ms.
Support contains 1 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 22 ms. Remains 645 /645 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 645/645 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 645 /645 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2026-05-22 21:28:09] [INFO ] Invariant cache hit.
[2026-05-22 21:28:09] [INFO ] Implicit Places using invariants in 639 ms returned [88, 89, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 654 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 631/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 24 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 701 ms. Remains : 631/645 places, 1562/1562 transitions.
RANDOM walk for 40000 steps (660 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 290742 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 290742 steps, saw 80478 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) 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-10401179875950362587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14025201763975232132.kers'
[2026-05-22 21:28:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10401179875950362587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14025201763975232132.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1562 rows 631 cols 6384 entries
Finished phase 1 with 181 SingleSign rule and 385 generalized
[2026-05-22 21:28:12] [INFO ] Computed 65 invariants in 40 ms
Computed 65 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-14025201763975232132.kers
Total runtime 44 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 77/257 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/332 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/334 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/400 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/474 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/476 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 89/565 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/565 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/592 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/592 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/631 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 77/257 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/332 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/334 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/400 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/474 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/476 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 89/565 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/565 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/592 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/592 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/631 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5843 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6951ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12036 steps, including 976 resets, run visited all 1 properties in 33 ms. (steps per millisecond=364 )
Parikh walk visited 1 properties in 45 ms.
Knowledge based reduction with 3 factoid took 124 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 41 ms :[(NOT p0)]
Knowledge-based reduction took 30668 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Support contains 1 out of 708 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 1633/1633 transitions.
Applied a total of 0 rules in 42 ms. Remains 708 /708 variables (removed 0) and now considering 1633/1633 (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-2552576095405706271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2289954278014442703.kers'
[2026-05-22 21:28:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2552576095405706271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2289954278014442703.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1633 rows 708 cols 6592 entries
Finished phase 1 with 223 SingleSign rule and 406 generalized
[2026-05-22 21:28:20] [INFO ] Computed 79 invariants in 18 ms
Computed 79 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-2289954278014442703.kers
Total runtime 32 ms.
[2026-05-22 21:28:20] [INFO ] Implicit Places using invariants in 659 ms returned []
[2026-05-22 21:28:20] [INFO ] Invariant cache hit.
[2026-05-22 21:28:22] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
[2026-05-22 21:28:22] [INFO ] Redundant transitions in 52 ms returned []
Running 1576 sub problems to find dead transitions.
[2026-05-22 21:28:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1576 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/2341 variables, and 61 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/24 constraints, Generalized P Invariants (flows): 45/55 constraints, State Equation: 0/708 constraints, PredecessorRefiner: 1576/1576 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1576 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/2341 variables, and 61 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/24 constraints, Generalized P Invariants (flows): 45/55 constraints, State Equation: 0/708 constraints, PredecessorRefiner: 0/1576 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 1576 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62746 ms. Remains : 708/708 places, 1633/1633 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 (453 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (74 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 315234 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 315234 steps, saw 71736 distinct states, run finished after 3013 ms. (steps per millisecond=104 ) properties seen :0
[2026-05-22 21:29:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/185 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/191 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/285 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/365 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/367 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/451 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/530 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/532 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 105/637 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/637 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/664 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/664 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/708 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/708 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1633/2341 variables, 708/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2341 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2341 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2341/2341 variables, and 787 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 708/708 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/117 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/185 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/191 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/285 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/365 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/367 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/451 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 79/530 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/532 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 105/637 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/637 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/664 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/664 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/708 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/708 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1633/2341 variables, 708/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2341/2341 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 708/708 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3097ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1633/1633 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 708 transition count 1593
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 88 place count 668 transition count 1585
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 111 place count 668 transition count 1562
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 134 place count 645 transition count 1562
Applied a total of 134 rules in 122 ms. Remains 645 /708 variables (removed 63) and now considering 1562/1633 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 645/708 places, 1562/1633 transitions.
RANDOM walk for 40000 steps (711 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (110 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279503 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279503 steps, saw 77113 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-1177250611660994774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18389057323367463923.kers'
[2026-05-22 21:29:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1177250611660994774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18389057323367463923.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1562 rows 645 cols 6573 entries
Finished phase 1 with 209 SingleSign rule and 357 generalized
[2026-05-22 21:29:32] [INFO ] Computed 79 invariants in 40 ms
Computed 79 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-18389057323367463923.kers
Total runtime 45 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 81/261 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/336 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/338 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/410 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/484 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 93/579 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/579 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/606 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/645 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2207 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2207 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2207 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2207/2207 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 81/261 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/336 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/338 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 72/410 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/484 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 93/579 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/579 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/606 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/645 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2207 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2207 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2207/2207 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8296 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 356 ms.
Support contains 1 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 645 /645 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 645/645 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 24 ms. Remains 645 /645 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2026-05-22 21:29:41] [INFO ] Invariant cache hit.
[2026-05-22 21:29:42] [INFO ] Implicit Places using invariants in 698 ms returned [88, 89, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 515, 516]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 700 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 631/645 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 772 ms. Remains : 631/645 places, 1562/1562 transitions.
RANDOM walk for 40000 steps (628 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (104 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 286560 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 286560 steps, saw 79022 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) 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-4671335455914351909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15022333898850210112.kers'
[2026-05-22 21:29:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4671335455914351909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15022333898850210112.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1562 rows 631 cols 6384 entries
Finished phase 1 with 181 SingleSign rule and 385 generalized
[2026-05-22 21:29:45] [INFO ] Computed 65 invariants in 40 ms
Computed 65 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-15022333898850210112.kers
Total runtime 44 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 77/257 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/332 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/334 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/400 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/474 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/476 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 89/565 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/565 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/592 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/592 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/631 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/111 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/174 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 77/257 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/332 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/334 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/400 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/400 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 74/474 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/474 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/476 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 89/565 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/565 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 27/592 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/592 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 39/631 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5885 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7119ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13378 steps, including 994 resets, run visited all 1 properties in 48 ms. (steps per millisecond=278 )
Parikh walk visited 1 properties in 48 ms.
Knowledge based reduction with 3 factoid took 105 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 64 ms :[(NOT p0)]
Knowledge-based reduction took 30181 ms.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1152 reset in 265 ms.
Product exploration explored 100000 steps with 1127 reset in 256 ms.
Built C files in :
/tmp/ltsmin6270898975418260188
[2026-05-22 21:29:53] [INFO ] Too many transitions (1633) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:29:53] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6270898975418260188
Running compilation step : cd /tmp/ltsmin6270898975418260188;'/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/ltsmin6270898975418260188;'/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/ltsmin6270898975418260188;'/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 1 out of 708 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 1633/1633 transitions.
Applied a total of 0 rules in 61 ms. Remains 708 /708 variables (removed 0) and now considering 1633/1633 (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-223453860980894997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14054828462471452072.kers'
[2026-05-22 21:29:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-223453860980894997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14054828462471452072.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1633 rows 708 cols 6592 entries
Finished phase 1 with 223 SingleSign rule and 406 generalized
[2026-05-22 21:29:56] [INFO ] Computed 79 invariants in 40 ms
Computed 79 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-14054828462471452072.kers
Total runtime 45 ms.
[2026-05-22 21:29:57] [INFO ] Implicit Places using invariants in 801 ms returned []
[2026-05-22 21:29:57] [INFO ] Invariant cache hit.
[2026-05-22 21:29:59] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2026-05-22 21:29:59] [INFO ] Redundant transitions in 56 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2491 ms. Remains : 708/708 places, 1633/1633 transitions.
Built C files in :
/tmp/ltsmin11924800953529914901
[2026-05-22 21:29:59] [INFO ] Too many transitions (1633) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:29:59] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11924800953529914901
Running compilation step : cd /tmp/ltsmin11924800953529914901;'/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/ltsmin11924800953529914901;'/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/ltsmin11924800953529914901;'/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 21:30:02] [INFO ] Flatten gal took : 36 ms
[2026-05-22 21:30:02] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:30:02] [INFO ] Time to serialize gal into /tmp/LTL15165661825115890332.gal : 8 ms
[2026-05-22 21:30:02] [INFO ] Time to serialize properties into /tmp/LTL1749863533301780201.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/LTL15165661825115890332.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4502512240223625291.hoa' '-atoms' '/tmp/LTL1749863533301780201.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/LTL1749863533301780201.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4502512240223625291.hoa
Detected timeout of ITS tools.
[2026-05-22 21:30:17] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:30:17] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:30:17] [INFO ] Time to serialize gal into /tmp/LTL3804189432136478184.gal : 7 ms
[2026-05-22 21:30:17] [INFO ] Time to serialize properties into /tmp/LTL16244841836766733918.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/LTL3804189432136478184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16244841836766733918.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p573==0)"))))
Formula 0 simplified : GF!"(p573==0)"
Detected timeout of ITS tools.
[2026-05-22 21:30:32] [INFO ] Flatten gal took : 27 ms
[2026-05-22 21:30:32] [INFO ] Applying decomposition
[2026-05-22 21:30:32] [INFO ] Flatten gal took : 29 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/graph114580674087210660.txt' '-o' '/tmp/graph114580674087210660.bin' '-w' '/tmp/graph114580674087210660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph114580674087210660.bin' '-l' '-1' '-v' '-w' '/tmp/graph114580674087210660.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:30:32] [INFO ] Decomposing Gal with order
[2026-05-22 21:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:30:32] [INFO ] Removed a total of 3245 redundant transitions.
[2026-05-22 21:30:32] [INFO ] Flatten gal took : 72 ms
[2026-05-22 21:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 14 ms.
[2026-05-22 21:30:32] [INFO ] Time to serialize gal into /tmp/LTL11982665118009467873.gal : 9 ms
[2026-05-22 21:30:32] [INFO ] Time to serialize properties into /tmp/LTL32147512454501806.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/LTL11982665118009467873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL32147512454501806.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G("(i1.u37.p573==0)"))))
Formula 0 simplified : GF!"(i1.u37.p573==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLCardinality-14 finished in 184817 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)||G(p1))) U G(!p2)))'
Support contains 5 out of 3223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3223/3223 places, 3908/3908 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 0 with 605 rules applied. Total rules applied 605 place count 3222 transition count 3302
Reduce places removed 605 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 608 rules applied. Total rules applied 1213 place count 2617 transition count 3299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1215 place count 2615 transition count 3299
Performed 868 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 868 Pre rules applied. Total rules applied 1215 place count 2615 transition count 2431
Deduced a syphon composed of 868 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 952 places and 0 transitions.
Iterating global reduction 3 with 1820 rules applied. Total rules applied 3035 place count 1663 transition count 2431
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3095 place count 1655 transition count 2379
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3147 place count 1603 transition count 2379
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3147 place count 1603 transition count 2346
Deduced a syphon composed of 33 places in 6 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3246 place count 1537 transition count 2346
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3246 place count 1537 transition count 2314
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3310 place count 1505 transition count 2314
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3312 place count 1503 transition count 2312
Iterating global reduction 5 with 2 rules applied. Total rules applied 3314 place count 1503 transition count 2312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3314 place count 1503 transition count 2311
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3316 place count 1502 transition count 2311
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3318 place count 1500 transition count 2302
Iterating global reduction 5 with 2 rules applied. Total rules applied 3320 place count 1500 transition count 2302
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3322 place count 1498 transition count 2293
Iterating global reduction 5 with 2 rules applied. Total rules applied 3324 place count 1498 transition count 2293
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3325 place count 1497 transition count 2285
Iterating global reduction 5 with 1 rules applied. Total rules applied 3326 place count 1497 transition count 2285
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 5 with 512 rules applied. Total rules applied 3838 place count 1240 transition count 2030
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3842 place count 1236 transition count 2026
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3847 place count 1235 transition count 2026
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 3848 place count 1235 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3849 place count 1234 transition count 2025
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3849 place count 1234 transition count 2024
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3851 place count 1233 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3853 place count 1231 transition count 2022
Iterating global reduction 7 with 2 rules applied. Total rules applied 3855 place count 1231 transition count 2022
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 3857 place count 1231 transition count 2020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3858 place count 1230 transition count 2020
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3859 place count 1229 transition count 2019
Iterating global reduction 9 with 1 rules applied. Total rules applied 3860 place count 1229 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3861 place count 1228 transition count 2018
Iterating global reduction 9 with 1 rules applied. Total rules applied 3862 place count 1228 transition count 2018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 3864 place count 1227 transition count 2023
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3866 place count 1225 transition count 2021
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 9 with 22 rules applied. Total rules applied 3888 place count 1210 transition count 2014
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 3895 place count 1203 transition count 2014
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 23 Pre rules applied. Total rules applied 3895 place count 1203 transition count 1991
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 11 with 47 rules applied. Total rules applied 3942 place count 1179 transition count 1991
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 3958 place count 1163 transition count 1991
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 12 with 48 rules applied. Total rules applied 4006 place count 1139 transition count 1967
Discarding 15 places :
Symmetric choice reduction at 12 with 15 rule applications. Total rules 4021 place count 1124 transition count 1952
Iterating global reduction 12 with 15 rules applied. Total rules applied 4036 place count 1124 transition count 1952
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4044 place count 1116 transition count 1944
Iterating global reduction 12 with 8 rules applied. Total rules applied 4052 place count 1116 transition count 1944
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4060 place count 1116 transition count 1936
Applied a total of 4060 rules in 860 ms. Remains 1116 /3223 variables (removed 2107) and now considering 1936/3908 (removed 1972) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17754792333510963189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2392560304513349997.kers'
[2026-05-22 21:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17754792333510963189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2392560304513349997.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 1 ms.
// Phase 1: matrix 1936 rows 1091 cols 7536 entries
Finished phase 1 with 271 SingleSign rule and 661 generalized
[2026-05-22 21:30:48] [INFO ] Computed 184 invariants in 18 ms
Computed 184 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-2392560304513349997.kers
Total runtime 24 ms.
[2026-05-22 21:30:49] [INFO ] Implicit Places using invariants in 1036 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 327, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 519, 536, 554, 574, 631, 643, 644, 645, 647, 664, 682, 702, 753, 754, 766, 767, 769, 786, 804, 824, 875, 876, 889, 890, 892, 909, 927, 947, 998, 999, 1002, 1013, 1014, 1015, 1033, 1054, 1055, 1056, 1057]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1043/3223 places, 1936/3908 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1043 transition count 1802
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 268 place count 909 transition count 1802
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 268 place count 909 transition count 1763
Deduced a syphon composed of 39 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 347 place count 869 transition count 1763
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 360 place count 864 transition count 1755
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 368 place count 856 transition count 1755
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 371 place count 853 transition count 1752
Iterating global reduction 4 with 3 rules applied. Total rules applied 374 place count 853 transition count 1752
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 377 place count 853 transition count 1749
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 499 place count 792 transition count 1688
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 503 place count 790 transition count 1689
Applied a total of 503 rules in 129 ms. Remains 790 /1043 variables (removed 253) and now considering 1689/1936 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6361181843742998110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15675037465372888651.kers'
[2026-05-22 21:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6361181843742998110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15675037465372888651.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1689 rows 790 cols 6786 entries
Finished phase 1 with 241 SingleSign rule and 444 generalized
[2026-05-22 21:30:50] [INFO ] Computed 105 invariants in 20 ms
Computed 105 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-15675037465372888651.kers
Total runtime 22 ms.
[2026-05-22 21:30:50] [INFO ] Implicit Places using invariants in 625 ms returned [89, 95, 100, 176, 182, 187, 264, 270, 275, 352, 358, 363, 445, 451, 456, 534, 540, 545, 622, 628, 633, 711, 717, 722, 787]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 627 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 765/3223 places, 1689/3908 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 765 transition count 1688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 764 transition count 1688
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 18 place count 748 transition count 1672
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 748 transition count 1672
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 50 place count 732 transition count 1656
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 732 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 724 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 724 transition count 1648
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 716 transition count 1640
Applied a total of 98 rules in 139 ms. Remains 716 /765 variables (removed 49) and now considering 1640/1689 (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-1601035937025222204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7650124354753929893.kers'
[2026-05-22 21:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1601035937025222204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7650124354753929893.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1640 rows 716 cols 6605 entries
Finished phase 1 with 227 SingleSign rule and 409 generalized
[2026-05-22 21:30:50] [INFO ] Computed 80 invariants in 41 ms
Computed 80 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-7650124354753929893.kers
Total runtime 44 ms.
[2026-05-22 21:30:51] [INFO ] Implicit Places using invariants in 629 ms returned []
[2026-05-22 21:30:51] [INFO ] Invariant cache hit.
[2026-05-22 21:30:52] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 716/3223 places, 1640/3908 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5003 ms. Remains : 716/3223 places, 1640/3908 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)||G(p1))) U G(!p2)))'
Stuttering acceptance computed with spot in 242 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Running random walk in product with property : ASLink-PT-08b-LTLCardinality-15
Product exploration explored 100000 steps with 33218 reset in 389 ms.
Product exploration explored 100000 steps with 33419 reset in 400 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 15 factoid took 63 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (417 resets) in 216 ms. (184 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40001 steps (72 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
[2026-05-22 21:30:54] [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) 87/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/119 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 273/392 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 170/562 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 154/716 variables, 27/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1640/2356 variables, 716/796 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2356 variables, 2/798 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2356 variables, 0/798 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2356 variables, 0/798 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2356/2356 variables, and 798 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 716/716 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 87/92 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/119 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 273/392 variables, 28/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/562 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 154/716 variables, 27/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 2/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/716 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1640/2356 variables, 716/798 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2356 variables, 2/800 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2356 variables, 1/801 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2356 variables, 0/801 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2356 variables, 0/801 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2356/2356 variables, and 801 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 716/716 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4208ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 330 ms.
Support contains 5 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 1640/1640 transitions.
Free-agglomeration rule applied 40 times.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 716 transition count 1600
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 88 place count 676 transition count 1592
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 110 place count 676 transition count 1570
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 132 place count 654 transition count 1570
Applied a total of 132 rules in 77 ms. Remains 654 /716 variables (removed 62) and now considering 1570/1640 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 654/716 places, 1570/1640 transitions.
RANDOM walk for 40000 steps (658 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (108 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 252019 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 252019 steps, saw 68132 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) 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-8411705602510516719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-564521673419798772.kers'
[2026-05-22 21:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8411705602510516719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-564521673419798772.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1570 rows 654 cols 6569 entries
Finished phase 1 with 207 SingleSign rule and 367 generalized
[2026-05-22 21:31:02] [INFO ] Computed 80 invariants in 34 ms
Computed 80 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-564521673419798772.kers
Total runtime 37 ms.
[2026-05-22 21:31:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/361 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/522 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 132/654 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1570/2224 variables, 654/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2224 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2224 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2224 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2224/2224 variables, and 735 constraints, problems are : Problem set: 0 solved, 2 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 654/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/361 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/522 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 132/654 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1570/2224 variables, 654/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2224 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2224 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2224 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2224 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2224 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2224/2224 variables, and 738 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12284 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 654/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13162ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2583 ms.
Support contains 5 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1570/1570 transitions.
Applied a total of 0 rules in 35 ms. Remains 654 /654 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 654/654 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1570/1570 transitions.
Applied a total of 0 rules in 25 ms. Remains 654 /654 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2026-05-22 21:31:17] [INFO ] Invariant cache hit.
[2026-05-22 21:31:18] [INFO ] Implicit Places using invariants in 719 ms returned [90, 91, 161, 162, 232, 233, 381, 382, 452, 453, 523]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 721 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 643/654 places, 1570/1570 transitions.
Applied a total of 0 rules in 29 ms. Remains 643 /643 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 775 ms. Remains : 643/654 places, 1570/1570 transitions.
RANDOM walk for 40000 steps (628 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (111 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 251810 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 251810 steps, saw 68048 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) 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-5090476190494823947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13363277034846823724.kers'
[2026-05-22 21:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5090476190494823947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13363277034846823724.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1570 rows 643 cols 6418 entries
Finished phase 1 with 182 SingleSign rule and 392 generalized
[2026-05-22 21:31:21] [INFO ] Computed 69 invariants in 29 ms
Computed 69 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-13363277034846823724.kers
Total runtime 34 ms.
[2026-05-22 21:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/357 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/518 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/643 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1570/2213 variables, 643/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2213 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2213 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2213 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2213/2213 variables, and 713 constraints, problems are : Problem set: 0 solved, 2 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 643/643 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/357 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 161/518 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 125/643 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1570/2213 variables, 643/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2213 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2213 variables, 2/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2213 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2213 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2213 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2213 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2213 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2213 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2213/2213 variables, and 717 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12429 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 643/643 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13244ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2379 ms.
Support contains 5 out of 643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 643/643 places, 1570/1570 transitions.
Applied a total of 0 rules in 25 ms. Remains 643 /643 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 643/643 places, 1570/1570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 643/643 places, 1570/1570 transitions.
Applied a total of 0 rules in 24 ms. Remains 643 /643 variables (removed 0) and now considering 1570/1570 (removed 0) transitions.
[2026-05-22 21:31:37] [INFO ] Invariant cache hit.
[2026-05-22 21:31:37] [INFO ] Implicit Places using invariants in 451 ms returned []
[2026-05-22 21:31:37] [INFO ] Invariant cache hit.
[2026-05-22 21:31:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:31:39] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2026-05-22 21:31:39] [INFO ] Redundant transitions in 24 ms returned []
Running 1532 sub problems to find dead transitions.
[2026-05-22 21:31:39] [INFO ] Invariant cache hit.
[2026-05-22 21:31:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/2213 variables, and 60 constraints, problems are : Problem set: 0 solved, 1532 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 43/44 constraints, State Equation: 0/643 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1532/1532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 1532 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/2213 variables, and 60 constraints, problems are : Problem set: 0 solved, 1532 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 17/25 constraints, Generalized P Invariants (flows): 43/44 constraints, State Equation: 0/643 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1532 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62509 ms. Remains : 643/643 places, 1570/1570 transitions.
Found 2 invariant AP formulas.
Knowledge based reduction with 17 factoid took 206 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4663831309093725016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6143986513442093457.kers'
[2026-05-22 21:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4663831309093725016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6143986513442093457.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1640 rows 716 cols 6605 entries
Finished phase 1 with 227 SingleSign rule and 409 generalized
[2026-05-22 21:32:40] [INFO ] Computed 80 invariants in 38 ms
Computed 80 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-6143986513442093457.kers
Total runtime 40 ms.
[2026-05-22 21:32:41] [INFO ] [Real]Absence check using 25 positive place invariants in 54 ms returned sat
[2026-05-22 21:32:41] [INFO ] [Real]Absence check using 25 positive and 55 generalized place invariants in 445 ms returned sat
[2026-05-22 21:32:51] [INFO ] [Real]Absence check using state equation in 9470 ms returned sat
[2026-05-22 21:32:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:32:51] [INFO ] [Nat]Absence check using 25 positive place invariants in 29 ms returned sat
[2026-05-22 21:32:52] [INFO ] [Nat]Absence check using 25 positive and 55 generalized place invariants in 157 ms returned sat
[2026-05-22 21:32:57] [INFO ] [Nat]Absence check using state equation in 5573 ms returned sat
[2026-05-22 21:32:57] [INFO ] Computed and/alt/rep : 469/2260/469 causal constraints (skipped 1119 transitions) in 133 ms.
[2026-05-22 21:33:04] [INFO ] Added : 217 causal constraints over 44 iterations in 6547 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 130288 ms.
Stuttering acceptance computed with spot in 131 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 716 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 716/716 places, 1640/1640 transitions.
Applied a total of 0 rules in 28 ms. Remains 716 /716 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2026-05-22 21:33:04] [INFO ] Invariant cache hit.
[2026-05-22 21:33:05] [INFO ] Implicit Places using invariants in 519 ms returned []
[2026-05-22 21:33:05] [INFO ] Invariant cache hit.
[2026-05-22 21:33:06] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2026-05-22 21:33:06] [INFO ] Redundant transitions in 24 ms returned []
Running 1588 sub problems to find dead transitions.
[2026-05-22 21:33:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 707/2356 variables, and 57 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 13/25 constraints, Generalized P Invariants (flows): 44/55 constraints, State Equation: 0/716 constraints, PredecessorRefiner: 1588/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/2356 variables, and 57 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/25 constraints, Generalized P Invariants (flows): 44/55 constraints, State Equation: 0/716 constraints, PredecessorRefiner: 0/1588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62455 ms. Remains : 716/716 places, 1640/1640 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (430 resets) in 209 ms. (190 steps per ms) remains 1/4 properties
BEST_FIRST walk for 32352 steps (61 resets) in 49 ms. (647 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
[2026-05-22 21:34:07] [INFO ] Invariant cache hit.
[2026-05-22 21:34:08] [INFO ] [Real]Absence check using 25 positive place invariants in 54 ms returned sat
[2026-05-22 21:34:08] [INFO ] [Real]Absence check using 25 positive and 55 generalized place invariants in 525 ms returned sat
[2026-05-22 21:34:18] [INFO ] [Real]Absence check using state equation in 9198 ms returned sat
[2026-05-22 21:34:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:34:19] [INFO ] [Nat]Absence check using 25 positive place invariants in 30 ms returned sat
[2026-05-22 21:34:19] [INFO ] [Nat]Absence check using 25 positive and 55 generalized place invariants in 218 ms returned sat
[2026-05-22 21:34:24] [INFO ] [Nat]Absence check using state equation in 5483 ms returned sat
[2026-05-22 21:34:25] [INFO ] Computed and/alt/rep : 469/2260/469 causal constraints (skipped 1119 transitions) in 114 ms.
[2026-05-22 21:34:31] [INFO ] Added : 217 causal constraints over 44 iterations in 6923 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 24958 ms.
Stuttering acceptance computed with spot in 115 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33252 reset in 442 ms.
Product exploration explored 100000 steps with 33307 reset in 389 ms.
Built C files in :
/tmp/ltsmin2631894867668987161
[2026-05-22 21:34:32] [INFO ] Too many transitions (1640) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:34:33] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2631894867668987161
Running compilation step : cd /tmp/ltsmin2631894867668987161;'/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/ltsmin2631894867668987161;'/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/ltsmin2631894867668987161;'/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 4 out of 716 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 716/716 places, 1640/1640 transitions.
Applied a total of 0 rules in 41 ms. Remains 716 /716 variables (removed 0) and now considering 1640/1640 (removed 0) transitions.
[2026-05-22 21:34:36] [INFO ] Invariant cache hit.
[2026-05-22 21:34:36] [INFO ] Implicit Places using invariants in 528 ms returned []
[2026-05-22 21:34:36] [INFO ] Invariant cache hit.
[2026-05-22 21:34:38] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2026-05-22 21:34:38] [INFO ] Redundant transitions in 23 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2152 ms. Remains : 716/716 places, 1640/1640 transitions.
Built C files in :
/tmp/ltsmin18019900062202756010
[2026-05-22 21:34:38] [INFO ] Too many transitions (1640) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:34:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18019900062202756010
Running compilation step : cd /tmp/ltsmin18019900062202756010;'/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/ltsmin18019900062202756010;'/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/ltsmin18019900062202756010;'/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 21:34:41] [INFO ] Flatten gal took : 33 ms
[2026-05-22 21:34:41] [INFO ] Flatten gal took : 28 ms
[2026-05-22 21:34:41] [INFO ] Time to serialize gal into /tmp/LTL885509333453716096.gal : 6 ms
[2026-05-22 21:34:41] [INFO ] Time to serialize properties into /tmp/LTL8841175455870051772.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/LTL885509333453716096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16530564325962895700.hoa' '-atoms' '/tmp/LTL8841175455870051772.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8841175455870051772.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16530564325962895700.hoa
Detected timeout of ITS tools.
[2026-05-22 21:34:56] [INFO ] Flatten gal took : 30 ms
[2026-05-22 21:34:56] [INFO ] Flatten gal took : 28 ms
[2026-05-22 21:34:56] [INFO ] Time to serialize gal into /tmp/LTL10139228843233969043.gal : 6 ms
[2026-05-22 21:34:56] [INFO ] Time to serialize properties into /tmp/LTL12818398188981929985.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/LTL10139228843233969043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12818398188981929985.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((F("((p151==0)||(p1667==1))"))||(G("(p185==1)"))))U(G(!("((p2814==0)||(p67==1))")))))
Formula 0 simplified : F(G!"((p151==0)||(p1667==1))" & F!"(p185==1)") R F"((p2814==0)||(p67==1))"
Detected timeout of ITS tools.
[2026-05-22 21:35:11] [INFO ] Flatten gal took : 28 ms
[2026-05-22 21:35:11] [INFO ] Applying decomposition
[2026-05-22 21:35:11] [INFO ] Flatten gal took : 28 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/graph14500581960435654529.txt' '-o' '/tmp/graph14500581960435654529.bin' '-w' '/tmp/graph14500581960435654529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14500581960435654529.bin' '-l' '-1' '-v' '-w' '/tmp/graph14500581960435654529.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:35:11] [INFO ] Decomposing Gal with order
[2026-05-22 21:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:35:11] [INFO ] Removed a total of 3222 redundant transitions.
[2026-05-22 21:35:11] [INFO ] Flatten gal took : 58 ms
[2026-05-22 21:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 14 ms.
[2026-05-22 21:35:11] [INFO ] Time to serialize gal into /tmp/LTL12511853421281611591.gal : 9 ms
[2026-05-22 21:35:11] [INFO ] Time to serialize properties into /tmp/LTL417556688280002467.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/LTL12511853421281611591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL417556688280002467.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("((i2.u27.p151==0)||(i9.u83.p1667==1))"))||(G("(i1.u24.p185==1)"))))U(G(!("((i13.u139.p2814==0)||(i1.u8.p67==1))")))))
Formula 0 simplified : F(G!"((i2.u27.p151==0)||(i9.u83.p1667==1))" & F!"(i1.u24.p185==1)") R F"((i13.u139.p2814==0)||(i1.u8.p67==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08b-LTLCardinality-15 finished in 278914 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)||X(X(X(F(p1)))))))'
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(G(p0))||(!p0 U X(!p1)))))'
Spot run failed in 34 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 34 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||G(p1))) U G(!p2)))'
Spot run failed in 54 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 21:35:27] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14822057914448867120
[2026-05-22 21:35:27] [INFO ] Too many transitions (3908) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:35:27] [INFO ] Applying decomposition
[2026-05-22 21:35:27] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14822057914448867120
Running compilation step : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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 21:35:27] [INFO ] Flatten gal took : 62 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/graph3408916957424668147.txt' '-o' '/tmp/graph3408916957424668147.bin' '-w' '/tmp/graph3408916957424668147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3408916957424668147.bin' '-l' '-1' '-v' '-w' '/tmp/graph3408916957424668147.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:35:27] [INFO ] Decomposing Gal with order
[2026-05-22 21:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:35:27] [INFO ] Removed a total of 2892 redundant transitions.
[2026-05-22 21:35:28] [INFO ] Flatten gal took : 109 ms
[2026-05-22 21:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 82 ms.
[2026-05-22 21:35:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality7084561542965782404.gal : 47 ms
[2026-05-22 21:35:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality3939460948428739447.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/LTLCardinality7084561542965782404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3939460948428739447.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 4 LTL properties
Checking formula 0 : !((G((F("((i18.i1.i0.u685.p1939==0)&&(i13.i5.i4.u343.p980==1))"))||(X(X(X(F("((i17.u639.p1834==0)&&(i17.u600.p1711==1))"))))))))
Formula 0 simplified : F(G!"((i18.i1.i0.u685.p1939==0)&&(i13.i5.i4.u343.p980==1))" & XXXG!"((i17.u639.p1834==0)&&(i17.u600.p1711==1))")
Compilation finished in 11145 ms.
Running link step : cd /tmp/ltsmin14822057914448867120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp2==true)) U (X([]((LTLAPp2==true)))||(!(LTLAPp2==true) U X(!(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp2==true)) U (X([]((LTLAPp2==true)))||(!(LTLAPp2==true) U X(!(LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp5==true))||[]((LTLAPp6==true)))) U [](!(LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp5==true))||[]((LTLAPp6==true)))) U [](!(LTLAPp7==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin14822057914448867120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 22:04:16] [INFO ] Applying decomposition
[2026-05-22 22:04:16] [INFO ] Flatten gal took : 108 ms
[2026-05-22 22:04:17] [INFO ] Decomposing Gal with order
[2026-05-22 22:04:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:04:17] [INFO ] Removed a total of 2652 redundant transitions.
[2026-05-22 22:04:17] [INFO ] Flatten gal took : 164 ms
[2026-05-22 22:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4450 labels/synchronizations in 91 ms.
[2026-05-22 22:04:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality11439342849759067856.gal : 33 ms
[2026-05-22 22:04:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality16974631214131895221.ltl : 3 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/LTLCardinality11439342849759067856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16974631214131895221.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((G((F("((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u232.p1939==0)&&(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u530.p980==1))"))||(X(X(X(F("((i0....265
Formula 0 simplified : F(G!"((i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u232.p1939==0)&&(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u530.p980==1))" & XXXG!"((i0.i0.i0.i...251

BK_TIME_CONFINEMENT_REACHED

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

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

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-08b"
export BK_EXAMINATION="LTLCardinality"
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-08b, examination is LTLCardinality"
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-177944366200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;